AREA AND LENGTH MINIMIZING FLOWS FOR SHAPE SEGMENTATION

Citation
K. Siddiqi et al., AREA AND LENGTH MINIMIZING FLOWS FOR SHAPE SEGMENTATION, IEEE transactions on image processing, 7(3), 1998, pp. 433-443
Citations number
30
Categorie Soggetti
Computer Science Software Graphycs Programming","Computer Science Theory & Methods","Engineering, Eletrical & Electronic","Computer Science Software Graphycs Programming","Computer Science Theory & Methods
ISSN journal
10577149
Volume
7
Issue
3
Year of publication
1998
Pages
433 - 443
Database
ISI
SICI code
1057-7149(1998)7:3<433:AALMFF>2.0.ZU;2-0
Abstract
A number of active contour models have been proposed that unify the cu rve evolution framework with classical energy minimization techniques for segmentation, such as snakes, The essential idea is to evolve a cu rve (in two dimensions) or a surface (in three dimensions) under const raints from image forces so that it clings to features of interest in an intensity image, Recently, the evolution equation has been derived from first principles as the gradient dow that minimizes a modified le ngth functional, tailored to features such as edges, However, because the how may be slow to converge in practice, a constant (hyperbolic) t erm is added to keep the curve/surface moving in the desired direction , In this paper, we derive a modification of this term based on the gr adient how derived from a weighted area functional, with image depende nt weighting factor, When combined with the earlier modified Length gr adient dow, we obtain a partial differential equation (PDE) that offer s a number of advantages, as illustrated by several examples of shape segmentation on medical images. In many cases the weighted area how ma y be used on its own, with significant computational savings.