Size of the dictionary in matching pursuit algorithm

Authors:
Qiangsheng Liu;Qiao Wang;Lenan Wu
Affiliations:
First Dept. of Mobile Div., ZTE Corp., Nanjing, China;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2004

Citing 0
Cited 4

A Differential Evolution Based Time-Frequency Atom Decomposition for Analyzing Emitter signals

MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Improved quantum-inspired genetic algorithm based time-frequency analysis of radar emitter signals

RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
A new dictionary learning method for kernel matching pursuit

FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Robust face recognition via occlusion dictionary learning

Pattern Recognition

Quantified Score

Hi-index	35.68

Visualization

Abstract

The matching pursuit algorithm has been successfully applied in many areas such as data compression and pattern recognition. The performance of matching pursuit is closely related to the selection of the dictionary. In this paper, we propose an algorithm to estimate the optimal dictionary distribution ratio and discuss the decay of the norm of residual signal in matching pursuit when the coefficients are quantized by a uniform scalar quantizer. It is proposed that if the approximation error E and the dimension of the space N are given, the optimal size of the dictionary and the optimal quantizer step should be obtained by minimizing the number of bits required to store the matching pursuit representation of any signal in the space to satisfy the error bound.