Sciweavers

241 search results - page 41 / 49
» Geodesic Graph Cut for Interactive Image Segmentation
Sort
View
ACCV
2010
Springer
14 years 6 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
CVPR
2007
IEEE
16 years 1 months ago
Modelling Objects using Distribution and Topology of Multiscale Region Pairs
We propose a method for simultaneous detection, localization and segmentation of objects of a known category. We show that this is possible by using segments as features. To this ...
Himanshu Arora, Narendra Ahuja
PR
2008
170views more  PR 2008»
14 years 11 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...
CVPR
2010
IEEE
15 years 8 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
15 years 5 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002