Matching vehicles using hubert scanning distance

Matching objects is a fundamental problem for any object detection system. Feature-based methods in matching objects such as vehicles often encounter the problem of correspondences between features of two related patterns. The features may be points, lines, curves and regions. Point pattern matching (PPM) is a primary and essential approach for establishing a correspondence within two related patterns. Although some well-known Hausdorff distance measures work well for this task, they are very computational expensive and suffer from the noise of images. In this paper, we propose a novel similarity measure using Hilbert curve named Hilbert scanning distance (HSD) to resolve the problems. This method computes the distance measure in one-dimensional (1-D) sequence in stead of in two-dimensional (2-D) image space, which greatly reduce the computational complexity. By applying a threshold elimination function, extreme distances caused by noise and position errors (e.g. those that occur with feature or edge extraction) are removed. The experimental results show that HSD can provide sufficient information for matching -vehicles within low computational complexity. We believe this point out a new direction for the research of PPM.