463 search results - page 83 / 93 » Computing the Hausdorff Distance between Curved Objects |
109
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
178
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
89
Voted
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
110
click to vote
EUROGRAPHICS
2010
Eurographics
15 years 24 days ago
2010
Eurographics
We introduce the notion of consensus skeletons for non-rigid space-time registration of a deforming shape. Instead of basing the registration on point features, which are local an...