COILYORK

Dissimilarity dataset.

    D = COILYORK

This is a dissimilarity matrix between set of graphs derived from four  objects of the COIL database computed by Richard Wilson. The graphs are  the Delaunay triangulations derived from corner points found in these  images, see [Xia and Hancock]. The distance matrix is constructed by  graph matching, using the algorithm of [Gold and Ranguranjan]

Reference(s)

B. Xiao and E. R. Hancock. Geometric characterisation of graphs. ICIAP 2005, LNCS 3617:471-478, 2005

S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:377-388, 1996.

See also

prtools, datasets, prdisdata,