Sciweavers

323 search results - page 38 / 65
» Interactive Organ Segmentation Using Graph Cuts
Sort
View
VISUALIZATION
2000
IEEE
13 years 12 months ago
Visualizing volume data using physical models
Visualization techniques enable scientists to interactively explore 3D data sets, segmenting and cutting them to reveal inner structure. While powerful, these techniques suffer fr...
David R. Nadeau, Michael J. Bailey
BIBE
2008
IEEE
121views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Joining retinal vessel segments
—A new method is introduced for joining vessel segments together to form a vessel graph. Using a reference image set from the Sunderland Eye Infirmary, we analysed the retinal b...
Bashir Al-Diri, Andrew Hunter, David Steel, Maged ...
CVPR
2010
IEEE
14 years 3 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
PR
2008
170views more  PR 2008»
13 years 7 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
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...