On the uniqueness of non-negative sparse & redundant representations

Alfred M. Bruckstein, Michael Elad, Michael Zibulevsky

Abstract

We consider an underdetermined linear system of equations Ax = b with non-negative entries in A and b, and seek a non-negative solution x. We generalize known equivalence results for the basis pursuit, for an arbitrary matrix A, and an arbitrary monotone element-wise concave penally replacing the lscr <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm in the objective function. This result is then used to show that if there exists a sufficiently sparse solution to Ax = b, x > 0, it is necessarily unique.
BibTeX
@inproceedings{bruckstein2008uniqueness,
  author = {Alfred M. Bruckstein and Michael Elad and Michael Zibulevsky},
  title = {{On the uniqueness of non-negative sparse \& redundant representations}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2008},
  doi = {10.1109/icassp.2008.4518817},
}

Loading related content...

Figure