Sciweavers

160 search results - page 8 / 32
» A New Algorithm for Inexact Graph Matching
Sort
View
SEMWEB
2007
Springer
14 years 5 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
14 years 3 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
VCIP
2003
146views Communications» more  VCIP 2003»
14 years 7 days ago
A segmentation system with model-assisted completion of video objects
This paper presents a new algorithm for video-object segmentation, which combines motion-based segmentation, high-level object-model detection, and spatial segmentation into a sin...
Dirk Farin, Peter H. N. de With, Wolfgang Effelsbe...
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
14 years 4 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo
CVPR
2009
IEEE
15 years 6 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu