{'fraction_non_alphanumeric': 0.021003500583430573, 'fraction_numerical': 0.0, 'mean_word_length': 5.3088235294117645, '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}}
Which super-resolution algorithm is proper for Farsi text image sequences

In this paper we propose a new algorithm for super-resolution of Farsi text image sequences. Our algorithm contains three main steps as prior super-resolution algorithms; registration, reconstruction, and restoration. Due to special properties of Farsi texts such as appearance of dots in alphabet, selecting a proper super-resolution algorithm, especially in presence of noise, is more important. We propose an algorithm with an accurate sub-pixel registration and IBP reconstruction that reconstructs a high resolution image from a set of noisy low resolution observations. In restoration step we have exploited NLM algorithm to overcome image noise. We test our algorithm on synthetic and real data. Both quantitative and qualitative results show outperformance of our algorithm.