DocumentCode :
2228333
Title :
A matching pursuit reconstruction algorithm based on adaptive backtracking
Author :
Wang Mingquan ; Chang Zheng ; Zhang Shi ; She Lihuang ; Kang Wenxiang
Author_Institution :
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
fYear :
2013
fDate :
5-8 Aug. 2013
Firstpage :
1
Lastpage :
6
Abstract :
This paper presents a kind of matching pursuit reconstruction algorithm based on adaptive backtracking (ABMP) on the basis of researching and summarizing the existing reconstruction algorithms. The advantages of the algorithm are the adaptive multi-matching principle and adaptive backtracking strategy, both of them are used to select atoms. Adaptive multi-matching principle accelerates the speed of matching atoms and improves the matching accuracy. Adaptive backtracking strategy improves the reconstruction accuracy and probability of precise reconstruction, and improves the speed of the algorithm. In addition, the algorithm also has the characteristic of sparsity adaptive and can be used for blind sparsity signal reconstruction. Simulation results show that the overall performance of the ABMP is obviously better than other greedy algorithms under the same condition.
Keywords :
backtracking; greedy algorithms; probability; signal reconstruction; ABMP; adaptive backtracking; adaptive multimatching principle; blind sparsity signal reconstruction; greedy algorithms; matching pursuit reconstruction algorithm; probability; Accuracy; Algorithm design and analysis; Image reconstruction; Matching pursuit algorithms; Optimization; Reconstruction algorithms; Sparse matrices; Compressed sensing; adaptive backtracking; greedy pursuit; sparse reconstruction; sparsity adaptive;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, Communication and Computing (ICSPCC), 2013 IEEE International Conference on
Conference_Location :
KunMing
Type :
conf
DOI :
10.1109/ICSPCC.2013.6663967
Filename :
6663967
Link To Document :
بازگشت