Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/296
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorLaw, NFB-
dc.creatorSiu, WC-
dc.date.accessioned2014-12-11T08:28:26Z-
dc.date.available2014-12-11T08:28:26Z-
dc.identifier.issn1053-587X-
dc.identifier.urihttp://hdl.handle.net/10397/296-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2002 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.subjectComputational complexityen_US
dc.subjectOver-complete waveletsen_US
dc.subjectSpatial implementationen_US
dc.subjectWavelet transformen_US
dc.titleAn efficient computational scheme for the two-dimensional overcomplete wavelet transformen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage2806-
dc.identifier.epage2819-
dc.identifier.volume50-
dc.identifier.issue11-
dc.identifier.doi10.1109/TSP.2002.804094-
dcterms.abstractWe have studied the computational complexity associated with the overcomplete wavelet transform for the commonly used Spline wavelet family. By deriving general expressions for the computational complexity using the conventional filtering implementation, we show that the inverse transform is significantly more costly in computation than the forward transform. To reduce this computational complexity, we propose a new spatial implementation based on the exploitation of the correlation between the lowpass and the bandpass outputs that is inherent in the overcomplete representation. Both theoretical studies and experimental findings show that the proposed spatial implementation can greatly simplify the computations associated with the inverse transform. In particular, the complexity of the inverse transform using the proposed implementation can be reduced to slightly less than that of the forward transform using the conventional filtering implementation. We also demonstrate that the proposed scheme allows the use of an arbitrary boundary extension method while maintaining the ease of the inverse transform.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE transactions on signal processing, Nov. 2002, v. 50, no. 11, p. 2806-2819-
dcterms.isPartOfIEEE transactions on signal processing-
dcterms.issued2002-11-
dc.identifier.isiWOS:000178713200018-
dc.identifier.scopus2-s2.0-0036844420-
dc.identifier.eissn1941-0476-
dc.identifier.rosgroupidr13294-
dc.description.ros2002-2003 > Academic research: refereed > Publication in refereed journal-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryVoR alloweden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
two-dimensional_02.pdf301.02 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

104
Last Week
1
Last month
Citations as of Jul 14, 2024

Downloads

159
Citations as of Jul 14, 2024

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Jul 11, 2024

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Jul 11, 2024

Google ScholarTM

Check

Altmetric


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