Pith. sign in

REVIEW

Compressed Sensing for Block-Sparse Smooth Signals

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1309.2505 v1 pith:TDQIM6LT submitted 2013-09-10 stat.ML cs.ITmath.ITmath.STstat.TH

Shahzad Gishkori , Geert Leus This is my paper · ORCID
classification stat.MLcs.ITmath.ITmath.STstat.TH
keywords compressedgrouplassosignalssmoothabsoluteachievealgorithms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present reconstruction algorithms for smooth signals with block sparsity from their compressed measurements. We tackle the issue of varying group size via group-sparse least absolute shrinkage selection operator (LASSO) as well as via latent group LASSO regularizations. We achieve smoothness in the signal via fusion. We develop low-complexity solvers for our proposed formulations through the alternating direction method of multipliers.

Discussion (0). Continue with ORCID to comment.

Pith tools