Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.compbiomed.2009.11.020
Title: | Fast segmentation of bone in CT images using 3D adaptive thresholding | Authors: | Zhang, J. Yan, C.-H. Chui, C.-K. Ong, S.-H. |
Keywords: | 3D Adaptive thresholding Bone CT image Segmentation |
Issue Date: | Feb-2010 | Citation: | Zhang, J., Yan, C.-H., Chui, C.-K., Ong, S.-H. (2010-02). Fast segmentation of bone in CT images using 3D adaptive thresholding. Computers in Biology and Medicine 40 (2) : 231-236. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compbiomed.2009.11.020 | Abstract: | Fast bone segmentation is often important in computer-aided medical systems. Thresholding-based techniques have been widely used to identify the object of interest (bone) against dark backgrounds. However, the darker areas that are often present in bone tissue may adversely affect the results obtained using existing thresholding-based segmentation methods. We propose an automatic, fast, robust and accurate method for the segmentation of bone using 3D adaptive thresholding. An initial segmentation is first performed to partition the image into bone and non-bone classes, followed by an iterative process of 3D correlation to update voxel classification. This iterative process significantly improves the thresholding performance. A post-processing step of 3D region growing is used to extract the required bone region. The proposed algorithm can achieve sub-voxel accuracy very rapidly. In our experiments, the segmentation of a CT image set required on average less than 10. s per slice. This execution time can be further reduced by optimizing the iterative convergence process. © 2009 Elsevier Ltd. | Source Title: | Computers in Biology and Medicine | URI: | http://scholarbank.nus.edu.sg/handle/10635/50924 | ISSN: | 00104825 | DOI: | 10.1016/j.compbiomed.2009.11.020 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.