By applying smoothed l0norm（SL0）algorithm,a block compressive sensing（BCS）algorithm called BCS-SL0 is proposed,which deploys SL0 and smoothing filter for image reconstruction.Furthermore,BCS-ReSL0 algorithm is dev...By applying smoothed l0norm（SL0）algorithm,a block compressive sensing（BCS）algorithm called BCS-SL0 is proposed,which deploys SL0 and smoothing filter for image reconstruction.Furthermore,BCS-ReSL0 algorithm is developed to use regularized SL0（ReSL0）in a reconstruction process to deal with noisy situations.The study shows that the proposed BCS-SL0 takes less execution time than the classical BCS with smoothed projected Landweber（BCS-SPL）algorithm in low measurement ratio,while achieving comparable reconstruction quality,and improving the blocking artifacts especially.The experiment results also verify that the reconstruction performance of BCS-ReSL0 is better than that of the BCSSPL in terms of noise tolerance at low measurement ratio.展开更多
Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvo...Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvolution. Experiments show that the details of the image destroy the structure of the kernel, especially when the blur kernel is large. So we extract the image structure with salient edges by the method based on RTV. In addition, the traditional method for motion blur kernel estimation based on sparse priors is conducive to gain a sparse blur kernel. But these priors do not ensure the continuity of blur kernel and sometimes induce noisy estimated results. Therefore we propose the kernel refinement method based on L0 to overcome the above shortcomings. In terms of non-blind deconvolution we adopt the L1/L2 regularization term. Compared with the traditional method, the method based on L1/L2 norm has better adaptability to image structure, and the constructed energy functional can better describe the sharp image. For this model, an effective algorithm is presented based on alternating minimization algorithm.展开更多
It is challenging to consistently smooth natural images, yet smoothing results determine the quality of a broad range of applications in computer vision. To achieve consistent smoothing, we propose a novel optimizatio...It is challenging to consistently smooth natural images, yet smoothing results determine the quality of a broad range of applications in computer vision. To achieve consistent smoothing, we propose a novel optimization model making use of the redundancy of natural images, by defining a nonlocal concentration regularization term on the gradient. This nonlocal constraint is carefully combined with a gradientsparsity constraint, allowing details throughout the whole image to be removed automatically in a datadriven manner. As variations in gradient between similar patches can be suppressed effectively, the new model has excellent edge preserving, detail removal,and visual consistency properties. Comparisons with state-of-the-art smoothing methods demonstrate the effectiveness of the new method. Several applications,including edge manipulation, image abstraction,detail magnification, and image resizing, show the applicability of the new method.展开更多
基金Supported by the National Natural Science Foundation of China(61421001,61331021,61501029)
文摘By applying smoothed l0norm（SL0）algorithm,a block compressive sensing（BCS）algorithm called BCS-SL0 is proposed,which deploys SL0 and smoothing filter for image reconstruction.Furthermore,BCS-ReSL0 algorithm is developed to use regularized SL0（ReSL0）in a reconstruction process to deal with noisy situations.The study shows that the proposed BCS-SL0 takes less execution time than the classical BCS with smoothed projected Landweber（BCS-SPL）algorithm in low measurement ratio,while achieving comparable reconstruction quality,and improving the blocking artifacts especially.The experiment results also verify that the reconstruction performance of BCS-ReSL0 is better than that of the BCSSPL in terms of noise tolerance at low measurement ratio.
基金Partially Supported by National Natural Science Foundation of China(No.61173102)
文摘Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvolution. Experiments show that the details of the image destroy the structure of the kernel, especially when the blur kernel is large. So we extract the image structure with salient edges by the method based on RTV. In addition, the traditional method for motion blur kernel estimation based on sparse priors is conducive to gain a sparse blur kernel. But these priors do not ensure the continuity of blur kernel and sometimes induce noisy estimated results. Therefore we propose the kernel refinement method based on L0 to overcome the above shortcomings. In terms of non-blind deconvolution we adopt the L1/L2 regularization term. Compared with the traditional method, the method based on L1/L2 norm has better adaptability to image structure, and the constructed energy functional can better describe the sharp image. For this model, an effective algorithm is presented based on alternating minimization algorithm.
基金supported by the National Natural Science Foundation of China (Nos. 61332015, 61373078, 61272245, 61202148, and 61103150)the NSFC-Guangdong Joint Fund (No. U1201258)
文摘It is challenging to consistently smooth natural images, yet smoothing results determine the quality of a broad range of applications in computer vision. To achieve consistent smoothing, we propose a novel optimization model making use of the redundancy of natural images, by defining a nonlocal concentration regularization term on the gradient. This nonlocal constraint is carefully combined with a gradientsparsity constraint, allowing details throughout the whole image to be removed automatically in a datadriven manner. As variations in gradient between similar patches can be suppressed effectively, the new model has excellent edge preserving, detail removal,and visual consistency properties. Comparisons with state-of-the-art smoothing methods demonstrate the effectiveness of the new method. Several applications,including edge manipulation, image abstraction,detail magnification, and image resizing, show the applicability of the new method.
