186 search results - page 22 / 38 » Fast Computation of Sparse Datacubes |
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
ACL
2010
14 years 7 months ago
2010
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
136
click to vote
CVPR
2012
IEEE
13 years 5 days ago
2012
IEEE
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...