Title: Sparse decomposition based on orthogonal matching pursuit with 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 pursuit,however,the tree based pursuit is l...Tree based orthogonal matching pursuit is proposed to overcome the convergence of sparse decomposition.Sparse decomposition can be fast solved by tree based pursuit,however,the tree based pursuit is locally best in essence.This paper proposes 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 accuracy 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.Read More
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot