Fast l₁-minimization algorithms for robust face recognition.

AY, Yang; Z, Zhou; AG, Balasubramanian; SS, Sastry; Y, Ma

doi:10.1109/tip.2013.2262292

Public

Fast l₁-minimization algorithms for robust face recognition.

Shared by NobleBlocks on May 13, 2013 • 12:00 AM UTC

Authors:

Yang AY

Zhou Z

Balasubramanian AG

Abstract

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...

Discussions