Sciweavers

717 search results - page 6 / 144
» The Viewing Graph
Sort
View
GD
1995
Springer
13 years 11 months ago
Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
M. Sheelagh T. Carpendale, David J. Cowperthwaite,...
TIT
2011
109views more  TIT 2011»
13 years 2 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 ...
CVPR
2003
IEEE
14 years 9 months ago
The Viewing Graph
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
Noam Levi, Michael Werman
ICCV
2007
IEEE
14 years 9 months ago
Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
Sudipta N. Sinha, Philippos Mordohai, Marc Pollefe...
ICIP
2010
IEEE
13 years 5 months ago
View synthesis based on Conditional Random Fields and graph cuts
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
Lam C. Tran, Christopher J. Pal, Truong Q. Nguyen