主权项 |
1. A method for generating a high-resolution image from a low-resolution blurred image by one or more processors, the method comprising:
determining an affine transform for transforming a first image into a second image that is aligned horizontally and vertically with the first image, the affine transform being determined from the low-resolution blurred image such that a weighted sum of a Schattenp=1/2-norm (S1/2-norm) of a low-rank component and a L1/2-norm of a sparse component is substantially minimized; wherein the low-rank component and the spare component are obtained by applying a candidate affine transform to the low-resolution blurred image to yield a third image and then decomposing the third image into the low-rank component for representing an edge structure of the third image, and the spare component for representing noise or blur information thereof; wherein the determining of the affine transform comprises iteratively refining the candidate affine transform so as to successively reduce the weighted sum, wherein the weighted sum is given by
∥A∥S1/21/2+λ∥E∥1/21/2 where:
A and E are the low-rank component and the sparse component, respectively,∥A∥S1/21/2 is the S1/2-norm of A,∥E∥1/21/2 is the L1/2-norm of E, andλ is a pre-determined parameter for balancing a contribution of the L1/2-norm with the weighted sum; wherein the candidate affine transform is iteratively refined according to {Ak+1=argminA12A-(Ioτ-Ek+1μYk)F2+AS1/21/2Ek+1=argminE12λE-(Ioτ-Ak+1+1μYk)F2+ElaaYk+1=Yk+μ(Ioτ-Ak+1-Ek+1) where:
Ioτ=Ak+Ek,Ak is the low-rank component obtained in a kth iteration, and Ak+1 is the low-rank component obtained in a (k+1)th iteration, an iteration immediately after the kth iteration,Ek is the spare component obtained in the kth iteration, and Ek+1 is the spare component obtained in the (k+1)th iteration,Yk is an augmented Lagrangian multiplier obtained in the kth iteration, and
Yk+1 is an augmented Lagrangian multiplier obtained in the (k+1)th iteration,μ is a nonnegative parameter,∥A∥S1/21/2 denotes a S1/2-norm, and∥E∥lαα denotes a L1/2-norm; wherein the candidate affine transform is iteratively refined untilIoτ-Ak+1-Ek+1FIoτF<ɛis satisfied, where ε is a pre-determined threshold;
wherein the iterative refinement of the candidate affine transform is computed by an iterative process comprising: Step 1: performing an initialization comprising:
K=0;A0=0;Y0=0;E0=0;Δτ0>0;μ0>0;ρ>1; Step 2: determining:Ioτ-Ek+μ-1Yk=UrSrVrTAk+1=UrH2μ(Sr)VrT; Step 3: determining:Ek+1=H2λμ(Ioτ-Ak+1+μ-1Yk) Step 4: determining:
Δτk+1(∀I)+(Ak+1+Ek+1−Ioτ−μ−1Yk) Step 5: determining:
Yk+1=Ykμ(Ioτ−Ak+1−μ−1Yk+1) Step 6: determining:
μk+1=ρμk Step 7: ifIoτ-Ak+1-Ek+1FIoτF<ɛfor the pre-determined threshold, repeat Step 2;
otherwise set values for A, E and τ; and generating the high-resolution image by a transform-invariant directional total variation (TI-DTV) regularization method, wherein the regularization method comprises computing a directional total variation (DTV) of a transformed image obtained by applying the determined affine transform to a candidate high-resolution image. |