[1] Liu Qiangsheng**, Wu Lenan,. Compete Matching Pursuits Algorithm* [J]. Journal of Southeast University (English Edition), 2002, 18 (1): 24-27. [doi:10.3969/j.issn.1003-7985.2002.01.005]
Copy
Compete Matching Pursuits Algorithm*(
)
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 18
- Issue:
- 2002 1
- Page:
- 24-27
- Research Field:
- Information and Communication Engineering
- Publishing date:
- 2002-03-30
Info
- Title:
- Compete Matching Pursuits Algorithm*
- Author(s):
- Liu Qiangsheng**; Wu Lenan
- Department of Radio Engineering, Southeast University, Nanjing 210096, China
- PACS:
- TN911
- DOI:
- 10.3969/j.issn.1003-7985.2002.01.005
- Abstract:
- Matching pursuits algorithm(MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In this paper, the authors proposed an algorithm called compete matching pursuits(CMP), which can overcome this shortcoming and performance very well.
References:
[1] Daubechies I. Ten lectures on wavelets[A].CBS-NSF Regional Conf Series in Appl Math, Society for Industrial and Applied Math [C]. Philadelphia, PA, 1992, 61.
[2] Chen S, Donoho D L. Atomic decomposition by basis pursuit[J]. SIAM Journal on Scientific Computing, 1998, 20(1):33-61.
[3] Mallat S, Zhang Z. Matching pursuit in a time-frequency dictionary[J], IEEE Transactions on Signal Processing, 1993, 41(12):3397-3415.
[4] Coifman R R, Wickerhauser M V. Entropy-based algorithms for best-basis selection[J]. IEEE Transactions on Information Theory, 1992, 38(2):713-718.
[5] Jaggi S, Carl W C, Mallat S, Willsky A S. High-resolution pursuit for feature extraction[J]. Applied and Computational Harmonic Analysis, 1998, 5(4):428-449.
Memo
- Memo:
- * The project supported by the National Natural Science Foundation of China(60072013).
** Born in 1973, male, graduate.
Last Update: 2002-03-20