Table of Contents
Fetching ...

A Unified Algorithmic Framework for Dynamic Compressive Sensing

Xiaozhi Liu, Yong Xia

TL;DR

The paper tackles recursive reconstruction of time-varying sparse signals from undersampled measurements by exploiting structured dynamic sparsity. It introduces the Partial-Laplacian sparsity model and a unified PLAY-CS framework that reveals connections among existing dynamic CS methods while generalizing to MMV via PLAY+ CS/MMV. An EM-based PLAY+ CS algorithm is proposed, with a broadband MMV extension that leverages dynamic joint sparsity. Across dynamic channel tracking and compressive background subtraction, the proposed methods outperform state-of-the-art approaches, demonstrating meaningful gains in practical, real-time wireless and video settings.

Abstract

We propose a unified dynamic tracking algorithmic framework (PLAY-CS) to reconstruct signal sequences with their intrinsic structured dynamic sparsity. By capitalizing on specific statistical assumptions concerning the dynamic filter of the signal sequences, the proposed framework exhibits versatility by encompassing various existing dynamic compressive sensing (DCS) algorithms. This is achieved through the incorporation of a newly proposed Partial-Laplacian filtering sparsity model, tailored to capture a more sophisticated dynamic sparsity. In practical scenarios such as dynamic channel tracking in wireless communications, the framework demonstrates enhanced performance compared to existing DCS algorithms.

A Unified Algorithmic Framework for Dynamic Compressive Sensing

TL;DR

The paper tackles recursive reconstruction of time-varying sparse signals from undersampled measurements by exploiting structured dynamic sparsity. It introduces the Partial-Laplacian sparsity model and a unified PLAY-CS framework that reveals connections among existing dynamic CS methods while generalizing to MMV via PLAY+ CS/MMV. An EM-based PLAY+ CS algorithm is proposed, with a broadband MMV extension that leverages dynamic joint sparsity. Across dynamic channel tracking and compressive background subtraction, the proposed methods outperform state-of-the-art approaches, demonstrating meaningful gains in practical, real-time wireless and video settings.

Abstract

We propose a unified dynamic tracking algorithmic framework (PLAY-CS) to reconstruct signal sequences with their intrinsic structured dynamic sparsity. By capitalizing on specific statistical assumptions concerning the dynamic filter of the signal sequences, the proposed framework exhibits versatility by encompassing various existing dynamic compressive sensing (DCS) algorithms. This is achieved through the incorporation of a newly proposed Partial-Laplacian filtering sparsity model, tailored to capture a more sophisticated dynamic sparsity. In practical scenarios such as dynamic channel tracking in wireless communications, the framework demonstrates enhanced performance compared to existing DCS algorithms.
Paper Structure (27 sections, 40 equations, 9 figures, 3 tables, 2 algorithms)

This paper contains 27 sections, 40 equations, 9 figures, 3 tables, 2 algorithms.

Figures (9)

  • Figure 1: An example of the CDL-B channel model in cdl. (a) plots the channel gains in the antenna-time domain. (b) plots the channel gains in the angle-time domain. (c) plots the sparsity in angular domain. (d) shows the dynamic joint sparsity in the angle-frequency-time domain.
  • Figure 2: Consecutive frames in the Hall video sequence hall. (a) plots the background (frame 1). (b) plots the video frames. (c) plots the subtracted foregrounds. (d) shows the vectorized pixel values of the corresponding foregrounds.
  • Figure 3: The hierarchical structure of the Partial-LSM model.
  • Figure 4: The NMSE curves and Corr curves of different methods when SNR of measurements is 40dB and $m=24$. (a) NMSE curves. (b) Corr curves.
  • Figure 5: The TNMSE performances of various algorithms under diffirent SNR and CR levels. (a) TNMSE of $\text{PLAY}^{+}$-CS. (b) TNMSE of RWL1-DF. (c) TNMSE of Regular-CS.
  • ...and 4 more figures

Theorems & Definitions (1)

  • Definition 1: modcs