A Linear Time Algorithm of Computing Hausdorff Distance for Content-based Image Analysis | Circuits, Systems, and Signal Processing Skip to main content

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Springer Nature Link
Log in

A Linear Time Algorithm of Computing Hausdorff Distance for Content-based Image Analysis

  • Short Paper
  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

The Hausdorff distance is a very important metric for various image applications in computer vision including image matching, moving-object detection, tracking and recognition, shape retrieval and content-based image analysis. However, no efficient algorithm has been reported that computes the exact Hausdorff distance in linear time for comparing two images. Very few methods have been proposed to compute the approximate Hausdorff distance with higher approximation error. In this paper, we propose a linear time algorithm for computing the approximated Hausdorff distance with lower approximation error. The proposed method is effective to reduce the processing time, while minimizing the error rate in content-based image processing and analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

References

  1. M.J. Atallah, A linear time algorithm for the Hausdorff distance between convex polygons. Inf. Process. Lett. 17, 207–209 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  2. G. Borgefors, Distance transformations in arbitrary dimensions. Comput. Vis. Graph. Image Process. 27, 321–345 (1984)

    Article  Google Scholar 

  3. M.P. Dubuisson, A.K. Jain, A modified Hausdorff distance for object matching, in Proc. of IAPR Int. Conf. on Computer Vision and Image Processing, Israel (1994), pp. 566–568

    Google Scholar 

  4. R. Fabbri, L.D.F. Costa, J.C. Torelli, O.M. Bruno, 2D Euclidean distance transform algorithms: a comparative survey. ACM Comput. Surv. 40(1), 1–44 (2008)

    Article  Google Scholar 

  5. R.C. Gonzalez, R.E. Woods, Digital Image Processing (Prentice-Hall Inc., Englewood Cliffs, 2007)

    Google Scholar 

  6. M.J. Hossain, M.A.A. Dewan, O. Chae, Moving object detection for real time video surveillance: an edge segment based approach. IEICE Trans. Commun. E90-B(12), 3654–3664 (2007)

    Article  Google Scholar 

  7. D.P. Huttenlocher, G.A. Klanderman, W.J. Rucklidge, Comparing images using the Hausdorff distance. IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 850–863 (1993)

    Article  Google Scholar 

  8. C.R. Maurer Jr., R. Qi, V. Raghavan, A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Trans. Pattern Anal. Mach. Intell. 25(2), 265–270 (2003)

    Article  Google Scholar 

  9. A. Rosenfeld, J.L. Pfaltz, Sequential operations in digital picture processing. J. Assoc. Comput. Mach. 13(4), 471–494 (1966)

    Article  MATH  Google Scholar 

  10. R. Shonkwiler, An image algorithm for computing the Hausdorff distance efficiently in linear time. Inf. Process. Lett. 30(2), 87–89 (1989)

    Article  MathSciNet  Google Scholar 

  11. K. Thirusittampalam, M.J. Hossain, O. Ghita, P.F. Whelan, A Novel Framework for Tracking In-vitro Cells in Time-lapse Phase Contrast Data, in Proc. of British Machine Vision Conference, UK (2010), pp. 69.1–69.11

    Chapter  Google Scholar 

  12. C.-H.T. Yang, S.-H. Lai, L.-W. Chang, Hybrid image matching combining Hausdorff distance with normalized gradient matching. Pattern Recognit. 40(4), 1173–1181 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Image Processing and Analysis, Dublin City University, Glasnevin, Dublin 9, Ireland

    M. Julius Hossain

  2. Department of Electrical and Computer Engineering, Concordia University, Montreal, Quebec, H3G 1M8, Canada

    M. Ali Akber Dewan

  3. Department of Computer Engineering, Kyung Hee University, Seochun ri, Kihung eup, Yongin si, Kyonggi do, 449-701, South Korea

    Kiok Ahn & Oksam Chae

Authors
  1. M. Julius Hossain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Ali Akber Dewan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kiok Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oksam Chae
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oksam Chae.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hossain, M.J., Dewan, M.A.A., Ahn, K. et al. A Linear Time Algorithm of Computing Hausdorff Distance for Content-based Image Analysis. Circuits Syst Signal Process 31, 389–399 (2012). https://doi.org/10.1007/s00034-011-9284-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-011-9284-y

Keywords

Search

Navigation