Sciweavers

23 search results - page 1 / 5
» Graph-cut optimization of the ratio of functions and its app...
Sort
View
IJCV
2006
299views more  IJCV 2006»
13 years 4 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
ICIP
2008
IEEE
13 years 11 months ago
Graph-cut optimization of the ratio of functions and its application to image segmentation
Optimizing the ratio of two functions of binary variables is a common task in many image analysis applications. In general, such a ratio is not amenable to graph-cut based optimiz...
Hui Wang, Nilanjan Ray, Hong Zhang
PAMI
2007
202views more  PAMI 2007»
13 years 4 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ECCV
2008
Springer
14 years 6 months ago
Star Shape Prior for Graph-Cut Image Segmentation
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...
Olga Veksler
ICIP
2005
IEEE
13 years 10 months ago
Graph cut based segmentation of convoluted objects
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
Alex Yong Sang Chia, Vitali Zagorodnov