Abstract
A new parallel algorithm to compute Euclidean metric-based Hausdorff distance measures between binary images (typically edge maps) is proposed in this paper. The algorithm has a running time of O(n) for images of size n × n. Further, the algorithm has the following features: (i) simple arithmetic (ii) identical computations at each pixel and (iii) computations using a small neighborhood for each pixel. An efficient cellular architecture for implementing the proposed algorithm is presented. Results of implementation using field-programmable gate arrays show that the measures can be computed for approximately 88000 image pairs of size 128×128 in a second. This result is valuable for real-time applications like object tracking and video surveillance.
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
Huttenlocher, D., Klanderman, G., Rucklidge, W.: Comparing images using the Hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 850–863 (1993)
Sim, D.G., Kwon, O.K., Park, R.H.: Object matching algorithms using robust Hausdorff distance measures. IEEE Transactions on Image Processing 8, 425–429 (1999)
Kwon, O.K., Sim, D.G., Park, R.H.: Robust Hausdorff distance matching algorithms using pyramidal structures. Pattern Recognition 34, 2005–2013 (2001)
Ayala-Ramírez, V., Parra, C., Devy, M.: Active tracking based on hausdorff matching. In: ICPR, pp. 4706–4709 (2000)
Kim, S.H., Park, R.H.: An efficient algorithm for video sequence matching using the modified hausdorff distance and the directed divergence. IEEE Trans. Circuits Syst. Video Techn. 12, 592–596 (2002)
Gao, Y.: Efficiently comparing face images using a modified hausdorff distance. IEE Proceedings - Vision, Image and Signal Processing 150, 346–350 (2003)
Shonkwiler, R.: An image algorithm for computing the hausdorff distance efficiently in linear time. Information Processing Letters 30, 87–89 (1989)
Shonkwiler, R.: Computing the hausdorff set distance in linear time for any l p point distance. Information Processing Letters 38, 201–207 (1991)
Bossomaier, T., Loeff, A.: Parallel computation of the Hausdorff distance between images. Parallel Computing 19, 1129–1140 (1993)
You, J., Cohen, H., Zhu, W., Pissaloux, E.: A robust and real-time texture analysis system using a distributed workstation cluster. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing 4, 2207–2210 (1996)
Gualtieri, J., Moigne, J.L., Packer, C.: Distance between images. In: Proceedings of the fourth IEEE symposium on the frontiers of massively parallel computation, pp. 216–223 (1992)
Azencott, R., Durbin, F., Paumard, J.: Robust recognition of buildings in compressed large aerial scenes. Proceedings of IEEE International Conference on Image Processing 2, 617–620 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sudha, N., Vivek, E.P. (2005). A High-Speed VLSI Array Architecture for Euclidean Metric-Based Hausdorff Distance Measures Between Images. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_22
Download citation
DOI: https://doi.org/10.1007/11602569_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30936-9
Online ISBN: 978-3-540-32427-0
eBook Packages: Computer ScienceComputer Science (R0)