Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly, tree edit distance is used to compute a dissimilarity between two given shapes. We present a new tree edit based shape matching method which uses a recent coarse skeleton representation. The coarse skeleton representation allows us to represent both shapes and shape categories in the form of depth-1 trees. Consequently, we can easily integrate the influence of the categories into shape dissimilarity measurements. The new dissimilarity measure gives a better within group versus between group separation, and it mimics the asymmetric nature of human similarity judgements
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for ...
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We c...
This paper describes two types of problems related to tree shapes, as well as algorithms that can be...
Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly,...
Shape is a significant visual clue for human perception and shape models show considerable promise a...
Shape is a significant visual clue for human perception and shape models show considerable promise a...
We present a framework for 2D shape contour (silhouette) comparison that can account for stretchings...
Shape matching is a difficult and important problem that remains unsolved. There are many applicatio...
Shape skeletons are commonly used in generic shape recognition as they capture part hierarchy, provi...
There is a growing need to be able to accurately and efficiently recognize similar models from exist...
In this thesis we aim to develop a framework for clustering trees and rep- resenting and learning a ...
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We c...
Skeletal shape representations, in spite of their structural instabilities, have proven themselves a...
Skeletons are often used as a framework for part-based shape description and matching. This paper de...
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for ...
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for ...
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We c...
This paper describes two types of problems related to tree shapes, as well as algorithms that can be...
Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly,...
Shape is a significant visual clue for human perception and shape models show considerable promise a...
Shape is a significant visual clue for human perception and shape models show considerable promise a...
We present a framework for 2D shape contour (silhouette) comparison that can account for stretchings...
Shape matching is a difficult and important problem that remains unsolved. There are many applicatio...
Shape skeletons are commonly used in generic shape recognition as they capture part hierarchy, provi...
There is a growing need to be able to accurately and efficiently recognize similar models from exist...
In this thesis we aim to develop a framework for clustering trees and rep- resenting and learning a ...
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We c...
Skeletal shape representations, in spite of their structural instabilities, have proven themselves a...
Skeletons are often used as a framework for part-based shape description and matching. This paper de...
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for ...
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for ...
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We c...
This paper describes two types of problems related to tree shapes, as well as algorithms that can be...