824 search results - page 122 / 165 » Efficient Distance Computation Between Non-Convex Objects |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Tracking people or objects across multiple cameras is a challenging research area in visual computing especially when these cameras have non-overlapping field-of-views. The import...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We present a robust representation for gait recognition that is compact, easy to construct, and affords efficient matching. Instead of a time series based representation comprisin...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...