Abstract
We present an interactive tool for efficient, accurate, and reproducible boundary extraction which requires minimal user input with a mouse. Optimal boundaries are computed and selected at interactive rates as the user moves the mouse starting from a user-selected seed point. When the mouse position comes in proximity to an object edge, a “live-wire” boundary snaps to, and wraps around the object of interest. Input of a new seed point “freezes” the selected boundary segment, and the process is repeated until the boundary is complete. Data-driven boundary cooling generates seed points automatically and further reduces user input. On-the-fly training adapts the dynamic boundary to edges of current interest.
Using the “boundary snapping” technique, boundaries are extracted in one-fifth of the time required for manual tracing, but with 4.4 times greater accuracy and 4.8 times greater reproducibility. In particular, interobserver reproducibility using boundary snapping is 3.8 times greater than intraobserver reproducibility using manual tracing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.F. O'Brien and N.F. Ezquerra, “Automated Segmentation of Coronary Vessels in Angiographic Image Sequences Utilizing Temporal, Spatial and Structural Constraints,” VBC'94, SPIE Vol. 2359, pp. 25–37, October, 1994.
M. Gleicher, “Image Snapping,” Comp. Graphics SIGGRAPH '95 Proc. pp. 191–198.
Y. P. Chien and K. S. Fu, “A Decision Function Method for Boundary Detection,” Computer Graphics and Image Processing, Vol. 3, No. 2, pp. 125–140, June 1974.
A. Martelli, “An Application of Heuristic Search Methods to Edge and Contour Detection,” Communications of the ACM Vol.19, No. 2, pp. 73–83, February 1976.
D.L. Pope et. al., “Dynamic Search Algorithms in Left Ventricular Border Recognition and Analysis of Coronary Arteries,” IEEE Computers in Cardiology, pp. 71–75, 1984.
D. H. Ballard and C. M. Brown, Computer Vision, Prentice Hall, 1982.
U. Montanari, “On the Optimal Detection of Curves in Noisy Pictures,” Communications of the ACM, Vol. 14, No. 5, pp. 335–345, May 1971.
A.A. Amini et. al., “Using Dynamic Programming for Solving Variational Problems in Vision.” PAMI, Vol. 12, no. 2, pp. 855–866, Sept., 1990.
D. Daneels, et al., “Interactive Outlining: An Improved Approach Using Active Contours,” SPIE Proceedings of Storage and Retrieval for Image and Video Databases, vol. 1908, pp. 226–233, Feb. 1993.
M. Kass et. Al., “Snakes: Active Contour Models,” Proceedings of the First International Conference on Computer Vision, London, England, pp. 259–68, June 1987.
D.J. Williams and M. Shah, “A Fast Algorithm for Active Contours and Curvature Estimation,” CVGIP: Image Understanding, vol. 55, no. 1, pp. 14–26, Jan. 1992.
Eric Mortensen, Bryan Morse, and William Barrett: “Adaptive Boundary Detection Using ‘Live-Wire’ Two-Dimensional Dynamic Programming,” IEEE Computers in Cardiology, pp. 635–638, Durham, North Carolina, October, 1992.
J.K. Udupa, S. Samarasekera, W.A. Barrett: “Boundary Detection Via Dynamic Programming,” Visualization in Biomedical Computing '92, pp. 33–39, Chapel Hill, North Carolina, October, 1992.
Eric Mortensen and William Barrett: “Intelligent Scissor for Image Composition,” Computer Graphics (SIGGRAPH '95 Proceedings), pp. 191–198.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrett, W.A., Mortensen, E.N. (1996). Fast, accurate, and reproducible live-wire boundary extraction. In: Höhne, K.H., Kikinis, R. (eds) Visualization in Biomedical Computing. VBC 1996. Lecture Notes in Computer Science, vol 1131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046953
Download citation
DOI: https://doi.org/10.1007/BFb0046953
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61649-8
Online ISBN: 978-3-540-70739-4
eBook Packages: Springer Book Archive