{'fraction_non_alphanumeric': 0.015350877192982455, 'fraction_numerical': 0.0, 'mean_word_length': 5.475177304964539, '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}}
Two-Step Segmentation for Speedup of Convergence via Preprocessing

This paper introduces an integrated two-steps segmentation algorithm in the framework of Mumford-Shah functional. Note that the efficiency and convergence speed of the active contour-based segmentation algorithms are strongly dependent of selections of initial curves. Therefore a preprocessing step is introduced and integrated to construct an initial level set which is very closer to the boundaries of objects. As a result, a fast convergence speed is achieved. Furthermore the algorithm has better flexibility on segmentation of different kinds of images when some preprocessing techniques like denoising, edges enhance are used. In addition, the local minimal problem in the classical algorithm also can be eliminated or improved by choosing better diffusion approaches. The resulting algorithm has also been demonstrated by several cases.