A global optimization approach for rational sparsity promoting criteria

Abstract : We consider the problem of recovering an unknown signal observed through a nonlinear model and corrupted with additive noise. More precisely, the nonlinear degradation consists of a convolution followed by a nonlinear rational transform. As a prior information, the original signal is assumed to be sparse. We tackle the problem by minimizing a least-squares fit criterion penalized by a Geman-McClure like potential. In order to find a globally optimal solution to this rational minimization problem, we transform it in a generalized moment problem, for which a hierarchy of semidefinite programming relaxations can be used. To overcome computational limitations on the number of involved variables, the structure of the problem is carefully addressed, yielding a sparse relaxation able to deal with up to several hundreds of optimized variables. Our experiments show the good performance of the proposed approach
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Monday, December 18, 2017 - 3:00:34 PM
Last modification on : Thursday, February 7, 2019 - 3:09:41 PM


Files produced by the author(s)



Marc Castella, Jean-Christophe Pesquet. A global optimization approach for rational sparsity promoting criteria. EUSIPCO 2017 - 25th European Signal Processing Conference, Aug 2017, Kos Island, Greece. pp.156 - 160, ⟨10.23919/EUSIPCO.2017.8081188⟩. ⟨hal-01666536⟩



Record views


Files downloads