Publication

On Sampling Lattices with Similarity Scaling Relationships

Related publications (32)

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.

Public space in Beijing

Béatrice Ferrari

This is a short exploration of public space in Beijing (and elsewhere). But how do we define public space and does it exist as such in Beijing? In this short presentation, instead of simply focusing on physical spaces, I will try to capture some of the ele ...

2010

A Computable Fourier Condition Generating Alias-Free Sampling Lattices

Yue Lu, Minh Do

We propose a Fourier analytical condition linking alias-free sampling with the Fourier transform of the indicator function defined on the given frequency support. Our discussions center around how to develop practical computation algorithms based on the pr ...

Institute of Electrical and Electronics Engineers2009

Algorithms for the Computation of Continuous Transforms of Rectilinear Polygons from IC Layouts

Robin Scheibler

In this work, we present a novel way of computing the continuous Haar, Fourier and cosine series coefficients of rectilinear polygons. We derive algorithms to compute the inner products with the continuous basis functions directly from the vertices of the ...

2009

A Fast Thresholded Landweber Algorithm for General Wavelet Bases: Application to 3D Deconvolution Microscopy

Michaël Unser, Cédric René Jean Vonesch

Wavelet-domain

ℓ _{ 1 }

-regularization is a promising approach to deconvolution. The corresponding variational problem can be solved using a “thresholded Landweber” (TL) algorithm. While this iterative procedure is simple to implement, it is known to ...

IEEE2008

Isotropic Polyharmonic B-Splines: Scaling Functions and Wavelets

Michaël Unser, Dimitri Nestor Alice Van De Ville, Thierry Blu

In this paper, we use polyharmonic B-splines to build multidimensional wavelet bases. These functions are nonseparable, multidimensional basis functions that are localized versions of radial basis functions. We show that Rabut's elementary polyharmonic B-s ...

IEEE2005

Intra-Adaptive Motion-Compensated Lifted Wavelets for Video Coding

Pierre Vandergheynst, Oscar Divorra Escoda

In this work, we study the effect of inserting spatially local temporal adaptivity to motion compensated frame adaptive transforms for video coding. Motion compensation aligns the temporal wavelet decomposition along motion trajectories. However, valid tra ...

2004

Directional multiresolution image representations

Minh Do

Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an ob ...

EPFL2002

Discrete Ridgelet Transforms for Image Representation

Martin Vetterli, Minh Do

The ridgelet transform (Candes and Donoho, 1999) was introduced as a new multiscale representation for functions on continuous spaces that are smooth away from discontinuities along lines. In this paper, we present several discrete versions of the ridgelet ...

2001

High Order Balanced MultiWavelets: Theory, Factorization and Design

Martin Vetterli, Jérôme Lebrun

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 ...

1999

Basefield transforms with the convolution property

Martin Vetterli

We present a general framework for constructing transforms in the field of the input which have a convolution-like property. The construction is carried out over the reals, but is shown to be valid over more general fields. We show that these basefield tra ...

1994

A Fast Thresholded Landweber Algorithm for General Wavelet Bases: Application to 3D Deconvolution Microscopy

Michaël Unser, Cédric René Jean Vonesch

Wavelet-domain

ℓ _{ 1 }

IEEE2008