PCM 2001: Advances in Multimedia Information Processing — PCM 2001 pp 764-771 | Cite as
A Robust Line-Feature-Based Hausdorff Distance for Shape Matching
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.
Preview
Unable to display preview. Download preview PDF.
References
- [1]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.CrossRefGoogle Scholar
- [2]B. Günsel and A. M. Tekalp, “Shape similarity matching for query-by-example”, Pattern Recognition, vol. 31, no. 7, pp. 931–944, 1998.CrossRefGoogle Scholar
- [3]A. Blumenkrans, “Two-Dimensional Object Recognition using a Two-Dimensional Polar Transform”, Pattern Recognition, vol. 24, no. 9, pp. 879–890, 1991.CrossRefGoogle Scholar
- [4]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.Google Scholar
- [5]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.Google Scholar
- [6]B. Takacs, “Comparing Face Images Using the Modified Hausdorff Distance”, Pattern Recognition, vol. 31, no. 12, pp. 1973-1881, 1998.CrossRefGoogle Scholar
- [7]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.CrossRefGoogle Scholar
- [8]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.CrossRefGoogle Scholar
- [9]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.MATHCrossRefGoogle Scholar