Estimating the mixing matrices based on a similarity function in sparse component analysis

DOI10.3969/J.ISSN.1005-3085.2013.05.002MaRDI QIDQ5167657zbMATH OpenFDO

Authors Xu Xu, Chonghui Guo

Publication date 30 June 2014

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3085.2013.05.002

zbMATH Keywords

agglomerative hierarchical clusteringfixed point algorithmsimilarity functionsparse component analysisunderdetermined blind source separation

Mathematics Subject Classification ID

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

Recommendations

• Mixture matrix identification of underdetermined blind source separation based on plane clustering algorithm
• Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
• Source number estimation and separation algorithms of underdetermined blind separation
• Blind estimation of underdetermined mixing matrix based on improved K-means clustering
• An algorithm for mixing matrix estimation in instantaneous blind source separation

Cited in

(7)

• K-hyperline clustering learning for sparse component analysis
• Similar component analysis
• Mixture matrix identification of underdetermined blind source separation based on plane clustering algorithm
• Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
• Independent Component Analysis and Blind Signal Separation
• Robust sparse component analysis based on a generalized Hough transform
• Source number estimation and separation algorithms of underdetermined blind separation

This page was built for publication: Estimating the mixing matrices based on a similarity function in sparse component analysis

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