Please use this identifier to cite or link to this item:
|Title:||An efficient computational scheme for the two-dimensional overcomplete wavelet transform|
|Authors:||Law, NFB |
|Source:||IEEE transactions on signal processing, Nov. 2002, v. 50, no. 11, p. 2806-2819 How to cite?|
|Journal:||IEEE transactions on signal processing|
|Abstract:||We 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.|
|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.|
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:||Journal/Magazine Article|
Show full item record
Citations as of May 25, 2016
WEB OF SCIENCETM
Citations as of May 27, 2016
Checked on May 22, 2016
Checked on May 22, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.