Delaunay-supported edges for image graphs

Graphs are a powerful and versatile data structure for pattern recognition. However, their flexibility brings inherent complexities for algorithms which seek to create or utilise graphs. In the context of computer vision, many feature detection algorithms can extract a suitable vertex set from an image. The creation of edges between these vertices presents new challenges, and effective methods for edge creation only exist for certain types of vertices such as points and regions. This paper presents a novel method for creating edges for image graphs, while supporting a wide array of vertex types. The presented method is principled, and its robustness is shown experimentally against a number of affine and projective transforms, as well as noise.