2013
DOI: 10.3788/ope.20132109.2464
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation of cell images based on improved graph MST and skeleton distance mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…Currently, traditional methods such as active contour models, watershed algorithms and graph cut algorithms [2][3][4][5], which are usually based on simple features and thresholding strategies, cannot deal with pathological images with drastic variations of nuclei density, blurred boundaries, overlapping targets, mitosis nucleus and sources from different organs. In recent years, deep learning methods have been widely applied to medical image segmentation due to the ability to learn representations of medical images with multiple levels of abstraction [6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…Currently, traditional methods such as active contour models, watershed algorithms and graph cut algorithms [2][3][4][5], which are usually based on simple features and thresholding strategies, cannot deal with pathological images with drastic variations of nuclei density, blurred boundaries, overlapping targets, mitosis nucleus and sources from different organs. In recent years, deep learning methods have been widely applied to medical image segmentation due to the ability to learn representations of medical images with multiple levels of abstraction [6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…Zhang et al [11] proposed an image segmentation method based on watershed and graph theory. Wang et al [12] adopted a new image segmentation algorithm based on graph theory and mathematical morphology. Fabijanska et al [13] used an improved algorithm based on minimum spanning tree, which can increase the speed of image segmentation by reducing the number of vertices in the graph.…”
Section: Introductionmentioning
confidence: 99%