Topic
Harmonic wavelet transform
About: Harmonic wavelet transform is a research topic. Over the lifetime, 9602 publications have been published within this topic receiving 247336 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The Fourier transform data communication system is described and the effects of linear channel distortion are investigated and a differential phase modulation scheme is presented that obviates any equalization.
Abstract: The Fourier transform data communication system is a realization of frequency-division multiplexing (FDM) in which discrete Fourier transforms are computed as part of the modulation and demodulation processes. In addition to eliminating the bunks of subcarrier oscillators and coherent demodulators usually required in FDM systems, a completely digital implementation can be built around a special-purpose computer performing the fast Fourier transform. In this paper, the system is described and the effects of linear channel distortion are investigated. Signal design criteria and equalization algorithms are derived and explained. A differential phase modulation scheme is presented that obviates any equalization.
2,507 citations
••
TL;DR: Several methods for filter design are described for dual-tree CWT that demonstrates with relatively short filters, an effective invertible approximately analytic wavelet transform can indeed be implemented using the dual- tree approach.
Abstract: The paper discusses the theory behind the dual-tree transform, shows how complex wavelets with good properties can be designed, and illustrates a range of applications in signal and image processing The authors use the complex number symbol C in CWT to avoid confusion with the often-used acronym CWT for the (different) continuous wavelet transform The four fundamentals, intertwined shortcomings of wavelet transform and some solutions are also discussed Several methods for filter design are described for dual-tree CWT that demonstrates with relatively short filters, an effective invertible approximately analytic wavelet transform can indeed be implemented using the dual-tree approach
2,407 citations
•
TL;DR: The S transform as discussed by the authors is an extension to the ideas of the Gabor transform and the Wavelet transform, based on a moving and scalable localising Gaussian window and is shown here to have characteristics that are superior to either of the transforms.
Abstract: The S transform, an extension to the ideas of the Gabor transform and the Wavelet transform, is based on a moving and scalable localising Gaussian window and is shown here to have characteristics that are superior to either of the transforms. The S transform is fully convertible both forward and inverse from the time domain to the 2-D frequency translation (time) domain and to the familiar Fourier frequency domain. Parallel to the translation (time) axis, the S transform collapses as the Fourier transform. The amplitude frequency-time spectrum and the phase frequency-time spectrum are both useful in defining local spectral characteristics. The superior properties of the S transform are due to the fact that the modulating sinusoids are fixed with respect to the time axis while the localising scalable Gaussian window dilates and translates. As a result, the phase spectrum is absolute in the sense that it is always referred to the origin of the time axis, the fixed reference point. The real and imaginary spectrum can be localised independently with a resolution in time corresponding to the period of the basis functions in question. Changes in the absolute phase ofa constituent frequency can be followed along the time axis and useful information can be extracted. An analysis of a sum of two oppositely progressing chirp signals provides a spectacular example of the power of the S transform. Other examples of the applications of the Stransform to synthetic as well as real data are provided.
2,323 citations
••
TL;DR: In this paper, the authors describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform, which offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity.
Abstract: We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a/spl grave/ trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement.
2,244 citations
••
TL;DR: The author describes the mathematical properties of such decompositions and introduces the wavelet transform, which relates to the decomposition of an image into a wavelet orthonormal basis.
Abstract: The author reviews recent multichannel models developed in psychophysiology, computer vision, and image processing. In psychophysiology, multichannel models have been particularly successful in explaining some low-level processing in the visual cortex. The expansion of a function into several frequency channels provides a representation which is intermediate between a spatial and a Fourier representation. The author describes the mathematical properties of such decompositions and introduces the wavelet transform. He reviews the classical multiresolution pyramidal transforms developed in computer vision and shows how they relate to the decomposition of an image into a wavelet orthonormal basis. He discusses the properties of the zero crossings of multifrequency channels. Zero-crossing representations are particularly well adapted for pattern recognition in computer vision. >
2,109 citations