Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
NOVELTY - The watermark is made imperceptible, e.g. invisible or inaudible, by inserting it into selected parts of the data that are neither significant nor insignificant perceptually. Examples for the domain of embedding are complex Fourier coefficients a ...
Off-axis holograms recorded with a CCD camera are numerically reconstructed with a calculation of scalar diffraction in the Fresnel approximation. We show that the zero order of diffraction and the twin image can be digitally eliminated by means of filteri ...
Many applications of fast Fourier transforms (FFTs), such as computer tomography, geophysical signal processing, high-resolution imaging radars, and prediction filters, require high-precision output. An error analysis reveals that the usual method of fixed ...
Holographic correlators can implement many correlations in parallel. For most systems shift invariance limits the number of correlation templates that can be stored in one correlator. This is because the output plane must be divided among the individual te ...
We present an exact expression for the L2 error that occurs when one approximates a periodic signal in a basis of shifted and scaled versions of a generating function. This formulation is applicable to a wide variety of linear approximation schem ...
It has been previously shown that a radially periodic image having a symmetric radial period can be decomposed into a circular Fourier series of circular cosine functions with radial frequencies of f=1/T, 2/T, ..., and that its Fourier spectrum consists of ...
We analyze the representation of periodic signals in a scaling function basis. This representation is sufficiently general to include the widely used approximation schemes like wavelets, splines and Fourier series representation. We derive a closed form ex ...
We present a general Fourier-based method that provides an accurate prediction of the approximation error as a function of the sampling step T. Our formalism applies to an extended class of convolution-based signal approximation techniques, which includes ...
In this paper, we introduce a novel algorithm to perform multi-scale Fourier transform analysis of piecewise stationary signals with application to automatic speech recognition. Such signals are composed of quasi-stationary segments of variable lengths. Th ...
This paper deals with multiwavelets and the different properties of approximation and smoothness that are associated with them. In particular, we focus on the important issue of the preservation of discrete time polynomial signals by multiwavelet based fil ...
