Sciweavers

43 search results - page 4 / 9
» Approximate Tree Matching and Shape Similarity
Sort
View
ICPR
2002
IEEE
14 years 7 months ago
Shape Representation Using Concavity Graphs
In this paper, a new graph data structure for 2-D shape representation is proposed. The new structure is called a concavity graph, and is an evolution from the already known "...
Ossama El Badawy, Mohamed Kamel
ICIP
2006
IEEE
14 years 8 months ago
A New Method for Boundary-Based Shape Matching and Retrieval
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
Minh-Son Dao, Raffaele de Amicis
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
14 years 19 days ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
ACL
2007
13 years 7 months ago
A Grammar-driven Convolution Tree Kernel for Semantic Role Classification
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate s...
Min Zhang, Wanxiang Che, AiTi Aw, Chew Lim Tan, Gu...
ECAI
2008
Springer
13 years 8 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...