Noisy colored point set matching

作者：Diez Yago^*; Antoni Sellares J

来源：Discrete Applied Mathematics, 2011, 159(6): 433-449.

DOI：10.1016/j.dam.2010.12.006

• Point set matching
• Noisy matching
• Bottleneck distance
• Exact solutions
• Approximate solutions
• Computational geometry

We propose a process for determining approximated matches, in terms of the bottleneck distance, under color preserving rigid motions, between two colored point sets A, B epsilon R(2), vertical bar A vertical bar <= vertical bar B vertical bar. We solve the matching problem by generating all representative motions that bring A close to a subset B' of set 2 and then using a graph matching algorithm. We also present an approximate matching algorithm with improved computational time. In order to get better running times for both algorithms we present a lossless filtering preprocessing step. By using it, we determine some candidate zones which are regions that contain a subset & of B such that A may match one or more subsets B' of &. Then, we solve the matching problem between A and every candidate zone. Experimental results using both synthetic and real data are reported to prove the effectiveness of the proposed approach.

• 出版日期2011-3-28