A High-Speed VLSI Array Architecture for Euclidean Metric-Based Hausdorff Distance Measures Between Images
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.
KeywordsBinary Image Object Tracking Video Surveillance Foreground Pixel Clock Pulse
Unable to display preview. Download preview PDF.
- 4.Ayala-Ramírez, V., Parra, C., Devy, M.: Active tracking based on hausdorff matching. In: ICPR, pp. 4706–4709 (2000)Google Scholar
- 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