This paper describes an efficient algorithm for inexact graph matching. The method is purely
structural, that is, it uses only the edge or connectivity structure of the graph and does not …

We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows
for a qualitative abstraction based on a directed acyclic graph of components and also a …

This paper investigates the correspondence matching of point-sets using spectral graph
analysis. In particular, we are interested in the problem of how the modal analysis of point …

Hierarchical image structures are abundant in computer vision and have been used to
encode part structure, scale spaces, and a variety of multiresolution features. In this paper …

In 2004, I was a guest at the Center for Machine Perception at the Czech Technical
University. During my visit, a graduate student was kind enough to show me around Prague …

This paper presents a bibliography of over 2250 references related to computer vision and
image analysis, arranged by subject matter. The topics covered include computational …

Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also
known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics …

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 …

In this paper we study the manifold embedding of graphs resulting from the Young-
Householder decomposition of the heat kernel [19]. We aim to explore how the sectional …

With ever growing databases containing multimedia data, indexing has become a necessity
to avoid a linear search. We propose a novel technique for indexing multimedia databases …