Abstract
Sparse decomposition has been widely used in numerous applications, such as image processing, pattern recognition, remote sensing and computational biology. Despite plenty of theoretical developments have been proposed, developing, implementing and analyzing novel fast sparse approximation algorithm is still an open problem. In this paper, a new pursuit algorithm Double Least Squares Pursuit (DLSP) is proposed for sparse decomposition. In this algorithm, the support of the solution is obtained by sorting the coefficients which are calculated by the first Least-Squares, and then the non-zero values over this support are detected by the second Least-Squares. The results of numerical experiment demonstrate the effectiveness of the proposed method, which is with less time complexity, more simple form, and gives close or even better performance compared to the classical Orthogonal Matching Pursuit (OMP) method.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Elad, M.: Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Springer (2010)
Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM Journal on Computing 24, 227–234 (1995)
Pati, Y.C., Rezaiifar, R., et al.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: 1993 Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers (1993)
Mallat, S.G., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing 41(12), 3397–3415 (1993)
Candes, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203–4215 (2005)
Candes, E., Romberg, J.: l1-magic:Recovery of sparse signals via convex programming. California Institute of Technology (2005), http://www.acm.caltech.edu/l1magic/
Cands, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics 59, 1207–1223 (2006)
Candes, E., Tao, T.: Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Transactions on Information Theory 52(12), 5406–5425 (2006)
Sparse Representations for Signal Processing and Coding, http://www.see.ed.ac.uk/~tblumens/Sparse/Sparse.html (Visited March 22, 2012)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)
Temlyakov, V.N.: Weak greedy algorithms. Advances in Computational Mathematics 5, 173–187 (2000)
Cai, T.T., Lie, W.: Orthogonal Matching Pursuit for Sparse Signal Recovery with Noise. IEEE Transactions on Information Theory 57(7), 4680–4688 (2011)
Tong, Z.: Sparse Recovery with Orthogonal Matching Pursuit under Rip. IEEE Transactions on Information Theory 57(9), 6215–6221 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Li, W., Wang, P., Qiao, H. (2012). Double Least Squares Pursuit for Sparse Decomposition. In: Shi, Z., Leake, D., Vadera, S. (eds) Intelligent Information Processing VI. IIP 2012. IFIP Advances in Information and Communication Technology, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32891-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-32891-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32890-9
Online ISBN: 978-3-642-32891-6
eBook Packages: Computer ScienceComputer Science (R0)