Sciweavers

101 search results - page 8 / 21
» Optimal Random Matchings on Trees and Applications
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
MICCAI
2007
Springer
14 years 8 months ago
Object Localization Based on Markov Random Fields and Symmetry Interest Points
We present an approach to detect anatomical structures by configurations of interest points, from a single example image. The representation of the configuration is based on Markov...
Branislav Micusík, Georg Langs, Horst Bisch...
FOCS
2008
IEEE
14 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ICCV
2009
IEEE
15 years 14 days ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
CVPR
2007
IEEE
14 years 9 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...