Sciweavers

99 search results - page 10 / 20
» Local polyhedra and geometric graphs
Sort
View
DCOSS
2006
Springer
15 years 3 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
CVPR
2007
IEEE
16 years 1 months ago
Learning GMRF Structures for Spatial Priors
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
Lie Gu, Eric P. Xing, Takeo Kanade
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 5 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
IJRR
2000
94views more  IJRR 2000»
14 years 11 months ago
Sensor-Based Exploration: Incremental Construction of the Hierarchical Generalized Voronoi Graph
This paper prescribes an incremental procedure to construct roadmaps of unknown environments. Recall that a roadmap is a geometric structure that a robot uses to plan a path betwe...
Howie Choset, Sean Walker, Kunnayut Eiamsa-Ard, Jo...
CVPR
2011
IEEE
14 years 8 months ago
From Partial Shape Matching through Local Deformation to Robust Global Shape Similarity for Object Detection
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
Tianyang Ma, LonginJan Latecki