Sciweavers

666 search results - page 39 / 134
» Unbalanced Graph Cuts
Sort
View
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
14 years 4 months ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 11 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
3DPH
2009
190views Healthcare» more  3DPH 2009»
13 years 11 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 ...
ISBI
2011
IEEE
13 years 1 months ago
Automatic segmentation of the left-ventricular cavity and atrium in 3D ultrasound using graph cuts and the radial symmetry trans
In this paper, we propose a graph-based method for fullyautomatic segmentation of the left ventricle and atrium in 3D ultrasound (3DUS) volumes. Our method requires no user input ...
Radford Juang, Elliot R. McVeigh, Beatrice Hoffman...
CVPR
2005
IEEE
15 years 1 days ago
Multi-View Stereo via Volumetric Graph-Cuts
George Vogiatzis, Philip H. S. Torr, Roberto Cipol...