DocumentCode
526459
Title
Newton Pursuit algorithm for sparse signal reconstruction in compressed sensing
Author
Lei, Zhu ; Chunting, Qiu
Author_Institution
Xi´´an Polytech. Univ., Xi´´an, China
Volume
6
fYear
2010
fDate
9-11 July 2010
Firstpage
463
Lastpage
466
Abstract
Sparse signal approximations have become a new tool in signal processing with wide ranging applications from source separation to signal acquisition. Recently, many algorithms for sparse signal reconstruction have been developed, however, greedy algorithms, such as Orthogonal Matching Pursuit algorithm, can have better performance than the other algorithms. Approximate orthogonal matching pursuit algorithms, such as gradient pursuit algorithm and conjugate gradient pursuit algorithm, can lead to fast approximations to Orthogonal Matching Pursuit. In this paper Newton pursuit algorithm for sparse signal reconstruction is proposed. The algorithm is a kind of directional pursuit algorithms with the same computational complexity compared to orthogonal matching pursuit algorithm, but it can have better performance than approximate orthogonal matching pursuit algorithms.
Keywords
approximation theory; computational complexity; greedy algorithms; iterative methods; signal reconstruction; sparse matrices; time-frequency analysis; Newton pursuit algorithm; approximate orthogonal matching pursuit algorithm; compressed sensing; computational complexity; greedy algorithm; sparse signal reconstruction; Lead; Newton Pursuit; compressed sensing; gradient pursuit; reconstruction; sparse signal;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-5537-9
Type
conf
DOI
10.1109/ICCSIT.2010.5564076
Filename
5564076
Link To Document