Greedy Sparse Signal Recovery with Tree Pruning
Jaeseok Lee, Suhyuk Kwon, Jun Won Choi, Byonghyo Shim

TL;DR
This paper introduces a novel greedy sparse signal recovery algorithm called TMP that explores multiple candidates via tree search, improving accuracy and efficiency over traditional methods.
Contribution
The paper proposes the TMP algorithm, combining pre-selection and tree pruning, to enhance greedy sparse recovery by exploring multiple candidates efficiently.
Findings
TMP effectively recovers sparse signals in noiseless scenarios.
TMP performs well in noisy conditions, maintaining high recovery accuracy.
Empirical results demonstrate TMP's superiority over existing greedy methods.
Abstract
Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a greedy sparse recovery algorithm investigating multiple promising candidates via the tree search. Two key ingredients of the proposed algorithm, referred to as the matching pursuit with a tree pruning (TMP), to achieve efficiency in the tree search are the {\it pre-selection} to put a restriction on columns of the sensing matrix to be investigated and the {\it tree pruning} to eliminate unpromising paths from the…
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.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Blind Source Separation Techniques · Image and Signal Denoising Methods
