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) 0091-3286/2012/$25.00 © 2012 SPIE
Hu Zhu, Tianxu Zhang, Luxin Yan, and 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
Published: 31 January 2012
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optical engineering

Algorithm development

Distance measurement

Pattern recognition

Artificial intelligence

Computer vision technology

Data processing

Back to Top