K-hyperline clustering learning for sparse component analysis
type: Item
instance of: scholarly article
title: K-hyperline clustering learning for sparse component analysis
zbMATH Open document ID: 1161.94333
author: Zhaoshui He
author: Andrzej Cichocki
author: Yuanqing Li
author: Saeid Sanei
author: Shengli Xie
published in: Signal Processing
publication date: 2009-05-14T00:00:00Z
full work available at URL: K-hyperline clustering learning for sparse component analysis.pdf
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 94A13
Mathematics Subject Classification ID: 94A11
zbMATH DE Number: 5554088
zbMATH Keywords: sparse component analysis (SCA)
zbMATH Keywords: disjoint orthogonality condition
zbMATH Keywords: \(k\)-means clustering
zbMATH Keywords: blind source separation
zbMATH Keywords: sparse representation
zbMATH Keywords: K-SVD
describes a project that uses: PDCO
describes a project that uses: Soft-LOST
describes a project that uses: ICALAB
describes a project that uses: AS 136
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1976917750
Wikidata QID: Q60486770
cites work: Analysis of Sparse Representation and Blind Source Separation
cites work: A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations
cites work: Blind source separation by sparse decomposition in a signal dictionary
cites work: $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
cites work: Underdetermined blind source separation using sparse representations
cites work: A variational method for learning sparse and overcomplete representations
cites work: Underdetermined blind source separation based on sparse representation
cites work: Blind Separation of Speech Mixtures via Time-Frequency Masking
cites work: A time-frequency blind signal separation method applicable to underdetermined mixtures of dependent sources
cites work: Atomic Decomposition by Basis Pursuit
cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
cites work: Performance Analysis of Minimum&lt;tex&gt;$ell_1$&lt;/tex&gt;-Norm Solutions for Underdetermined Source Separation
cites work: Sparse solutions to linear inverse problems with multiple measurement vectors
cites work: Dictionary Learning Algorithms for Sparse Representation
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: Linear Geometric ICA: Fundamentals and Algorithms
cites work: Independent Component Analysis and Blind Signal Separation
cites work: Q4139463
cites work: Q4353852
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
DOI: 10.1016/J.SIGPRO.2008.12.005
description: scientific article; zbMATH DE number 5554088