Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
From MaRDI portal
Publication:1646156
DOI10.1016/j.amc.2014.01.087zbMath1410.68336OpenAlexW2090837289MaRDI QIDQ1646156
Xianquan Zhang, Dan He, Chunqiang Yu, Zhenjun Tang
Publication date: 22 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.01.087
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Cites Work
- Point pattern matching algorithm for planar point sets under Euclidean transform
- Approximate input sensitive algorithms for point pattern matching
- Geometric pattern matching for point sets in the plane under similarity transformations
- Scaling universalities of \(k\)th-nearest neighbor distances on closed manifolds
- Articulated motion reconstruction from feature points
- Simple algorithms for partial point set pattern matching under rigid motion
- Genetic algorithm for affine point pattern matching
This page was built for publication: Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale