Sciweavers

1245 search results - page 66 / 249
» Binary Sparse Coding
Sort
View
147
Voted
PAMI
2012
13 years 5 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens
CVPR
2007
IEEE
16 years 4 months ago
Viewpoint-Coded Structured Light
We introduce a theoretical framework and practical algorithms for replacing time-coded structured light patterns with viewpoint codes, in the form of additional camera locations. ...
Mark Young, Erik Beeson, James Davis, Szymon Rusin...
PASTE
1998
ACM
15 years 6 months ago
OPTVIEW: A New Approach for Examining Optimized Code
The task of mappingbetween source programs and machine code, once the code has been optimizedand transformed by a compiler is often di cult. Yet there are many instances, such as ...
Caroline Tice, Susan L. Graham
COLT
1999
Springer
15 years 6 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
ICIP
2008
IEEE
16 years 4 months ago
Complexity modeling of H.264 entropy decoding
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
Zhan Ma, Zhongbo Zhang, Yao Wang