Distance between images

Abstract

The authors compare two methods which compute an approximation to the Hausdorff distance between pairs of binary images. They also implement a parallel vision of one of the methods, which can provide a fast image distance algorithm to calibrate algorithms performing such tasks as image recognition, image compression, or image browsing. For this purpose, they have shown a simple application of selecting the best iteration of a region growing algorithm which yields edge images by comparing them to a Canny edge detector.<>