Skip navigation
Skip navigation

Discovering shape classes using tree edit-distance and pairwise clustering

Torsello, Andreas; Robles-Kelly, Antonio; Hancock, Edwin R

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
URI: http://hdl.handle.net/1885/28863
Source: International Journal of Computer Vision
DOI: 10.1007/s11263-006-8929-y

Download

File Description SizeFormat Image
01_Torsello_Discovering_shape_classes_2007.pdf828.77 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator