{'fraction_non_alphanumeric': 0.013071895424836602, 'fraction_numerical': 0.0, 'mean_word_length': 5.350230414746544, '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 for Adaptive Polynomial Based Image Interpolation

In this paper, an adaptive algorithm is suggested for the implementation of polynomial based image interpolation techniques such as Bilinear, Bicubic, Cubic Spline and Cubic O-MOMS. This algorithm is based on the minimization of the squared estimation error at each pixel in the interpolated image by adaptively estimating the distance of the pixel to be estimated from its neighbors. The adaptation process at each pixel is performed iteratively to yield the best estimate of this pixel value. This adaptive interpolation algorithm takes into consideration the mathematical model by which a low resolution (LR) image is obtained from a high resolution (HR) image. This adaptive algorithm is compared to traditional polynomial based interpolation techniques and to the warped distance interpolation techniques. The performance of this algorithm is also compared to the performance of other algorithms used in commercial interpolation softwares such as the ACDSee and the Photopro programs. Results show that the suggested adaptive algorithm is superior from the Peak Signal to Noise Ratio (PSNR) point of view to other traditional techniques and it has a higher ability of edge preservation than traditional image techniques. The computational cost of the adaptive algorithm is studied and found to be moderate.