Fast and Stable Signal Deconvolution via Compressible State-Space Models

Abbas Kazemipour, Ji Liu, Krystyna Solarana, Daniel A. Nagode, Patrick O. Kanold, Min Wu, Behtash Babadi

TL;DR

This paper introduces a novel framework called "Compressible State-Space Models" (CSSM) for efficiently and stably de-convolving signals from noisy, blurred, and undersampled biological data. By modeling the underlying discrete events as sparse "innovations" within a state-space model, they achieve significant improvements in speed and accuracy compared to existing methods, particularly for applications like calcium imaging and EEG analysis.

What Problem Does This Paper Address?

Many biological signals, such as EEG and calcium imaging data, are collected as noisy, blurred versions of underlying events. Deconvolving these signals is crucial for understanding biological processes. However, existing methods often struggle with:

  • Abrupt changes: Biological signals frequently exhibit sudden, transient events (like neural spikes) that are difficult to model with traditional smooth state-space models.
  • Undersampling and noise: Real-world measurements are often incomplete (undersampled) and corrupted by noise, making accurate reconstruction challenging.
  • Computational complexity: Many deconvolution techniques become computationally prohibitive for the long time series data common in biology.
  • Lack of theoretical guarantees: Existing methods often lack rigorous theoretical backing for their performance and stability.

This paper aims to address these limitations by developing a method that can handle noisy, blurred, and undersampled data, accurately capture transient events, and offer theoretical guarantees on its performance, all while being computationally efficient.

Methods

The core of this work lies in the Compressible State-Space Model (CSSM) framework. Here's a breakdown of the key techniques:

  • State-Space Models (SSMs): The authors leverage SSMs, where the unobserved "state" represents the underlying biological signal, and the "observations" are the noisy measurements.
  • Compressible Innovations: Instead of assuming smooth state transitions, they model the changes in the state (the "innovations") as being sparse or compressible. This means that most of the time, the state doesn't change much, but occasionally, there are significant, discrete events (like spikes). This is a key departure from traditional SSMs.
  • Dynamic Compressive Sensing (CS): They frame the deconvolution problem as a dynamic CS problem, where sparsity is enforced on the dynamics (innovations) rather than the states themselves. This is achieved by minimizing an $l_1$-norm of the state innovations.
  • Two Nested Expectation-Maximization (EM) Algorithms: To efficiently solve the complex optimization problem of jointly estimating the states and the unknown transition matrix, they propose a two-level EM algorithm:
  • Outer EM: This algorithm iteratively refines estimates of the states and the transition matrix. It leverages the connection between $l_1$-minimization and Gaussian state-space models.
  • Inner EM: This algorithm is used within the outer loop to efficiently estimate the states and update the transition matrix. It employs a Fixed Interval Smoother (FIS) for state estimation and a closed-form update for the transition matrix.
  • Stability Guarantees: The paper provides theoretical guarantees on the stability and accuracy of their state recovery, particularly under certain sparsity assumptions on the dynamics and when the transition matrix is convergent.
  • Confidence Intervals: They incorporate a method to derive confidence intervals for the detected events, allowing for a more robust assessment of their statistical significance.

Datasets

The paper evaluates their method on:

  • Simulated Data: Used to demonstrate the theoretical performance and compare against baseline methods under controlled conditions, including varying compression ratios and signal-to-noise ratios (SNRs).
  • Calcium Imaging Data:
    • In vitro data: Collected from neurons where ground-truth spiking activity was simultaneously recorded using electrophysiology and calcium imaging. This allows for direct comparison with known events.
  • In vivo data: Collected from awake mice, where ground-truth is not available due to measurement limitations. This showcases the method's ability to handle real-world, complex biological recordings.
  • EEG Data: Recordings from human sleep studies used for sleep spindle detection.

