scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
TL;DR: In this paper, a wavelet transform called Spikelet was designed and optimized to spike and overlap pattern recognition in the digitalized signal that comes from H1, a motion-sensitive neuron of the fly's visual system.

43 citations

Journal ArticleDOI
TL;DR: In this article, an improved wavelet-based technique for corner detection in 2D planar curves is presented, which is simple to implement and computationally efficient and exploits wavelet transform modulus maxima to detect corners.
Abstract: An improved, wavelet-based technique for corner detection in 2D planar curves is presented. This boundary based technique is simple to implement and computationally efficient and exploits the wavelet transform modulus maxima to detect corners The proposed algorithm is robust with respect to object geometry. Results for noisy conditions are also reported.

43 citations

Proceedings ArticleDOI
10 Apr 1997
TL;DR: In this article, the authors presented the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems, including the calculations of Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian systems and for parametrization of Arnold-Weinstein curves in Floer variational approach.
Abstract: In this paper we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In the general case we have the solution as a multiresolution expansion in the base of compactly supported wavelet basis. The solution is parametrized by the solutions of two reduced algebraical problems, one is nonlinear and the second is some linear problem, which is obtained from one of the next wavelet constructions: Fast Wavelet Transform, Stationary Subdivision Schemes, the method of Connection Coefficients. According to the orbit method and by using construction from the geometric quantization theory we construct the symplectic and Poisson structures associated with generalized wavelets by using metaplectic structure. We consider wavelet approach to the calculations of Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian systems and for parametrization of Arnold-Weinstein curves in Floer variational approach.

43 citations

Proceedings Article
01 Sep 1998
TL;DR: Nonlinear local transform domain filtering is reviewed, and its relation with wavelet denoising is discussed, and a postprocessing stage is applied to a number of transform domain denoised signals to obtain a better estimate of the original signal.
Abstract: In this work, nonlinear local transform domain filtering is reviewed, and its relation with wavelet denoising is discussed. A postprocessing stage is applied to a number of transform domain denoised signals to obtain a better estimate of the original signal. Simulations are made over different Gaussian noise corrupted one-dimensional signals and images, in DCT and wavelet transform domains. Their performances with respect to threshold, transform basis and window size are compared.

43 citations

Proceedings ArticleDOI
03 Apr 1990
TL;DR: The discretization is developed, leading to a form which can run with any FFT (fast Fourier transform) routine and the advantage of the technique is illustrated by computing broadband radar ambiguity functions and affine time-frequency representations.
Abstract: Theoretical wideband studies generally provide expressions involving stretched forms of the signal. This feature complicates implementation of the results and suggests the use of a Mellin transform to process dilations efficiently. A tool for the practical development of this idea is given. The definition, properties, and time-frequency interpretation of the relevant Mellin transform are given. The discretization is developed, leading to a form which can run with any FFT (fast Fourier transform) routine. The advantage of the technique is illustrated by computing broadband radar ambiguity functions and affine time-frequency representations. >

43 citations


Network Information
Related Topics (5)
Image processing
229.9K papers, 3.5M citations
82% related
Feature extraction
111.8K papers, 2.1M citations
82% related
Image segmentation
79.6K papers, 1.8M citations
81% related
Support vector machine
73.6K papers, 1.7M citations
80% related
Feature (computer vision)
128.2K papers, 1.7M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202323
202274
20213
20207
20196
201831