Sciweavers

605 search results - page 35 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
GEOINFORMATICA
1998
96views more  GEOINFORMATICA 1998»
13 years 7 months ago
Experiments with Learning Techniques for Spatial Model Enrichment and Line Generalization
The nature of map generalization may be non-uniform along the length of an individual line, requiring the application of methods that adapt to the local geometry and the geographi...
Corinne Plazanet, Nara Martini Bigolin, Anne Ruas
COMPGEOM
2010
ACM
14 years 23 days ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
PAMI
1998
107views more  PAMI 1998»
13 years 7 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
CVPR
2004
IEEE
14 years 9 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
ECCV
2008
Springer
14 years 9 months ago
Scale-Dependent/Invariant Local 3D Shape Descriptors for Fully Automatic Registration of Multiple Sets of Range Images
Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
John Novatnack, Ko Nishino