Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CCCG
2006
11 years 7 months ago
On Bipartite Matching under the RMS Distance
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
Jeff M. Phillips, Pankaj K. Agarwal
SDM
2007
SIAM
167views Data Mining» more  SDM 2007»
11 years 7 months ago
Bandits for Taxonomies: A Model-based Approach
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabar...
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
11 years 7 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
CVPR
2004
IEEE
11 years 9 months ago
Diffeomorphic Matching of Distributions: A New Approach for Unlabelled Point-Sets and Sub-Manifolds Matching
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
Joan Glaunes, Alain Trouvé, Laurent Younes
DAGM
2004
Springer
11 years 11 months ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
GIS
2007
ACM
12 years 6 months ago
Dynamics-aware similarity of moving objects trajectories
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Robe...
ECCV
2000
Springer
12 years 7 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
books