241 search results - page 5 / 49 » Geodesic Graph Cut for Interactive Image Segmentation |
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
In many neurophysiological studies, understanding the neuronal circuitry of the brain requires detailed 3D models of the nerve cells and their synapses. Typically, researchers bui...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Interactive graph cuts are widely used in object segmentation but with some disadvantages: 1) Manual interactions may cause inaccurate or even incorrect segmentation results and i...
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
ICPR
2008
IEEE
15 years 3 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
107
click to vote
EMMCVPR
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...