快速有效的染色体自动分割算法

染色体的自动分割一直是一个难题 ,现在取得的成就大部分针对二体、三体的交叠、粘连情况 ,更多的染色体交叠、粘连问题还需要人机交互来解决。介绍一种基于边界几何分析的分割算法 ,算法第一步进行边界的提取和处理 ,提出了对内部空洞的处理方法 ,第二步进行凹点和凸点的搜索与标示 ,最后根据凹、凸点提供的几何信息对染色体进行逐步分割。该算法可以大大降低所需要的人机交互量和人机交互的难度 ,从而提高了染色体分析的自动化程度

Efficient algorithm for automatic segmentation of chromosomes

The automatic segmentation of chromosomes has been a difficult problem. The best results have been with only two or three chromosomes touching or overlapping. Artificial intellegence must be used for more than three chromosomes touching or overlapping. This paper describes an automatic segmentation algorithm based on the analysis of the chromosomal geometric characteristics. The first step in the algorithm is to identity the chromosome borders and to develop a method to deal with the inner hole. The second step is to mark the concave and convex points. Then, the algorithm segments the chromosomes based on the geometric information for the concave and convex points. The algorithm greatly reduces the completity of the artificial interference and improves the automation of the chromosome analysis.