Three-Dimensional Thinning Algorithm that Peels the Outmost Layer with Application to Neuron Tracing
- 7 Downloads
- 8 Citations
Abstract
A novel thinning algorithm for three-dimensional (3D) binary images is presented, with applications in the study of neuronal micro-anatomy by light microscopy. This algorithm satisfies properties important to many biological applications, including (a) connectivity preservation, (b) thinness, and (c) geometry preservation. It is fast to execute (a few minutes for typical 3D data sizes) on a personal computer. The algorithm addresses many challenges that are presented by 3D data. Algorithm improvements, over precursory algorithms, include the following: (1) Stricter and more exhaustive constraints on identifying outmost-layer border points are applied. (2) Border points are deleted by a novel ascending order of weighted neighbor count approach. The algorithm is robust in that it retains the above three properties (a–c) in the presence of relatively severe noise, uneven dye uptake, and nonuniform background.
Preview
Unable to display preview. Download preview PDF.
REFERENCES
- Capowski, J. J., Ed. (1989). Computer Techniques in Neuroanatomy, Plenum Press, New York.Google Scholar
- Cohen, A. R., Roysam, B., and Turner, J. N. (1994). Automated tracing and volume measurements of neurons from 3D-D confocal fluorescence microscopy data. J. Microscopy 173(Pt2): 103-114.Google Scholar
- Gong, W., and Bertrand, G. (1990). A simple parallel 3-D thinning algorithm. In IEEE 10th International Conference on Pattern Recognition, pp. 188-190.Google Scholar
- Hillman, D. E. (1979), Neuronal Shape Parameters and Substructures as a Basis of Neuronal Form. Neuronsciences, Murray Printing Company, pp. 477-497.Google Scholar
- Larkman, A. U. (1991). Dendritic morphology of pyramidal neurones of the visual cortex of the rat: I. Branch pattern. J. Comp. Neurol. 306: 307-319.Google Scholar
- Larkman, A. U. (1992). Dendritic morphology of pyramidal neurones of the visual cortex of the rat: IV. Electrical geometry. J. Comp. Neurol. 323: 137-152.Google Scholar
- Latecki, L., and Ma, C. M. (1996). An algorithm for 3D simplicity test. Computer Vision and Image Understanding 63: 388-393.Google Scholar
- Lee, T. C., and Kashyap, R. L. (1994). Building skeleton models via 3-D medial surface/axis thinning algorithms. Graphical Models and Image Processing 56: 462-478.Google Scholar
- Ma, C. M. (1994). On topology preservation in 3D thinning. Computer Vision and Image Understanding 59: 328-339.Google Scholar
- Ma, C. M., and Sonka, M. (1996). A fully parallel 3D thinning algorithm and its application. Computer Vision and Image Understanding 64: 420-433.Google Scholar
- Malandian, G., and Bertrand, G. (1992). Fast characterization of 3D simple point. In IEEE International Conference on Pattern Recognition, pp. 232-235.Google Scholar
- Mulherjee, J., Das, P. P., and Chatterji, B. N. (1990). On connectivity issues of ESPTA. Pattern Recognit. Lett. 11: 643-648.Google Scholar
- Narsingh, D. (1974). Graph Theory with Applications to Engineering, Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
- Pawley, J. B. (1995). Handbook of Biological Confocal Microscopy, Plenum, New York.Google Scholar
- Pudney, C. (1998). Distance-ordered homotopic thinning: A skeletonization algorithm for 3D digital images. Computer Vision and Image Understanding 72: 404-413.Google Scholar
- Saha, P. K., Chaudhuri, B. B., Chanda, B., and Majumder, D. D. (1994). Topology preservation in 3D digital space. Pattern Recognition 27: 295-300.Google Scholar
- Srihari, S. N., Udupa, J. K., and Yao, M. M. (1979). Understanding the bin of parts. Proc. IEEE Conf. Decision Contr., pp. 44-49.Google Scholar
- Tsao, Y. F., and Fu, K. S. (1981). A parallel algorithm for 3-D picture. Computer Graphics and Image Processing 17: 315-331.Google Scholar
- Vincent, L. (1991). Efficient computation of various types of skeletons. Proceedings, Image Processing, SPIE, Vol. 1445, pp. 315-331.Google Scholar