Sciweavers

95 search results - page 3 / 19
» Modeling of Front Evolution with Graph Cut Optimization
Sort
View
MICCAI
2001
Springer
13 years 10 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...
ECCV
2006
Springer
14 years 7 months ago
An Integral Solution to Surface Evolution PDEs Via Geo-cuts
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, ...
3DPH
2009
190views Healthcare» more  3DPH 2009»
13 years 6 months ago
Vessels-Cut: A Graph Based Approach to Patient-Specific Carotid Arteries Modeling
We present a nearly automatic graph-based segmentation method for patient specific modeling of the aortic arch and carotid arteries from CTA scans for interventional radiology simu...
Moti Freiman, Noah Broide, Miriam Natanzon, Einav ...
CVPR
2009
IEEE
15 years 23 days ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICCV
2003
IEEE
14 years 7 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu