A High-Speed VLSI Array Architecture for Euclidean Metric-Based Hausdorff Distance Measures Between Images

  • N. Sudha
  • E. P. Vivek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3769)


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.


Binary Image Object Tracking Video Surveillance Foreground Pixel Clock Pulse 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Huttenlocher, D., Klanderman, G., Rucklidge, W.: Comparing images using the Hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 850–863 (1993)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Kwon, O.K., Sim, D.G., Park, R.H.: Robust Hausdorff distance matching algorithms using pyramidal structures. Pattern Recognition 34, 2005–2013 (2001)zbMATHCrossRefGoogle Scholar
  4. 4.
    Ayala-Ramírez, V., Parra, C., Devy, M.: Active tracking based on hausdorff matching. In: ICPR, pp. 4706–4709 (2000)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Gao, Y.: Efficiently comparing face images using a modified hausdorff distance. IEE Proceedings - Vision, Image and Signal Processing 150, 346–350 (2003)CrossRefGoogle Scholar
  7. 7.
    Shonkwiler, R.: An image algorithm for computing the hausdorff distance efficiently in linear time. Information Processing Letters 30, 87–89 (1989)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Shonkwiler, R.: Computing the hausdorff set distance in linear time for any l p point distance. Information Processing Letters 38, 201–207 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Bossomaier, T., Loeff, A.: Parallel computation of the Hausdorff distance between images. Parallel Computing 19, 1129–1140 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • N. Sudha
    • 1
  • E. P. Vivek
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyMadras

Personalised recommendations