Concept

Rayon de convergence

Publications associées (155)

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

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

Identifying physical properties of deformable objects by using particle filters

Charles Baur, Oussama Khatib

This paper presents a new approach for estimating physical properties of deformable models from experimental measurements. In contrast to most previous work, we introduce a new method based on particle filters which identifies the different stiffness prope ...

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

A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution

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

We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the

\ell ^{ 1 }

-norm of the wavelet coefficients of the solution. Previously available methods have essentially consisted in alte ...

IEEE2008

A fast thresholded landweber algorithm for general wavelet bases: Application to 3D deconvolution microscopy

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

Wavelet-domain l(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 converge ...

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

Hard-x-ray lensless imaging of extended objects

Christian David

We demonstrate a hard-x-ray microscope that does not use a lens and is not limited to a small field of view or an object of finite size. The method does not suffer any of the physical constraints, convergence problems, or defocus ambiguities that often ari ...

2007

A global collisionless PIC code in magnetic coordinates

Olivier Sauter, Laurent Villard, Kurt Appert, Trach-Minh Tran, Alberto Bottino, Sébastien Jolliet, Ben McMillan, Paolo Angelino

A global plasma turbulence simulation code, ORB5, is presented. It solves the gyrokinetic electrostatic equations including zonal flows in axisymmetric magnetic geometry. The present version of the code assumes a Boltzmann electron response on magnetic sur ...

Elsevier2007

Performance of Averaging Algorithms in Time-Varying Networks

Patrick Denantes

We study averaging algorithms in time-varying networks, and means tomeasure their performance. We present sufficient conditions on these algorithms, which ensure they lead to computation at each node, of the global average of measurements provided by each ...

2007

Stability and Convergence of the Level Set Method in Computer Vision

Kunal Narayan Chaudhury

Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability and convergence have always been neglected in most of the level set implemen ...

Elsevier2007

Convergence analysis for sequential Monte Carlo receivers in communications applications

Volkan Cevher

Recently, sequential Monte Carlo methods have been used in the telecommunications field, finding application in receiver design. Several properties of these receivers make their designs very attractive. These receivers do not require channel state informat ...

2006

Time-lag in Derivative Convergence for Fixed Point Iterations

Daniel Kressner

In an earlier study it was proven and experimentally confirmed on a 2D Euler code that fixed point iterations can be differentiated to yield first and second order derivatives of implicit functions that are defined by state equations. It was also asserted ...

2005

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

A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution

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

We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the

\ell ^{ 1 }

-norm of the wavelet coefficients of the solution. Previously available methods have essentially consisted in alte ...

IEEE2008

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