Sciweavers

1348 search results - page 43 / 270
» Matching planar maps
Sort
View
ICIP
2007
IEEE
14 years 11 months ago
Region-Based Dense Depth Extraction from Multi-View Video
A novel multi-view region-based dense depth map estimation problem is presented, based on a modified planesweeping strategy. In this approach, the whole scene is assumed to be reg...
Cevahir Cigla, Xenophon Zabulis, A. Aydin Alatan
ICPR
2006
IEEE
14 years 11 months ago
Chaining Planar Homographies for Fast and Reliable 3D Plane Tracking
This paper addresses the problem of tracking a 3D plane over a sequence of images acquired by a free moving camera, a task that is of central importance to a wide variety of visio...
Manolis I. A. Lourakis, Antonis A. Argyros
FCT
2009
Springer
14 years 4 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
CAEPIA
2007
Springer
14 years 4 months ago
Interest Point Detectors for Visual SLAM
In this paper we present several interest points detectors and we analyze their suitability when used as landmark extractors for vision-based simultaneous localization and mapping ...
Óscar Martínez Mozos, Arturo Gil, M&...
DCG
2010
73views more  DCG 2010»
13 years 10 months ago
Optimal Angle Bounds for Quadrilateral Meshes
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classifica...
Christopher J. Bishop