Equivalence probability and sparsity of two sparse solutions in sparse representation.
This paper discusses the estimation and numerical calculation of the probability that the 0-norm and 1-norm solutions of underdetermined linear equations are equivalent in the case of sparse representation. First, we define the sparsity degree of a signal. Two equivalence probability estimates are obtained when the entries of the 0-norm solution have different sparsity degrees. One is for the case in which the basis matrix is given or estimated, and the other is for the case in which the basis matrix is random. However, the computational burden to calculate these probabilities increases exponentially as the number of columns of the basis matrix increases. This computational complexity problem can be avoided through a sampling method. Next, we analyze the sparsity degree of mixtures and establish the relationship between the equivalence probability and the sparsity degree of the mixtures. This relationship can be used to analyze the performance of blind source separation (BSS). Furthermore, we extend the equivalence probability estimates to the small noise case. Finally, we illustrate how to use these theoretical results to guarantee a satisfactory performance in underdetermined BSS.
Li
Yuanqing
Y
Institute for Infocomm Research, Singapore 119613, Singapore. auyqli@scut.edu.cn
Cichocki
Andrzej
A
Amari
Shun-ichi
S
Xie
Shengli
S
Guan
Cuntai
C
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D015233:Models, Statistical; D011382:Programming, Linear