409 search results - page 70 / 82 » Compact Similarity Joins |
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
JMLR
2012
11 years 10 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
NIPS
2008
13 years 9 months ago
2008
Contours have been established in the biological and computer vision literature as a compact yet descriptive representation of object shape. While individual contours provide stru...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...