Sciweavers

759 search results - page 29 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
PAMI
2007
169views more  PAMI 2007»
14 years 9 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
94
Voted
CVPR
2005
IEEE
15 years 11 months ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...
ECCV
2008
Springer
15 years 8 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
83
Voted
FOCS
2008
IEEE
15 years 4 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
EVOW
2007
Springer
15 years 3 months ago
Iterated k-Opt Local Search for the Maximum Clique Problem
Abstract. This paper presents a simple iterated local search metaheuristic incorporating a k-opt local search (KLS), called Iterated KLS (IKLS for short), for solving the maximum c...
Kengo Katayama, Masashi Sadamatsu, Hiroyuki Narihi...