Sciweavers

1261 search results - page 44 / 253
» Approximation algorithms for aligning points
Sort
View
65
Voted
PAMI
2008
189views more  PAMI 2008»
14 years 9 months ago
A Marked Point Process of Rectangles and Segments for Automatic Analysis of Digital Elevation Models
This work presents a framework for automatic feature extraction from images using stochastic geometry. Features in images are modeled as realizations of a spatial point process of ...
Mathias Ortner, Xavier Descombes, Josiane Zerubia
IPCO
2001
166views Optimization» more  IPCO 2001»
14 years 11 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
15 years 11 months ago
Substructure Clustering on Sequential 3d Object Datasets
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
Zhenqiang Tan, Anthony K. H. Tung
97
Voted
SEMWEB
2007
Springer
15 years 3 months ago
ASMOV Results for OAEI 2007
Numerous ontology alignment algorithms have appeared in the literature in recent years, but only a few make use of the semantics enclosed within the ontologies in order to improve ...
Yves R. Jean-Mary, Mansur R. Kabuka
CVPR
2009
IEEE
16 years 4 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...