2018
DOI: 10.1109/rbme.2018.2798701
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Graph Cuts/Graph Search Based Medical Image Segmentation

Abstract: Medical image segmentation is a fundamental and challenging problem for analyzing medical images. Among different existing medical image segmentation methods, graph-based approaches are relatively new and show good features in clinical applications. In the graph-based method, pixels or regions in the original image are interpreted into nodes in a graph. By considering Markov random field to model the contexture information of the image, the medical image segmentation problem can be transformed into a graph-bas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 95 publications
(51 citation statements)
references
References 115 publications
0
51
0
Order By: Relevance
“…Graph-based methods may encode global image information, thus allowing the use of contextual information. 64 In practice, the segmentation problem is transformed into a "vertex-labeling" or "graph-partitioning" problem that requires assigning correct labels to each node of the graph according to its properties. 65 Although the nodes of the graph most commonly are the image pixels or voxels, other types of vertices can also be used to construct the graph, such as region-or user-specific markers.…”
Section: Graph-based Methodsmentioning
confidence: 99%
“…Graph-based methods may encode global image information, thus allowing the use of contextual information. 64 In practice, the segmentation problem is transformed into a "vertex-labeling" or "graph-partitioning" problem that requires assigning correct labels to each node of the graph according to its properties. 65 Although the nodes of the graph most commonly are the image pixels or voxels, other types of vertices can also be used to construct the graph, such as region-or user-specific markers.…”
Section: Graph-based Methodsmentioning
confidence: 99%
“…Mesh vertices are then moved to the position associated with the outermost node in their normal aligned columns which is in S. The s-t cut is often computed with the efficient algorithm by Boykov and Kolmogorov [3]. Furthermore, several extensions to this basic construction have since been developed [4].…”
Section: Surface Fitting With Graph Cutsmentioning
confidence: 99%
“…Binarization process isolates background pixels from foreground pixels based on the threshold value of luminance. Clustering based, histogram based are the generally known thresholding methods [11][12][13]. More progressive methods include graph cut and level set based, but these lead to more computational complexity [12,14,15].…”
Section: Binary Conversionmentioning
confidence: 99%
“…Clustering based, histogram based are the generally known thresholding methods [11][12][13]. More progressive methods include graph cut and level set based, but these lead to more computational complexity [12,14,15]. Here a basic thresholding method was applied where pixels in input image having luminance value greater than threshold value are replaced with value 1, while rest of the pixels is replaced with value 0.…”
Section: Binary Conversionmentioning
confidence: 99%