A bilinear algorithm for sparse representations

DOI10.1007/s10589-007-9043-yzbMath1183.65042OpenAlexW2065435057WikidataQ59682416 ScholiaQ59682416MaRDI QIDQ2475611

Panos M. Pardalos, Fabian J. Theis, Pando Grigorov Georgiev

Publication date: 11 March 2008

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9043-y

zbMATH Keywords

numerical exampleblind source separationsparse representationsparse component analysisunderdetermined mixturesbilinear algorithmhyperplane clustering problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) System identification (93B30)

Related Items

A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem ⋮ A hierarchical approach for sparse source blind signal separation problem ⋮ Robust physiological mappings: from non-invasive to invasive ⋮ A Kronecker approximation with a convex constrained optimization method for blind image restoration

Uses Software

• PDCO
• FastICA
• ICALAB

Cites Work

• \(k\)-plane clustering
• Geometrical structures of FIR manifold and multichannel blind deconvolution
• Blind Source Separation by Sparse Decomposition in a Signal Dictionary
• Atomic Decomposition by Basis Pursuit
• Learning the parts of objects by non-negative matrix factorization
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization