Open AccessA dicentric chromosome identification method based on clustering and watershed algorithm
Author(s) -
Xiang Shen,
Yafeng Qi,
Tianshu Ma,
Zhenggan Zhou
Publication year - 2019
Publication title -
scientific reports
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.24
H-Index - 213
ISSN - 2045-2322
DOI - 10.1038/s41598-019-38614-7
Subject(s) - dicentric chromosome , cluster analysis , chromosome , identification (biology) , algorithm , computer science , mathematics , pattern recognition (psychology) , biology , artificial intelligence , karyotype , genetics , gene , botany
Aiming at the problem of low efficiency of dicentric chromosome identification counting under the microscope, this paper presents a joint processing algorithm combining clustering and watershed. The method first uses clustering and watershed algorithm to segment the original chromosome image, and then identifies the individual chromosomes. The results show that when the equivalent width Y parameter is selected m = 1, n = 1, the true positive rate of dicentric chromosome identification is 76.6%, and positive predictive value is 76.6% in high dose, which is higher than the threshold algorithm for the true positive rate (63.9%) and positive predictive value (63.5%). The number of identified dicentric chromosomes can be used for dose estimation. When 500 cells are used for identification and dose estimation, the dose estimation pass rate can reach 80% in high dose. But for low dose, more cells should be used to identify to increase the dose estimation pass rate.