Sciweavers

241 search results - page 7 / 49
» Geodesic Graph Cut for Interactive Image Segmentation
Sort
View
ACIVS
2006
Springer
15 years 3 months ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...
MM
2006
ACM
103views Multimedia» more  MM 2006»
15 years 3 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...
ECCV
2008
Springer
15 years 11 months ago
GeoS: Geodesic Image Segmentation
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
Antonio Criminisi, Toby Sharp, Andrew Blake
ECCV
2010
Springer
15 years 2 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...
MICCAI
2010
Springer
14 years 8 months ago
Joint Registration and Segmentation of Dynamic Cardiac Perfusion Images Using MRFs
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
Dwarikanath Mahapatra, Ying Sun