Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1491
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorCheung, KP-
dc.creatorChan, YH-
dc.date.accessioned2014-12-11T08:26:29Z-
dc.date.available2014-12-11T08:26:29Z-
dc.identifier.isbn0-7803-6725-1-
dc.identifier.urihttp://hdl.handle.net/10397/1491-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.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.en_US
dc.rightsThis 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.en_US
dc.subjectAdaptive algorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectComputer simulationen_US
dc.subjectIterative methodsen_US
dc.titleA fast two-stage algorithm for realizing matching pursuiten_US
dc.typeConference Paperen_US
dc.description.otherinformationCentre for Multimedia Signal Processing, Department of Electronic and Information Engineeringen_US
dcterms.abstractMatching 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationICIP : 2001 International Conference on Image Processing : proceedings : 7-10 October 2001, Thessaloniki, Greece, v.2, p. 431-434-
dcterms.issued2001-
dc.identifier.isiWOS:000178044600110-
dc.identifier.scopus2-s2.0-0035159870-
dc.relation.ispartofbookICIP : 2001 International Conference on Image Processing : proceedings : 7-10 October 2001, Thessaloniki, Greece-
dc.relation.conferenceIEEE International Conference on Image Processing [ICIP]-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Realizing matching pursuit_01.pdf358.44 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

97
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

87
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Apr 25, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.