HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Optimization of a Geman-McClure like criterion for sparse signal deconvolution

Abstract : This paper deals with the problem of recovering a sparse unknown signal from a set of observations. The latter are obtained by convolution of the original signal and corruption with additive noise. We tackle the problem by minimizing a least-squares fit criterion penalized by a Geman-McClure like potential. The resulting criterion is a rational function, which makes it possible to formulate its minimization as a generalized problem of moments for which a hierarchy of semidefinite programming relaxations can be proposed. These convex relaxations yield a monotone sequence of values which converges to the global optimum. To overcome the computational limitations due to the large number of involved variables, a stochastic block-coordinate descent method is proposed. The algorithm has been implemented and shows promising results
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School Connect in order to contact the contributor
Submitted on : Monday, February 15, 2016 - 5:28:38 PM
Last modification on : Saturday, January 15, 2022 - 3:57:43 AM
Long-term archiving on: : Saturday, November 12, 2016 - 9:30:17 PM


Files produced by the author(s)



Marc Castella, Jean-Christophe Pesquet. Optimization of a Geman-McClure like criterion for sparse signal deconvolution. CAMSAP 2015 : 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, Dec 2015, Cancun, Mexico. pp.317-320, ⟨10.1109/CAMSAP.2015.7383798⟩. ⟨hal-01263352v2⟩



Record views


Files downloads