Sciweavers

244 search results - page 18 / 49
» Image Thresholding Using Graph Cuts
Sort
View
ECCV
2010
Springer
14 years 4 months 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...
TMI
2010
134views more  TMI 2010»
13 years 5 months ago
Mitral Annulus Segmentation From 3D Ultrasound Using Graph Cuts
The shape of the mitral valve annulus is used in diagnostic and modeling applications, yet methods to accurately and reproducibly delineate the annulus are limited. This paper pres...
Robert Schneider, Douglas P. Perrin, Nikolay V. Va...
CVPR
2011
IEEE
13 years 6 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
Ryan Kennedy, Jean Gallier, Jianbo Shi
ICCV
2003
IEEE
15 years 25 days 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
ICIP
2010
IEEE
13 years 9 months ago
View synthesis based on Conditional Random Fields and graph cuts
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
Lam C. Tran, Christopher J. Pal, Truong Q. Nguyen