Sciweavers

1605 search results - page 149 / 321
» On Partitional Labelings of Graphs
Sort
View
ICCV
2007
IEEE
15 years 10 days ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
ECCV
2010
Springer
14 years 3 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
TIT
2011
109views more  TIT 2011»
13 years 5 months ago
On Achieving Local View Capacity Via Maximal Independent Graph Scheduling
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...
Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh ...
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
14 years 4 months ago
Closing a Million-Landmarks Loop
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
Udo Frese, Lutz Schroder
ICPR
2010
IEEE
14 years 24 days ago
Entropy Estimation and Multi-Dimensional Scale Saliency
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
Pablo Suau, Francisco Escolano