DocumentCode
2174376
Title
An MP sparse decomposition algorithm with 2-step search method based on partitioning the over-complete dictionary
Author
Yi-qing, Shen ; Chuang, Ye ; Hao, Li ; Bai-Xiang, Wang
Author_Institution
Inst. of Electron. Circuit & Inf. Syst., Zhejiang Univ., Hangzhou, China
fYear
2011
fDate
9-11 Sept. 2011
Firstpage
2539
Lastpage
2542
Abstract
In this paper, after study of Matching Pursuit(MP) based signal sparse decomposition, a new sparse decomposition algorithm with 2-step search method based on partitioning the over-complete dictionary is presented to overcome the complexity of MP. This algorithm improves the speed of signal sparse decomposition with pretty subjective visual effect of images. Finally the experimental results verify the efficiency of the proposed method.
Keywords
iterative methods; search problems; signal processing; 2-step search method; MP sparse decomposition algorithm; matching pursuit; over-complete dictionary; signal sparse decomposition; Algorithm design and analysis; Dictionaries; Information theory; Matching pursuit algorithms; Partitioning algorithms; Search methods; USA Councils; 2-step search; MP (matching pursuit); over-complete dictionary; sparse decomposition;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Communications and Control (ICECC), 2011 International Conference on
Conference_Location
Ningbo
Print_ISBN
978-1-4577-0320-1
Type
conf
DOI
10.1109/ICECC.2011.6066516
Filename
6066516
Link To Document