Shortest path based splitting line finding for touching cells.

A shortest path based algorithm is proposed in this paper to find splitting lines for touching cells. Firstly, an initial splitting line is obtained through the distance transform of a marker image and the watershed algorithm. Then, the initial splitting line is separated into different line segments if necessary, and the start and end points of these line segments act as the start and end points of shortest path. Finally, the shortest path algorithm is used to find the splitting line between the start and end points, and the final result of touching cells splitting can be formed by the contour of the touching cells and the splitting lines. Experimental results show that the proposed algorithm is efficient for different types of touching cells. [ABSTRACT FROM AUTHOR]