Sciweavers

511 search results - page 10 / 103
» The intrinsic dimensionality of graphs
Sort
View
ICCV
2005
IEEE
14 years 3 months ago
Degenerate Cases and Closed-form Solutions for Camera Calibration with One-Dimensional Objects
Camera Calibration with one-dimensional objects is based on an algebraic constraint on the image of the absolute conic. We will give an alternative derivation to this constraint, ...
Pär Hammarstedt, Peter F. Sturm, Anders Heyde...
DGCI
2003
Springer
14 years 3 months ago
The Generation of N Dimensional Shape Primitives
This paper describes a method to accelerate the generation of shape primitives for N-dimensional images N X . These shape primitives can be used in conditions for topology preservi...
Pieter P. Jonker, Stina Svensson
DLT
2007
13 years 11 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 10 months ago
Learning Isometric Separation Maps
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
GD
1998
Springer
14 years 2 months ago
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
David R. Wood