Robust reconstruction with nonconvex subset constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Robust reconstruction with nonconvex subset constraints

Résumé

In this paper, we are interested in the recovery of an unknown signal corrupted by a linear operator, a nonlinear function, and an additive Gaussian noise. In addition, some of the observations contain outliers. Many robust data fit functions which alleviate sensitivity to outliers can be expressed as piecewise rational functions. Based on this fact, we reformulate the robust inverse problem as a rational optimization problem. The considered framework allows us to incorporate nonconvex constraints such as unions of subsets. The rational problem is then solved using recent optimization techniques which offer guarantees for global optimality. Finally, experimental results illustrate the validity of the recovered global solutions and the good quality of the reconstructed signals despite the presence of outliers.
Fichier principal
Vignette du fichier
mlsp2020_pdfexpress-checked.pdf (270.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02977062 , version 1 (23-10-2020)

Identifiants

Citer

Arthur Marmin, Marc Castella, Jean-Christophe Pesquet. Robust reconstruction with nonconvex subset constraints: a polynomial optimization approach. MLSP 2020 - IEEE 30th international workshop on Machine Learning for Signal Processing, Sep 2020, Espoo (online), Finland. pp.1-6, ⟨10.1109/MLSP49062.2020.9231524⟩. ⟨hal-02977062⟩
59 Consultations
102 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More