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...
We present a simple and efficient dense matching method based on region growing techniques, which can be applied to a wide range of globally textured images like many outdoor scen...
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our f...
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu,...
Images of an object undergoing ego- or camera- motion
often appear to be scaled, rotated, and deformed versions
of each other. To detect and match such distorted patterns
to a s...
Many traditional methods for shape classification involve
establishing point correspondences between shapes to
produce matching scores, which are in turn used as similarity
meas...