{'fraction_non_alphanumeric': 0.024601063829787235, 'fraction_numerical': 0.0026595744680851063, 'mean_word_length': 5.270833333333333, '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 fast image registration algorithm for super-resolution

In this paper, a robust and fast image registration algorithm suitable for super-resolution is proposed, it yields a solution that precisely registers images with subpixel accuracy. The proposed registration process is carried out in three stages. In first stage, the image edges are extracted and then the corner points which are on the image edges are extracted, where the improved Harris corner algorithm is used in order to reduce the calculation amount. In second stage, for the coarse registration, the NCC (Normalized cross correlation) similarity measure is used to get an initial set of corresponding point pairs, and then a statistical method is employed in order to remove mismatched points. In detail, we calculate the shift (Δx,Δy) of each point pairs, count the frequency of each shift, and then select the shift with most frequency as the image shift, which is expressed as(Δx0,Δy0). In third stage, for fine image registration, subpixel image registration is achieved by interpolation. The bicubic interpolation is done in the neighborhood of the inliers (the correspondences with shift (Δx0,Δy0) are called as inliers) and the NCC matching and statistical method is used once again to find the correct corresponding point pairs, from which the shifts between the reference and unregistered image are estimated. The experimental results illustrate the registration speed and accuracy of the proposed method improved significantly.