DMCA
1Convexity in source separation: Models, geometry, and algorithms
| Citations: | 7 - 6 self |
BibTeX
@MISC{Mccoy_1convexityin,
author = {Michael B. Mccoy and Volkan Cevher and Quoc Tran Dinh and Afsaneh Asaei and Luca Baldassarre},
title = {1Convexity in source separation: Models, geometry, and algorithms},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Source separation or demixing is the process of extracting multiple components entangled within a signal. Contemporary signal processing presents a host of difficult source separation problems, from interference cancellation to background subtraction, blind deconvolution, and even dictionary learning. Despite the recent progress in each of these applications, advances in high-throughput sensor technology place demixing algorithms under pressure to accommodate extremely high-dimensional signals, separate an ever larger number of sources, and cope with more sophisticated signal and mixing models. These difficulties are exacerbated by the need for real-time action in automated decision-making systems. Recent advances in convex optimization provide a simple framework for efficiently solving numerous difficult demixing problems. This article provides an overview of the emerging field, explains the theory that governs the underlying procedures, and surveys algorithms that solve them efficiently. We aim to equip practitioners with a toolkit for constructing their own demixing algorithms that work, as well as concrete intuition for why they work. Fundamentals of demixing The most basic model for mixed signals is a superposition model, where we observe a mixed
Keyphrases
source separation superposition model automated decision-making system contemporary signal processing high-dimensional signal simple framework recent progress sophisticated signal mixing model mixed signal difficult source separation problem interference cancellation dictionary learning basic model high-throughput sensor technology place multiple component concrete intuition demixing algorithm recent advance real-time action underlying procedure convex optimization
