Charles Deledalle picture
[english] [français]

Charles Deledalle


J'ai obtenu le diplome d'Ingénieur de l'EPITA et le diplome du master Sciences et Technologies de l'Univ. Paris VI, tous deux en France, en 2008. En 2011, j'ai soutenu ma thèse du LTCI, Telecom ParisTech, France, en traitement du signal et de l'image et supervisée par Florence Tupin et Loïc Denis. J'ai fait un post-doctorat en mathématiques appliquées au CEREMADE, Univ. Paris IX, France, en 2011-2012, sous la supervision de Gabriel Peyré et Jalal Fadili. Je suis actuellement chercheur CNRS à l'IMB, Univ. Bordeaux, France. Mes recherches incluent la restauration d'images et les problèmes inverses et en particuliers l'estimation de paramètres. J'ai reçu le prix du meilleur papier étudiant IEEE ICIP en 2010, le prix de thèse ISIS/EEA/GRETSI en 2012, le prix du journal IEEE TGRS en 2016, et le prix du meilleur enseignant du département ECE d'UCSD.

  [Voir mon curriculum vitae]

Nouveautés et calendrier


Publications récentes

Some of the publications below have appeared in an IEEE journal, Springer journal, Elsevier journal or conference record. By allowing you to download them, I am required to post the following copyright reminder: "This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."

Accelerating GMM-based patch priors for image restoration: Three ingredients for a 100x speed-up,
Shibin Parameswaran, Charles-Alban Deledalle, Loïc Denis, Truong Q. Nguyen
IEEE Transactions on Image Processing, vol. 28, no. 2, pp. 687-698, 2019 (IEEE Xplore, recommended pdf, HAL, ArXiv)
Presented at 5G and Beyond forum, May 2018, La Jolla, CA, USA (poster)
Image restoration methods aim to recover the underlying clean image from corrupted observations. The Expected Patch Log-likelihood (EPLL) algorithm is a powerful image restoration method that uses a Gaussian mixture model (GMM) prior on the patches of natural images. Although it is very effective for restoring images, its high runtime complexity makes EPLL ill-suited for most practical applications. In this paper, we propose three approximations to the original EPLL algorithm. The resulting algorithm, which we call the fast-EPLL (FEPLL), attains a dramatic speed-up of two orders of magnitude over EPLL while incurring a negligible drop in the restored image quality (less than 0.5 dB). We demonstrate the efficacy and versatility of our algorithm on a number of inverse problems such as denoising, deblurring, super-resolution, inpainting and devignetting. To the best of our knowledge, FEPLL is the first algorithm that can competitively restore a 512x512 pixel image in under 0.5s for all the degradations mentioned above without specialized code optimizations such as CPU parallelization or GPU implementation.
Image denoising with generalized Gaussian mixture model patch priors,
Charles-Alban Deledalle, Shibin Parameswaran, Truong Q. Nguyen
SIAM Journal on Imaging Sciences, vol. 11, no. 4, pp. 2568-2609, 2018 (epubs SIAM, HAL, ArXiv)
Presented at LIRMM Seminar, Jan 2019, Montpellier, France (slides)
Patch priors have become an important component of image restoration. A powerful approach in this category of restoration algorithms is the popular Expected Patch Log-likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture model (GMM) prior learned on clean image patches as a way to regularize degraded patches. In this paper, we show that a generalized Gaussian mixture model (GGMM) captures the underlying distribution of patches better than a GMM. Even though GGMM is a powerful prior to combine with EPLL, the non-Gaussianity of its components presents major challenges to be applied to a computationally intensive process of image restoration. Specifically, each patch has to undergo a patch classification step and a shrinkage step. These two steps can be efficiently solved with a GMM prior but are computationally impractical when using a GGMM prior. In this paper, we provide approximations and computational recipes for fast evaluation of these two steps, so that EPLL can embed a GGMM prior on an image with more than tens of thousands of patches. Our main contribution is to analyze the accuracy of our approximations based on thorough theoretical analysis. Our evaluations indicate that the GGMM prior is consistently a better fit for modeling image patch distribution and performs better on average in image denoising task.
24. Generalized SURE for optimal shrinkage of singular values in low-rank matrix denoising,
Jérémie Bigot, Charles Deledalle, Delphine Féral
Journal of Machine Learning Research, vol. 18, no. 137, pp. 1-50, 2017 (JMLR, ArXiv)
Presented at ISNPS'2018, June, Salerno, Italy (slides)
We consider the problem of estimating a low-rank signal matrix from noisy measurements under the assumption that the distribution of the data matrix belongs to an exponential family. In this setting, we derive generalized Stein's unbiased risk estimation (SURE) formulas that hold for any spectral estimators which shrink or threshold the singular values of the data matrix. This leads to new data-driven shrinkage rules, whose optimality is discussed using tools from random matrix theory and through numerical experiments. Our approach is compared to recent results on asymptotically optimal shrinking rules for Gaussian noise. It also leads to new procedures for singular values shrinkage in matrix denoising for Poisson-distributed or Gamma-distributed measurements.

[Toutes]  [Scholar Google]

Last modified: Fri Nov 15 00:47:31 Europe/Berlin 2019
Ce site utilise Google Analytics [en savoir plus]