This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. We show how to transform the tree edit distance problem into a series of maximum weight clique problems, and show how to use relaxation labeling to find an approximate solution. This allows us to compute a set of pairwise distances between graph-structures. We show how the edit distances can be used to compute a matrix of pairwise affinities using χ² statistics. We present a maximum likelihood method for clustering the graphs by iteratively updating the elements of the affinity matrix. This involves interleaved steps for updating the affinity matrix using an eigendecomposition method and updating the cluster membership indicators. We illustrate the new tree clustering framework on shock-graphs extracted from the silhouettes of 2D shapes.
|Data di pubblicazione:||2007|
|Titolo:||Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering|
|Rivista:||INTERNATIONAL JOURNAL OF COMPUTER VISION|
|Appare nelle tipologie:||2.1 Articolo su rivista |