Article thumbnail

A fast two-stage algorithm for realizing matching pursuit

By KP Cheung and YH Chan

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.Department of Electronic and Information EngineeringCentre for Multimedia Signal Processing, Department of Electronic and Information Engineerin

Topics: Adaptive algorithms, Computational complexity, Computer simulation, Iterative methods
Publisher: IEEE
Year: 2001
OAI identifier: oai:ira.lib.polyu.edu.hk:10397/1491
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10397/14... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.