Please use this identifier to cite or link to this item:
|Title:||A fast two-stage algorithm for realizing matching pursuit|
|Source:||ICIP : 2001 International Conference on Image Processing : proceedings : 7-10 October 2001, Thessaloniki, Greece, v.2, p. 431-434 How to cite?|
|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.|
|Rights:||© 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Files in This Item:
|Realizing matching pursuit_01.pdf||358.44 kB||Adobe PDF||View/Open|
Citations as of Feb 4, 2016
Checked on Feb 7, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.