This paper presents a threshold-free maximum a posteriori (MAP) super resolution (SR) algorithm to reconstruct high resolution (HR) images with sharp edges. The joint distribution of directional edge images is modeled as a multidimensional Lorentzian (MDL) function and regarded as a new image prior. This model makes full use of gradient information to restrict the solution space and yields an edge-preserving SR algorithm. The Lorentzian parameters in the cost function are replaced with a tunable variable, and graduated nonconvexity (GNC) optimization is used to guarantee that the proposed multidimensional Lorentzian SR (MDLSR) algorithm converges to the global minimum. Simulation results show the effectiveness of the MDLSR algorithm as well as its superiority over conventional SR methods.
In this paper,an iterative regularized super resolution (SR) algorithm considering non-Gaussian noise is proposed.Based on the assumption of a generalized Gaussian distribution for the contaminating noise,an lp norm is adopted to measure the data fidelity term in the cost function.In the meantime,a regularization functional defined in terms of the desired high resolution (HR) image is employed,which allows for the simultaneous determination of its value and the partly reconstructed image at each iteration step.The convergence is thoroughly studied.Simulation results show the effectiveness of the proposed algorithm as well as its superiority to conventional SR methods.
A novel Bayesian super resolution (SR) algorithm based on the distribution of synthetic gradient is proposed. The synthetic gradient combines prior information in horizontal, vertical, and diagonal directions. Its distribution is modeled as a Lorentzian function and regarded as a new image model which can sufficiently regularize the ill-posed algorithm and preserve the edges in the reconstructed images. The graduated nonconvexity (GNC) optimization is employed to guarantee the convergence of the proposed Lorentzian SR (LSR) algorithm to the global minimum. The performance of LSR is compared with conventional algorithms, and experimental results demonstrate that the proposed algorithm obtains both subjective and objective gains.
