2013
DOI: 10.1111/jmi.12096
|View full text |Cite
|
Sign up to set email alerts
|

Dense nuclei segmentation based on graph cut and convexity–concavity analysis

Abstract: SummaryWith the rapid advancement of 3D confocal imaging technology, more and more 3D cellular images will be available. However, robust and automatic extraction of nuclei shape may be hindered by a highly cluttered environment, as for example, in fly eye tissues. In this paper, we present a novel and efficient nuclei segmentation algorithm based on the combination of graph cut and convex shape assumption. The main characteristic of the algorithm is that it segments nuclei foreground using a graph-cut algorith… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(11 citation statements)
references
References 21 publications
(87 reference statements)
0
10
0
Order By: Relevance
“…A large pool of powerful cell nuclei segmentation methods exists, including iterative thresholding24, level sets25, graph cut26, gradient flow tracking27, lines-of-sight28 or watershed methods29. Identifying the approach that is appropriate for a wide variety of datasets, fast and robust with respect to high cell density, as well as variations in cell nuclei volume, shape and dye distribution, has become a major challenge in image analysis.…”
mentioning
confidence: 99%
“…A large pool of powerful cell nuclei segmentation methods exists, including iterative thresholding24, level sets25, graph cut26, gradient flow tracking27, lines-of-sight28 or watershed methods29. Identifying the approach that is appropriate for a wide variety of datasets, fast and robust with respect to high cell density, as well as variations in cell nuclei volume, shape and dye distribution, has become a major challenge in image analysis.…”
mentioning
confidence: 99%
“…One reason for the robustness is, that the decomposition is performed directly on the three-dimensional objects rather than applying it on each two-dimensional slice independently like in [ 47 ] or [ 19 ]. Incorporating the three-dimensional information provides more accurate decomposition of apparently touching cell nuclei.…”
Section: Pre-processingmentioning
confidence: 99%
“…Three-dimensional cell nuclei segmentation methods commonly rely on pre-processing steps (e.g. filtering, initial thresholding or seed detection) combined with watershed ([ 15 – 17 ]), graph cut ([ 18 , 19 ]), machine learning ([ 20 , 21 ]), gradient flow tracking [ 22 ], active surface models [ 23 ], level set [ 24 ], or concavity-based segmentation ([ 25 , 26 ]). But despite the continual progress in three-dimensional cell nuclei segmentation, there is still a need to improve accuracy, level of automation and adaptability.…”
Section: Introductionmentioning
confidence: 99%
“…Mathematical morphology (Nedzved et al, 2000;Shu et al, 2013) can be applied to segment partially touching cells using the opening operation or the ultimate residues, but only strives in low-density regions. Approach based on concavity detection (Bai et al, 2008;Kothari et al, 2009;Zhang et al, 2013;Qi, 2014;Riccio et al, 2019) allows concave points on the contours of touching cells to be detected. Touching cells can be optimally separated using ellipse registration or a distance transformation algorithm, but false concave points due to noise are often present.…”
Section: Introductionmentioning
confidence: 99%