502 search results - page 26 / 101 » Sparse Subspace Clustering |
107
click to vote
ETS
2006
IEEE
15 years 8 months ago
2006
IEEE
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
148
click to vote
SIAMMAX
2011
14 years 4 months ago
2011
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
106
click to vote
ACCV
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we systematically study the effect of poorly registered faces on the training and inferring stages of traditional face recognition algorithms. We then propose a nov...
120
click to vote
AMFG
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a general framework for face modeling under varying lighting conditions. First, we show that a face lighting subspace can be constructed based on three o...
120
Voted
NIPS
2008
15 years 3 months ago
2008
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...