Sciweavers

591 search results - page 15 / 119
» Compatible Geometric Matchings
Sort
View
151
Voted
COMPGEOM
1993
ACM
15 years 10 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
AVBPA
2005
Springer
279views Biometrics» more  AVBPA 2005»
15 years 11 months ago
On Combining Textural and Geometrical Scores for Discriminative Face Authentication
Abstract. In this paper, a combined shape-texture approach to discriminative face authentication is studied. Facial texture information is captured through Gabor responses (jets), ...
José Luis Alba-Castro, Daniel Gonzál...
CVPR
2007
IEEE
16 years 7 months ago
Quasi-Dense Wide Baseline Matching Using Match Propagation
In this paper we propose extensions to the match propagation algorithm which is a technique for computing quasidense point correspondences between two views. The extensions make t...
Juho Kannala, Sami S. Brandt
CVPR
2010
IEEE
16 years 2 months ago
Asymmetric Region-to-Image Matching for Comparing Images with Generic Object Categories
We present a feature matching algorithm that leverages bottom-up segmentation. Unlike conventional image-toimage or region-to-region matching algorithms, our method finds corresp...
Jaechul Kim, Kristen Grauman
IPL
2008
104views more  IPL 2008»
15 years 5 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...