Results 1  10
of
15
Complete discrete 2D Gabor transforms by neural networks for image analysis and compression
, 1988
"... AbstractA threelayered neural network is described for transforming twodimensional discrete signals into generalized nonorthogonal 2D “Gabor ” representations for image analysis, segmentation, and compression. These transforms are conjoint spatiahpectral representations [lo], [15], which provide ..."
Abstract

Cited by 373 (8 self)
 Add to MetaCart
AbstractA threelayered neural network is described for transforming twodimensional discrete signals into generalized nonorthogonal 2D “Gabor ” representations for image analysis, segmentation, and compression. These transforms are conjoint spatiahpectral representations [lo], [15], which provide a complete image description in terms of locally windowed 2D spectral coordinates embedded within global 2D spatial coordinates. Because intrinsic redundancies within images are extracted, the resulting image codes can be very compact. However, these conjoint transforms are inherently difficult to compute because t e elementary expansion functions are not orthogonal. One orthogonking approach developed for 1D signals by Bastiaans [SI, based on biorthonormal expansions, is restricted by constraints on the conjoint sampling rates and invariance of the windowing function, as well as by the fact that the auxiliary orthogonalizing functions are nonlocal infinite series. In the present “neural network ” approach, based
Multiresolution Support Applied to Image Filtering and Restoration
, 1995
"... The notion of a multiresolution support is introduced. This is a sequence of boolean images, related to significant pixels at each of a number of resolution levels. The multiresolution support is then used for noise suppression, in the context of image filtering, or iterative image restoration. A ..."
Abstract

Cited by 39 (21 self)
 Add to MetaCart
The notion of a multiresolution support is introduced. This is a sequence of boolean images, related to significant pixels at each of a number of resolution levels. The multiresolution support is then used for noise suppression, in the context of image filtering, or iterative image restoration. Algorithmic details, and a range of practical examples, illustrate this approach.
Fast GaborLike Windowed Fourier and Continuous Wavelet Transforms
 IEEE Signal Processing Letters
, 1994
"... Fast algorithms for the evaluation of running windowed Fourier and continuous wavelet transforms are presented. The analysis functions approximate complexmodulated Gaussians as closely as desired and may be optimally localized in time and frequency. The Gabor filtering is performed indirectly by co ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Fast algorithms for the evaluation of running windowed Fourier and continuous wavelet transforms are presented. The analysis functions approximate complexmodulated Gaussians as closely as desired and may be optimally localized in time and frequency. The Gabor filtering is performed indirectly by convulving a premodulated signal with a Gaussianlike window and demodulating the output. The window functions are either Bsplines dilated by an integer factor m or quasi.Gaussians of arbitrary size generated from the ,fold convolution of a symmetrical exponential. Both approaches result in a recursive implementation with a complexity independent of the window size (O(N)).
Overcoming the Curse of Dimensionality in Clustering by means of the Wavelet Transform
 The Computer Journal
, 2000
"... We use a redundant wavelet transform analysis to detect clusters in highdimensional data spaces. We overcome Bellman's \curse of dimensionality" in such problems by (i) using some canonical ordering of observation and variable (document and term) dimensions in our data, (ii) applying a wavelet t ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We use a redundant wavelet transform analysis to detect clusters in highdimensional data spaces. We overcome Bellman's \curse of dimensionality" in such problems by (i) using some canonical ordering of observation and variable (document and term) dimensions in our data, (ii) applying a wavelet transform to such canonically ordered data, (iii) modeling the noise in wavelet space, (iv) dening signicant component parts of the data as opposed to insignicant or noisy component parts, and (v) reading o the resultant clusters. The overall complexity of this innovative approach is linear in the data dimensionality. We describe a number of examples and test cases, including the clustering of highdimensional hypertext data. 1 Introduction Bellman's (1961) [1] \curse of dimensionality" refers to the exponential growth of hypervolume as a function of dimensionality. All problems become tougher as the dimensionality increases. Nowhere is this more evident than in problems related to ...
Pattern Clustering based on Noise Modeling in Wavelet Space
, 1997
"... We describe an effective approach to object or feature detection in point patterns via noise modeling. This is based on use of a redundant or nonpyramidal wavelet transform. Noise modeling is based on a Poisson process. We illustrate this new method with a range of examples. We use the close rel ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We describe an effective approach to object or feature detection in point patterns via noise modeling. This is based on use of a redundant or nonpyramidal wavelet transform. Noise modeling is based on a Poisson process. We illustrate this new method with a range of examples. We use the close relationship between image (pixelated) and point representations to achieve the result of a clustering method with constanttime computational cost. Keywords: Cluster analysis, point pattern, `a trous wavelet transform, noise modeling, Poisson distribution, minefield detection. 1 Introduction Point pattern clustering has constituted one of major strands in cluster analysis. We will briefly describe some of this work, in order to motivate the need for (i) a multiscale approach which 1 is computationally very efficient, and (ii) a direct treatment of noise and clutter which leads to improved cluster detection. In the following the first few categories of work proceed in the direction of a m...
WAVELETBASED IDENTIFICATION OF LINEAR DISCRETETIME SYSTEMS
"... Discretetime linear timevarying systems are modeled by discretetime wavelets. System identification using the output error method is studied. The output of the unknown system is in general corrupted by noise. The minimum mean square error, minimum cumulative mean square error and least squares ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Discretetime linear timevarying systems are modeled by discretetime wavelets. System identification using the output error method is studied. The output of the unknown system is in general corrupted by noise. The minimum mean square error, minimum cumulative mean square error and least squares are considered. The optimal system model parameters are found. Conditions are derived that provide consistency to the optimal parameters obtained by the least squares approach. It is shown that due to the good timefrequency localization of wavelets, parameter estimates are robust to narrowband noise and/or impulse noise.
Fourier series Dilation Translation
, 2004
"... Keywords: Discrete wavelet transform Time–frequency localization Base function ..."
Abstract
 Add to MetaCart
Keywords: Discrete wavelet transform Time–frequency localization Base function
WaveletBased Identification Of Linear DiscreteTime Systems: Robustness Issue
"... Discretetime linear timevarying systems are modeled by discretetime wavelets. The output of the unknown system is corrupted by noise. The system model parameters are estimated by the least squares method applied to the output error. Conditions are derived that provide vanishing influence of the o ..."
Abstract
 Add to MetaCart
Discretetime linear timevarying systems are modeled by discretetime wavelets. The output of the unknown system is corrupted by noise. The system model parameters are estimated by the least squares method applied to the output error. Conditions are derived that provide vanishing influence of the output noise to the parameter estimates. Due to the timefrequency selectivity of wavelets, parameter estimates can be robust to narrowband noise and/or impulse noise. This robustness is confirmed by simulations. Key words: System identification, Linear systems, Discretetime systems, Timevarying systems, Output error identification, Measurement noise, Recursive least squares, Robustness, Consistency, Convergence, Wavelets, Basis functions 1 Introduction This paper deals with the identification of linear discretetime systems by discretetime wavelets in the presence of additive output noise. In (Doroslovacki and Fan, 1 The conference version of the paper was presented at the 11th IFAC Sym...
The Numerical Performance of Wavelets for PDEs: The MultiScale Finite Element
"... The research summarized in this paper is part of a multiyear effort focused on evaluating the viability of wavelet bases for the solution of partial differential equations. The primary objective for this work has been to establish a foundation for hierarchical/wavelet simulation methods based upon ..."
Abstract
 Add to MetaCart
The research summarized in this paper is part of a multiyear effort focused on evaluating the viability of wavelet bases for the solution of partial differential equations. The primary objective for this work has been to establish a foundation for hierarchical/wavelet simulation methods based upon numerical performance, computational efficiency, and the ability to exploit the hierarchical adaptive nature of wavelets. This work has demonstrated that hierarchical bases can be effective for problems with a dominant elliptic character. However, the strict enforcement of orthogonality in the usual L 2 sense is less desirable than orthogonality in the energy norm. This conclusion has led to the development of a multiscale linear finite element based on a hierarchical changeofbasis. This work considers the numerical and computational performance of the hierarchical Schauder basis in a Galerkin context. A unique rowcolumn lumping procedure is developed with multiscale solution strategi...