Name
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@?R^2, |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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2010.12.006 | Discrete Applied Mathematics |
Keywords | Field | DocType |
approximate solutions,approximate matching algorithm,subsets b,subset b,computational geometry,improved computational time,exact solutions,preprocessing step,point set matching,bottleneck distance,candidate zone,noisy matching,approximated match,matching problem,exact solution,graph matching | Discrete mathematics,Bottleneck,Combinatorics,Optimal matching,Computational geometry,Filter (signal processing),Matching (graph theory),Approximate string matching,3-dimensional matching,Mathematics,Lossless compression | Journal |
Volume | Issue | ISSN |
159 | 6 | Discrete Applied Mathematics |
Citations | PageRank | References |
2 | 0.41 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yago Diez | 1 | 45 | 11.50 |
| J. Antoni Sellarès | 2 | 49 | 8.79 |