pith. sign in

arxiv: 1812.06737 · v1 · pith:DBDR77U6new · submitted 2018-12-17 · 💻 cs.LG · astro-ph.IM· eess.SP· stat.ML

Heuristics for Efficient Sparse Blind Source Separation

classification 💻 cs.LG astro-ph.IMeess.SPstat.ML
keywords separationsparseblinddatapalmsourcestrategyalgorithm
0
0 comments X
read the original abstract

Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this context, Proximal Alternating Linearized Minimization (PALM) has become a standard algorithm which, despite its theoretical grounding, generally provides poor practical separation results. In this work, we propose a novel strategy that combines a heuristic approach with PALM. We show its relevance on realistic astrophysical data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.