Sciweavers

302 search results - page 22 / 61
» Reducing graphs in graph cut segmentation
Sort
View
CVPR
2009
IEEE
16 years 7 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
MICCAI
2004
Springer
16 years 18 days ago
Clustering Fiber Traces Using Normalized Cuts
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to cre...
Anders Brun, Hans Knutsson, Hae-Jeong Park, Martha...

Publication
592views
16 years 8 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
CRV
2007
IEEE
231views Robotics» more  CRV 2007»
15 years 6 months ago
Establishing Visual Correspondence from Multi-Resolution Graph Cuts for Stereo-Motion
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
Joshua Worby, W. James MacLean
TVCG
2008
110views more  TVCG 2008»
14 years 11 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...