Key Insights and Ideas

  • Sparsity in Dynamics, Not Just States: The most significant insight is shifting the focus of sparsity from the states themselves to the dynamics (innovations) of the state-space model. This is crucial for modeling transient biological events.
  • Bridging CS and SSMs: The paper elegantly bridges the gap between compressive sensing theory and state-space modeling, extending CS guarantees to a more general dynamic setting.
  • EM for Joint Estimation: The clever use of nested EM algorithms provides a computationally efficient way to jointly estimate both the underlying signals and the often unknown system dynamics.
  • Theoretical Guarantees for Real-World Problems: Providing theoretical stability guarantees for deconvolution in the presence of noise and undersampling is a critical step towards reliable biological signal analysis.
  • Confidence Intervals for Biological Events: The ability to provide statistically sound confidence intervals for detected events (like spikes) is invaluable for biological interpretation and hypothesis testing.

Key Results

  • Improved State Reconstruction: The proposed Fast Compressible State-Space (FCSS) estimator significantly outperforms traditional methods like Basis Pursuit Denoising (BPDN) in reconstructing underlying states, especially under compression.
  • Accurate Spike Detection: In calcium imaging, FCSS (and its pruned version, PFCSS) demonstrates superior accuracy in detecting spikes compared to existing methods like constrained f-oopsi, with significantly fewer false positives.
  • Efficient Sleep Spindle Detection: FCSS effectively denoises EEG data and accurately detects sleep spindles, outperforming standard band-pass filtering and RMS methods.
  • Computational Speedup: The FCSS algorithm is linear in the observation duration (T), making it significantly faster (e.g., ~3x faster than f-oopsi for moderate data sizes) and more scalable than batch-mode optimization methods.
  • Robustness to Compression: The method shows remarkable performance even with significant undersampling (e.g., using only 2/3 of the measurements), highlighting the potential for compressive imaging techniques.

Limitations and Future Work

  • Convergent Transition Matrix: The theoretical analysis relies on the assumption of a convergent state transition matrix. While the authors note that this condition can be enforced, it's a specific requirement.
  • Sparsity Assumptions: The stability guarantees are contingent on specific sparsity assumptions on the state innovations.
  • Future Work:
    • Higher-Order Dynamics: The authors suggest generalizing the framework to model higher-order autoregressive dynamics for other transient neural signals (e.g., K-complexes).
  • Broader Applications: They envision applications beyond calcium imaging and EEG, including modeling heart beat dynamics and detecting rapid changes in neural data covariance (e.g., epileptic seizures).
  • Model Selection: Further work could explore automatic model order selection for the state-space models.

Summary updated

Abstract

Objective: Common biological measurements are in the form of noisy convolutions of signals of interest with possibly unknown and transient blurring kernels. Examples include EEG and calcium imaging data. Thus, signal deconvolution of these measurements is crucial in understanding the underlying biological processes. The objective of this paper is to develop fast and stable solutions for signal deconvolution from noisy, blurred and undersampled data, where the signals are in the form of discrete events distributed in time and space. Methods : We introduce compressible state-space models as a framework to model and estimate such discrete events. These state-space models admit abrupt changes in the states and have a convergent transition matrix, and are coupled with compressive linear measurements. We consider a dynamic compressive sensing optimization problem and develop a fast solution, using two nested Expectation Maximization algorithms, to jointly estimate the states as well as their transition matrices. Under suitable sparsity assumptions on the dynamics, we prove optimal stability guarantees for the recovery of the states and present a method for the identification of the underlying discrete events with precise confidence bounds. Results : We present simulation studies as well as application to calcium deconvolution and sleep spindle detection, which verify our theoretical results and show significant improvement over existing techniques. Conclusion : Our results show that by explicitly modeling the dynamics of the underlying signals, it is possible to construct signal deconvolution solutions that are scalable, statistically robust, and achieve high temporal resolution. Significance : Our proposed methodology provides a framework for modeling and deconvolution of noisy, blurred, and undersampled measurements in a fast and stable fashion, with potential application to a wide range of biological data.
BibTeX
@article{kazemipour2018fast,
  author = {Abbas Kazemipour and Ji Liu and Krystyna Solarana and Daniel A. Nagode and Patrick O. Kanold and Min Wu and Behtash Babadi},
  title = {{Fast and Stable Signal Deconvolution via Compressible State-Space Models}},
  journal = {IEEE Trans. Biomedical Engineering},
  year = {2018},
  url = {https://openreview.net/forum?id=Yf6IH_2yDRY},
}
Figure