Abstract
Matching Pursuits is proved to be one of the most efficient techniques in various video coding techniques. However, its computation effort is so tremendous that it may not be affordable in some real-time applications. This paper presents an efficient algorithm for the implementation of Matching Pursuits. Simulation results show that the computation effort can be successfully reduced with the proposed method.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Conference on Image Processing |
| Pages | 863-866 |
| Number of pages | 4 |
| Publication status | Published - 1 Dec 2000 |
| Event | International Conference on Image Processing (ICIP 2000) - Vancouver, BC, Canada Duration: 10 Sept 2000 → 13 Sept 2000 |
Conference
| Conference | International Conference on Image Processing (ICIP 2000) |
|---|---|
| Country/Territory | Canada |
| City | Vancouver, BC |
| Period | 10/09/00 → 13/09/00 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering