On the Doubly Sparse Compressed Sensing Problem

DOI10.1007/978-3-319-27239-9_11MaRDI QIDQ3460106zbMATH OpenOpenAlexFDO

Authors Grigory Kabatiansky, Serge Vlăduţ, Cédric Tavernier

Publication date 12 January 2016

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.07145

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: A new variant of the Compressed Sensing problem is investigated when the number of measurements corrupted by errors is upper bounded by some value l but there are no more restrictions on errors. We prove that in this case it is enough to make 2(t+l) measurements, where t is the sparsity of original data. Moreover for this case a rather simple recovery algorithm is proposed. An analog of the Singleton bound from coding theory is derived what proves optimality of the corresponding measurement matrices.

Recommendations

• Doubly iteratively reweighted algorithm for constrained compressed sensing models
• Nesterov's algorithm solving dual formulation for compressed sensing
• Sparsity and compressed sensing in inverse problems
• Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
• Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing
• Successive Concave Sparsity Approximation for Compressed Sensing
• Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
• Two results of sparsity for dual frames
• Dual-sparsity preserving projection

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Compressed sensing
• Decoding by Linear Programming
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On error correction with errors in both the channel and syndrome

Cited in

(7)

• Collaborative block compressed sensing reconstruction with dual-domain sparse representation
• Separable collusion-secure multimedia codes
• Compressed sensing and matrix completion with constant proportion of corruptions
• Nesterov's algorithm solving dual formulation for compressed sensing
• Compressed sensing with sparse corruptions: fault-tolerant sparse collocation approximations
• A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing

This page was built for publication: On the Doubly Sparse Compressed Sensing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460106)