K-hyperline clustering learning for sparse component analysis

DOI10.1016/J.SIGPRO.2008.12.005MaRDI QIDQ1016854zbMATH OpenOpenAlexWikidataFDO

Authors Zhaoshui He, Andrzej Cichocki, Yuanqing Li, Saeid Sanei, Shengli 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

\(k\)-means clusteringblind source separationdisjoint orthogonality conditionK-SVDsparse component analysis (SCA)sparse representation

Mathematics Subject Classification ID

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

Recommendations

• Robust sparse component analysis based on a generalized Hough transform
• Independent Component Analysis and Blind Signal Separation
• A bilinear algorithm for sparse representations
• Optimization algorithms for sparse representations and applications
• Estimating the mixing matrices based on a similarity function in sparse component analysis

Cites work

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

Cited in

(7)

• Underdetermined mixing matrix estimation algorithm based on single source points
• 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 blind separation of non-disjoint signals in time-frequency domain based on matrix diagonalization
• Blind source separation based on mixed integer programming
• Independent Component Analysis and Blind Signal Separation
• Overcomplete blind source separation based on generalized Gaussian function and SL0 norm

Describes a project that uses

Uses Software

• PDCO
• Soft-LOST
• ICALAB
• AS 136

This page was built for publication: K-hyperline clustering learning for sparse component analysis

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