Concept

Application linéaire par morceaux

Publications associées (63)

Wavelet Footprints: Theory, Algorithms and Applications

In recent years, wavelet-based algorithms have been successful in different signal processing tasks. The wavelet trans- form is a powerful tool because it manages to represent both tran- sient and stationary behaviors of a signal with few transform coeffi- ...

2003

Discretization of the radon transform and of its inverse by spline convolutions

Michaël Unser, Michael Stefan Daniel Liebling, Stefan Horbelt

We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths hi and degrees ni. We apply our results to derive spline-convolution-based algorithms for two closely related prob ...

IEEE2002

Dynamic scheduling of a flexible machine. Restless bandit formulation

Max-Olivier Hongler, Fabrice Dusonchet

We explore the scheduling rules and the hedging levels that can be obtained by using a restless bandit problem formulation of a make-to-stock production. The underlying dynamics are a Markov chain in continuous time and the associated rewards are piecewise ...

Editions Hermes2002

Ordonnancement dynamique d'une machine flexible Formulation en processus de Bandits-manchots

Max-Olivier Hongler, Fabrice Dusonchet

We explore the scheduling rules and the hedging levels that can be obtained by using a Restless Bandit Problem formulation of a make-to-stock production. The underlying dynamics are markov chain in continuous lime and the associate reward are piecewise lin ...

2002

Least-Squares Image Resizing Using Finite Differences

Michaël Unser, Thierry Blu

We present an optimal spline-based algorithm for the enlargement or reduction of digital images with arbitrary (noninteger) scaling factors. This projection-based approach can be realized thanks to a new finite difference method that allows the computation ...

IEEE2001

MOMS: Maximal-Order Interpolation of Minimal Support

Michaël Unser, Philippe Thévenaz, Thierry Blu

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

IEEE2001

A sampling theorem for periodic piecewise polynomial signals

Martin Vetterli, Pina Marziliano, Thierry Blu

We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampli ...

2001

Spline Kernels for Continuous-Space Image Processing

Michaël Unser, Thierry Blu

We present an explicit formula for spline kernels; these are defined as the convolution of several B-splines of variable widths h and degrees n. The spline kernels are useful for continuous signal processing algorithms that involve B-spline inner-products ...

IEEE2000

Function approximation on triangular grids: some numerical results using adaptive techniques

Luca Formaggia

Applications of mesh adaptation techniques could be found in the numerical solution of PDE's or in the optimal triangulation of surfaces for shape representation or graphic display. The scope of this work is to verify through numerical experiments the effe ...

2000

Approximation and Compression of Piecewise Smooth Functions

Martin Vetterli, Paolo Prandoni

Wavelet or sub–band coding has been quite successful in compression applications, and this success can be attributed in part to the good approximation properties of wavelets. In this paper, we revisit rate–distortion (RD) bounds for the wavelet approximati ...

1999

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