Snakes on the Watershed

  • Authors:
  • Jaesang Park;James M. Keller

  • Affiliations:
  • Univ. of Missouri, Columbia;Univ. of Missouri, Columbia

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a new approach for object boundary extraction, called the watersnake. It is a two-step snake algorithm whose energy functional is minimized by the dynamic programming method. It is more robust to local minima because it finds the solution by searching the entire energy space. To reduce the complexity of the minimization process, the watershed transformation and a coarse-to-fine strategy are used. The new technique is compared to standard methods for accuracy in synthetic data and is applied to segmentation of white blood cells in bone marrow images.