Matching pursuit has found many applications recently especially in very low bit rate video coding. In this paper we show how the complexity of matching pursuit can be reduced from O(N) to O(log(2N)) using tree structured dictionaries. Moreover, we show how tree structured dictionaries provide an efficient coding strategy that is more resilient to error than random coding. Our simulation results showed an improvement of about 3 dB in PSNR can be achieved using the code provided by the tree structured dictionary.
Tree structure search for matching pursuit
IEEE International Conference on Image Processing 2005 ; 3 ; III-908
2005-01-01
355289 byte
Conference paper
Electronic Resource
English
Tree Structure Search for Matching Pursuit
British Library Conference Proceedings | 2005
|Multiple Blocks Update Algorithm for Matching Pursuit Video Coding
British Library Conference Proceedings | 2005
|Matching Pursuit via Genetic Algorithm Based on Hybrid Coding
British Library Online Contents | 2005
|Search and pursuit-evasion in mobile robotics
British Library Online Contents | 2011
|