{'fraction_non_alphanumeric': 0.01703940362087327, 'fraction_numerical': 0.003194888178913738, 'mean_word_length': 5.103896103896104, '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}}
A New Approach to Image Segmentation with Two-Dimensional Hidden Markov Models

Image segmentation is one of the fundamental problems in computer vision. In this work, we present a new segmentation algorithm that is based on the theory of two-dimensional hidden Markov models (2D-HMM). Unlike most 2D-HMM approaches we do not apply the Viterbi Algorithm, instead we present a computationally efficient algorithm that propagates the state probabilities through the image. This approach can easily be extended to higher dimensions. We compare the proposed method with a 2D-HMM standard algorithm and Iterated Conditional Modes using real world images like a radiography or a satellite image as well as synthetic images. The experimental results show that our approach is highly capable of condensing image segments. This gives our algorithm a significant advantage over the standard algorithm when dealing with noisy images with few classes.