Approximate Geometric Pattern Matching Under Rigid Motions

Authors:
Michael T. Goodrich;Joseph S. B. Mitchell;Mark W. Orletsky
Affiliations:
Johns Hopkins Univ., Baltimore, MD;State Univ. of New York, Stony Brook;Johns Hopkins Univ., Baltimore, MD
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1999

Citing 20
Cited 17

Computational geometry: an introduction

Computational geometry: an introduction
Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Labeled point pattern matching by Delaunay triangulation and maximal cliques

Pattern Recognition
Least-Squares Fitting of Two 3-D Point Sets

IEEE Transactions on Pattern Analysis and Machine Intelligence
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Congruence, similarity and symmetries of geometric objects

Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Parallel merge sort

SIAM Journal on Computing
An optimal-time algorithm for slope selection

SIAM Journal on Computing
Minimax geometric fitting of two corresponding sets of points

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Introduction to algorithms

Introduction to algorithms
Least-Squares Estimation of Transformation Parameters Between Two Point Patterns

IEEE Transactions on Pattern Analysis and Machine Intelligence
Invariant Descriptors for 3D Object Recognition and Pose

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part I
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Approximate decision algorithms for point set congruence

Computational Geometry: Theory and Applications
Geometric pattern matching under Euclidean motion

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Dynamic Trees and Dynamic Point Location

SIAM Journal on Computing
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Improvements on Geometric Pattern Matching Problems

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Generalized Approzimate Algorithms for Point Set Congruence

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures

Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Comparing point clouds

Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

Computational Optimization and Applications
Graphical Models and Point Pattern Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple algorithms for partial point set pattern matching under rigid motion

Pattern Recognition
Dynamics-aware similarity of moving objects trajectories

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Interactive Hausdorff distance computation for general polygonal models

ACM SIGGRAPH 2009 papers
Geometric pattern matching for point sets in the plane under similarity transformations

Information Processing Letters
Approximate input sensitive algorithms for point pattern matching

Pattern Recognition
Exploring movement-similarity analysis of moving objects

SIGSPATIAL Special
Line-based object recognition using Hausdorff distance: from range images to molecular secondary structures

Image and Vision Computing
An improved algorithm for point set pattern matching under rigid motion

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Fast matching of large point sets under occlusions

Pattern Recognition
A simple algorithm for approximate partial point set pattern matching under rigid motion

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
An efficient approximation algorithm for point pattern matching under noise

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximate one-to-one point pattern matching

Journal of Discrete Algorithms
Similarity in (spatial, temporal and) spatio-temporal datasets

Proceedings of the 15th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.15

Visualization

Abstract

We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.