Title: A novel Matching Pursuit algorithm with adaptive subdictionary
Abstract:Sparse decomposition of a signal can be obtained by decomposing the signal in an overcomplete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widel...Sparse decomposition of a signal can be obtained by decomposing the signal in an overcomplete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.Read More
Publication Year: 2008
Publication Date: 2008-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot