Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1530
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:30Z-
dc.date.available2014-12-11T08:26:30Z-
dc.identifier.isbn0-7803-6297-7-
dc.identifier.urihttp://hdl.handle.net/10397/1530-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rights© 2000 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.subjectCode standardsen_US
dc.subjectImage matchingen_US
dc.subjectIterative methodsen_US
dc.subjectSearch problemsen_US
dc.subjectTelecommunication standardsen_US
dc.subjectVector quantisationen_US
dc.subjectVideo codingen_US
dc.titleAn efficient algorithm for realizing matching pursuits and its applications in MPEG4 coding systemen_US
dc.typeConference Paperen_US
dc.description.otherinformationCentre for Multimedia Signal Processing, Department of Electronic and Information Engineeringen_US
dc.description.otherinformationRefereed conference paperen_US
dcterms.abstractMatching Pursuits is proved to be one of the most efficient techniques used 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationICIP : 2000 International Conference on Image Processing : proceedings : September 10-13, 2000, Vancouver, British Columbia, Canada, v. 2, p. 863-866-
dcterms.issued2000-
dc.identifier.isiWOS:000167496400223-
dc.identifier.scopus2-s2.0-0034444935-
dc.relation.ispartofbookICIP : 2000 International Conference on Image Processing : proceedings : September 10-13, 2000, Vancouver, British Columbia, Canada-
dc.relation.conferenceIEEE International Conference on Image Processing [ICIP]-
dc.identifier.rosgroupidr00631-
dc.description.ros2000-2001 > Academic research: refereed > Refereed conference paper-
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 
Alogrithm MPEG4 coding system.pdf368.3 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

43
Last Week
1
Last month
Citations as of Jun 19, 2022

Downloads

38
Citations as of Jun 19, 2022

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Jun 23, 2022

Google ScholarTM

Check


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