Paper
22 September 1992 Boundary detection via dynamic programming
Jayaram K. Udupa, Supun Samarasekera, William A. Barrett
Author Affiliations +
Proceedings Volume 1808, Visualization in Biomedical Computing '92; (1992) https://doi.org/10.1117/12.131065
Event: Visualization in Biomedical Computing, 1992, Chapel Hill, NC, United States
Abstract
This paper reports a new method for detecting optimal boundaries in multidimensional scene data via dynamic programming (DP). In its current form the algorithm detects 2-D contours on slices and differs from other reported DP-based algorithms in an essential way in that it allows freedom in 2-D for finding optimal contour paths (as opposed to a single degree of freedom in the published methods). The method is being successfully used in segmenting object boundaries in a variety of medical applications including orbital volume from CT images (for craniofacial surgical planning), segmenting bone in MR images for kinematic analysis of the joints of the foot, segmenting the surface of the brain from the inner surface of the cranial vault, segmenting pituitary gland tumor for following the effect of a drug on the tumor, segmenting the boundaries of the heart in MR images, and segmenting the olfactory bulb for verifying hypotheses related to the size of this bulb in certain disease states.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jayaram K. Udupa, Supun Samarasekera, and William A. Barrett "Boundary detection via dynamic programming", Proc. SPIE 1808, Visualization in Biomedical Computing '92, (22 September 1992); https://doi.org/10.1117/12.131065
Lens.org Logo
CITATIONS
Cited by 53 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Computer programming

Visualization

Biomedical optics

Binary data

Analytical research

Detection and tracking algorithms

Back to Top