Abstract
Matching pursuit is proved to be one of the most efficient techniques in various signal coding techniques. However, its computation effort is so tremendous that it may not be affordable in some real-time applications. A two-stage filtering structure for realizing matching pursuit has recently proposed. This paper presents an efficient algorithm for the implementation of the structure. The issues of how to determine the elementary dictionary and approximate a given initial dictionary are also addressed in this paper. Simulation results show that the proposed algorithm can achieve a significant improvement in the complexity-distortion performance.
Original language | English |
---|---|
Title of host publication | IEEE International Conference on Image Processing |
Pages | 431-434 |
Number of pages | 4 |
Publication status | Published - 1 Jan 2001 |
Event | IEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece Duration: 7 Oct 2001 → 10 Oct 2001 |
Conference
Conference | IEEE International Conference on Image Processing (ICIP) |
---|---|
Country/Territory | Greece |
City | Thessaloniki |
Period | 7/10/01 → 10/10/01 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering