Open Access Open Access  Restricted Access Subscription or Fee Access

An Iterative Framework for Sparse Signal Reconstruction Algorithms

Wassan Bhajankaur s, AM Kothari


This paper focuses to different strategies will often improve the performance of many sparse reconstruction algorithms The sparse signal recovery problem has been the subject of extensive research over the last few Decades in several different research communities, including applied mathematics, statistics, and theoretical computer science. The goal of this research has been to obtain higher compression rates, stable recovery schemes, low encoding, update and decoding times and resilience to noise. In this paper, we propose a general iterative framework and a novel algorithm which iteratively enhance the performance of any given arbitrary sparse reconstruction algorithm.

Keywords: Compressed sensing sparse recovery, sparse signal signal reconstruction iterative algorithms

Cite this Article
Wassan Bhajankaur S, AM Kothari. An iterative framework for sparse signal reconstruction algorithms. Journal of Advancements in Robotics. 2015; 2(3): 25–29p.

Full Text:



Candès E, Romberg J, Tao T. Robust uncertainty principles exact signal reconstruction from highly incomplete frequency in formation. IEEE Trans. Inf. Theory. 2006; 52(2): 489–509p.

Candès E, Romberg JK, Tao T. Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Applied Math’s. 2006; 59(8): 1207–1223p.

Tropp J. Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inf. Theory. 2006; 52(3): 1030–1051p.

Chen S, Donoho D, Saunders M. Atomic decom position by basis pursuit. SIAMRev. 2001; 43(1): 129–159p.

Mallat S, Zhang Z. Matching pursuits with time-frequency dictionaries. IEEETrans SignalProcess. 1993; 41(12): 3397–3415p.

Tropp J, Gilbert A. Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory. 2007; 53(12): 4655–4666p.

Needell D, Tropp J. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl .Comput. Harmon. Anal. 2009; 26(3): 301–321p.

Dai W, Milenkovic O. Sub space pursuit for compressive sensing signal reconstruction. IEEETrans. Inf. Theory. 2009; 55(5): 2230–2249p.

Gorodnitsky I, Rao BD. Sparse signal reconstruction from limited data using FOCUSS are-weighted minimum algorithm. IEEE Trans. Signal Process. 1997; 45(3): 600–616p.

Wipf D, Rao BD. Bayesian learning for sparse signal reconstruction. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). 2003; 6(VI): 601–4p.

Wipf D, Rao BD. Sparse Bayesian learning for basis selection. Low-dimensional models for dimensionality reduction and signal recovery: A geometric perspective. Proceedings of the IEEE. 2010.

Gilbert A, Indyk P. Sparse recovery using sparse matrices. Proceedings of IEEE. 2010.

Bishop C M. Pattern recognition and machine learning. Springer. 2006.

Donoho D L. Compressed sensing. IEEE Trans. Info. Theory. 2006; 52: 1289–1306p.

Cand`es E J. Compressive sampling. in Proc. International Congress of Mathematicians. 2006; 3 (Madrid, Spain): 1433–1452p.

Cohen A, Dahmen W, DeVore R. Compressed sensing and best k-term approximation. American Mathematical Society. 2009; 22(1): 211–231p.

Marvasti F. No uniform Sampling: Theory and Practice. Springer, NewYork. 2001.

Baraniuk RG. A lecture on compressive sensing. IEEE Signal Process. 2007; 24(4): 118–121p.

Vetterli M, Marziliano P, Blu T. Sampling signals with finite rate of innovation. IEEE Trans. Signal Process. 2002; 50(6): 1417–1428p.

Lin S, Costello DJ. Error Control Coding. Prentice-Hall, Englewood. 2000.


  • There are currently no refbacks.

This site has been shifted to