{'fraction_non_alphanumeric': 0.018832391713747645, 'fraction_numerical': 0.0, 'mean_word_length': 5.109195402298851, '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}}
Cardiac MR image segmentation and left ventricle surface reconstruction based on level set method.

A two-stage segmentation algorithm is presented to solve the problems of inhomogeneity, weak edges and artifacts exhibited in the magnetic resonance imaging (MRI) images. First, the K-mean clustering algorithm is applied to classify the objects. Then, a speed function based on the clustering results is defined in order to search the rough boundary. Secondly, a speed function of the gradient intensity is constructed to locate the boundary accurately. Due to the lack of deformation information of the boundaries between MR slices, a deformable model is used to reconstruct the shape of the LV: a dynamic equation governing the surface deformation is given; from the slice data, external forces are constructed and elastic forces are provided with mean curvatures of the deformation surface. The level set method is applied to solve the dynamic equation for the LV shape. Experimental results demonstrate the effectiveness of the algorithm listed in the paper.