Pith. sign in

REVIEW

Stopping Condition for Greedy Block Sparse Signal Recovery

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1612.07413 v1 pith:KTOQ7JHT submitted 2016-12-22 cs.IT math.IT

Stopping Condition for Greedy Block Sparse Signal Recovery

classification cs.IT math.IT
keywords recoveryblockbompconditioniterationenergyresidualsignals
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

For greedy block sparse recovery where the sparsity level is unknown, we derive a stopping condition to stop the iteration process. Focused on the block orthogonal matching pursuit (BOMP) algorithm, we model the energy of residual signals at each iteration from a probabilistic perspective. At the iteration when the last supporting block is detected, the resulting energy of residual signals is supposed to suffer an obvious decrease. Based on this, we stop the iteration process when the energy of residual signals is below a given threshold. Compared with other approaches, our derived condition works well for the BOMP recovery. What is more, we promote our approach to the interference cancellation based BOMP (ICBOMP) recovery in paper [1]. Simulation results show that our derived condition can save many unnecessary iterations and at the same time guarantees a favorable recovery accuracy, both for the BOMP and ICBOMP recoveries.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.