K-hyperline clustering learning for sparse component analysis

DOI10.1016/j.sigpro.2008.12.005zbMath1161.94333OpenAlexW1976917750WikidataQ60486770 ScholiaQ60486770MaRDI QIDQ1016854

Yuanqing Li, Zhaoshui He, Saeid Sanei, Andrzej Cichocki, Sheng-Li Xie

Publication date: 14 May 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: http://epubs.surrey.ac.uk/742963/1/K-hyperline%20clustering%20learning%20for%20sparse%20component%20analysis.pdf

zbMATH Keywords

blind source separationsparse representation\(k\)-means clusteringK-SVDdisjoint orthogonality conditionsparse component analysis (SCA)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Detection theory in information and communication theory (94A13) Application of orthogonal and other special functions (94A11)

Related Items

Split Bregman algorithms for sparse group lasso with application to MRI reconstruction ⋮ Optimization Problems Associated with Manifold-Valued Curves with Applications in Computer Vision ⋮ Underdetermined mixing matrix estimation algorithm based on single source points ⋮ Blind Source Separation Based on Mixed Integer Programming ⋮ Underdetermined blind separation of non-disjoint signals in time-frequency domain based on matrix diagonalization ⋮ Overcomplete blind source separation based on generalized Gaussian function and SL0 norm

Uses Software

• PDCO
• AS 136
• Soft-LOST
• ICALAB

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• A time-frequency blind signal separation method applicable to underdetermined mixtures of dependent sources
• Blind Source Separation by Sparse Decomposition in a Signal Dictionary
• A Variational Method for Learning Sparse and Overcomplete Representations
• Greed is Good: Algorithmic Results for Sparse Approximation
• Atomic Decomposition by Basis Pursuit
• Dictionary Learning Algorithms for Sparse Representation
• Linear Geometric ICA: Fundamentals and Algorithms
• Underdetermined blind source separation based on sparse representation
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• Analysis of Sparse Representation and Blind Source Separation
• Performance Analysis of Minimum<tex>$ell_1$</tex>-Norm Solutions for Underdetermined Source Separation
• Blind Separation of Speech Mixtures via Time-Frequency Masking
• Sparse solutions to linear inverse problems with multiple measurement vectors
• A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Independent Component Analysis and Blind Signal Separation
• Underdetermined blind source separation using sparse representations