144 search results - page 15 / 29 » Landmark matching on the sphere using distance functions |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
IJDAR
2010
13 years 4 months ago
2010
We study online classification of isolated handwritten symbols using distance measures on spaces of curves. We compare three distance-based measures on a vector space representatio...
IVC
2007
13 years 7 months ago
2007
In urban areas, buildings are often used as landmarks for localization. Reliable and efficient recognition of buildings is crucial for enabling this functionality. Motivated by t...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...