Addresses the problem of the sensitivity of wavelet representations to translations for two-dimensional signals. The authors describe a fast algorithm to calculate the two-dimensional wavelet transforms for all the circular translates of an input image. They select the optimal translate for the decomposition using a quadtree search algorithm. The resulted wavelet representation is invariant under translations measured by an additive cost criterion. The complexity of the whole algorithm is O(N/sup 2/ log N) for a N/spl times/N input block. They apply this translation invariant wavelet transform to data compression. The results show that by taking into account the effect of translations, additional compression can be achieved beyond that achieved by a standard wavelet transform.<>
A two-dimensional translation invariant wavelet representation and its applications
Proceedings of 1st International Conference on Image Processing ; 1 ; 66-70 vol.1
1994-01-01
537204 byte
Conference paper
Electronic Resource
English
A Two-Dimensional Translation Invariant Wavelet Representation and its Applications
British Library Conference Proceedings | 1994
|Affine Invariant for 2D Image Representation: A Wavelet Approach
British Library Conference Proceedings | 2005
|A Translation-Invariant Wavelet Denoising Method Based on Improved Threshold
British Library Online Contents | 2011
|Complex Daubechies Wavelet Based Affine Invariant Representation for Object Recognition
British Library Conference Proceedings | 1994
|