This paper studies the problem of recovering a non-negative sparse signal $\x
\in \Re^n$ from highly corrupted linear measurements $\y = A\x + \e \in \Re^m$,
where $\e$ is an unknown error vector whose nonzero entries may be unbounded.
Motivated by an observation from face recognition in computer vision, this
paper proves that for highly correlated (and poss