Publication

Stochastic Models and Techniques for Sparse Signals

Publications associées (39)

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

Monte-Carlo SURE: A Black-Box Optimization of Regularization Parameters for General Denoising Algorithms

Michaël Unser, Thierry Blu, Sathish Ramani

We consider the problem of optimizing the parameters of a given denoising algorithm for restoration of a signal corrupted by white Gaussian noise. To achieve this, we propose to minimize Stein's unbiased risk estimate (SURE) which provides a means of asses ...

IEEE2008

Exploiting the anisotropy of anomalous scattering boosts the phasing power of SAD and MAD experiments

The X-ray polarization anisotropy of anomalous scattering in crystals of brominated nucleic acids and selenated proteins is shown to have signiﬁcant effects on the diffraction data collected at an absorption edge. For conventionally collected single- or mu ...

2008

Normalisation of Histogrammed List Mode Data

Many PET scanners nowadays have the possibility to record event-by-event information, known as list mode data. This has the advantage of keeping the data in the highest possible resolution (both temporal and spatial). In most cases, list mode data are then ...

2008

The Snakuscule

Michaël Unser, Philippe Thévenaz

Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the data (typically on the integral of its gradient under the curve, or on its inte ...

IEEE2006

Browsing Recorded Meetings with Ferret

Browsing for elements of interest within a recorded meeting is time-consuming. We describe work in progress on a meeting browser, which aims to support this process by displaying many types of data. These include media, transcripts and processing results, ...

IDIAP2004

Embedding Motion in Model-Based Stochastic Tracking

Daniel Gatica-Perez, Jean-Marc Odobez, Silèye Oumar Ba

Particle filtering is now established as one of the most popular method for visual tracking. Within this framework, two assumptions are generally made. The first is that the data are temporally independent given the sequence of object states. In this paper ...

IDIAP2003

Robust Features for Frontal Face Authentication in Difficult Image Conditions

Samy Bengio

In this report we extend the recently proposed {DCT}-mod2 feature extraction technique (which utilizes polynomial coefficients derived from {2D} {DCT} coefficients obtained from horizontally & vertically neighbouring blocks) via the use of various windows ...

IDIAP2003

Concurrency Control for Transactional Drago

Jörg Kienzle

The granularity of concurrency control has a big impact on the performance of transactional systems. Concurrency control granu- larity and data granularity (data size) are usually the same. The e ect of this coupling is that if a coarse granularity is used ...

Springer Verlag2002

Structure of nanoscale silicon clusters

Wanda Andreoni, Michele Parrinello

Using the Car-Parrinello method, the authors have obtained unforeseen structures for the low-lying isomers of Si45 and other midsized Si clusters. They are formed by two shells of atoms, the outer one (cage) being fullerenelike and the inner one (core) con ...

1994