On Sampling Lattices with Similarity Scaling Relationships
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.
We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts ...
We present a novel, accurate and fast algorithm to obtain Fourier series coecients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using o-the-shelf hardware components. Based on properties of Fourier ...
We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density operator, which gen ...
Sinusoidal transforms such as the DCT are known to be optimal-that is, asymptotically equivalent to the Karhunen-Loeve transform (KLT)-for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains a ...
Sinusoidal transforms such as the DCT are known to be optimal—that is, asymptotically equivalent to the Karhunen-Loève transform (KLT)—for the representation of Gaussian stationary processes, including the classical AR(1) processes. While the KLT remains ...
A method and device for reducing the computational complexity of a processing algorithm, of a discrete signal, in particular of the spectral estimation and analysis of bio-signals, with minimum or no quality loss, which comprises steps of (a) choosing a do ...
This work is about time series of functional data (functional time series), and consists of three main parts. In the first part (Chapter 2), we develop a doubly spectral decomposition for functional time series that generalizes the Karhunen–Loève expansion ...
In Part I we introduced the generalized Wiener rational basis functions, and here in Part II we continue our investigation with numerical experiments. Wiener's generalized basis can utilize the fast Fourier transform for integer values of the decay paramet ...
We introduce a complete parameterization of the family of two-dimensional steerable wavelets that are polar-separable in the Fourier domain under the constraint of self-reversibility. These wavelets are constructed by multiorder generalized Riesz transform ...
In this correspondence, we introduce a dual-tree rational-dilation complex wavelet transform for oscillatory signal processing. Like the short-time Fourier transform and the dyadic dual-tree complex wavelet transform, the introduced transform employs quadr ...
