Sciweavers

302 search results - page 20 / 61
» Reducing graphs in graph cut segmentation
Sort
View
TSMC
2008
138views more  TSMC 2008»
14 years 11 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...
EVOW
2004
Springer
15 years 5 months ago
Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
Abraham Duarte, Ángel Sánchez, Felip...
ICIP
2010
IEEE
14 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
88
Voted
ICPR
2008
IEEE
16 years 28 days ago
Segmentation by combining parametric optical flow with a color model
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
Adrian Ulges, Thomas M. Breuel
PAMI
2007
202views more  PAMI 2007»
14 years 11 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