We introduce a new iterative algorithm for Sparse Component Analysis (SCA). The algorithm, which we call Iterative Detection‐Estimation (IDE), is essentially a method to find sufficiently sparse solutions of underdetermined linear systems of equations. In the SCA context, this solves the source separation part of the problem. Each iteration of IDE consists of two steps. In the detection step, starting with a previously known estimate of the sparse solution vector, we detect which components of the solution are (possibly) active, i.e., having a considerable value. Then, in the estimation step, we compute the new estimate by finding a solution of the system which is the closest to the subspace specified by the detection step. This is called projection into the activity subspace. We will compare the solution obtained by the proposed algorithm against the minimum 1‐norm solution obtained by Linear Programming (LP). It is shown by experiment that, with proper choice of parameters, the proposed algorithm is abo...
[1]
D K Smith,et al.
Numerical Optimization
,
2001,
J. Oper. Res. Soc..
[2]
D. Donoho.
For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
,
2006
.
[3]
M. V. Rossum,et al.
In Neural Computation
,
2022
.
[4]
Rémi Gribonval,et al.
A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges
,
2006,
ESANN.
[5]
P. Laguna,et al.
Signal Processing
,
2002,
Yearbook of Medical Informatics.