2127 search results - page 231 / 426 » Computing large matchings fast |
135
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Methods based on local, viewpoint invariant features have proven capable of recognizing objects in spite of viewpoint changes, occlusion and clutter. However, these approaches fail...
136
Voted
PR
2000
15 years 4 months ago
2000
We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primar...
134
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The homography between pairs of images are typically computed from the correspondence of keypoints, which are established by using image descriptors. When these descripto...
138
click to vote
HCW
1998
IEEE
15 years 9 months ago
1998
IEEE
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
108
click to vote
CVPR
2010
IEEE
16 years 23 days ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...