The Improvement of the Processes of a Class of Graph-Cut-Based Image Segmentation Algorithms Shengxiao NIUGengsheng CHEN
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2016/12/01 Vol. E99-DNo. 12 ;
pp. 3053-3059 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: graph cut, image segmentation, energy function, maximum flow,
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/06/01 Vol. E93-DNo. 6 ;
pp. 1512-1520 Type of Manuscript: PAPER Category: Data Engineering, Web Information Systems Keyword: content delivery network, incremental algorithm, maximum flow,
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2003/02/01 Vol. E86-DNo. 2 ;
pp. 179-185 Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium) Category: Graph Algorithms Keyword: graph, minimum cut, algorithm, cactus, maximum adjacency ordering, connectivity, maximum flow,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/12/25 Vol. E75-ANo. 12 ;
pp. 1785-1792 Type of Manuscript: PAPER Category: Graphs, Networks and Matroids Keyword: graphs and networks, maximum flow, edge addition, vertex-capacitated, undirected,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/06/25 Vol. E75-ANo. 6 ;
pp. 678-684 Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1991 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '91)) Category: Combinational/Numerical/Graphic Algorithms Keyword: graphs and networks, flow network, location theory, covering problem, maximum flow,