31 January 2012 Robust and fast Hausdorff distance for image matching
Author Affiliations +
Abstract
A robust and fast Hausdorff distance (HD) method is presented for image matching. Canny edge operator is used for extracting edge points. HD measure is one of efficient measures for comparing two edge images by calculating the interpixel distance between two sets of edge points, and does not require the point-to-point correspondence. However, high computational complexity is a common problem for HD measure because a large number of edge points could be extracted used to calculate HD. Further, a great many incorrect edge points will be extracted under the condition of occlusion and other ill conditions. A gradient orientation selectivity strategy is proposed to not only select available edges, but also reduce the number of edge points. Experimental results show that the proposed method has less computational cost, and has good robustness for object matching, especially under partial occlusion and other ill conditions.
© 2012 Society of Photo-Optical Instrumentation Engineers (SPIE)
Hu Zhu, Hu Zhu, Tianxu Zhang, Tianxu Zhang, Luxin Yan, Luxin Yan, Lizhen Deng, Lizhen Deng, } "Robust and fast Hausdorff distance for image matching," Optical Engineering 51(1), 017203 (31 January 2012). https://doi.org/10.1117/1.OE.51.1.017203 . Submission:
JOURNAL ARTICLE
6 PAGES


SHARE
RELATED CONTENT

AWM: Adaptive Weight Matting for medical image segmentation
Proceedings of SPIE (February 23 2017)
Topologically clustering: a method for discarding mismatches
Proceedings of SPIE (November 14 2007)
Image matching using algebraic topology
Proceedings of SPIE (January 17 2006)
A fast template matching method based on context prediction
Proceedings of SPIE (December 02 2011)

Back to Top