## Abstract

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|. We solve the matching problem by generating all representative motions that bring A close to a subset B′ of set 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 of B such that A may match one or more subsets B′ of S. 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.

Original language | English |
---|---|

Pages (from-to) | 433-449 |

Number of pages | 17 |

Journal | Discrete Applied Mathematics |

Volume | 159 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2011 Mar 28 |

## Keywords

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

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics