Sciweavers

144 search results - page 8 / 29
» Landmark matching on the sphere using distance functions
Sort
View
ISCI
2007
170views more  ISCI 2007»
13 years 7 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
TOG
2012
273views Communications» more  TOG 2012»
11 years 10 months ago
Functional maps: a flexible representation of maps between shapes
We present a novel representation of maps between pairs of shapes that allows for efficient inference and manipulation. Key to our approach is a generalization of the notion of m...
Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, ...
SCAM
2007
IEEE
14 years 1 months ago
Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
Arnoldo José Müller Molina, Takeshi Sh...
ISBI
2006
IEEE
14 years 1 months ago
Shape analysis using the Fisher-Rao Riemannian metric: unifying shape representation and deformation
— We show that the Fisher-Rao Riemannian metric is a natural, intrinsic tool for computing shape geodesics. When a parameterized probability density function is used to represent...
Adrian Peter, Anand Rangarajan
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 25 days ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk