39 search results - page 4 / 8 » The Pyramid Match: Efficient Learning with Partial Correspon... |
DAGSTUHL
2006
13 years 9 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
SIAMJO
2008
13 years 7 months ago
2008
This paper concerns a fractional function of the form xT a/ xT Bx, where B is positive definite. We consider the game of choosing x from a convex set, to maximize the function, an...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We consider the problem of localizing the articulated and deformable shape of a walking person in a single view. We represent the non-rigid 2D body contour by a Bayesian graphical...