adaptive boundary detection, two-dimensional dynamic programming
An adaptive boundary detection algorithm that uses two-dimensional dynamic programming is presented. The algorithm is less constrained than previous one-dimensional dynamic programming algorithms and allows the user to interactively determine the mathematically optimal boundary between a user-selected seed point and any other dynamically selected "free” point in the image. Interactive movement of the free point by the cursor causes the boundary to behave like a “live wire” as it adapts to the new minimum cost path between the seed point and the currently selected free point. The algorithm can also be adapted or customized to learn boundary-defining features for a particular class of images. Adaptive 2D DP performs well on a variety of images (angiocardiograms, CT, MRI). In particular, it accurately detects the boundaries of low contrast objects, such as occur with intravenous injections, as well as those found in noisy, low SNR images.
Original Publication Citation
E. N. Mortensen, B. S. Morse,W. A. Barrett, and J. K. Udupa, "Adaptive boundary dectection using 'livewire' two- dimensional dynamic programming," in IEEE Proceedings of Computers in Cardiology, pp. 635-638, October 1992.
BYU ScholarsArchive Citation
Barrett, William A.; Morse, Bryan S.; Mortensen, Eric N.; and Udupa, Jayaram, "Adaptive Boundary Detection Using “Live-Wire” Two-Dimensional Dynamic Programming" (1992). Faculty Publications. 713.
Physical and Mathematical Sciences
© 1992 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information