25 September 2003 A fast practical feature point-matching algorithm
Author Affiliations +
Proceedings Volume 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition; (2003) https://doi.org/10.1117/12.538714
Event: Third International Symposium on Multispectral Image Processing and Pattern Recognition, 2003, Beijing, China
Abstract
This paper proposed a new stable algorithm based on feature point matching, which can be used in image registration under shift and rotation. The new method firstly extracts feature points in the first image of an image sequence and then searches the matching points in the consecutive images. Different from conventional methods, it adopts constrain of distance to revise matching and removing false matching, and also adopts projection of pixel to filter feature points and choose many possible matching points for one reference feature point, which makes it fast and reliable. Experiments prove this method is practical and reliable.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Minghao Hu, Minghao Hu, Mingwu Ren, Mingwu Ren, Jingyu Yang, Jingyu Yang, } "A fast practical feature point-matching algorithm", Proc. SPIE 5286, Third International Symposium on Multispectral Image Processing and Pattern Recognition, (25 September 2003); doi: 10.1117/12.538714; https://doi.org/10.1117/12.538714
PROCEEDINGS
4 PAGES


SHARE
RELATED CONTENT

An improved SIFT descriptor
Proceedings of SPIE (November 15 2011)
Globally consistent image mosaicing
Proceedings of SPIE (August 19 2010)
A robust point matching algorithm for image registration
Proceedings of SPIE (January 12 2012)

Back to Top