Abstract
The Hausdorff distance can be used to measure the similarity of two point sets. In matching the two point sets, one of the point sets is translated, rotated and scaled in order to obtain an optimal matching, which is a computationally intensive process. In this paper, a robust line-feature-based approach for model-based recognition is proposed, which can achieve a good performance level in matching, even in a noisy environment or with the existence of occlusion. The method is insensitive to noise and can find the rotation and scale of the image point set accurately and reliably. For this reason, instead of 4D matching, a 2D-2D matching algorithm can be used. This can greatly reduce the required memory and computation. Having rotated and scaled the image point set, the difference between the query point set and the model point set can be computed by considering translation only. The perfamvance and the sensitivity to noise of our algorithm are evaluated using simulated data. Experiments show that our 2D-2D algorithm can give a high performance level when determining the relative scale and orientation of two point sets.
This work is supported by HKPolyU research grant G-V596.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. S. Kim, W. Y. Kim, “Content-based trademark retrieval system using a visually salient feature”, Image and Vision Computing, Vol. 16, pp. 931–939, 1998.
B. Günsel and A. M. Tekalp, “Shape similarity matching for query-by-example”, Pattern Recognition, vol. 31, no. 7, pp. 931–944, 1998.
A. Blumenkrans, “Two-Dimensional Object Recognition using a Two-Dimensional Polar Transform”, Pattern Recognition, vol. 24, no. 9, pp. 879–890, 1991.
D. P. Huttenlocher, G. A. Klanderman, and W. J. Rucklidge, “Comparing Image Using the Hausdorff Distance”, IEEE Transactions on PAMI, vol. 15, no. 9, pp. 850–863, 1993.
M. Dubuisson and A. K. Jain, “A modified Hausdorff distance for object Matching”, Proc. 12th Int. Conf on Pattern Recognition (ICPR), Jerusalem, Israel, pp. 566–568, 1994.
B. Takacs, “Comparing Face Images Using the Modified Hausdorff Distance”, Pattern Recognition, vol. 31, no. 12, pp. 1973-1881, 1998.
X. Yi and Octavia, “Line-Based Recognition Using A Multidimensional Hausdorff Distance”, IEEE Transactions on Patten Analysis and Machine intelligence, vol. 21, no. 9, pp. 901–916, September 1999.
D. G. Sim, O. K. Kwon, and R. H. Park, “Object Matching Algorithms Using Robust Hausdorff distance Measures”, IEEE Transactions on image Processing, vol. 8, no. 3, pp. 425–429, March 1999.
W. P. Choi, K. M. Lam, and W. C. Siu, “An adaptive active contour model for highly irregular boundaries”, Pattern Recognition, vol. 34, pp. 323–331, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, WP., Lam, KM., Siu, WC. (2001). A Robust Line-Feature-Based Hausdorff Distance for Shape Matching. In: Shum, HY., Liao, M., Chang, SF. (eds) Advances in Multimedia Information Processing — PCM 2001. PCM 2001. Lecture Notes in Computer Science, vol 2195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45453-5_98
Download citation
DOI: https://doi.org/10.1007/3-540-45453-5_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42680-6
Online ISBN: 978-3-540-45453-3
eBook Packages: Springer Book Archive