Sciweavers

27 search results - page 3 / 6
» Succinct representations of planar maps
Sort
View
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
13 years 8 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...
CVPR
2005
IEEE
14 years 10 months ago
A SIFT Descriptor with Global Context
Matching points between multiple images of a scene is a vital component of many computer vision tasks. Point matching involves creating a succinct and discriminative descriptor fo...
Eric N. Mortensen, Hongli Deng, Linda G. Shapiro
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 1 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
TMI
2010
167views more  TMI 2010»
13 years 3 months ago
Two-Dimensional Intraventricular Flow Mapping by Digital Processing Conventional Color-Doppler Echocardiography Images
Abstract--Doppler echocardiography remains the most extended clinical modality for the evaluation of left ventricular (LV) function. Current Doppler ultrasound methods, however, ar...
Damien Garcia, Juan C. del Álamo, David Tan...
CVPR
2008
IEEE
13 years 8 months ago
Hallucinating 3D facial shapes
This paper focuses on hallucinating a facial shape from a low-resolution 3D facial shape. Firstly, we give a constrained conformal embedding of 3D shape in R2 , which establishes ...
Gang Pan, Song Han, Zhaohui Wu