介绍了应用链码分析边界形状的新方法，通过引入相对链码与绝对链码概念得到了计算链码和（平均链码）的简捷算法，边界上连续3点的绝对链码之和可以表示边界点的切线方向（斜率），进入和离开边界的3点链码和之差可以表示边界的曲率，同时给出了利用这些参数判别边界角点，边界光滑段的判据，以及估算曲率半径、等效周长的方法。最后，以细胞边界凹陷的修补和重叠细胞粘连的分割为例介绍了算法具体的使用，该算法在3类细胞中采集到的20余组粘连和缺损细胞上进行了验证，结果表明，该算法处理速度快，分割效果良好。

This dissertation expands on a new algorithm, which has the function of analyzing edge form with the chain code. By the introduction of the concepts of relative chain code and absolute chain code, we proposed a simple and direct algorithm to compute chain code sum(average chain code). We found that tangent direction(slope) of edge point can be figured by the absolute chain code sum of three sequential points and curvature of edge can be figured by the difference of chain code sum between the three sequential points ingoing and outgoing. Furthermore, we provided the criterion distinguishing edge inflexion and sleek curve section and the method computing inaccurately curvature radius and approximate perimeter. In the end of the paper, we introduced the use method with cell edge hollow repairing and overlap or conglutination cell segmenting for example. This algorithm has proved high speed and has a good effect of cell segmention on more than twenty groups of conglutinate and absent cells which are gathered from three kinds of cells.