Sciweavers

100 search results - page 10 / 20
» Learning distance function by coding similarity
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Submodular dictionary learning for sparse coding
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...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
NIPS
2008
13 years 9 months ago
Spectral Hashing
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
Yair Weiss, Antonio Torralba, Robert Fergus
ICPR
2010
IEEE
14 years 1 months ago
A Meta-Learning Approach to Conditional Random Fields Using Error-Correcting Output Codes
—We present a meta-learning framework for the design of potential functions for Conditional Random Fields. The design of both node potential and edge potential is formulated as a...
Francesco Ciompi, Oriol Pujol, Petia Radeva
ICCV
1998
IEEE
13 years 12 months ago
Condensing Image Databases when Retrieval is Based on Non-Metric Distances
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
David W. Jacobs, Daphna Weinshall, Yoram Gdalyahu
ICS
2010
Tsinghua U.
13 years 11 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat