Identifiability Conditions and Subspace Clustering in Sparse BSS

DOI10.1007/978-3-540-74494-8_45MaRDI QIDQ3608571zbMATH OpenOpenAlexFDO

Authors Pando G. Georgiev, Fabian J. Theis, Anca Ralescu

Publication date 5 March 2009

Published in Independent Component Analysis and Signal Separation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74494-8_45

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Subspace clustering by \((k,k)\)-sparse matrix factorization
• Building Invariances Into Sparse Subspace Clustering
• Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates
• A subspace clustering algorithm based on simultaneously sparse and low-rank representation
• Subspace clustering through sub-clusters
• Provable Subspace Clustering: When LRR Meets SSC
• A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data

Cites work

• Blind source separation by sparse decomposition in a signal dictionary
• Independent component analysis, a new concept?
• Minimization of the sum of minima of convex functions and its application to clustering
• \(k\)-plane clustering

Cited in

(6)

• A Novel Subspace Clustering Method for Dictionary Design
• The LOST algorithm: Finding lines and separating speech mixtures
• A bilinear algorithm for sparse representations
• Optimization algorithms for sparse representations and applications
• Underdetermined sparse blind source separation of nonnegative and partially overlapped data
• Blind signal separation of underdetermined mixtures based on clustering algorithms on planes

This page was built for publication: Identifiability Conditions and Subspace Clustering in Sparse BSS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608571)