Sciweavers

187 search results - page 11 / 38
» On the Natural Imprint Function of a Graph
Sort
View
98
Voted
ECCV
2002
Springer
15 years 11 months ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
CP
2004
Springer
15 years 2 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
PAMI
2010
396views more  PAMI 2010»
14 years 8 months ago
Self-Validated Labeling of Markov Random Fields for Image Segmentation
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
Wei Feng, Jiaya Jia, Zhi-Qiang Liu
CVPR
2006
IEEE
15 years 3 months ago
Globally Optimal Grouping for Symmetric Boundaries
Many natural and man-made structures have a boundary that shows certain level of bilateral symmetry, a property that has been used to solve many computer-vision tasks. In this pap...
Joachim S. Stahl, Song Wang
SOFSEM
2007
Springer
15 years 3 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger