Skip to Main content Skip to Navigation
Conference papers

Solving inverse problems with overcomplete transforms and convex optimization techniques

Abstract : Many algorithms have been proposed during the last decade in order to deal with inverse problems. Of particular interest are convex optimization approaches that consist of minimizing a criteria generally composed of two terms: a data fidelity (linked to noise) term and a prior (regularization) term. As image properties are often easier to extract in a transform domain, frame representations may be fruitful. Potential functions are then chosen as priors to fit as well as possible empirical coefficient distributions. As a consequence, the minimization problem can be considered from two viewpoints : a minimization along the coefficients or along the image pixels directly. Some recently proposed iterative optimization algorithms can be easily implemented when the frame representation reduces to an orthonormal basis. Furthermore, it can be noticed that in this particular case, it is equivalent to minimize the criterion in the transform domain or in the image domain. However, much attention should be paid when an overcomplete representation is considered. In that case, there is no longer equivalence between coefficient and image domain minimization. This point will be developed throughout this paper. Moreover, we will discuss how the choice of the transform may influence parameters and operators necessary to implement algorithms.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00826119
Contributor : Nelly Pustelnik <>
Submitted on : Tuesday, May 28, 2013 - 2:53:41 PM
Last modification on : Thursday, March 26, 2020 - 7:53:34 PM
Document(s) archivé(s) le : Tuesday, September 3, 2013 - 9:46:56 AM

File

SPIE09.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00826119, version 1

Citation

Lotfi Chaari, Nelly Pustelnik, Caroline Chaux, Jean-Christophe Pesquet. Solving inverse problems with overcomplete transforms and convex optimization techniques. SPIE, Aug 2009, San Diego, California, United States. ⟨hal-00826119⟩

Share

Metrics

Record views

634

Files downloads

397