软件导刊Issue(12)：44-45,2.DOI:10.11907/rjdk.143584
Graph Cuts算法实现过程中的关键问题研究
The Study of Key Issues for Graph Cuts Realization
张晓峰1
作者信息
- 1. 南通大学计算机科学与技术学院，江苏南通226019
- 折叠
摘要
Abstract
Graph Cuts (GC) algorithm is an interactive method for object detection based on Graph theory .This algorithm translates image segmentation into a model which is composed of region properties and boundary properties .Then a min cut is obtained by a optimal algorithm for object segmentation .Because the deep theory of GC algorithm ,many difficulties will occur in its realization .In this paper ,the realization of GC algorithm is clearly described ,which make a fundament for further research of GC model .关键词
目标提取/Graph Cuts/优化分割Key words
Object Detection/Graph Cuts/Optimal Segmentation分类
信息技术与安全科学引用本文复制引用
张晓峰..Graph Cuts算法实现过程中的关键问题研究[J].软件导刊,2014,(12):44-45,2.
