Independent Component Analysis and Blind Signal Separation

DOI10.1007/11679363MaRDI QIDQ5898401zbMATH OpenOpenAlexFDO

Authors Mark D. Plumbley

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11679363

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• On Polar Polytopes and the Recovery of Sparse Representations
• Fast sparse reconstruction: Greedy inverse scale space flows
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Ways to sparse representation: An overview
• Greed is Good: Algorithmic Results for Sparse Approximation

Cited in

(7)

• Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
• On Polar Polytopes and the Recovery of Sparse Representations
• Dictionary Learning for L1-Exact Sparse Coding
• scientific article; zbMATH DE number 6129860 (Why is no real title available?)
• Accelerated mesh sampling for the hyper reduction of nonlinear computational models
• Cardinality minimization, constraints, and regularization: a survey
• CMB data analysis and sparsity

This page was built for publication: Independent Component Analysis and Blind Signal Separation

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