## Combinatorial and experimental methods for approximate point pattern matching (2003)

### Cached

### Download Links

- [www.cs.utah.edu]
- [www.research.att.com]
- [www.cs.utah.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Algorithmica |

Citations: | 6 - 0 self |

### BibTeX

@ARTICLE{Gavrilov03combinatorialand,

author = {Martin Gavrilov and Piotr Indyk and Rajeev Motwani and Suresh Venkatasubramanian},

title = {Combinatorial and experimental methods for approximate point pattern matching },

journal = {Algorithmica},

year = {2003},

volume = {38},

pages = {38--2}

}

### OpenURL

### Abstract

Point pattern matching is an important problem in computational geometry, with applications in areas like computer vision, object recognition, molecular modelling, and image registration. Traditionally, it has been studied in an exact formulation, where the input point sets are given with arbitrary precision. This leads to algorithms that typically have running times of the order of high degree polynomials, and require robust calculations of intersection points of high degree surfaces. We study approximate point pattern matching, with the goal of developing algorithms that are more efficient and more practical than exact algorithms. Our work is motivated by the observation that in practice, data sets that form instances of pattern matching problems are noisy, and so approximate formulations are more appropriate. We present new and efficient algorithms for approximate point pattern matching in two and three dimensions, based on approximate combinatorial distance bounds on sets of points, and via the use of methods from combinatorial pattern matching. We also present an average case analysis and a detailed empirical study of our methods.