A high-speed VLSI array architecture for euclidean metric-based hausdorff distance measures between images

Authors:
N. Sudha;E. P. Vivek
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Madras;Department of Computer Science and Engineering, Indian Institute of Technology, Madras
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 8
Cited 0

An image algorithm for computing the Hausdorff distance efficiently in linear time

Information Processing Letters
Computing the Hausdorff set distance in linear time for any Lp point distance

Information Processing Letters
Parallel computation of the Hausdorff distance between images

Parallel Computing
Comparing Images Using the Hausdorff Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Active Tracking Based on Hausdorff Matching

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 4
A robust and real-time texture analysis system using a distributed workstation cluster

ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04
Object matching algorithms using robust Hausdorff distance measures

IEEE Transactions on Image Processing
An efficient algorithm for video sequence matching using the modified Hausdorff distance and the directed divergence

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

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.