paper-with-me

Papers

LSALSA: Accelerated Source Separation via Learned Sparse Coding

2018-02-13 · Benjamin Cowen, Apoorva Nandini Saridena, Anna Choromanska

We propose an efficient algorithm for the generalized sparse coding (SC) inference problem. The proposed framework applies to both the single dictionary setting, where each data point is represented as a sparse combination of the columns of one dictionary matrix, as well as the multiple dictionary setting as given in morphological component analysis (MCA), where the goal is to separate a signal into additive parts such that each part has distinct sparse representation within a corresponding dictionary. Both the SC task and its generalization via MCA have been cast as $\ell_1$-regularized least-squares optimization problems. To accelerate traditional acquisition of sparse codes, we propose a deep learning architecture that constitutes a trainable time-unfolded version of the Split Augmented Lagrangian Shrinkage Algorithm (SALSA), a special case of the Alternating Direction Method of Multipliers (ADMM). We empirically validate both variants of the algorithm, that we refer to as LSALSA (learned-SALSA), on image vision tasks and demonstrate that at inference our networks achieve vast improvements in terms of the running time, the quality of estimated sparse codes, and visual clarity on both classic SC and MCA problems. Finally, we present a theoretical framework for analyzing LSALSA network: we show that the proposed approach exactly implements a truncated ADMM applied to a new, learned cost function with curvature modified by one of the learned parameterized matrices. We extend a very recent Stochastic Alternating Optimization analysis framework to show that a gradient descent step along this learned loss landscape is equivalent to a modified gradient descent step along the original loss landscape. In this framework, the acceleration achieved by LSALSA could potentially be explained by the network's ability to learn a correction to the gradient direction of steeper descent.

📄 PDF Abstract BibTeX arXiv:1802.06875

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

ADMM The alternating direction method of multipliers (ADMM) is an algorithm that solves convex optimization problems by breaking them into smaller pieces, each of which are…

Similar Papers 제목 키워드 기반

Supervised Speech Separation Based on Deep Learning: An Overview

2017-08-24 · DeLiang Wang, Jitong Chen

Speech separation is the task of separating target speech from background interference. Traditionally, speech separation is studied as a signal processing problem. A more recent approach formulates speech separation as a…

Deep LearningSpeaker SeparationSpeech DereverberationSpeech Enhancement+1

Unrolling PALM for sparse semi-blind source separation

2021-12-10 · ICLR 2022 4 · Mohammad Fahes, Christophe Kervazo, Jérôme Bobin, Florence Tupin

Sparse Blind Source Separation (BSS) has become a well established tool for a wide range of applications - for instance, in astrophysics and remote sensing. Classical sparse BSS methods, such as the Proximal Alternating …

blind source separation

Semi-blind Source Separation via Sparse Representations and Online Dictionary Learning

2012-12-03 · Sirisha Rambhatla, Jarvis D. Haupt

This work examines a semi-blind single-channel source separation problem. Our specific aim is to separate one source whose local structure is approximately known, from another a priori unspecified background source, give…

Audio Source Separationblind source separationDictionary Learning

Directional Sparse Filtering using Weighted Lehmer Mean for Blind Separation of Unbalanced Speech Mixtures

2021-01-30 · Karn Watcharasupat, Anh H. T. Nguyen, Ching-Hui Ooi, Andy W. H. Khong

In blind source separation of speech signals, the inherent imbalance in the source spectrum poses a challenge for methods that rely on single-source dominance for the estimation of the mixing matrix. We propose an algori…

Audio Source Separationblind source separationMulti-Speaker Source SeparationSpeech Separation

Heuristics for Efficient Sparse Blind Source Separation

2018-12-17 · Christophe Kervazo, Jerome Bobin, Cecile Chenot

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 …

blind source separation