Tunneling descent level set segmentation of ultrasound images

Authors:
Zhong Tao;Hemant D. Tagare
Affiliations:
Dept. of Electrical Engineering, Yale University, New Haven, CT;Dept. of Electrical Engineering, Yale University, New Haven, CT
Venue:
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
Year:
2005

Citing 4
Cited 0

Model-based image interpretation using genetic algorithms

Image and Vision Computing - Special issue: BMVC 1991
A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets

SIAM Journal on Numerical Analysis
Intensity-Invariant 2D+T Acoustic Boundary Detection

WBIA '98 Proceedings of the IEEE Workshop on Biomedical Image Analysis
Active contours without edges

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The presence of speckle in ultrasound images causes many spurious local minima in the energy function of active contours. These minima trap the segmentation prematurely under gradient descent and cause the algorithm to fail. This paper presents a substantially new reformulation of Tunneling Descent, which is a deterministic technique to escape from unwanted local minima. In the new formulation, the evolving curve is represented by level sets, and the evolution strategy is obtained as a sequence of constrained minimizations. The algorithm is used to segment the endocardium in 115 short axis cardiac ultrasound images. All segmentations are achieved without tweaking the energy function or numerical parameters. Experimental evaluation of the results shows that the algorithm overcomes multiple local minima to give segmentations that are considerably more accurate than conventional techniques.