Daniel's code.zip_IMAGE DEBLURRING_图像去模糊_图像去模糊的相关算法_图片去模糊

function [cleanI,psnr,cost] = EPLLhalfQuadraticSplitDeblur(noiseI,lambda,K,patchSize,betas,T,prior,I,LogLFunc) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % EPLLhalfQuadraticSplitDeblur - Minimizes the EPLL cost using half quadratic splitting % as defined in the paper: % "From Learning Models of Natural Image Patches to Whole Image Restoration" % by Daniel Zoran and Yair Weiss, ICCV 2011 % % % Version 1.0 (21/10/2011) % % This function is for deblurring, for denoising and inpainting - for deblurring refer to % EPLLhalfQuadraticSplit.m % % % Inputs: % % noiseI - the blurry image, with some noise added to it % lambda - the parameter lambda from Equation (2) in the paper (mostly % used as the inverse of the noise variance. If a matrix is given, it % should be the same size as the image (used for inpainting) % K - the blur kernel used to blur the image % patchSize - the size of patches to extract (single scalar, patches are % always square) % betas - a list (1xM vector) of beta values, if the values are positive, they will be % used as is, negative values will be ignored and beta will be estimated % automatically from the noisy image (for as many iterations as there are % in betas) % T - The number of iterations to optimizie for X and Z at each beta % value % prior - a function handle to a function which calculates a MAP estimate % using a given prior for a noisy patch at noise level beta, see examples in the % demos % I - the original image I, used only for PSNR calculations and % comparisons % LogLFunc - a function handle to calculate the log likelihood of patches % in the image, used for calculating the total cost (optional). % % % % Outputs: % % cleanI - the restored image % psnr - a list of the psnr values obtained for each beta and iteration % cost - if LogLFunc is given then this is the cost from Equation 2 in % the paper at each value of beta. % % See demos in this same code package for examples on how to use this % function for deblurring some example priors % (including the GMM prior used in the paper). % % All rights reserved to the authors of the paper (Daniel Zoran and Yair % Weiss). If you have any questions, comments or suggestions please contact % Daniel Zoran at [email protected]. % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%% % This function is practically identical to EPLLhalfQuadraticSplit, which % you should refer to for detailed documentaion. The only difference is % with the handling of the blurring kernel, which is documented below. %%%%%%%%%%%%%%%%%%%%%% RealNoiseSD = sqrt(1/(lambda(1)/patchSize^2)); % if expecting cost calc_cost = false; cost = []; if nargout>2 if isa(LogLFunc,'function_handle') calc_cost = true; else calc_cost = false; end end % TT = myconvmtx2(noiseI,K); beta = abs(betas(1)/4); cleanI = noiseI; k=1; sd = Inf; for betaa=betas % if any beta<0 estimate betas automatically if (betaa<0) old_sd = sd; [sd] = estimateNoiseSDUsingKurts(cleanI,12); fprintf('sd is:%f beta is %f * (1/noiseSD^2)',sd,(1/sd^2)/(1/RealNoiseSD^2)); sd = sd; if isnan(sd) || sd>old_sd beta = beta*4; sd = beta^-0.5; else beta = 1/sd^2; end else beta = betaa; end for tt=1:T % Z step Z = im2col(cleanI,[patchSize patchSize]); % calculate orignal cost if LogLFunc is defined and output % arguments expect it if calc_cost cost(k) = 0.5*lambda*sum((cleanI(:)-noiseI(:)).^2) - EPLL(Z,LogLFunc); fprintf('Cost is: %f\n',cost(k)); end cleanZ = prior(Z,patchSize,(beta)^-0.5,size(noiseI)); % x step [I1,counts] = scol2im(cleanZ,patchSize,size(I,1),size(I,2),'sum'); tt1 = noiseI(floor(size(K,1)/2)+1:end-floor(size(K,1)/2),floor(size(K,2)/2)+1:end-floor(size(K,2)/2)); % convolution with the rotated kernel (LHS of Equation 4 in the % paper) tt1 = conv2(tt1,rot90(rot90(K)),'full'); tt2 = I1; % Solve for x, using the convolved image from above (Equation 4 in % the paper) cleanI = reshape(bicg(@(x,tflag) Afun(x,K,counts,beta,lambda,size(I),tflag),(lambda*tt1(:) + beta*tt2(:)),1e-6,2500),size(noiseI)); psnr(k) = 20*log10(1/std2(cleanI-I)); fprintf('PSNR is:%f I1 PSNR:%f\n',psnr(k),20*log10(1/std2(I1./counts-I))); % imshow([I noiseI cleanI],[0 1]); drawnow; k=k+1; end end cleanI = reshape(cleanI,size(noiseI)); cleanI(cleanI>1)=1; cleanI(cleanI<0)=0; psnr = psnr(:)'; % function to apply the corruption model (implemented efficiantly using % convolutions instead of matrix multiplications) function y = Afun(x,K,counts,beta,lambda,ss,transp_flag) xx = reshape(x,ss); tt = imfilter(xx,K,'conv','same'); tt = tt(floor(size(K,1)/2)+1:end-floor(size(K,1)/2),floor(size(K,2)/2)+1:end-floor(size(K,2)/2)); y = lambda*imfilter(tt,rot90(rot90(K)),'conv','full'); y = y + beta*counts.*xx; y = y(:);