Skip to search formSkip to main contentSkip to account menu

Graph cuts in computer vision

Known as: Graph cut, Graph cut segmentation 
As applied in the field of computer vision, graph cuts can be employed to efficiently solve a wide variety of low-level computer vision problems… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
This paper studies the minimal controllability problem (MCP), i.e., the problem of, given a linear time-invariant system, finding… 
2013
2013
Many road detection algorithms require pre-learned information, which may be unreliable as the road scene is usually unexpectable… 
2011
2011
The aim of this study is to automatically detect the boundary of vessel walls in optical coherence tomography (OCT) sequences. We… 
2011
2011
Methods of interacting with stereo image pairs are important for handling the increasing amount of stereoscopic 3D data now being… 
2008
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images… 
2008
2008
We propose an iterative scheme of spatio-temporal local color transformation of background and graph-cut segmentation for… 
2007
2007
An effective texture synthesis method is presented that is inspired by the work of Kwatra et al. [1]. Their algorithm is non… 
2007
2007
Abstract : Geometric harmonics provides a framework for taking data in high-dimensional measurement spaces and embedding them in… 
Highly Cited
2006
Highly Cited
2006
This paper presents the visual threat awareness (VISTA) system for real time collision obstacle detection for an unmanned air… 
1998
1998
This paper proposes a way to incorporate a priori information in a 3D stereo reconstruction process from a pair of calibrated…