Home > Papers

 
 
Two dictionaries Matching Pursuit for sparse decomposition of signals
Peng Xu *,Dezhong Yao *
Center of Neuroinformatics, School of Life Science and Technology, University of Electronic Science and Technology of China
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online: 8 December 2005
Accepted by: none
Citation: Peng Xu,Dezhong Yao.Two dictionaries Matching Pursuit for sparse decomposition of signals[OL]. [ 8 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4180
 
 
Signal may be decomposed sparsely and power-focally in an over-complete dictionary with Matching Pursuit (MP). In this paper, proposed is a modified MP method named two dictionaries MP to decompose signal more sparsely. In the iteration procedure of the two dictionaries MP, the over-complete dictionary is classified into two separate dictionaries with the selected and unselected atoms, and in each iteration, the algorithm was designed to have more chances than the original MP to choose the atom in the selected atom dictionary as the optimal atom by a simulate annealing threshold function, thus the algorithm avails for a more sparse decomposition. The decomposition results for a cosine-modulated exponential signal and an actual speech signal showed that the proposed two dictionaries MP could decompose signal more sparsely.
Keywords:Sparsity; Over-complete dictionary; Matching pursuit; Simulate annealing threshold function
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 647
Bookmarked 0
Recommend 5
Comments Array
Submit your papers