Sciweavers

759 search results - page 20 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
MICCAI
2001
Springer
15 years 2 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...
AI
2011
Springer
14 years 4 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
EMMCVPR
2007
Springer
15 years 1 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
CVPR
2004
IEEE
15 years 11 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
ICCV
2007
IEEE
15 years 11 months ago
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
Ali Kemal Sinop, Leo Grady