{'fraction_non_alphanumeric': 0.020752269779507133, 'fraction_numerical': 0.0, 'mean_word_length': 5.225806451612903, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Large three-dimensional dataset segmentation using a graph-theoretic energy-minimization approach

A new graph algorithm for the multiscale segmentation of large three-dimensional medical data sets is presented. It is a region-merging segmentation algorithm based on minimizing the Mumford-Shah energy. The Mumford-Shah functional formulation leads to improved segmentation results compared with alternative approaches; and the graph theoretic approach yields improved performance and simplified data structures. Also, the graph algorithm acts on only a subset of the full data set at a given time, allowing its application to large data sets such as whole-body scans. Results on a head MRI data set are presented and compared with a manual segmentation of this data set.