1456 search results - page 226 / 292 » A search quality evaluation based on objective-subjective me... |
174
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
229
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
156
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
155
click to vote
CSDA
2004
15 years 6 months ago
2004
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
184
click to vote
TRECVID
2008
15 years 7 months ago
2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...