Sciweavers

76 search results - page 11 / 16
» Interactive Graph Cut Based Segmentation with Shape Priors
Sort
View
CGF
2010
218views more  CGF 2010»
13 years 7 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
ECCV
2010
Springer
14 years 26 days ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
ICCV
2007
IEEE
14 years 9 months ago
Multi-Object Tracking Through Clutter Using Graph Cuts
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
MICCAI
2009
Springer
13 years 9 months ago
Optimal Graph Search Segmentation Using Arc-weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...
ECCV
2008
Springer
14 years 9 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...