Min-Cut/Max-Flow Segmentation of Hydrocephalus in Children from CT Datasets

被引：0

作者：

Weglinski, Tomasz ^{[1
]}

Fabijanska, Anna ^{[1
]}

机构：

[1] Lodz Univ Technol, Inst Appl Comp Sci, PL-90924 Lodz, Poland

来源：

2012 INTERNATIONAL CONFERENCE ON SIGNALS AND ELECTRONIC SYSTEMS (ICSES) | 2012年

关键词：

VENTRICULAR SYSTEM; VOLUME; SIZE;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper considers the problem of assessment of hydrocephalus in children using image processing and analysis algorithms. In particular, problem of lesion segmentation from CT brain scans is regarded. An approach for hydrocephalus segmentation based on min-cut/max-flow algorithm is pro-posed. Images after segmentation are next used to determine the volume of the lesion. Results of the proposed approach are presented, compared with the previous approaches proposed by the authors and discussed.

引用

页数：6

共 50 条

[41] Examples of max-flow and min-cut problems with duality gaps in continuous networks
Nozawa, Ryohei
Mathematical Programming, Series B, 1994, 63 (02): : 213 - 234
[42] EXAMPLES OF MAX-FLOW AND MIN-CUT PROBLEMS WITH DUALITY GAPS IN CONTINUOUS NETWORKS
NOZAWA, R
MATHEMATICAL PROGRAMMING, 1994, 63 (02) : 213 - 234
[43] A tight max-flow min-cut duality theorem for nonlinear multicommodity flows
Broussard, Matthew
Krishnamoorthy, Bala
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (04)
[44] ON MAX-FLOW MIN-CUT AND INTEGRAL FLOW PROPERTIES FOR MULTICOMMODITY FLOWS IN DIRECTED NETWORKS
NAGAMOCHI, H
IBARAKI, T
INFORMATION PROCESSING LETTERS, 1989, 31 (06) : 279 - 285
[45] Review of Serial and Parallel Min-Cut/Max-Flow Algorithms for Computer Vision
Jensen, Patrick M. M.
Jeppesen, Niels
Dahl, Anders B. B.
Dahl, Vedrana A. A.
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (02) : 2310 - 2329
[46] Finding Better Web Communities in Digraphs via Max-Flow Min-Cut
Chan, Chung
Al-Bashabsheh, Ali
Tam, Da Sun Handason
Zhao, Chao
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 410 - 414
[47] Geographic max-flow and min-cut under a circular disk failure model
Neumayer, Sebastian
Efrat, Alon
Modiano, Eytan
COMPUTER NETWORKS, 2015, 77 : 117 - 127
[48] Geographic Max-Flow and Min-Cut Under a Circular Disk Failure Model
Neumayer, Sebastian
Efrat, Alon
Modiano, Eytan
2012 PROCEEDINGS IEEE INFOCOM, 2012, : 2736 - 2740
[49] Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T
Rao, S
JOURNAL OF THE ACM, 1999, 46 (06) : 787 - 832
[50] An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
Boykov, Y
Kolmogorov, V
ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, 2001, 2134 : 359 - 374

← 1 2 3 4 5 →