Sciweavers

43 search results - page 3 / 9
» Approximate Tree Matching and Shape Similarity
Sort
View
JCP
2008
162views more  JCP 2008»
13 years 5 months ago
Shape Recognition by Clustering and Matching of Skeletons
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
Hamidreza Zaboli, Mohammad Rahmati, Abdolreza Mirz...
EMMCVPR
2007
Springer
13 years 11 months ago
Shape Classification Based on Skeleton Path Similarity
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
Xingwei Yang, Xiang Bai, Deguang Yu, Longin Jan La...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 5 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ICDE
2002
IEEE
209views Database» more  ICDE 2002»
14 years 6 months ago
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
Ioannis Fudos, Leonidas Palios, Evaggelia Pitoura
ECCV
2002
Springer
14 years 7 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...