Sciweavers

55 search results - page 3 / 11
» Linear Orderings of Random Geometric Graphs
Sort
View
ICCV
2007
IEEE
14 years 7 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
MICCAI
2010
Springer
13 years 3 months ago
Nonlinear Embedding towards Articulated Spine Shape Inference Using Higher-Order MRFs
In this paper we introduce a novel approach for inferring articulated spine models from images. A low-dimensional manifold embedding is created from a training set of prior mesh mo...
Samuel Kadoury, Nikos Paragios
PAMI
2007
176views more  PAMI 2007»
13 years 4 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
13 years 11 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 5 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett