Fast l₁-minimization algorithms for robust face recognition
l1-minimization refers to finding the minimum l1-norm solution to an underdetermined linear system [Formula: see text]. Under certain conditions as described in compressive sensing theory, the minimum l1-norm solution is also the sparsest solution. In this paper, we study the speed and scalability o...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 22(2013), 8 vom: 14. Aug., Seite 3234-46
|
|---|
| 1. Verfasser: |
Yang, Allen Y
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Zhou, Zihan,
Balasubramanian, Arvind Ganesh,
Sastry, S Shankar,
Ma, Yi |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2013
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|
|---|
| Schlagworte: | Journal Article
Research Support, U.S. Gov't, Non-P.H.S. |
|---|