On compact representations of Voronoi cells of lattices
Related publications (48)
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.
Aliasing in images is often considered as a nuisance. Artificial low frequency patterns and jagged edges appear when an image is sampled at a too low frequency. However, aliasing also conveys useful information about the high frequency content of the image ...
We introduce a 3-D parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We consider a 3-D filament (consisting of a B-spline skeleton and a specified radial profile) and match its projections ...
This paper introduces an algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP), based on the matching pursuit approach (MP). This algorithm decomposes the signal into a linear combination of selected atoms, chosen to ...
The Wold decomposition of discrete-time CS (cyclostationary) processes into regular and predictable component is considered. Using the properties of the zeros of linear periodic systems it is shown that the predictable component consists of a linear combin ...
The Wold decomposition of discrete-time CS (cyclostationary) processes into regular and predictable component is considered. Using the properties of the zeros of linear periodic systems it is shown that the predictable component consists of a linear combin ...
We consider the problem of interpolating a signal using a linear combination of shifted versions of a compactly-supported basis function φ(x). We first give the expression of the φ's that have minimal support for a given accuracy (also known as "approximat ...
The polynomial time algorithm of Lenstra, Lenstra, and Lovász [15] for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the p ...
Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit ...