A fast two-stage algorithm for realizing matching pursuit

K. P. Cheung, Yuk Hee Chan

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

11 Citations (Scopus)

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 languageEnglish
Title of host publicationIEEE International Conference on Image Processing
Pages431-434
Number of pages4
Publication statusPublished - 1 Jan 2001
EventIEEE International Conference on Image Processing (ICIP) - Thessaloniki, Greece
Duration: 7 Oct 200110 Oct 2001

Conference

ConferenceIEEE International Conference on Image Processing (ICIP)
CountryGreece
CityThessaloniki
Period7/10/0110/10/01

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this