Aiming at the problem that the computational process in the method for image haze removal based on the dark channel prior is too complicated and too time-consuming, we propose a fast method for single image haze removal based on multiscale dark channel prior. In order to solve the problem that it takes too much time on a high resolution image, we choose to optimize the image haze removal based on dark channel prior algorithm by the method of multiple scales. We deal with rough resolution images and use fast minimum filtering and fast guided filtering to speed up the haze removal algorithm. Therefore, the speed of calculation is accelerated while maintaining the good image effect after haze removal.
In the process of image restoration, the result of image restoration is very different from the real image because of the existence of noise, in order to solve the ill posed problem in image restoration, a blind deconvolution method based on L1/L2 regularization prior to gradient domain is proposed. The method presented in this paper first adds a function to the prior knowledge, which is the ratio of the L1 norm to the L2 norm, and takes the function as the penalty term in the high frequency domain of the image. Then, the function is iteratively updated, and the iterative shrinkage threshold algorithm is applied to solve the high frequency image. In this paper, it is considered that the information in the gradient domain is better for the estimation of blur kernel, so the blur kernel is estimated in the gradient domain. This problem can be quickly implemented in the frequency domain by fast Fast Fourier Transform. In addition, in order to improve the effectiveness of the algorithm, we have added a multi-scale iterative optimization method. This paper proposes the blind deconvolution method based on L1/L2 regularization priors in the gradient space can obtain the unique and stable solution in the process of image restoration, which not only keeps the edges and details of the image, but also ensures the accuracy of the results.
For the real-time motion deblurring, it is of utmost importance to get a higher processing speed with about the same image quality. This paper presents a fast Richardson-Lucy motion deblurring approach to remove motion blur which rotates blurred image under blurring paths. Hence, the computational time is reduced sharply by using one-dimensional Fast Fourier Transform in one-dimensional Richardson-Lucy method. In order to obtain accurate transformational results, interpolation method is incorporated to fetch the gray values. Experiment results demonstrate that the proposed approach is efficient and effective to reduce motion blur under the blur paths.
We present a novel blind restoration algorithm to restore object images from real images based on maximum likelihood estimation. In order to estimate the unknown turbulence point spread functions (PSF) of the observed image contain the same objects, multi-frame images are used to construct an integral likelihood function. A series of experiments for synthetic and real images illustrate that the proposed algorithm is effective in restoring real images.
With improving of intelligent and automation in modern industrial production area, the detection and reconstruction of the 3D surface of the product has become an important technology, but the image which acquire on the actual production line has motion blur and this problem will affect the later reconstruction work. In order to solve this problem, a deblurring method which based on double view moving target image is proposed in this paper. We can deduce the relationship of the point spread function(PSF) path between the double view image through the epipolar geometry and the camera model. The experimental results show that deblurring with the PSF path solved by the geometric relationship achieves good results.
Blind image deblurring is an important issue. In this paper, we focus on solving this issue by constrained regularization method. Motivated by the importance of edges to visual perception, the edge-enhancing indicator is introduced to constrain the total variation regularization, and the bilateral filter is used for edge-preserving smoothing. The proposed edge enhancing regularization method aims to smooth preferably within each region and preserve edges. Experiments on simulated and real motion blurred images show that the proposed method is competitive with recent state-of-the-art total variation methods.
This paper introduces and evaluates a new algorithm for the computation of type-III discrete Hartley transforms (DHT)
of length N = 2n. The length-N type-III discrete Hartley transforms can be decomposed into several length-16 type-III discrete Hartley transforms based on the radix-2 fast algorithm, and the length-16 type-III discrete Hartley transforms can be computed by first- order moments. It can save a lot of arithmetic operations and the computational complexity of the algorithms is lower than some existing methods. Moreover, this algorithm can be easily implemented.