A linear time algorithm of computing Hausdorff distance for content-based image analysis
A linear time algorithm of computing Hausdorff distance for content-based image analysis
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.
Hausdorff distance, Distance transformation ·, Image matching, Video coding, Moving-object detection
389-399
Hossain, M. Julius
bba1b875-7604-462b-a55b-ba0b54f728e8
Dewan, M. Ali Akber
363af584-4a43-4a28-8f3c-25b78fbd5360
Ahn, Kiok
44f01b22-7832-4e51-af6e-6cd36e3fd084
Chae, Oksam
f3b49af7-329a-4eed-bcd1-33aa737cd234
1 February 2012
Hossain, M. Julius
bba1b875-7604-462b-a55b-ba0b54f728e8
Dewan, M. Ali Akber
363af584-4a43-4a28-8f3c-25b78fbd5360
Ahn, Kiok
44f01b22-7832-4e51-af6e-6cd36e3fd084
Chae, Oksam
f3b49af7-329a-4eed-bcd1-33aa737cd234
Hossain, M. Julius, Dewan, M. Ali Akber, Ahn, Kiok and Chae, Oksam
(2012)
A linear time algorithm of computing Hausdorff distance for content-based image analysis.
Circuits, Systems, and Signal Processing, 31, .
(doi:10.1007/s00034-011-9284-y).
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 record has no associated files available for download.
More information
e-pub ahead of print date: 23 March 2011
Published date: 1 February 2012
Additional Information:
© Springer Science+Business Media
Keywords:
Hausdorff distance, Distance transformation ·, Image matching, Video coding, Moving-object detection
Identifiers
Local EPrints ID: 458219
URI: http://eprints.soton.ac.uk/id/eprint/458219
ISSN: 0278-081X
PURE UUID: 9bff408f-ba96-45ff-9eca-d19e00ced9ae
Catalogue record
Date deposited: 01 Jul 2022 16:32
Last modified: 17 Mar 2024 04:12
Export record
Altmetrics
Contributors
Author:
M. Julius Hossain
Author:
M. Ali Akber Dewan
Author:
Kiok Ahn
Author:
Oksam Chae
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics