An improved watershed algorithm based on efficient computation of shortest paths

The present paper describes a new algorithm to calculate the watershed transform through rain simulation of greyscale digital images by means of pixel arrowing. The efficiency of this method is based on limiting the necessary neighbouring operations to compute the transform to the outmost, and in the total number of scannings performed over the whole image. The experiments demonstrate that the proposed algorithm is able to significantly reduce the running time of the fastest known algorithm without involving any loss of efficiency.