Abstract
A segmentation algorithm is presented which uses pyramid data structures as a means for achieving computational efficiency and for improving the quality of the segmentation. Results of experiments on synthetic and actual computed tomographic data are presented, and future enhancements to the algorithms are discussed. The motivation for using pyramids is to reduce computational costs through a coarse-to-fine segmentation strategy and to improve the quality of the segmentation.
Original language | English |
---|---|
Title of host publication | Proceedings - International Conference on Pattern Recognition |
Publisher | Publ by IEEE |
Pages | 276-278 |
Number of pages | 3 |
ISBN (Print) | 0818608781 |
State | Published - 1988 |
Externally published | Yes |
Publication series
Name | Proceedings - International Conference on Pattern Recognition |
---|