Noisy colored point set matching
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?R2 A , B ? R 2 , |A|?|B| | A | ? | B | . We solve the matching problem by generating all representative motions that bring A A close to a subset B? B ? of set B B 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 S S of B B such that A A may match one or more subsets B? B ? of S S . Then, we solve the matching problem between A A and every candidate zone. Experimental results using both synthetic and real data are reported to prove the effectiveness of the proposed approach.
point set matching noisy matching bottleneck distance exact solutions approximate solutions computational geometry