Learning Probabilistic Transfer Functions: A Comparative Study of Classifiers

• Published in: Computer graphics forum Vol. 34; no. 3; pp. 111 - 120
• Main Authors: Soundararajan, K. P., Schultz, T.
• Format: Journal Article
• Language: English
• Published: Oxford Blackwell Publishing Ltd 01.06.2015
• Subjects: Analysis; Artificial intelligence; Categories and Subject Descriptors (according to ACM CCS); Classification; Classifiers; Forests; I.4.6 [Image Processing and Computer Vision]: Segmentation-Pixel classification; Image processing systems; Mathematical models; Probabilistic methods; Probability theory; Rendering; Studies; Transfer functions
• ISSN: 0167-7055; 1467-8659
• DOI: 10.1111/cgf.12623

Complex volume rendering tasks require high‐dimensional transfer functions, which are notoriously difficult to design. One solution to this is to learn transfer functions from scribbles that the user places in the volumetric domain in an intuitive and natural manner. In this paper, we explicitly model and visualize the uncertainty in the resulting classification. To this end, we extend a previous intelligent system approach to volume rendering, and we systematically compare five supervised classification techniques – Gaussian Naive Bayes, k Nearest Neighbor, Support Vector Machines, Neural Networks, and Random Forests – with respect to probabilistic classification, support for multiple materials, interactive performance, robustness to unreliable input, and easy parameter tuning, which we identify as key requirements for the successful use in this application. Based on theoretical considerations, as well as quantitative and visual results on volume datasets from different sources and modalities, we conclude that, while no single classifier can be expected to outperform all others under all circumstances, random forests are a useful off‐the‐shelf technique that provides fast, easy, robust and accurate results in many scenarios.