A Novel Subspace Clustering Method for Dictionary Design

DOI10.1007/978-3-642-00599-2_5MaRDI QIDQ3614929zbMATH OpenOpenAlexFDO

Authors B. Vikrham Gowreesunker, Ahmed H. Tewfik

Publication date 17 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-642-00599-2_5

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Identifiability Conditions and Subspace Clustering in Sparse BSS
• Blind source separation by sparse decomposition in a signal dictionary
• Independent Component Analysis and Blind Signal Separation
• Local subspace clustering
• Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity

Cites work

• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• scientific article; zbMATH DE number 1465030 (Why is no real title available?)
• Two Improved Sparse Decomposition Methods for Blind Source Separation

This page was built for publication: A Novel Subspace Clustering Method for Dictionary Design

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