## Flux Maximizing Geometric Flows (2001)

Venue: | IEEE Transactions on Pattern Analysis and Machine Intelligence |

Citations: | 107 - 7 self |

### BibTeX

@ARTICLE{Vasilevskiy01fluxmaximizing,

author = {Alexander Vasilevskiy and Kaleem Siddiqi},

title = {Flux Maximizing Geometric Flows},

journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},

year = {2001},

volume = {24},

pages = {1565--1578}

}

### Years of Citing Articles

### OpenURL

### Abstract

Several geometric active contour models have been proposed for segmentation in computer vision and image analysis. The essential idea is to evolve a curve (in 2D) or a surface (in 3D) under constraints from image forces so that it clings to features of interest in an intensity image. Recent variations on this theme take into account properties of enclosed regions and allow for multiple curves or surfaces to be simultaneously represented. However, it is still unclear how to apply these techniques to images of narrow elongated structures, such as blood vessels, where intensity contrast may be low and reliable region statistics cannot be computed. To address this problem we derive the gradient flows which maximize the rate of increase of flux of an appropriate vector field through a curve (in 2D) or a surface (in 3D). The key idea is to exploit the direction of the vector field along with its magnitude. The calculations lead to a simple and elegant interpretation which is essentially parameter free and has the same form in both dimensions. We illustrate its advantages with several level-set based segmentations of 2D and 3D angiography images of blood vessels.