Underdetermined blind source separation using sparse representations
From MaRDI portal
Publication:5958660
DOI10.1016/S0165-1684(01)00120-7zbMath0985.94006OpenAlexW2038237443MaRDI QIDQ5958660
Michael Zibulevsky, Pau Bofill
Publication date: 3 March 2002
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-1684(01)00120-7
blind source separationnorm decompositionpotential-function clusteringsparse signal representationunderdetermined source separation
Related Items (37)
Compressed blind signal reconstruction model and algorithm ⋮ Underdetermined blind identification for uniform linear array by a new time-frequency method ⋮ Sparsity and independence: balancing two objectives in optimization for source separation with application to fMRI analysis ⋮ Analysis of Sparse Representation and Blind Source Separation ⋮ SSP-based UBI algorithms for uniform linear array ⋮ $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ Underdetermined mixing matrix estimation algorithm based on single source points ⋮ Bayesian inference over ICA models: application to multibiometric score fusion with quality estimates ⋮ Free component analysis: theory, algorithms and applications ⋮ A new blind method for separating M+1 sources from M mixtures ⋮ A recursive sparse blind source separation method and its application to correlated data in NMR spectroscopy of biofluids ⋮ Musical audio analysis using sparse representations ⋮ Searching-and-averaging method of underdetermined blind speech signal separation in time domain ⋮ Non‐negative matrix factorization and its application in blind sparse source separation with less sensors than sources ⋮ Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging ⋮ Multiscale blind source separation ⋮ Source number estimation and separation algorithms of underdetermined blind separation ⋮ The LOST algorithm: Finding lines and separating speech mixtures ⋮ A performance guarantee for orthogonal matching pursuit using mutual coherence ⋮ Underdetermined blind separation of non-disjoint signals in time-frequency domain based on matrix diagonalization ⋮ Two-dimensional random projection ⋮ Postprocessing and sparse blind source separation of positive and partially overlapped data ⋮ Compressed Sensing and Source Separation ⋮ Fast Sparse Representation Based on Smoothed ℓ0 Norm ⋮ Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem ⋮ Dictionary Learning for L1-Exact Sparse Coding ⋮ First Stereo Audio Source Separation Evaluation Campaign: Data, Algorithms and Results ⋮ A Note on Lewicki-Sejnowski Gradient for Learning Overcomplete Representations ⋮ Overcomplete blind source separation based on generalized Gaussian function and SL0 norm ⋮ A complex mixing matrix estimation algorithm based on single source points ⋮ Adaptive blind separation of underdetermined mixtures based on sparse component analysis ⋮ A New Nonlinear Sparse Component Analysis for a Biologically Plausible Model of Neurons ⋮ K-hyperline clustering learning for sparse component analysis ⋮ A WHT signal detection-based FLO-TF-UBSS algorithm under impulsive noise environment ⋮ An algorithm for mixing matrix estimation in instantaneous blind source separation ⋮ Mixing vector estimation in single channel blind source separation of angle modulated signal sources based on cumulant system of equations ⋮ A complex-valued mixing matrix estimation algorithm for underdetermined blind source separation
This page was built for publication: Underdetermined blind source separation using sparse representations
