Skip to Main content Skip to Navigation
Conference papers

Double Least Squares Pursuit for Sparse Decomposition

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Friday, May 19, 2017 - 10:43:10 AM
Last modification on : Thursday, March 5, 2020 - 5:41:50 PM
Long-term archiving on: : Monday, August 21, 2017 - 12:41:59 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Wanyi Li, Peng Wang, Hong Qiao. Double Least Squares Pursuit for Sparse Decomposition. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.357-363, ⟨10.1007/978-3-642-32891-6_44⟩. ⟨hal-01524947⟩



Record views


Files downloads