Results 1  10
of
2,488
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing
On the Use of Windows for Harmonic Analysis With the Discrete Fourier Transform
 Proc. IEEE
, 1978
"... AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we subject ..."
Abstract

Cited by 668 (0 self)
 Add to MetaCart
AhmwThis Pw!r mak = available a concise review of data win compromise consists of applying windows to the sampled daws pad the ^ affect On the Of in the data set, or equivalently, smoothing the spectral samples. '7 of aoise9 m the ptesence of sdroag bar The two operations to which we subject the data are momc mterference. We dm call attention to a number of common = in be rp~crh of windows den used with the fd F ~ sampling and windowing. These operations can be performed transform. This paper includes a comprehensive catdog of data win in either order. Sampling is well understood, windowing is less related to sampled windows for DFT's. HERE IS MUCH signal processing devoted to detection and estimation. Detection is the task of determiningif a specific signal set is present in an observation, while estimation is the task of obtaining the values of the parameters
The Contourlet Transform: An Efficient Directional Multiresolution Image Representation
 IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of onedimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” twodimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract

Cited by 513 (20 self)
 Add to MetaCart
The limitations of commonly used separable extensions of onedimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” twodimensional transform that can capture the intrinsic geometrical structure
The FourierSeries Method For Inverting Transforms Of Probability Distributions
, 1991
"... This paper reviews the Fourierseries method for calculating cumulative distribution functions (cdf's) and probability mass functions (pmf's) by numerically inverting characteristic functions, Laplace transforms and generating functions. Some variants of the Fourierseries method are remar ..."
Abstract

Cited by 211 (52 self)
 Add to MetaCart
by aliasing; this explains the name of the method. This Fourier analysis applies to the inversion problem because the Fourier coefficients are just values of the transform. The mathematical centerpiece of the Fourierseries method is the Poisson summation formula, which identifies the discretization error
On group Fourier analysis and symmetry preserving discretizations of PDEs
 Proc. IEEE Conf. on Decision and Control
, 2010
"... In this paper we review some group theoretic techniques applied to discretizations of PDEs. Inspired by the recent years active research in Lie group and exponential time integrators for differential equations, we will in the first part of the article present algorithms for computing matrix exponen ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
exponentials based on Fourier transforms on finite groups. As an example, we consider spherically symmetric PDEs, where the discretization preserves the 120 symmetries of the icosahedral group. This motivates the study of spectral element discretizations based on triangular subdivisions. In the second part
Mellin Transforms And Asymptotics: Harmonic Sums
 THEORETICAL COMPUTER SCIENCE
, 1995
"... This survey presents a unified and essentially selfcontained approach to the asymptotic analysis of a large class of sums that arise in combinatorial mathematics, discrete probabilistic models, and the averagecase analysis of algorithms. It relies on the Mellin transform, a close relative of the i ..."
Abstract

Cited by 202 (12 self)
 Add to MetaCart
This survey presents a unified and essentially selfcontained approach to the asymptotic analysis of a large class of sums that arise in combinatorial mathematics, discrete probabilistic models, and the averagecase analysis of algorithms. It relies on the Mellin transform, a close relative
Local Fourier Analysis
"... Classic convergence analysis for geometric multigrid The constant coefficient case The classic convergence analysis for multigrid methods assumes: • ddimensional PDE with constant coefficients (−1)q d∑ i=1 d 2q dx2qi u(x) = g(x), x ∈ Ω = (0, 1)d, q ≥ 1. • Periodic boundary conditions on ∂Ω or an i ..."
Abstract
 Add to MetaCart
Classic convergence analysis for geometric multigrid The constant coefficient case The classic convergence analysis for multigrid methods assumes: • ddimensional PDE with constant coefficients (−1)q d∑ i=1 d 2q dx2qi u(x) = g(x), x ∈ Ω = (0, 1)d, q ≥ 1. • Periodic boundary conditions on ∂Ω
An Efficient Hamiltonian for Discrete Fractional Fourier Transform
"... Abstract—Fractional Fourier Transform, which is a generalization of the classical Fourier Transform, is a powerful tool for the analysis of transient signals. The discrete Fractional Fourier Transform Hamiltonians have been proposed in the past with varying degrees of correlation between their eigen ..."
Abstract
 Add to MetaCart
Abstract—Fractional Fourier Transform, which is a generalization of the classical Fourier Transform, is a powerful tool for the analysis of transient signals. The discrete Fractional Fourier Transform Hamiltonians have been proposed in the past with varying degrees of correlation between
Fast Discrete Fourier Spectra Attacks on Stream Ciphers
"... Abstract. In this paper, we present some new results on the selective discrete Fourier spectra attack, introduced first as the recent RønjomHelleseth attack and the modifications due to Gong et al. The focal point of this paper is to fill some gaps in the theory of analysis in terms of discrete Fou ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
Abstract. In this paper, we present some new results on the selective discrete Fourier spectra attack, introduced first as the recent RønjomHelleseth attack and the modifications due to Gong et al. The focal point of this paper is to fill some gaps in the theory of analysis in terms of discrete
Eigenvectors and functions of the discrete Fourier transform
 IEEE Trans. Acoust., Speech, Signal Processing
, 1982
"... AbstractA method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can be effi ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
AbstractA method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can
Results 1  10
of
2,488