Title: Orthogonal Matching Pursuit Based on Tree-Structure Redundant Dictionary
Abstract: Tree based Orthogonal matching pursuit is proposed to overcome the convergence of sparse decomposition. Sparse decomposition can be fast solved by tree based matching pursuit, however, the tree based pursuit is locally best in essence, so it convergences very slowly. We propose the orthogonal matching pursuit algorithm that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. Also, it guarantees the sparsity of results and exactly of reconstructed image. Speech signal and earthquake signal are tested via Tree based orthogonal matching pursuit separately, both of which have better convergence performance than tree based matching pursuit.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot