Efficient Kidney Segmentation in Micro-CT Based on Multi-Atlas Registration and Random Forests
Fengjun Zhao, Pei Gao, Haowen Hu and 3 more
IEEE Access · 2018
doi:10.1109/access.2018.2861418 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Micro-computed tomography (micro-CT) provides an in vivo high-resolution preclinical imaging for murine kidneys. However, due to the relatively low dosage of X-rays, accurate and efficient segmentation of murine kidneys in micro-CT imaging remains challenging. In this paper, we proposed an efficient kidney segmentation method in micro-CT images based on multi-atlas registration (MAR) and random forests (RFs). First, we constructed a probability map of kidneys by the MAR and obtained an initial shape estimation of kidneys. We acquired the transformations of MAR based on high-contrast organs and then mapped kidneys to the new micro-CT images. Second, we extracted multiple features (including intensity, texture, and context features) from the voxels with lower probabilities and fed these features to a RF classifier. The role of RF is to fine-tune kidney boundaries after MAR. Finally, combining the initial shape with high probabilities and the fine-tuning of RF, we obtained the final segmentation of kidneys. The experiments were conducted on datasets acquired by micro-CT imaging of mice with and without the administration of contrast agent (Dataset1 and Dataset2). The results demonstrated the proposed MAR-RF outperformed the level sets, statistical-atlas registration, active shape model, and other supervised learning methods, with the Dice coefficients of 0.9766 and 0.9255, and the mean surface distances of 1.25 and 0.98 mm on Dataset1 and Dataset2, respectively. The training and prediction time of our MAR-RF were only 37.04% and 17.68% of the compared method, respectively. The proposed method has great potential for applications in other segmentation tasks of computer-aided diagnosis.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.