{'fraction_non_alphanumeric': 0.02104499274310595, 'fraction_numerical': 0.0050798258345428155, 'mean_word_length': 5.239819004524887, '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}}
Fast Deconvolution for Motion Blur Along the Blurring Paths

In this paper, we propose a deconvolution method which removes the motion blur along the blurring paths. The 2-D blurred image is transformed into 1-D horizontal blurred vectors along the blurring paths. Hence, the deconvolution of stacked horizontal blurred vectors is implemented in an iterative deconvolution process by a 1-D image restoration method that saves computation time. The deconvolution process is usually implemented in the frequency domain by fast Fourier transform (FFT). The computation time of FFT used in the 1-D image restoration method for the blurred vectors is about two-fifths of that of 2-D FFT used in the common image restoration method. To get stacked horizontal blurred vectors, we first incorporate orthogonal Chebyshev polynomial into the proposed method to extract pixels along the blurring paths. Then, we expand horizontal blurred vectors smoothly to reduce boundary artifacts. At last, we add a nonquadratic regularization term to the Richardson-Lucy algorithm, which adaptively penalizes the image gradients, to avoid oversmoothing of details. Experimental results for real motion-blurred images demonstrate that our approach runs much faster than the 2-D deblurring algorithm, while achieving as high restoration accuracy and visual perception as the 2-D deconvolution algorithm.