A fast expected time algorithm for the 2-D point pattern matching problem

作者：

Highlights：

•

摘要

Point set pattern matching is an integral part of many pattern recognition problems. We study a randomized algorithm for the alignment approach to model-based recognition.Under certain mild assumptions we show that if our scene is a set of n points and our model is a set of m

论文关键词：Point pattern matching expected time algorithm

论文评审过程：Received 27 May 2003, Accepted 1 December 2003, Available online 11 February 2004.

论文官网地址：https://doi.org/10.1016/j.patcog.2003.12.009