A linear time algorithm of computing hausdorff distance for content-based image analysis

M. Julius Hossain, M. Ali Akber Dewan, Kiok Ahn, Oksam Chae

Research output: Contribution to journalJournal Articlepeer-review

17 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)389-399
Number of pages11
JournalCircuits, Systems, and Signal Processing
Volume31
Issue number1
DOIs
Publication statusPublished - Feb. 2012

Keywords

  • Distance transformation
  • Hausdorff distance
  • Image matching
  • Moving-object detection
  • Video coding

Fingerprint

Dive into the research topics of 'A linear time algorithm of computing hausdorff distance for content-based image analysis'. Together they form a unique fingerprint.

Cite this