Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,197,181 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Active contour model
Binary image
Conditional random field
Correspondence problem
Expand
Broader (1)
Computer vision
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On the Exact Solution of the Minimal Controllability Problem
S. Pequito
,
Guilherme Ramos
,
S. Kar
,
Pedro M. Q. Aguiar
,
Jaime Ramos
2015
Corpus ID: 13029697
This paper studies the minimal controllability problem (MCP), i.e., the problem of, given a linear time-invariant system, finding…
Expand
2011
2011
Automatical vessel wall detection in intravascular coronary OCT
Kai-Pin Tung
,
W. Shi
,
R. Silva
,
P. Edwards
,
D. Rueckert
IEEE International Symposium on Biomedical…
2011
Corpus ID: 2232262
The aim of this study is to automatically detect the boundary of vessel walls in optical coherence tomography (OCT) sequences. We…
Expand
2009
2009
Graph Cut Based Point-Cloud Segmentation for Polygonal Reconstruction
David Sedláček
,
J. Zára
International Symposium on Visual Computing
2009
Corpus ID: 18253213
The reconstruction of 3D objects from a point-cloud is based on sufficient separation of the points representing objects of…
Expand
2008
2008
A new graph cut-based multiple active contour algorithm without initial contours and seed points
Jong-Sung Kim
,
K. Hong
Machine Vision and Applications
2008
Corpus ID: 1927210
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images…
Expand
2008
2008
Silhouette extraction based on iterative spatio-temporal local color transformation and graph-cut segmentation
Yasushi Makihara
,
Y. Yagi
International Conference on Pattern Recognition
2008
Corpus ID: 4649636
We propose an iterative scheme of spatio-temporal local color transformation of background and graph-cut segmentation for…
Expand
2007
2007
Texture Synthesis Method for Generic Video Sequences
P. Ndjiki-Nya
,
Christoph Stüber
,
T. Wiegand
IEEE International Conference on Image Processing
2007
Corpus ID: 7084558
An effective texture synthesis method is presented that is inspired by the work of Kwatra et al. [1]. Their algorithm is non…
Expand
2007
2007
Diffusion Maps and Geometric Harmonics for Automatic Target Recognition (ATR). Volume 2. Appendices
S. Zucker
,
R. Coifman
2007
Corpus ID: 33721827
Abstract : Geometric harmonics provides a framework for taking data in high-dimensional measurement spaces and embedding them in…
Expand
2007
2007
WarpCut - Fast Obstacle Segmentation in Monocular Video
A. Wedel
,
T. Schoenemann
,
T. Brox
,
D. Cremers
DAGM-Symposium
2007
Corpus ID: 100513
Autonomous collision avoidance in vehicles requires an accurate separation of obstacles from the background, particularly near…
Expand
Highly Cited
2006
Highly Cited
2006
Stereo based obstacle detection for an unmanned air vehicle
J. Byrne
,
Martin Cosgrove
,
R. Mehra
Proceedings IEEE International Conference on…
2006
Corpus ID: 1216098
This paper presents the visual threat awareness (VISTA) system for real time collision obstacle detection for an unmanned air…
Expand
2004
2004
Fast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning
Carlos Leung
,
B. Appleton
,
Changming Sun
British Machine Vision Conference
2004
Corpus ID: 9451005
The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE