Dynamic Filtering of Time-Varying Sparse Signals via l1 Minimization
Adam Charles, Aurele Balavoine, Christopher Rozell

TL;DR
This paper introduces and analyzes two algorithms for dynamic filtering of time-varying sparse signals using l1 minimization, demonstrating their effectiveness and robustness through simulations and natural video data.
Contribution
It presents the first strong performance analysis of dynamic filtering algorithms for time-varying sparse signals and introduces a novel hierarchical probabilistic approach for improved robustness.
Findings
RWL1-DF outperforms BPDN-DF in practice, especially with inaccurate models.
Both algorithms show strong performance on simulated and real video data.
The hierarchical probabilistic model enhances robustness to model inaccuracies.
Abstract
Despite the importance of sparsity signal models and the increasing prevalence of high-dimensional streaming data, there are relatively few algorithms for dynamic filtering of time-varying sparse signals. Of the existing algorithms, fewer still provide strong performance guarantees. This paper examines two algorithms for dynamic filtering of sparse signals that are based on efficient l1 optimization methods. We first present an analysis for one simple algorithm (BPDN-DF) that works well when the system dynamics are known exactly. We then introduce a novel second algorithm (RWL1-DF) that is more computationally complex than BPDN-DF but performs better in practice, especially in the case where the system dynamics model is inaccurate. Robustness to model inaccuracy is achieved by using a hierarchical probabilistic data model and propagating higher-order statistics from the previous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
