Publication

Image Interpolation and Resampling

Publications associées (115)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The double description method for the approximation of explicit MPC control laws

Colin Neil Jones

A standard model predictive controller (MPC) can be written as a parametric optimization problem whose solution is a piecewise affine (PWA) map from the measured state to the optimal control input. The primary limitation of this optimal `explicit solutionÂ ...

IEEE2008

Modeling two-phase flows on moving domains

Matthias Preisig

Mudflows are catastrophic events that cause immense damage to infrastructure and life every year. Local authorities have been trying to mitigate the risk by zoning regulations as well as by building protection structures for many years. These measures have ...

EPFL2008

Consistent And Regularized Magnification Of Images

Michaël Unser, Philippe Thévenaz, Aurélien Bourquard, Katarina Balac

Because more output data must be created than is available from the input, magnification is an III-posed problem. Traditional magnification relies on resampling an interpolation model at the appropriate rate; unfortunately, this simple solution is blind to ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Regularized interpolation for noisy data

Michaël Unser, Philippe Thévenaz, Sathish Ramani

Interpolation is a vital tool in biomedical signal processing. Although there exists a substantial literature dedicated to noise-free conditions, much less is known in the presence of noise. Here, we document the breakdown of standard interpolation for noi ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Regularized Interpolation for Noisy Data

Michaël Unser, Philippe Thévenaz, Sathish Ramani

IEEE2007

On Interpolation and Resampling of Discrete Data

Pouya Dehghani Tafti

This letter introduces a new representation of discrete signals based on the mathematical notions of functionals and continuous dual spaces. A new and more general sampling theorem is also suggested. Next, the problems of interpolating and resampling discr ...

IEEE2006

A Light Formulation of the E* Interpolated Path Replanner

Roland Philippsen

The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...

2006

FST-based Reconstruction of 3D-models from Non-Uniformly Sampled Datasets on the Sphere

Pascal Frossard, Ivana Tosic

This paper proposes a new method for reconstruction of star-shaped 3D surfaces from scattered datasets, where such surfaces are considered as signals living in the space of square integrable functions on the unit sphere. We first propose a generalization o ...

2006

A Frequency Domain Approach to Registration of Aliased Images with Application to Super-Resolution

Martin Vetterli, Sabine Süsstrunk, Patrick Vandewalle

Super-resolution algorithms reconstruct a high resolution image from a set of low resolution images of a scene. Precise alignment of the input images is an essential part of such algorithms. If the low resolution images are undersampled and have aliasing a ...

2006

An Interpolated Dynamic Navigation Function

Roland Siegwart, Roland Philippsen

The E-star algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion ...

2005