Faster and better sparse blind source separation through mini-batch optimization - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Faster and better sparse blind source separation through mini-batch optimization

C Kervazo
T Liaudat
  • Fonction : Auteur
Jerome Bobin
  • Fonction : Auteur
  • PersonId : 858908

Résumé

Sparse Blind Source Separation (sBSS) plays a key role in scientific domains as different as biomedical imaging, remote sensing or astrophysics, which require the development of increasingly faster and scalable BSS methods without sacrificing the separation performances. To that end, a new distributed sparse BSS algorithm is introduced based on a mini-batch extension of the Generalized Morphological Component Analysis algorithm (GMCA). Precisely, it combines a robust projected alternate least-squares method with mini-batches optimization. The originality further lies in the use of a manifold-based aggregation of asynchronously estimated mixing matrices. Numerical experiments are carried out on realistic spectroscopic spectra , and highlight the ability of the proposed distributed GMCA (dGMCA) to provide very good separation results even when very small mini-batches are used. Quite unexpectedly, it can further outperform the (non-distributed) state-of-the-art methods for highly sparse sources.
Fichier principal
Vignette du fichier
distributed_GMCA.pdf (1.71 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02426991 , version 1 (03-01-2020)

Identifiants

  • HAL Id : hal-02426991 , version 1

Citer

C Kervazo, T Liaudat, Jerome Bobin. Faster and better sparse blind source separation through mini-batch optimization. 2020. ⟨hal-02426991⟩
215 Consultations
162 Téléchargements

Partager

Gmail Facebook X LinkedIn More