کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
442612 | 692310 | 2014 | 12 صفحه PDF | دانلود رایگان |
• Estimate and visualize the uncertainties of the probabilistic segmentation result.
• Judge the performance of segmentation algorithms using the proposed measures.
• Simple visualization tools are used to convey the uncertainty with segmentation.
• Aggregated uncertainty measures can be helpful for analyzing the suspicious areas.
Probabilistic segmentation is concerned with handling imperfections of image segmentation algorithms. They assign to each voxel and each segment a probability that the voxel belongs to the segment. This is often the starting point for estimating and visualizing uncertainties in the segmentation result. We propose a novel, generally applicable uncertainty estimation approach that considers all probabilities to compute a single uncertainty value between 0 and 1 for each voxel. It is based on aspects of information theory and uses the Kullback–Leibler divergence (or the total variation divergence). We developed several forms of the proposed approach and analyze and compare their behaviors. We show the advantage over existing approaches, derive aggregated uncertainty measures that are useful for judging the accuracy of a probabilistic segmentation algorithm, and present visualization methods to highlight uncertainties in segmentation results.
Figure optionsDownload high-quality image (121 K)Download as PowerPoint slide
Journal: Computers & Graphics - Volume 39, April 2014, Pages 48–59