Abstract: The segmentation speed is a bottleneck of application of interactive algorithm in the interactive segmentation of serial medical images. This paper provided an interactive medical image segmentation algorithm based on pairing heap. The time complexity of procedure of searching the shortest path dynamically of Liv}Wire was decreased by paring heap implementing degradable prior-queue. Algorithm analysis and experiment in radiation therapy plan system indicate that the algorithm can improve the segmentation efficiency of serial medical images.

Key words: Medical image, Live-Wire algorithm, Interactive segmentation, Paring heap