Concept

Combinaison barycentrique

Publications associées (190)

Super-resolution from unregistered aliased images

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

EPFL2006

Polyharmonic Smoothing Splines and the Multidimensional Wiener Filtering of Fractal-Like Signals

Michaël Unser, Dimitri Nestor Alice Van De Ville

Motivated by the fractal-like behavior of natural images, we develop a smoothing technique that uses a regularization functional which is a fractional iterate of the Laplacian. This type of functional was initially introduced by Duchon for the approximatio ...

IEEE2006

Discrete Choice Models for Static Facial Expression Recognition

Michel Bierlaire, Jean-Philippe Thiran, Matteo Sorci, Gianluca Antonini

In this paper we propose the use of Discrete Choice Analysis (DCA) for static facial expression classification. Facial expressions are described with expression descriptive units (EDU), consisting in a set of high level features derived from an active appe ...

Springer-Verlag2006

Deep reactive ion etching and focused ion beam combination for nanotip fabrication

Luis Guillermo Villanueva Torrijo

We have studied the fabrication of high-aspect ratio silicon tips by a combination of deep reactive ion etching and focused ion beam. The reactive ion etching is used to obtain so-called "rocket tips" which can be fabricated with a high aspect ratio. The r ...

2006

Mean-square performance of a convex combination of two adaptive filters

Ali H. Sayed

Combination approaches provide an interesting way to improve adaptive filter performance. In this paper, we study the mean-square performance of a convex combination of two transversal filters. The individual filters are independently adapted using their o ...

Institute of Electrical and Electronics Engineers2006

Kernel Matching Pursuit for Large Datasets

Jean-Philippe Thiran, Vlad Popovici

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

2005

Sparse Approximation Using M-Term Pursuits with Applications to Image and Video Compression

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

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

2005

The M-Term Pursuit for Image Representation and Progressive Compression

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable coding. The MTP algorithm belongs to the framework of the matching pursuit ( ...

EUSIPCO2005

Improving Fusion with Margin-Derived Confidence In Biometric Authentication Tasks

Samy Bengio, Norman Hoon Thian Poh

This study investigates a new confidence criterion to improve fusion via a linear combination of scores of several biometric authentication systems. This confidence is based on the margin of making a decision, which answers the question, ``after observing ...

2005

Développement et validation de méthodes dosimétriques en ligne pour le traitement du cancer de la prostate

Currently, the treatment of prostate cancer under open MRI at the University of Geneva Hospital, applying high dose rate (HDR) brachytherapy, involves three main steps : needle implantation, dosimetric calculations and irradiation. As such, there is no pre ...

EPFL2005

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