# Patent

## Title
Device, system, and method of blind deblurring and blind super-resolution utilizing internal patch recurrence

## Abstract

Devices, systems, and methods of blind deblurring and blind super-resolution utilizing internal patch recurrence. Small signal patches tend to repeat “as is” across multiple scales of a natural signal. This fractal-like behavior is utilized for signal processing tasks, including “Blind Deblurring” or “Blind Super-Resolution”, namely, removing signal blur or increasing signal resolution without a-priori knowledge of the underlying blur kernel. While the cross-scale patch recurrence is strong in signals taken under ideal conditions, the cross-scale patch recurrence significantly diminishes when the acquisition blur deviates from an ideal blur. These deviations from ideal patch recurrences are used for recovering the underlying (unknown) blur kernel. The correct blur kernel is recovered by seeking the kernel which maximizes the patch similarity across scales of a related “reference” signal. For example, this reference signal may be the low-resolution input signal, the sharp deblurred-version of a blurry input signal, or the like. Quantitative and qualitative experiments indicate that this approach yields improved or superior results, in “Blind Deblurring” and in “Blind Super-Resolution”.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority and benefit from U.S. provisional patent application 61/828,204, entitled “Nonparametric Blind Super-Resolution”, filed on May 29, 2013, which is hereby incorporated by reference in its entirety


FIELD
The present invention relates to the field of image processing.
BACKGROUND
Super Resolution (SR) may refer to a method or algorithm for recovering a high-resolution image from one or several low-resolution versions of that image. Most SR methods operate under the assumption that the low-resolution input image was obtained by down-sampling the unknown high-resolution image with a known blur kernel. The blur kernel is typically assumed to be the Point Spread Function (PSF) of the camera; or, when the PSF value is unknown, the blur kernel is assumed to be a standard Low-Pass Filter (LPF) such as a Gaussian kernel or a bicubic kernel. Unfortunately, many SR algorithms fail to yield adequate results.
Photos often come out blurry due to camera shake, defocus or low-grade optics. Undoing this undesired effect is called de-blurring or deblurring, and most deblurring methods rely heavily on the availability of prior knowledge on the desired sharp image. Most existing algorithms rely, either explicitly or implicitly, on the fact that images contain enough step edges. This assumption is formulated in various ways. Some studies assume simple parametric probability models, which promote sparsity of image gradients. Other studies assume a parametric form for the spectrum of the image, which decays polynomially with frequency (corresponding to the Fourier transform of step edges). Many approaches employ heuristic methods for detecting and/or enhancing edges in the blurry image. These range from setting a threshold on the image gradients, to shock and bilateral filtering. Unfortunately, many de-blurring algorithms fail to yield adequate results.
SUMMARY
The present invention may include, for example, devices, systems, and methods of blind deblurring and blind super-resolution utilizing internal patch recurrence.
In accordance with the present invention, small image patches tend to repeat “as is” across multiple scales of a natural image. This fractal-like behavior may be utilized for various image processing tasks, including “Blind Deblurring” or “Blind Super-Resolution”, namely, removing image blur or increasing image resolution without a-priori knowledge of the underlying blur kernel. While the cross-scale patch recurrence may be strong in images taken under ideal imaging conditions, the cross-scale patch recurrence significantly diminishes when the camera blur deviates from an ideal blur. These deviations from ideal patch recurrences may be used for recovering the underlying unknown blur kernel. For example, the correct blur kernel may be recovered by seeking the kernel which maximizes the patch similarity across scales of the input image. Quantitative and qualitative experiments indicate that the methods of the present invention may yield improved or superior results, both in “Blind Deblurring” and in “Blind Super-Resolution”.
In accordance with the present invention, for example, a method for performing a signal-processing task on an input signal may comprise: estimating a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal which is a related version of said input signal; wherein the method is implemented by using a device comprising at least a hardware component.
In some embodiments, a device for performing a signal-processing task on an input signal may comprise: a blur kernel estimator to estimate a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal which is a related version of said input signal.
In some embodiments, the device may comprise: a Super Resolution module to perform Blind Super-Resolution of a low-resolution signal, by utilizing patch recurrence across scales of said low-resolution signal to recover a super-resolution blur kernel, and by utilizing said super-resolution blur kernel for generating a high-resolution signal.
In some embodiments, the device may comprise: a deblur module to perform Blind Deblurring of said input signal, by estimating a blur kernel and a sharp version of said input signal, wherein said sharp version of said input signal is related to said input signal by said blur kernel, and wherein patch similarity is maximized across scales of said sharp version of said input signal.
The present invention may provide other and/or additional benefits and/or advantages.



BRIEF DESCRIPTION OF THE DRAWINGS
For simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity of presentation. Furthermore, reference numerals may be repeated among the figures to indicate corresponding or analogous elements. The figures are listed below.
FIG. 1A is a schematic illustration of a default prior-art blur kernel that was used in conventional SR algorithms that yielded low-quality SR results;
FIG. 1B is a schematic illustration of an optimal SR blur kernel that may be recovered or computed in accordance with the present invention, and which may be used in SR algorithms (and/or in other suitable image-processing algorithms) which may yield improved or superior results;
FIG. 2 is a schematic illustration demonstrating a continuous scene, a high-resolution image, and a low-resolution image, and further demonstrating the relations among them, in accordance with the SR algorithm of the present invention;
FIGS. 3A and 3B are schematic illustrations of two graph charts, one graph chart (FIG. 3A) demonstrating a simple discretization of the PSF, and another graph chart (FIG. 3B) demonstrating the optimal SR blur kernel for such a PSF, in accordance with the present invention;
FIG. 4 is a schematic illustration demonstrating utilization of patch-recurrence across scales for recovering the optimal SR blur kernel, in accordance with the present invention;
FIG. 5A is a graph of Nearest Neighbor error versus the number of iterations, demonstrating convergence of the SR kernel recovery algorithm of the present invention;
FIG. 5B is a graph of the relative SR construction error, using an SR algorithm, versus the number of iterations, demonstrating convergence of the SR kernel recovery algorithm of the present invention;
FIG. 6 is an illustration of four blur kernels which may be used for SR or other image-processing algorithms;
FIG. 7 is an illustration of two charts demonstrating the error measures incurred by using internally-recovered kernels and externally-recovered kernels;
FIG. 8 is a schematic illustration of images demonstrating enforcement of cross-scale patch prior in each iteration of the blind-SR algorithm in accordance with the present invention; and
FIGS. 9A-9C are block-diagram illustrations of a demonstrative system and its components and modules, in accordance with the present invention.



DETAILED DESCRIPTION OF SOME EMBODIMENTS
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of some embodiments. However, it will be understood by persons of ordinary skill in the art that some embodiments may be practiced without these specific details. In other instances, well-known methods, procedures, components, units and/or circuits have not been described in detail so as not to obscure the discussion.
Applicants have realized that Super Resolution (SR) algorithms typically utilize a blur kernel while assuming that the blur kernel is known (e.g., the Point Spread Function (PSF) of the camera, or a default low-pass filter, for example, Gaussian filter). However, the performance of SR methods significantly deteriorates when the assumed blur kernel deviates from the true blur kernel. The present invention comprises a framework for “blind” super resolution, which may not rely on such assumption. Applicants have realized that unlike the common belief, the PSF of the camera is a wrong blur kernel to use in SR algorithms. The methods and systems of the present invention may recover the correct SR blur kernel directly from a low-resolution image. This may be achieved by utilizing the inherent recurrence property of small natural image patches, internally within the same image and/or externally in a collection of other natural images). In accordance with the present invention, recurrence of small image patches across scales of the low-resolution image (which forms the basis for single-image SR), may further be used for estimating the optimal blur kernel. This may yield significant improvement in SR results, as well as in results of other image-processing algorithms (e.g., deblurring or anti-blurring, or other image-processing algorithms which aim to sharpen an image or a blurry image), which may utilize an optimal blur kernel calculated or estimated in accordance with the present invention. It is clarified that each image, which is intended to be processed or intended to be a subject for SR or deblurring or other image processing or image enhancement tasks, typically has its own, particular, optimal blur kernel; and that a general blur kernel may not be used, typically, for enhancing a batch of different images.
Applicants have realized that the PSF may vary in practice with zoom, focus, and/or camera shake; and that relying on the wrong blur kernel may lead to low-quality SR results. Applicants have further realized that unlike the common belief, even if the PSF is known, the PSF is the wrong blur kernel to use in SR algorithms. The present invention comprises methods for obtaining the optimal blur kernel directly from the low-resolution image, thereby enabling SR algorithms (or other suitable algorithms that rely on the blur kernel) to utilize the correct or optimal blur kernel.
Applicants have realized that a very limited amount of work has been dedicated to “blind SR”, namely SR in which the blur kernel is not assumed known; and that prior attempts in this field have not yielded quality results. Methods in this category assume some parametric model for the kernel (e.g., still a Gaussian kernel, but with unknown width) and infer its parameters. A nonparametric or “blind” kernel recovery method has been attempted for SR and for deblurring, but assumed that the blur kernel has a single peak, which the Applicants realized is a restrictive assumption in the presence of motion blur. Similarly, methods for jointly estimating the high-resolution image and a nonparametric blur kernel may lead to erroneous results, according to previous studies.
The present invention may provide a robust method for blind SR, based on the property that natural image patches tend to recur abundantly, both across scales of the same image, as well as in an external database of other natural images.
Reference is made to FIG. 1A, which is a schematic illustration of a prior-art blur kernel 101 that has been used in conventional SR algorithms that yielded low-quality SR results. Reference is also made to FIG. 1B, which is a schematic illustration of an optimal blur kernel 102 that may be recovered or computed in accordance with the present invention, for a particular image, and which may be used in SR algorithms (and/or in other suitable image-processing algorithms) which may yield superior results.
A first novel aspect of the present invention is directed to characterizing the optimal blur kernel relating the unknown high-resolution image to the input low-resolution image. In contrast to the common belief, the optimal blur kernel k is not the PSF. Rather, k is typically narrower than the PSF and, counter-intuitively, k may have negative values, a property not shared by the PSF.
A second novel aspect of the present invention is the estimating, calculating and/or determining of k by relying on patch recurrence across scales of the input low-resolution image, a property which has been previously used for non-blind single-image SR. In particular, the blur kernel that maximizes the similarity of recurring patches across scales of the low-resolution image, is also the optimal SR kernel. Based on this principle, an iterative algorithm may be performed for recovering the optimal blur kernel.
A third novel aspect of the present invention is that a blur kernel estimation algorithm may be created or modified to work with an external database of images, recovering the optimal blur kernel relating the low-resolution image to the external high-resolution image examples. It is noted that other example-based SR algorithms may rely on an external database of low-resolution and high-resolution pairs of patches extracted from a large collection of high-quality example images; however, they assume that the blur kernel k is known a-priori, and they use it to generate the low-resolution versions of the high-resolution image examples.
A fourth novel aspect of the present invention comprises an algorithm that computes the Maximum a Posteriori (MAP) estimate of the blur kernel, as opposed to a joint MAP estimation (over the kernel and high-resolution image) of some conventional algorithms. Additionally, plugging the blur kernel, which is estimated in accordance with the present invention, into existing super-resolution algorithms may result in improved reconstructions that are comparable to using the ground-truth blur kernel. For demonstrating the term “ground-truth kernel”, a high-resolution image was down-sampled with a certain (“ground-truth”) kernel to yield a low-resolution image; and the proposed methods of the present invention may be used to estimate the blur kernel from the low-resolution image, with a target to estimate a blur kernel as similar as possible to the ground-truth kernel.
The present invention may calculate the correct or optimal SR kernel. Let l denote a low-resolution image. Super-resolution may be viewed as trying to recover a high-resolution image h of the same scene, as if taken by the same camera, but with an optical zoom-in by a factor of α. This may allow the user to view or notice fine details, which may be smaller than a pixel size in l. In the following equations, parentheses are used in continuous-space functions, and square brackets are used in discrete-space functions.
The low-resolution image l may be generated from a continuous-space image ƒ and a continuous-space PSF bL, as follows:

l[n]=∫ƒ(x)bL(n−x)dx  (1)

The unknown high-resolution image h corresponds to an α times finer grid:




  
    
      
        
          h
          ⁡
          
            [
            n
            ]
          
        
        =
        
          ∫
          
            
              f
              ⁡
              
                (
                x
                )
              
            
            ⁢
            
              
                b
                H
              
              ⁡
              
                (
                
                  
                    n
                    α
                  
                  -
                  x
                
                )
              
            
            ⁢
            
              d
              x
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




In Equation (2), bH is the high-resolution PSF. For example, in the case of optical zoom, bH is a narrower (scaled-down) version of bL, namely:

bH(x)=αbL(αx)  (3)

Reference is made to FIG. 2, which is a schematic illustration demonstrating a continuous scene ƒ(x) 201, a high-resolution image h 202, and a low-resolution image l 203, and further demonstrating the relations among h, l and ƒ.
The high-resolution image h and the low-resolution image l are related by blur and subsample, such that:




  
    
      
        l
        =
        
          
            (
            
              h
              *
              k
            
            )
          
          ↓
          α
        
      
    
    
      
        (
        
          4
          ⁢
          A
        
        )
      
    
  
  
    
      
        
          l
          ⁡
          
            [
            n
            ]
          
        
        =
        
          
            ∑
            m
          
          ⁢
          
            
          
          ⁢
          
            
              h
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              k
              ⁡
              
                [
                
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    n
                  
                  -
                  m
                
                ]
              
            
          
        
      
    
    
      
        (
        
          4
          ⁢
          B
        
        )
      
    
  




In Equation (4B), k is a discrete blur kernel, which is the SR blur kernel that the methods of the present invention may compute and utilize. Although conventional methods often assumed that k is (or resembles) the PSF, in accordance with the present invention the optimal SR kernel is not a simple discretization of the PSF and is not a simple approximation of the PSF.
In accordance with the present invention, substituting Equations (1) and (2) into (4B), and requiring that the equality hold for every possible function ƒ, leads to:




  
    
      
        
          
            ∑
            m
          
          ⁢
          
            
          
          ⁢
          
            
              k
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              
                b
                H
              
              ⁡
              
                (
                
                  x
                  -
                  
                    m
                    α
                  
                
                )
              
            
          
        
        =
        
          
            b
            L
          
          ⁡
          
            (
            x
            )
          
        
      
    
    
      
        (
        5
        )
      
    
  




In accordance with the present invention, bL is a linear combination of translated versions of bH, and the coefficients of this representation constitute the SR kernel k. It may not always be possible to satisfy the relation (5) exactly. The optimal discrete blur kernel, in such cases, corresponds to the least squares solution of Equation (5).
Reference is made to FIGS. 3A and 3B, which are schematic illustrations of two graph charts 301 and 302, respectively, demonstrating unique features of the optimal blur kernel k in accordance with the present invention. Graph chart 301 demonstrates discretization of the PSF via point-wise sampling; whereas graph chart 302 demonstrates the optimal blur kernel k computed from Equation (5) in accordance with the present invention. As demonstrated, the optimal blur kernel k is not a simple discretization of the low-resolution PSF bL(x) (computed for α=2).
FIGS. 3A and 3B further demonstrate additional unique features of the optimal blur kernel k which may be obtained by using the methods of the present invention. For example, in accordance with the present invention, counter-intuitively, in certain settings the optimal blur kernel k relating h and l does not share much resemblance to the PSF bL. In particular, the optimal blur kernel k is not guaranteed to assume only positive values, as often postulated in the context of conventional blind-deblurring methods. The optimal blur kernel k may have negative values. The optimal blur kernel k is often narrower than the PSF bL. The optimal blur kernel k often has a more oscillatory nature than the PSF bL. These phenomena are demonstrated in FIGS. 3A-3B for a 1D rectangular PSF.
The physical interpretation of the optimal blur kernel k may be understood from FIG. 2 as composed of two operations: deconvolution with bH, followed by convolution with bL. Thus, while ignoring sampling issues, the optimal blur kernel k may have the same effect as a continuous-domain filter kc whose Fourier transform is:




  
    
      
        
          
            K
            c
          
          ⁡
          
            (
            ω
            )
          
        
        =
        
          
            
              
                B
                L
              
              ⁡
              
                (
                ω
                )
              
            
            
              
                B
                H
              
              ⁡
              
                (
                ω
                )
              
            
          
          =
          
            
              
                B
                L
              
              ⁡
              
                (
                ω
                )
              
            
            
              
                B
                L
              
              ⁡
              
                (
                
                  ω
                  ⁢
                  
                    /
                  
                  ⁢
                  α
                
                )
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




In Equation (6), Kc, BL, BH are the Fourier transforms of kc, bL, bH, respectively.
If the PSF is an ideal low-pass filter (a sinc in the image domain; a rect in the Fourier domain), then the kernel kc indeed equals to the PSF bL, because rect(ω)/rect(ω/α)=rect(ω). However, typically bL(ω) is not flat on its entire support, and it smoothly decays towards the high frequencies. Consequently, the division by bL(ω/α) amplifies the high frequencies in Kc(ω) with respect to bL(ω), implying that the optimal kernel is usually narrower than the PSF. For example, if the PSF is a Gaussian with width σ, then direct computation shows that kc is also a Gaussian, but with width of σ√{square root over (1−1/α2)}, which is smaller than σ. When the PSF has sharp transitions, the kernel often exhibits an oscillatory behavior, as demonstrated in FIG. 3B.
It is noted that least-square problems of the type corresponding to Equation (5), may have a closed form solution, which corresponds to samples of a function whose Fourier transform is:




  
    
      
        
          
            
              B
              L
            
            ⁡
            
              (
              ω
              )
            
          
          ⁢
          
            
              B
              H
              *
            
            ⁡
            
              (
              ω
              )
            
          
        
        
          
            ∑
            m
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                
                  B
                  H
                
                ⁡
                
                  (
                  
                    ω
                    -
                    
                      2
                      ⁢
                      πα
                      ⁢
                      
                        
                      
                      ⁢
                      m
                    
                  
                  )
                
              
              
            
            2
          
        
      
    
    
      
        (
        
          6
          ⁢
          A
        
        )
      
    
  




The present invention may estimate the optimal blur kernel, for example, by using internal examples. Recurrence of small image patches (e.g., 5×5 pixels, 7×7 pixels, or the like) across scales of a single natural image was analyzed and quantified in for a wide diversity of images. Such cross-scale patch recurrence has been shown to provide a strong cue for SR from a single image. These SR methods, however, assumed a known blur kernel. In accordance with the present invention, the recurrence of image patches across scales may also be utilized to recover the correct blur kernel k relating the unknown high-resolution image h with the low-resolution image l. Furthermore, in accordance with the present invention, the kernel which maximizes similarity of recurring patches across scales of the low-resolution image l, is also the optimal kernel k between images h and l.
Reference is made to FIG. 4, which is a schematic illustration demonstrating utilization of patch-recurrence across scales for recovering the optimal blur kernel. A small pattern ƒ(x) recurs in a continuous scene 410 at multiple sizes, indicated by stars 411 and 412. In a low-resolution image l (denoted 420), patches q and r are discrete observations of these patterns. Ellipses 451 and 452 depict the camera PSF, relating each pixel in the low-resolution image l 420 to its source area in the continuous scene 410. Equation (10) discussed further below, entails that these low-resolution patches are related by the unknown optimal SR kernel k, such that: q=(r*k)↓α. Further shown is a coarse scale image lα (denoted 430). rα is the child patch of r in the coarser image lα 430. According to Equation (10), if the coarse image is generated with the kernel k, then rα=q.
In accordance with the present invention, the observation that small image patches recur across scales of an image, implies that small patterns recur in the continuous scene at multiple sizes. Let ƒ(x) be such a pattern, recurring elsewhere in the continuous scene as ƒ(x/α), namely, α times larger (depicted by the stars 411 and 412 in the continuous scene 410) These two continuous patterns are observed in the low-resolution image 420 by two discrete patterns of different sizes, contained in patches q and r. In accordance with the present invention, the low-resolution patches q and r are related to each other by blurring and subsampling with the (unknown) optimal blur kernel k derived in Equation (5). This is despite the fact that the two patches are captured with the same low-resolution PSF bL (depicted by the orange ellipses 451-452). These insights may be utilized in a kernel recovery algorithm.
Patches q and r are generated by the low-resolution PSF bL as:




  
    
      
        
          q
          ⁡
          
            [
            n
            ]
          
        
        =
        
          ∫
          
            
              f
              ⁡
              
                (
                x
                )
              
            
            ⁢
            
              
                b
                L
              
              ⁡
              
                (
                
                  n
                  -
                  x
                
                )
              
            
            ⁢
            
              d
              x
            
          
        
      
    
    
      
        (
        7
        )
      
    
  
  
    
      
        
          r
          ⁡
          
            [
            n
            ]
          
        
        =
        
          ∫
          
            
              f
              ⁡
              
                (
                
                  x
                  α
                
                )
              
            
            ⁢
            
              
                b
                L
              
              ⁡
              
                (
                
                  n
                  -
                  x
                
                )
              
            
            ⁢
            
              d
              x
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




With a change of integration variables, and by using Equation (3), r may be rewritten as:




  
    
      
        
          r
          ⁡
          
            [
            n
            ]
          
        
        =
        
          
            ∫
            
              
                f
                ⁡
                
                  (
                  x
                  )
                
              
              ⁢
              α
              ⁢
              
                
              
              ⁢
              
                
                  b
                  L
                
                ⁡
                
                  (
                  
                    n
                    -
                    
                      α
                      ⁢
                      
                        
                      
                      ⁢
                      x
                    
                  
                  )
                
              
              ⁢
              
                d
                x
              
            
          
          =
          
            ∫
            
              
                f
                ⁡
                
                  (
                  x
                  )
                
              
              ⁢
              
                
                  b
                  H
                
                ⁡
                
                  (
                  
                    
                      n
                      α
                    
                    -
                    x
                  
                  )
                
              
              ⁢
              
                d
                x
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




Equations (7) and (9) entail that q and r are low-resolution and high-resolution manifestation of the same continuous scene ƒ, namely: q with the PSF bL and with grid spacing 1, while r corresponds to a high-resolution version of q with the PSF bH and grid spacing 1/α. In accordance with the present invention, q corresponds to a down-sampled version of r with the optimal SR kernel k as derived above, namely:




  
    
      
        
          q
          ⁡
          
            [
            n
            ]
          
        
        =
        
          
            ∑
            m
          
          ⁢
          
            
          
          ⁢
          
            
              r
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              k
              ⁡
              
                [
                
                  
                    α
                    ⁢
                    
                      
                    
                    ⁢
                    n
                  
                  -
                  m
                
                ]
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




Equation (10) may be verified by substituting Equations (7) and (9) into (10) and using the property (5) of the optimal kernel k.
Equation (10) induces a linear constraint on the unknown coefficients of the kernel k. Multiple such patch pairs in the low-resolution image would thus allow recovery of the optimal kernel k. It is noted that, as demonstrated in FIG. 4, the right-hand side of Equation (10) corresponds to the coarser-scale patch rα in the coarser version lα of the input image l, namely rα=q (see the coarser image 430 in FIG. 4). Therefore, detecting Nearest-Neighbors (NNs) for the patch q in the coarser image lα provides candidate parents rεl for q. In this strategy, however, to form the “correct” coarse image lα we need to know the optimal kernel k. Nonetheless, in accordance with the present invention, Equation (10) implies that the correct blur kernel k is also the one which maximizes similarity of NNs across scales in the low-resolution image l. The present invention may use this property in the algorithm to obtain the optimal kernel k.
An algorithm in accordance with the present invention may utilize an iterative approach. For example, the algorithm starts with some initial guess {circumflex over (k)}, for k, such as a delta function, and uses it to down-sample l. Next, for each small patch qi in l, the algorithm finds a few nearest neighbors (NNs) in lα and regards the large patches right above them as the candidate “parents” of qi. The so found parent-child pairs (q, r) are then used to construct a set of linear equations (using Equation (10)), which is solved using least-squares to obtain an updated {circumflex over (k)}. These steps may be repeated until convergence.
It is noted that the least squares step does not recover the initial kernel {circumflex over (k)} that was used to down-sample the image, but rather a kernel that is closer to the true kernel k. This is because, as the Applicants have realized, even with an inaccurate kernel, many of the NNs of qi are located at the same image coordinates in lα as the NNs corresponding to the correct kernel k. Thus, in each iteration the number of correct NNs increases, and the estimate gets closer to the correct kernel k. As long as the root mean squared error (RMSE) between patches in l and their NNs in lα keeps decreasing, the algorithm may keep iterating. The applicants' experiments show that this process converges to the correct kernel k quickly (typically within about 15 iterations), and is insensitive to the choice of initial guess {circumflex over (k)}. For example, FIG. 5A demonstrates the convergence of the algorithm, depicting a graph of the NN error versus the number of iterations; and FIG. 5B further demonstrates the convergence of the algorithm, depicting a graph of the relative SR construction error (ERGT) versus the number of iterations. The ERGT may be defined as the ratio between the SR error with the recovered kernel and the SR error with the ground-truth kernel.
In accordance with the present invention, not all patches in l need to recur (have similar patches) in the coarse image lα in order to be able to recover the optimal kernel k. For example, recovering a 7×7 discrete kernel k relating high-resolution image h with low-resolution image l (i.e., having 49 unknowns) may be done with as little as one good 7×7 patch recurring in scales l and lα (i.e., providing 49 equations). When using multiple patches, the NNs should intuitively be weighted according to their degree of similarity to the query patches {qi}, so that good NNs contribute more than their poor counterparts. Some implementations may add a regularization term to the least-squares problem solved in each iteration, in order to impose smoothness constraints on the kernel.
The present invention may estimate the optimal blur kernel by using external image examples. Some example-based SR algorithms rely on an external database of high-resolution patches extracted from a large collection of high-resolution images; but such algorithms assume that the blur kernel k is known a-priori, and use it to downsample the images in the database in order to obtain pairs of low-resolution and high-resolution patches. These pairs may be used to learn how to “undo” the operation of downsampling with k, so that, given an input image l, its corresponding high-resolution version h can be reconstructed. The following discussion explains the physical interpretation of the optimal kernel k when using an external database of examples, and then shows how to estimate this optimal kernel k.
Some embodiments of the present invention may assume, for demonstrative and simplified purposes, that all the high-resolution images in the external database were taken by a single camera with a single PSF. Since the external images form examples of the high-resolution patches in SR, this implicitly induces that the high-resolution PSF bH is the PSF of the external camera. The external camera, however, is most likely not the same as the camera imaging the low-resolution input image l (the “internal” camera). Thus, the high-resolution PSF bH and the low-resolution PSF bL may not necessarily have the same profile (e.g., one is no longer a scaled version of the other). It is noted that the previous discussion remains valid; namely, the kernel k relating the high-resolution and low-resolution images is still given by Equations (5) and (6A) in these settings, but with a PSF bH of a different camera. According to Equation (6), the intuitive understanding of the optimal kernel k when using external high-resolution image examples is (in the Fourier domain):




  
    
      
        
          
            K
            c
          
          ⁡
          
            (
            ω
            )
          
        
        =
        
          
            
              
                B
                L
              
              ⁡
              
                (
                ω
                )
              
            
            
              
                B
                H
              
              ⁡
              
                (
                ω
                )
              
            
          
          =
          
            
              
                PSF
                Internal
              
              ⁡
              
                (
                ω
                )
              
            
            
              
                PSF
                External
              
              ⁡
              
                (
                ω
                )
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




Thus, in SR from external examples the high-resolution patches correspond to the PSF bH of the external camera, and the low-resolution patches generated from them by down-sampling with k should correspond, by construction, to the low-resolution PSF bL of the internal camera. This k is generally unknown (and is assumed by external SR methods to be some default kernel, like a Gaussian kernel or a bicubic kernel).
The present invention may determine the optimal kernel k for external SR in a similar method as for internal SR (as described above), with the exception that the “parent” patches {ri} are now searched in an external database of images, rather than within the input image. As in the internal SR, the algorithm may start with an initial guess {circumflex over (k)} to the kernel k. The algorithm then down-samples the external patches {ri} with {circumflex over (k)} to obtain their low-resolution versions {riα}. Then each low-resolution patch q in the low-resolution image l searches for its NNs among {riα}, to find its candidate parents {ri} in the database. These “parent-child” pairs (q, r) are used to recover a more accurate kernel {circumflex over (k)} via a least-squares solution to a system of linear equations. This process may be repeated iteratively until convergence to the final estimated kernel {circumflex over (k)}.
Reference is made to FIG. 6, which is an illustration of four blur kernels 601-604 which may be used for SR or other image-processing algorithms. Kernel 601 is the ground-truth kernel. Kernel 602 is a default bicubic kernel. Kernel 603 is a kernel estimated by internal recovery, namely, by utilizing image patch recurrence within the image. Kernel 604 is a kernel estimated by external recovery, namely, by utilizing image patch recurrence within images in an external database of images. Applicants have realized that the internal-recovered kernel 603 and/or the external-recovered kernel 603, are much closer to the ground-truth kernel 601 than the default bicubic kernel 602.
The kernel estimation algorithms of the present invention (both the internal approach and the external approach) may be viewed as a principled Maximum a Posteriori (MAP) estimation. Some existing blind SR approaches attempt to simultaneously estimate the high-resolution image h and the kernel k, by assuming a prior on each of them and maximizing the posterior probability p(h, k|l). This MAPh,k approach may lead to inaccurate estimates of k. This is in contrast to the MAPk method, which seeks to estimate k alone, by maximizing its marginal posterior, p (k|l). In accordance with the present invention, the algorithm may compute the MAPk estimate based on a nonparametric prior.
Reference is made to Algorithm (1), which demonstrates MAP kernel estimation in accordance with the present invention:










Algorithm (1)


















Input:
query low-res patches {q1,...,qM}, example high-res patches




{r1,...,rN}



Output:
The MAPk estimate {circumflex over (k)}









initialize {circumflex over (k)} with a delta function;



for t = 1,...,T do



  1. down-sample example image patches



  2. find NNs and compute weights



  3. update {circumflex over (k)}



end










In Algorithm (1), the step of down-sampling example image patches may utilize the following equation:

rjα={circumflex over (k)}  (11A)

In Equation (11A), {circumflex over (k)} is the column-vector representation of the kernel, and Rj is a matrix corresponding to convolution with rj and sub-sampling by α.
In Algorithm (1), the step of finding NNs may be done according to the squared norm between the patches, and computing the weights may utilize the following equation, for each riα which is a NN of qi:




  
    
      
        
          ω
          ij
        
        =
        
          
            exp
            ⁢
            
              {
              
                
                  -
                  
                    1
                    2
                  
                
                ⁢
                
                  
                    
                    
                      
                        q
                        i
                      
                      -
                      
                        r
                        j
                        α
                      
                    
                    
                  
                  2
                
                ⁢
                
                  /
                
                ⁢
                
                  σ
                  2
                
              
              }
            
          
          
            
              ∑
              j
            
            ⁢
            
              
            
            ⁢
            
              exp
              ⁢
              
                {
                
                  
                    -
                    
                      1
                      2
                    
                  
                  ⁢
                  
                    
                      
                      
                        
                          q
                          i
                        
                        -
                        
                          r
                          j
                          α
                        
                      
                      
                    
                    2
                  
                  ⁢
                  
                    /
                  
                  ⁢
                  
                    σ
                    2
                  
                
                }
              
            
          
        
      
    
    
      
        (
        
          11
          ⁢
          B
        
        )
      
    
  




In Equation (11B), qi is the column-vector representation of the low-resolution patch.
In Algorithm (1), the step of updating {circumflex over (k)} may utilize the following equation:




  
    
      
        
          k
          ^
        
        =
        
          
            
              (
              
                
                  
                    1
                    
                      σ
                      2
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        i
                        ,
                        j
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        w
                        ij
                      
                      ⁢
                      
                        R
                        j
                        T
                      
                      ⁢
                      
                        R
                        j
                      
                    
                  
                
                +
                
                  
                    C
                    T
                  
                  ⁢
                  C
                
              
              )
            
            
              -
              1
            
          
          ⁢
          
            
              ∑
              
                i
                ,
                j
              
            
            ⁢
            
              
            
            ⁢
            
              
                w
                ij
              
              ⁢
              
                R
                j
                T
              
              ⁢
              
                q
                i
              
            
          
        
      
    
    
      
        (
        
          11
          ⁢
          C
        
        )
      
    
  




In Equation (11C), C may be a matrix that corresponds to derivatives in the horizontal and vertical directions.
The external kernel estimation method utilizes a collection of image patches {ri} from an external database as candidates for constituting “parents” to small patches from the input image l. The internal kernel estimation method utilizes large patches from the input image l itself, as potential “parents”. Common to both approaches is the utilization of a set of patches {ri} which constitute a good nonparametric representation of the probability distribution of high-resolution patches acquired with the PSF bH. Subsequently, the method may thus assume that it has access to a database patches {r1 . . . rN} of image patches, independently drawn from the distribution p(h).
In accordance with the present invention, assume that the low-resolution image l corresponds to a noisy down-sampled version of the high-resolution image h. Then, every patch qi in l may be expressed in terms of the corresponding high-resolution patch hi in h as:

qi=Khi+ni  (12)

In Equation (12), hi and qi are column vectors representing the high-resolution and low-resolution patches; K is a matrix that corresponds to convolution with k and sub-sampling by a; and ni is noise. The algorithm may assume that {hi}, {ni} and k are statistically independent (e.g., if the query patches {qi} are extracted from distant locations in the low-resolution image l). Accordingly, the MAPk estimate is given by:




  
    
      
        
          
            
              
                k
                ^
              
              =
              
              ⁢
              
                
                  
                    
                      arg
                      ⁢
                      
                        
                      
                      ⁢
                      max
                    
                    ⁢
                    
                      
                    
                  
                  k
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    ∏
                    
                      i
                      =
                      1
                    
                    M
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        
                          q
                          i
                        
                        ❘
                        k
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    arg
                    ⁢
                    
                      
                    
                    ⁢
                    max
                  
                  k
                
                ⁢
                
                  
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    ∏
                    
                      i
                      =
                      1
                    
                    M
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      ∫
                      
                        h
                        i
                      
                      
                        
                      
                    
                    ⁢
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            
                              
                                q
                                i
                              
                              ❘
                              
                                h
                                i
                              
                            
                            ,
                            k
                          
                          )
                        
                      
                      ⁢
                      
                        p
                        ⁡
                        
                          (
                          
                            h
                            i
                          
                          )
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        d
                        
                          h
                          i
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




In Equation (13), M is the number of patches extracted from 1. The above expression may be written in terms of the distribution of the noise. For concreteness, if ni is normally distributed with zero mean and covariance σ2I, then Equations (13) becomes:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              max
            
            ⁢
            
              
            
          
          k
        
        ⁢
        
          p
          ⁡
          
            (
            k
            )
          
        
        ⁢
        
          
        
        ⁢
        
          
            ∏
            
              i
              =
              1
            
            M
          
          ⁢
          
            
          
          ⁢
          
            
              ∫
              h
              
                
              
            
            ⁢
            
              exp
              ⁢
              
                {
                
                  -
                  
                    
                      
                        
                      
                      ⁢
                      
                        
                          
                          
                            
                              q
                              i
                            
                            -
                            Kh
                          
                          
                        
                        2
                      
                    
                    
                      2
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                
                }
              
              ⁢
              
                p
                ⁡
                
                  (
                  h
                  )
                
              
              ⁢
              
                
              
              ⁢
              
                d
                h
              
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




The above utilized the fact that {hi} are identically distributed. Many image processing methods utilize parametric priors p(h) (e.g., which promote sparsity of image gradients). However, in many of these parametric families, the integral in Equation (14) cannot be calculated in closed form, thus requiring approximate solutions. In contrast, the present invention may approximate p(h) in a non-parametric method by using the training patches {rj}.
In accordance with the present invention, the integral in Equation (14) may be written in terms of an expectation over h, so that the objective in (14) may be expressed as:




  
    
      
        
          max
          k
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              k
              )
            
          
          ⁢
          
            
              ∏
              
                i
                =
                1
              
              M
            
            ⁢
            
              
            
            ⁢
            
              
                E
                h
              
              [
              
                exp
                ⁢
                
                  {
                  
                    -
                    
                      
                        
                          
                          
                            
                              q
                              i
                            
                            -
                            Kh
                          
                          
                        
                        2
                      
                      
                        2
                        ⁢
                        
                          σ
                          2
                        
                      
                    
                  
                  }
                
              
              ]
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




This expectation may be approximated by an empirical mean (sample mean) over all high-resolution training patches {ri}:




  
    
      
        
          max
          k
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              k
              )
            
          
          ⁢
          
            
          
          ⁢
          
            
              ∏
              
                i
                =
                1
              
              M
            
            ⁢
            
              
            
            ⁢
            
              
                1
                N
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                
                ⁢
                
                  exp
                  ⁢
                  
                    {
                    
                      -
                      
                        
                      
                      ⁢
                      
                        
                          
                            
                            
                              
                                q
                                i
                              
                              -
                              
                                Kr
                                j
                              
                            
                            
                          
                          2
                        
                        
                          2
                          ⁢
                          
                            σ
                            2
                          
                        
                      
                    
                    }
                  
                
              
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




Under the assumption on {ri}, this approximation is guaranteed to tend to the MAPk solution as N tends to infinity. Therefore, for a large enough collection of training patches, Equation (16) is practically equivalent to the MAPk criterion.
In order to emphasize the dependence of Equation (16) on k, it is noted that the term Krj may be equivalently written as Rjk, where k is the column-vector representation of the kernel and Rj is a matrix corresponding to convolution with rj and sub-sampling by α. Furthermore, a reasonable prior for k is expressed in the following, in which C may be chosen (e.g., to penalize for non-smooth kernels):

p(k)=c·exp{−∥Ck∥2/2}  (16A)

With these substitutions (and taking the log), Equation (16) is equivalent to:




  
    
      
        
          
            min
            k
          
          ⁢
          
            
          
          ⁢
          
            
              1
              2
            
            ⁢
            
              
            
            ⁢
            
              
                
                Ck
                
              
              2
            
          
        
        -
        
          
            ∑
            
              i
              =
              1
            
            M
          
          ⁢
          
            
          
          ⁢
          
            log
            (
            
              
                ∑
                
                  j
                  =
                  1
                
                N
              
              ⁢
              
                
              
              ⁢
              
                exp
                ⁢
                
                  {
                  
                    -
                    
                      
                        
                          
                          
                            
                              q
                              i
                            
                            -
                            
                              
                                R
                                j
                              
                              ⁢
                              k
                            
                          
                          
                        
                        2
                      
                      
                        2
                        ⁢
                        
                          σ
                          2
                        
                      
                    
                  
                  }
                
              
            
            )
          
        
      
    
    
      
        (
        17
        )
      
    
  




For this optimization, a kernel k achieving good score is such that if it is used to down-sample the training patches in the database, then each of the query patches {qi} should find as many good nearest neighbors (NNs) as possible.
Minimizing Equation (17) may be done in an iterative manner, such that each iteration down-samples the training patches using the current estimate {circumflex over (k)} of k, finds nearest neighbors to the query patches {qi}, and updates {circumflex over (k)} by solving a weighted least-squares problem. More specifically, setting the gradient of Equation (17) to zero, leads to a version of the iteratively re-weighted least squares (IRLS) procedure, as outlined in Algorithm (1). Each equation induced by an NN rα of a low-resolution patch q is weighted by the degree of similarity between rα and q. It is noted that in practice, only those patches in the database whose distance to q is small (not much larger than σ) are assigned non-negligible weights, so that the number of required NNs per low-resolution patch is typically small. This interpretation may provide a more concrete methodology for implementing the internal and external methods described above.
Applicants have validated the benefit of using the SR kernel estimation methods of the present invention, both empirically (on low-resolution images generated with ground-truth data), as well as visually on real images. In a demonstrative experiment, the low-resolution patches q and rα were 5×5 patches. Some experiments were run with scaling factors of α=2 (namely, SR×2) and α=3 (namely, SR×3); and typically solved for 9×9 kernels, 11×11 kernels, or 13×13 kernels. The noise level was assumed to be σ=10. For the external kernel recovery, some experiments used a database of 30 natural images downloaded from the Internet (most likely captured by different cameras). The regularization in the least-squares stage of each iteration (see Algorithm (1)) was performed with a matrix C corresponding to derivatives in the horizontal and vertical directions.
In order to quantify the effect of the estimated kernel {circumflex over (k)} on SR algorithms, some experiments may utilize two measures. A first measure may be an Error Ratio to Ground Truth (ERGT), which may measure the ratio between the SR reconstruction error with the estimated kernel {circumflex over (k)} and the SR reconstruction error with the ground-truth kernel k, namely:

ERGT=∥h−ĥ{circumflex over (k)}∥2/∥h−ĥk∥2  (17A)

Values close to 1 indicate that the estimated kernel {circumflex over (k)} is nearly as good as the ground-truth kernel k. A second measure is the Error Ratio to Default (ERD), which quantifies the benefit of using the estimated kernel {circumflex over (k)} over the default (typically bicubic) kernel kd, and is defined as:

ERGT=∥h−ĥ{circumflex over (k)}∥2/∥h−ĥkd∥2  (17B)

ERD values that are much smaller than 1, indicate a large improvement.
Experiments by the Applicants showed that plugging the recovered kernel {circumflex over (k)} into conventional SR methods may lead to substantial improvement in the resulting high-resolution image over using their assumed default (bicubic) kernel. It is noted that the recovered kernels are much wider than the default (bicubic) kernel. The differences in the resulting high-resolution images are observed both visually, and numerically when compared to the ground-truth image. For example, in some experiments that pertained to a specific image and attempted to estimate an optimal blur kernel closest to the ground-truth kernel, a first SR algorithm that was adapted to utilize internal kernel recovery achieved ERD=0.45 and ERGT=1.02; and a second SR algorithm that was adapted to utilize external kernel recovery achieved ERD=0.43 and ERGT=1.01.
Some experiments by the Applicants showed the convergence of the internal kernel estimation algorithm applied to a low-resolution input image. For example, the RMSE between patches in the image and their NNs in the coarser scale rapidly decreases; demonstrating that the algorithm of the present invention indeed maximizes the similarity of recurring patches across scales. Moreover, the ERGT of the SR reconstruction decreases with each iteration towards 1; thereby implying that the estimated kernel converges to SR performance of the ground-truth kernel.
The iterative algorithm of the present invention is fairly insensitive to the initialization of the kernel. In an experiment by the Applicants, an image was obtained by down-sampling a large image by a factor of 3 with a Gaussian kernel. The experiment ran 30 iterations of both the internal and the external algorithms, each time with a different initial kernel. These include a delta function, as well as randomly sampled kernels. In the experiment, both algorithms consistently converged to estimated kernels which are close to the ground-truth kernel, regardless of the initial guess.
In order to empirically validate the algorithm of the present invention, the Applicants further performed a large statistical analysis on hundreds of images with randomly varying ground-truth kernels. FIG. 7 demonstrates the error measures incurred by using internally-recovered kernels (chart 701) and externally-recovered kernels (chart 702), in accordance with the present invention. In the experiment, 100 test images were down-sampled by a factor of 3, each with several 7×7 kernels. The kernels were drawn randomly from the prior on k assumed as discussed above (with the matrix C corresponding to derivatives in the horizontal and vertical directions), i.e., randomly sampled smooth kernels. The plots in charts 701-702 depict the distribution of the error measures. As demonstrated, SR with the estimated kernel performs similarly to SR with the ground-truth kernel (ERGT≈1) and performs better than with the default kernel (ERD<1).
Further experiments by the Applicants demonstrated that the results of using the present invention's internal recovery scheme on real images yielded visually-superior results, relative to SR utilizing the default kernel; in both historic photographs downloaded from the Internet, as well as in real images captured by a smartphone.
In accordance with the present invention, contrary to the common belief, the PSF of the camera is the wrong blur kernel k to use in SR algorithms. The correct blur kernel k may be recovered directly from the low-resolution image, by utilizing the recurrence of small image patches, either at coarser scales of the same image, or in an external database of images. This is shown to be a principled MAP estimation of k, and leads to a significant improvement in SR results, as well as in results of other image-processing algorithms that may utilize the blur kernel.
The present invention may be used in conjunction with classic up-scaling methods. Although the experiments herein demonstrated the approach on patch-based single-image SR techniques, the methods and algorithm of the present invention may be used in conjunction with any suitable method or algorithm that requires or utilizes knowledge of the blur kernel. This includes, for example, multi-image SR settings, in which each image may experience a different blur, generalized interpolation methods such as consistent interpolation the minimax regret method and other techniques (e.g., hybrid Wiener filter, dense grid recovery schemes).
Image de-blurring, or the process of removing blur without increasing resolution, may be regarded a special case of image SR, corresponding to a scale factor of α=1. Accordingly, the blind SR algorithm of the present invention, which may utilize an external database of images, may similarly be used as a blind de-blurring method, by setting α=1.
In accordance with the present invention, the discrete blur kernel k[n] may be estimated from the low-resolution image l. In some cases, it may be desired to estimate the continuous-space PSF bL(x). Once an estimate of the discrete blur kernel k[n] is available, an estimate of the continuous-space PSF bL(x) may be obtained by utilizing Equation (5). The continuous-space PSF bL(x) may be used, for example, to de-blur an image, in order to obtain a sharper image (even without increasing resolution). A more detailed discussion of estimating a blur kernel for enhancing image deblurring is further discussed herein below.
The blind SR methods of the present invention may be used in various applications, for example, medical imaging, defense and security imaging systems, conversion of television broadcasts to high-definition (HD), and other suitable hardware systems and/or software modules that may require or may utilize up-scaling of an image to a larger size. The methods of the present invention may be regarded as performing “digital zoom”, by a camera, a camcorder, a mobile phone, a smartphone, a tablet, or other suitable electronic devices, as well as in image processing or photo editing software applications. In some conventional devices, the “digital zoom” function implements a simple image up-scaling algorithm that does not truly recover details that are smaller than a pixel size; and even with more advanced SR techniques, the results of such “digital zoom” are often unsatisfactory. In contrast, the algorithms of the present invention may boost the performance of any SR technique, thereby enabling high-quality “digital zoom”.
The present invention may be used in conjunction with non-uniform blur. For example, an image may be affected by motion blur that is non-uniform across the scene. Such cases may be handled by running the algorithm of the present invention separately on different parts or regions of the image, and extracting a different blur kernel for each such part or region of the image.
The present invention may be used for Space-Time Super-Resolution. For example, SR may be applied not only to increase spatial resolution, but also to increase temporal resolution of video sequences. In this context, it may be required to know the temporal blur, which is associated with the temporal integration of the sensor array elements. The techniques of the present invention may be used to recover the temporal or spatio-temporal (three-dimensional) blur kernel required for performing temporal or spatio-temporal SR. This may be done both with an external database of 3D spatio-temporal patches, or from the input video itself (as such patches tend to recur across scales of natural videos).
The present invention further comprises methods, algorithms, and systems for blind deblurring of an image, by utilizing internal patch recurrence. In accordance with the present invention, recurrence of small image patches across different scales of a natural image may be used for “blind-deblurring”, namely, removal of an unknown blur from a blurry image. While patches repeat ‘as is’ across scales in a sharp natural image, this cross-scale recurrence significantly diminishes in blurry images.
For example, the cross-scale patch recurrence is strong in sharp images and weak in blurry images. Small patches (e.g., 5×5 pixels, or 7×7 pixels) tend to recur across scales in an “ideal” (sharp) natural image x; namely, if natural image x is down-scaled by a factor of α, then for most patches in image x, there exist almost identical patches in the down-scaled image {circumflex over (x)}α. In contrast, in a blurry image y that takes the form of Equation (18) discussed herein, this is no longer true. The similarity between patches in the blurry image y and in its down-scaled version yα is significantly reduced. Patches in the down-scaled version yα tend to be α-times sharper than their corresponding patches in the blurry image y. In accordance with the present invention, down-scaling the blurry image generates a pool of sharper patches, which may be used as a prior for removing the blur in the blurry image y.
The method of the present invention may utilize these deviations from ideal patch recurrence, as a cue for recovering the underlying (unknown) blur kernel. More specifically, the method searches for the blur kernel k, such that if its effect is “undone” (if the blurry image is deconvolved with k), then the patch similarity across scales of the image will be maximized. Experimental evaluations indicate that the blind deblurring method of the present invention outperforms conventional blind deblurring methods.
If the blur is uniform (i.e., same blur across the entire image), the blurry image y may be modeled as having been obtained from the desired sharp image x as:

y=k*x+n  (18)

In Equation (18), the symbol * denotes convolution; k is some blur kernel and n is noise.
Since both the blur kernel k and the sharp image x are unknown, and since many different pairs of x and k may result in the same blurry image y, many conventional blind deblurring methods rely heavily on the availability of prior knowledge on x.
The present invention comprises a method for blind-deblurring, which is based on the internal patch recurrence property within a single natural image. Almost any small image patch in a sharp natural image (e.g., 5×5 or 7×7 pixels) re-appears “as is” (without shrinking the patch) in smaller scaled-down versions of the image. The utilization of external patch-priors (extracted from a large collection of natural images) has been compared to the utilization of internal patch-priors (extracted from within the image). Although limited in their number, the internal image-specific patches provide better examples (a stronger prior) with stronger predictive power than a generic external collection of natural patches. In accordance with the present invention, this superiority of the internal image-specific patches is true for blind-deblurring. In fact, utilizing the internal patch recurrence prior may lead to better results than all previous blind-deblurring methods, including conventional external patch-based method of deblurring.
It is noted that employing the internal patch prior in the case of blind deblurring may be challenging. While externally, all patches are sharp, internally all the patches of a blurry image suffer from the blur. Nevertheless, while the blur is strong in the original scale, the blur decreases at coarser scales of the image. Thus, sharper image patches “emerge” in coarser scales of the blurry image. The patches in coarser image scales may thus serve as a good patch prior (sharper examples) for deblurring the input scale. This may allow recovery of the unknown blur kernel.
While patches repeat across scales in a sharp natural image, this cross-scale recurrence significantly diminishes in blurry images. The present invention utilizes these deviations from ideal patch recurrence as a cue for recovering the underlying (unknown) blur kernel. This is done by seeking a blur kernel k, such that if its effect is undone (namely, if y is deconvolved by k), the patch similarity across scales will be maximized. More specifically, we look for an image {circumflex over (x)} and a blur kernel {circumflex over (k)} such that on the one hand, {circumflex over (x)} satisfies the patch recurrence property (namely, strong similarity between patches across scales of {circumflex over (x)}), and, on the other hand, {circumflex over (k)} *{circumflex over (x)} is close to the blurry image y. This may be done by solving the optimization problem:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              
                x
                ^
              
              ,
              
                k
                ^
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                y
                -
                
                  
                    k
                    ^
                  
                  *
                  
                    x
                    ^
                  
                
              
              
            
            2
          
        
        +
        
          
            λ
            1
          
          ⁢
          
            ρ
            ⁡
            
              (
              
                
                  x
                  ^
                
                ,
                
                  
                    x
                    ^
                  
                  α
                
              
              )
            
          
        
        +
        
          
            λ
            2
          
          ⁢
          
            
              
              
                k
                ^
              
              
            
            2
          
        
      
    
    
      
        (
        19
        )
      
    
  




In optimization problem (19), {circumflex over (x)}α is an α-times smaller version of {circumflex over (x)}; the data term is ∥y−{circumflex over (k)}*{circumflex over (x)}∥2; the image prior is ρ({circumflex over (x)},{circumflex over (x)}α); and the kernel prior is ∥{circumflex over (k)}∥2, a regularizer on the kernel k. The image prior ρ({circumflex over (x)},{circumflex over (x)}α) is a function that measures the degree of dissimilarity between patches in {circumflex over (x)} and their Nearest Neighbor patches (NNs) in the down-scaled version {circumflex over (x)}α.
Optimization problem (19) may be interpreted as a joint MAP estimation of x and k. With simple parametric priors (e.g., those that promote sparsity of image gradients) the joint MAP strategy often under-estimates the amount of blur, and thus results in a blurry image {circumflex over (x)}. However, the nonparametric prior term ρ({circumflex over (x)}, {circumflex over (x)}α) of the present invention, does not suffer from this bias towards blurry reconstructions {circumflex over (x)}, and may therefore yield improved results. This is due to the fact that small patches in a natural sharp image {circumflex over (x)} typically have similar patches (NNs) in its down-scaled version in {circumflex over (x)}α; and therefore, for a sharp {circumflex over (x)} the penalty ρ({circumflex over (x)},{circumflex over (x)}α) is small. In contrast, patches in a blurry {circumflex over (x)} are less similar to patches in its down-scaled version {circumflex over (x)}α; and therefore, for a blurry image {circumflex over (x)} the penalty ρ({circumflex over (x)}, {circumflex over (x)}α) is large.
The present invention may solve the optimization problem (19), namely, seeking the blur kernel {circumflex over (k)} such that, if its effect is undone (if y is deblurred by {circumflex over (k)}), will maximize the cross-scale similarity of patches in the deblurred image {circumflex over (x)}. Since no closed form solution is available for problem (19), the present invention may utilize an iterative process, in which each iteration comprises three steps, as demonstrated for example in Algorithm (2):










Algorithm (2)


















Input:
   Blurry image y



Output:
   Blur kernel k









Initialize {circumflex over (k)} = δ and {circumflex over (x)} = y;



for t = 1,...,T do



   1. Image Prior Update



   2. Deblurring



   3. Kernel Update



end










In Algorithm (2), the iterative process is initialized with the blur kernel {circumflex over (k)} being a delta function, and {circumflex over (x)} is initially the blurry input image y. In each iteration, the first step (updating the image prior) may comprise down-scaling image {circumflex over (x)} by a factor of α to obtain a down-scaled version {circumflex over (x)}α. In each iteration, the second step (deblurring) may comprise minimizing the objective function in problem (19) with respect to {circumflex over (x)} holding {circumflex over (k)} and {circumflex over (x)}α fixed. In each iteration, the third step (updating the kernel) may comprise minimizing the objective function in problem (19) with respect to {circumflex over (k)}, holding {circumflex over (x)} and {circumflex over (x)}α fixed.
Even though Algorithm (2) iterates between an x-step (updating {circumflex over (x)} with {circumflex over (k)} fixed) and a k-step (updating {circumflex over (k)} with {circumflex over (x)} fixed), Algorithm (2) is different from conventional algorithms which might appear similar. Particularly, the x-step in Algorithm (2) is fundamentally different from conventional algorithms. Rather than using a fixed generic prior on natural images, the present invention utilizes an evolving image-specific prior based on patches extracted from the down-scaled (sharper) version of the blurry image. Since the estimated {circumflex over (x)} gets sharper from iteration to iteration, in accordance with the present invention, the image prior also changes from iteration to iteration.
Step 1 of Algorithm (2) operates to produce an image version {circumflex over (x)}α, which serves as a pool of sharper patches. If we shrink a blurry image {circumflex over (x)} by a factor of α, then the result version {circumflex over (x)}α contains α-times less the amount of blur. For example, if we scale-down the image {circumflex over (x)} by a factor of α=2, then an edge smeared over 10 pixels in image {circumflex over (x)} would appear smeared over only 5 pixels in the down-scaled version {circumflex over (x)}α. However, the scaled-down image is also α-times smaller than {circumflex over (x)}. In accordance with the present invention, it may be proven that despite the fact that {circumflex over (x)}α is smaller, the pool of small patches (e.g., 5×5 pixels) extracted from version {circumflex over (x)}α is roughly the same as the pool of small patches extracted from the larger image {circumflex over (x)}α only α-times sharper. This is due to the recurrence of small patterns at various sizes in the continuous scene.
Step 1 of Algorithm (2) resulted in a down-scaled image version {circumflex over (x)}α, which provides a pool of patches that are α-times sharper than those in the image estimate {circumflex over (x)}. These patches are used in Step 2 of Algorithm (2) as examples for how patches in {circumflex over (x)} should look like if we were to sharpen them by a factor of α. To construct a new α-times sharper image {circumflex over (x)}, step 2 of Algorithm (2) minimizes the objective function in problem (19) with respect to {circumflex over (x)} while holding {circumflex over (k)} and {circumflex over (x)}α fixed. This is in fact the deblurring of image y by the current kernel estimate {circumflex over (k)}, where the prior is represented by the patches in {circumflex over (x)}α. For example, in the first iteration (in which {circumflex over (k)}=δ), we solve:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              x
              ^
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                y
                -
                
                  x
                  ^
                
              
              
            
            2
          
        
        +
        
          
            λ
            1
          
          ⁢
          
            ρ
            ⁡
            
              (
              
                
                  x
                  ^
                
                ,
                
                  
                    x
                    ^
                  
                  α
                
              
              )
            
          
        
      
    
    
      
        (
        20
        )
      
    
  




This results in an image {circumflex over (x)}, which is close to the input image y, but at the same time its patches are similar to the α-times sharper patches in: {circumflex over (x)}α. Therefore, the image {circumflex over (x)}1 recovered in the first iteration contains α-times less the amount of blur than image y. At the second iteration, the image in {circumflex over (x)}2 is α-times sharper than {circumflex over (x)}1, and thus α2-times sharper than image y. The image {circumflex over (x)}l at the l-th iteration is αl times sharper than the input image y, and tends to x for large l.
Step 3 in Algorithm (2) updates the kernel estimate {circumflex over (k)}, by computing the blur between the current deblurred estimate {circumflex over (x)} and the input image y. Thus, in the l-th iteration, the kernel estimate {circumflex over (k)}l is such that y={circumflex over (k)}l*{circumflex over (x)}l. For large enough l, the image estimate {circumflex over (x)}l converges to x, and accordingly the kernel estimate {circumflex over (k)}l converges to k, which is the output of Algorithm (2).
Reference is made to FIG. 8, which is a schematic illustration of images 801-804 demonstrating enforcement of the cross-scale patch prior in each iteration of Algorithm (2). Referring to image 801, a small pattern recurs in a continuous scene at multiple sizes (indicated by stars 851 and 852). Referring to image 802, at the l-th iteration, the image estimate {circumflex over (x)}l corresponds to the convolution of the scene with the kernel estimate {circumflex over (k)}l; and thus the two patterns in the scene appear as two blurry patches q and r in the image estimate {circumflex over (x)}l. Referring to image 803, in the down-scaled version {circumflex over (x)}lα, the child patch of r contains the same structure as the patch q in {circumflex over (x)}l, only α-times sharper. Referring to image 804, Algorithm (2) constructs a sharper image estimate {circumflex over (x)}l+1 such that each of its patches is constrained to be similar to its sharper version in {circumflex over (x)}lα (e.g., the new version of q in {circumflex over (x)}l+1 should be similar to the sharper patch rα in {circumflex over (x)}lα).
Referring again to step 1 of Algorithm (2), the purpose of this step is to produce from the current image estimate {circumflex over (x)}, a pool of patches that are less blurry. In accordance with the present invention, shrinking a blurry image y by a factor of α, generates an α-times smaller image yα, which contains approximately the same pool of patches as in (the larger) image y, only α-times sharper.
It is known that most patches in a sharp natural image, recur multiple times in its scaled-down version; and that the source of this patch recurrence is the repetitions of small patterns at various sizes in the continuous scene. Consider a small pattern ƒ(ξ) in the continuous scene which recurs elsewhere as ƒ(ξ/α), namely, a times larger (demonstrated by stars 851-852 in FIG. 8). Temporarily ignoring sampling issues, these two patterns are convolved with the blur of the camera k(ξ), and appear in the observed image 802 as patches q and r there:




  
    
      
        
          
            q
            ⁡
            
              (
              ξ
              )
            
          
          =
          
            
              k
              ⁡
              
                (
                ξ
                )
              
            
            *
            
              f
              ⁡
              
                (
                ξ
                )
              
            
          
        
        ,
        
          
            r
            ⁡
            
              (
              ξ
              )
            
          
          =
          
            
              k
              ⁡
              
                (
                ξ
                )
              
            
            *
            
              f
              ⁡
              
                (
                
                  ξ
                  α
                
                )
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




Upon shrinking the blurry image by a factor of α, the patch r becomes

rα(ξ)=r(αξ)=α·k(αξ)*ƒ(ξ)  (22)

Accordingly, rα(ξ) corresponds to the same continuous structure, ƒ(ξ), but convolved with the α-times narrower kernel α·k(αξ), rather than with k(ξ). This implies that the patch rα in the smaller image is exactly an α-times sharper version of the patch q in the original blurry image, as demonstrated in image 803 of FIG. 8.
The above shows that shrinking an image by a factor of α produces a pool of patches of the same size that are α-times sharper. Step 2 of Algorithm (2) utilizes this pool of sharper patches as a non-parametric prior for the purpose of sharpening the blurry image by a factor of α. Thus, ignoring sampling issues, the first iteration of the algorithm recovers an image of the scene blurred with the narrower kernel α·k(αξ). The second iteration further reduces the blur to α2·k(α2ξ), and so on. The residual blur in the sequence of recovered images becomes narrower and narrower and eventually converges to:

liml→∞αl·k(αlξ)=δ(ξ)  (23)

The discussion above ignored sampling issues and utilized continuous signals, whereas in practice the algorithm may operate on discrete images. Had the image in {circumflex over (x)}l recovered in the l-th iteration corresponded to point-wise samples of αl·k(αlξ)*ƒ(ξ), the process would eventually tend to point-wise samples of the continuous ƒ(ξ), which would cause aliasing effects. Indeed, the Fourier transform of αl·k(αlξ)*ƒ(ξ), which is K(ω/αl), converges (for all ω) to:

liml→∞K(ω/αl)=K(0)=1  (24)

Therefore, eventually, all frequencies would have been retained prior to sampling.
To avoid undesired aliasing effects, the method's goal is that the recovered in {circumflex over (x)}l would correspond to samples of the continuous scene f (ξ) filtered with the band-limited blur kernel K(ω/αl)·rect(ω), where rect(ω)=1 for |ω|<π (the Nyquist frequency) and is zero elsewhere. The method operates to shrink the blur in the spatial domain (expand it in the frequency domain), but not beyond the Nyquist frequency π (namely, zero all frequencies above π). Accordingly, as l tends to infinity, the function K(ω/αl)·rect(ω) tends to K(0)·rect(ω)=rect(ω). Therefore, in this case, {circumflex over (x)}l converges to samples of the continuous scene convolved with the ideal low-pass filter sinc (ξ).
In accordance with the present invention, the down-scaling operation performed on the blurry image {circumflex over (x)}l should be done so that patches in the resulting down-scaled version {circumflex over (x)}lα are discrete versions of the continuous scene blurred with K(ω/αl)·rect(ω). The Applicants have further realized, based on calculations and derivations, that if the camera blur K(ω) is band-limited to π, so that the blurry image y does not suffer from aliasing, then down-sampling with a sinc kernel leads exactly to the desired result. Therefore, in Step 1 of Algorithm (2), the down-scaling is performed using a sinc kernel.
Referring now to step 2 of Algorithm (2), this step minimizes the objective function in optimization problem (19) with respect to {circumflex over (x)} while holding {circumflex over (k)} and {circumflex over (x)}α fixed. Disregarding the last term in problem (19), which does not depend on {circumflex over (x)}, this step solves:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              x
              ^
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                y
                -
                
                  
                    k
                    ^
                  
                  *
                  
                    x
                    ^
                  
                
              
              
            
            2
          
        
        +
        
          
            λ
            1
          
          ⁢
          
            ρ
            ⁡
            
              (
              
                
                  x
                  ^
                
                ,
                
                  
                    x
                    ^
                  
                  α
                
              
              )
            
          
        
      
    
    
      
        (
        25
        )
      
    
  




This step is in effect a deblurring of image y by the kernel estimate so far, {circumflex over (k)}. It is noted that {circumflex over (k)} may still be far from the correct k, so that the deblurred image {circumflex over (x)} being constructed is not yet a sharp image. This is in contrast to conventional non-blind deblurring methods, which rely on priors for sharp natural images and seek to recover a sharp deconvolved image. In accordance with the present invention, the deconvolved image {circumflex over (x)}, which is still partially blurry, is obtained in Equation (25) by using patches from the smaller image and {circumflex over (x)}α as a prior. These patches contain a residual blur that approximately corresponds to the current {circumflex over (k)}, and therefore serve as a good non-parametric prior for the current deblurring step.
In order to solve the “partial” deblurring problem (25), instead of using a natural image prior (e.g., learned from an external database of sharp patches), the present invention utilizes an image prior that is learned from the patches in {circumflex over (x)}α. Problem (25) may be written in vector form as:




  
    
      
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              min
            
            
              x
              ^
            
          
          ⁢
          
            
          
          ⁢
          
            
              
              
                y
                -
                
                  
                    K
                    ^
                  
                  ⁢
                  
                    x
                    ^
                  
                
              
              
            
            2
          
        
        +
        
          
            λ
            1
          
          ⁢
          
            ρ
            ⁡
            
              (
              
                
                  x
                  ^
                
                ,
                
                  
                    x
                    ^
                  
                  α
                
              
              )
            
          
        
      
    
    
      
        (
        26
        )
      
    
  




In Equation (26), {circumflex over (K)} is a matrix that corresponds to convolution with {circumflex over (k)}.
In accordance with the present invention, the formal definition of the function ρ({circumflex over (x)}, {circumflex over (x)}α) is minus the Expected Log Likelihood (EPLL) of patches in {circumflex over (x)} namely:

ρ({circumflex over (x)}, {circumflex over (x)}α)=−Σj log p(Qj{circumflex over (x)})  (27)

In Equation (27), Qj is a matrix that extracts the j-th patch from {circumflex over (x)}.
In accordance with the present invention, the probability p(Qj{circumflex over (x)}) may be learned from the patches in {circumflex over (x)}α. Letting Ri denote the matrix which extracts the i-th patch from {circumflex over (x)}α, the probability p(Qj{circumflex over (x)}) may be approximated using non-parametric density kernel estimation as:




  
    
      
        
          p
          ⁡
          
            (
            
              
                Q
                j
              
              ⁢
              
                x
                ^
              
            
            )
          
        
        =
        
          c
          ⁢
          
            
              ∑
              i
              
                
              
            
            ⁢
            
              
            
            ⁢
            
              exp
              ⁢
              
                {
                
                  
                    -
                    
                      1
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        
                          h
                          2
                        
                      
                    
                  
                  ⁢
                  
                    
                      
                      
                        
                          
                            Q
                            j
                          
                          ⁢
                          
                            x
                            ^
                          
                        
                        -
                        
                          
                            R
                            i
                          
                          ⁢
                          
                            
                              x
                              ^
                            
                            α
                          
                        
                      
                      
                    
                    2
                  
                
                }
              
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




In Equation (28), h is a bandwidth parameter, and c is a constant independent of {circumflex over (x)}. This results in the prior term:




  
    
      
        
          ρ
          ⁡
          
            (
            
              
                x
                ^
              
              ,
              
                
                  x
                  ^
                
                α
              
            
            )
          
        
        =
        
          -
          
            
              ∑
              j
              
                
              
            
            ⁢
            
              
            
            ⁢
            
              log
              (
              
                
                  ∑
                  i
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                  exp
                  ⁢
                  
                    {
                    
                      
                        -
                        
                          1
                          
                            2
                            ⁢
                            
                              
                            
                            ⁢
                            
                              h
                              2
                            
                          
                        
                      
                      ⁢
                      
                        
                          
                          
                            
                              
                                Q
                                j
                              
                              ⁢
                              
                                x
                                ^
                              
                            
                            -
                            
                              
                                R
                                i
                              
                              ⁢
                              
                                
                                  x
                                  ^
                                
                                α
                              
                            
                          
                          
                        
                        2
                      
                    
                    }
                  
                
              
              )
            
          
        
      
    
    
      
        (
        29
        )
      
    
  




Having defined ρ({circumflex over (x)}, {circumflex over (x)}α), an algorithm may be derived for minimizing the objective of Equation (26). Applicants have realized that substituting Equation (29) into Equation (26) and setting the gradient to zero, leads to the requirement that:

({circumflex over (K)}T{circumflex over (K)}+βI){circumflex over (x)}={circumflex over (K)}Ty+βz  (30)

In Equation (30), I is the identity matrix; β=0.5M2λ1/h2, where M is the width of the patches (assuming square patches); and z is an image constructed by replacing each patch in {circumflex over (x)} by a weighted average of its nearest neighbor (NN) patches in {circumflex over (x)}α.
More specifically, z is constructed by tiling patches zi, while averaging overlaps:




  
    
      
        z
        =
        
          
            1
            
              M
              2
            
          
          ⁢
          
            
              ∑
              j
              
                
              
            
            ⁢
            
              
                Q
                j
                T
              
              ⁢
              
                z
                j
              
            
          
        
      
    
    
      
        (
        
          30
          ⁢
          A
        
        )
      
    
  




Each patch zi corresponds to a weighted average of patches from {circumflex over (x)}α:




  
    
      
        
          z
          j
        
        =
        
          
            ∑
            i
            
              
            
          
          ⁢
          
            
              w
              
                i
                ,
                j
              
            
            ⁢
            
              R
              i
            
            ⁢
            
              
                x
                ^
              
              α
            
          
        
      
    
    
      
        (
        
          30
          ⁢
          B
        
        )
      
    
  




The weights wi,j are computed according to the degree of similarity between patch j from x and patch i from {circumflex over (x)}α:




  
    
      
        
          w
          
            i
            ,
            j
          
        
        =
        
          
            exp
            ⁢
            
              {
              
                
                  1
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    
                      h
                      2
                    
                  
                
                ⁢
                
                  
                    
                    
                      
                        
                          Q
                          j
                        
                        ⁢
                        
                          x
                          ^
                        
                      
                      -
                      
                        
                          R
                          i
                        
                        ⁢
                        
                          
                            x
                            ^
                          
                          α
                        
                      
                    
                    
                  
                  2
                
              
              }
            
          
          
            
              ∑
              m
              
                
              
            
            ⁢
            
              exp
              ⁢
              
                {
                
                  
                    1
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      
                        h
                        2
                      
                    
                  
                  ⁢
                  
                    
                      
                      
                        
                          
                            Q
                            j
                          
                          ⁢
                          
                            x
                            ^
                          
                        
                        -
                        
                          
                            R
                            m
                          
                          ⁢
                          
                            
                              x
                              ^
                            
                            α
                          
                        
                      
                      
                    
                    2
                  
                
                }
              
            
          
        
      
    
    
      
        (
        
          30
          ⁢
          C
        
        )
      
    
  




Equation (30) cannot be solved in closed form since z depends non-linearly on {circumflex over (x)}. Instead, the method may alternate a few times between solving for while keeping z fixed, and computing z based on the newly found {circumflex over (x)} using Equations (30A) and (30B).
In accordance with the present invention, in the first phase, the method replaces each patch in the current image {circumflex over (x)} by a weighted average of its NNs (using L2 distance) from the (sharper) image in {circumflex over (x)}α. This step actually enforces the prior of the present invention, which is that patches in the recovered image should be similar to patches in {circumflex over (x)}α. The resulting image z, however, does not necessarily conform to the data fidelity term, which requires that when the reconstruction is blurred with {circumflex over (k)}, it should be similar to the input image y. Thus, in the second phase, the method plugs z back into Equation (30) and updates {circumflex over (x)}. The method then repeats the NN search for the patches in the updated {circumflex over (x)}, generates an updated z, and so forth. Alternating these steps a few times, leads to an image {circumflex over (x)} which satisfies both requirements; namely, the patches of {circumflex over (x)} are similar to those in in {circumflex over (x)}α, and its blurry version {circumflex over (x)}*{circumflex over (k)} resembles the input image y.
Referring now to step 3 in Algorithm (2), this step corresponds to updating the kernel {circumflex over (k)}, given the current estimate of the image {circumflex over (x)}. Disregarding the second term in Equation (19), which does not depend on {circumflex over (k)}, the optimization problem may be written in vector form as:




  
    
      
        
          
            
              
                arg
                ⁢
                
                  
                
                ⁢
                min
              
              ⁢
              
                
              
            
            
              k
              ^
            
          
          ⁢
          
            
              
              
                y
                -
                
                  
                    X
                    ^
                  
                  ⁢
                  
                    k
                    ^
                  
                
              
              
            
            2
          
        
        +
        
          
            λ
            2
          
          ⁢
          
            
              
              
                k
                ^
              
              
            
            2
          
        
      
    
    
      
        (
        31
        )
      
    
  




In Equation (31), {circumflex over (x)} is a matrix that corresponds to convolution with the current image estimate {circumflex over (x)}. The solution to this least-squares problem is given by:

{circumflex over (k)}=({circumflex over (x)}T{circumflex over (x)}+λ2I)−1{circumflex over (x)}Ty  (32)

Constraints on the kernel may be incorporated into optimization problem (31), in which case Equation (32) no longer represents the optimal solution to problem (31). Possible constraints include the requirement that the coefficients of the kernel be positive and/or that they sum to 1. In the case that constraints are incorporated, problem (31) can be solved numerically with conventional optimization methods.
A demonstrative implementation may use 5×5 patches, and a scale gap of α=4/3. To speed up the convergence of Algorithm (2), a coarse-to-fine manner may be used. For example, eight iterations of Algorithm (2) may be applied on each of the levels of an image pyramid constructed from the blurry input image y. The recovered {circumflex over (x)} and {circumflex over (k)} at each pyramid level may be interpolated to constitute an initial guess for the next pyramid level. The pyramid may be constructed with scale-gaps of α using down-scaling with a sinc.
Additional speed up may be obtained by implementing the NN search in the deblurring step more efficiently. Each patch in {circumflex over (x)} needs to find its NN patches in {circumflex over (x)}α. In many cases (e.g., step edges and corners), the corresponding coarse-scale patch often resides just “beneath” the current patch, namely, at approximately the same relative image location in the scaled-down image; since step edges and corners are self-similar across scales (i.e., fractal-like). Accordingly, for fractal-like structures, ƒ(ξ) and ƒ(ξ/α) (e.g., in image 801 of FIG. 8) reside at the same location in the continuous world, leading to a shaper patch rα just below the blurry patch q. Most good NNs of a patch in a sharp image are typically found in a local neighborhood “beneath” the patch in a coarser pyramid scale; and this may significantly speed up the NN search in the context of single image super-resolution. The present invention may utilize the local search for NNs, to achieve computational speedup, as well as to guarantee more reliable NN matches, despite the different blurs across scales. In a demonstrative implementation, for each patch in {circumflex over (x)}, only a single NN is extracted, which may be found within a local 9×9 neighborhood beneath it in {circumflex over (x)}α (using an L2 distance). This approximation may suffice for recovering a good global kernel {circumflex over (k)}.
For computational efficiency, some implementations may solve all the large linear systems of equations in the Fourier domain. For example, the matrix {circumflex over (K)}T appearing in Equation (30) corresponds to convolution with a mirrored version of {circumflex over (k)}, which is equivalent to multiplication by K*(ω) in the frequency domain. Therefore, solving for {circumflex over (x)} while keeping z fixed may be implemented as:




  
    
      
        
          
            X
            ^
          
          ⁡
          
            (
            ω
            )
          
        
        =
        
          
            
              
                K
                ^
              
              *
              
                (
                ω
                )
              
              ⁢
              
                Y
                ⁡
                
                  (
                  ω
                  )
                
              
            
            +
            
              β
              ⁢
              
                
              
              ⁢
              
                Z
                ⁡
                
                  (
                  ω
                  )
                
              
            
          
          
            
              
                
                
                  
                    K
                    ^
                  
                  ⁡
                  
                    (
                    ω
                    )
                  
                
                
              
              2
            
            +
            β
          
        
      
    
    
      
        (
        33
        )
      
    
  




This formulation may allow to significantly speed up computations, for example, using Fast Fourier Transforms (FFTs) with proper padding to avoid undesired border effects.
Similarly, Equation (32) may be computed in the Fourier domain as:




  
    
      
        
          
            K
            ^
          
          ⁡
          
            (
            ω
            )
          
        
        =
        
          
            
              X
              ^
            
            *
            
              (
              ω
              )
            
            ⁢
            
              Y
              ⁡
              
                (
                ω
                )
              
            
          
          
            
              
                
                
                  
                    X
                    ^
                  
                  ⁡
                  
                    (
                    ω
                    )
                  
                
                
              
              2
            
            +
            
              
                λ
                2
              
              ⁢
              
                σ
                2
              
            
          
        
      
    
    
      
        (
        34
        )
      
    
  




Some embodiments of the present invention may implement Equation (34) using FFTs for speed purposes, but may take caution when doing so since multiplication of FFTs correspond to cyclic convolution rather than to linear convolution. The difference between the two is manifested at the borders of the image. Therefore, after computing {circumflex over (k)} using an FFT implementation of Equation (34), the border regions of the input image y may be replaced with the border regions of {circumflex over (x)}*{circumflex over (k)}, and the process may be repeated again. Some embodiments may do this several times, until the border effect vanishes.
In some implementations, for example, the Fourier procedures in Equation (33) and (34) may be much faster (e.g., 50 times faster) than the corresponding steps in conventional blind and non-blind deblurring methods
A demonstrative experiment tested Algorithm (2) on a large database comprising 640 large natural images of diverse scenes (typically 1,024 by 768 pixels), which were obtained by synthetically blurring 80 high-quality images with 8 blur kernels and adding 1 percent white Gaussian noise. Qualitative and quantitative comparisons to six conventional blind deblurring algorithms showed that the present invention yielded better results or superior results; for example, a smaller mean error ratio (defined in Equation (35) below), indicating better average performance, a smaller value of the highest error-ratio, indicating better worst-case performance, and increased success rate (i.e., percent of images with error ratio smaller than 5).
The Applicants' experiments indicated the usefulness of internal patch recurrence as a cue for kernel recovery. Complex textures with strong edges, such as an image region that depicts a sea with waves, may not be well represented by the generic image priors that are assumed by conventional methods. For example, such image regions may not conform to the assumption of sparsity of image gradients that some conventional methods utilize; and patches within such image region may not find good NNs in an external patch prior that is based on external database of images. In contrast, such image region of a sea with waves is self-similar, at least across small scale-gaps; and thus the present invention may produce more accurate kernel estimates, which lead to deblurred images with better visual quality and with lower error-ratios.
Some of the Applicants' experiments have utilized the following Error Ration measure, to measure the quality of a recovered blur kernel {circumflex over (k)}:




  
    
      
        r
        =
        
          
            
              
              
                x
                -
                
                  
                    x
                    ^
                  
                  
                    k
                    ^
                  
                
              
              
            
            2
          
          
            
              
              
                x
                -
                
                  
                    x
                    ^
                  
                  k
                
              
              
            
            2
          
        
      
    
    
      
        (
        35
        )
      
    
  




In Equation (35), {circumflex over (x)}{circumflex over (k)} corresponds to (non-blind) deblurring with the recovered blur kernel {circumflex over (k)}; and {circumflex over (x)}k corresponds to deblurring with the ground-truth kernel k. The smaller r is, the better the reconstruction.
The Applicants' experiments further indicate that the deblurring method of the present invention is more robust than any conventional deblurring approach, as it rarely fails to recover the blur kernel with reasonable accuracy (low rmax). In the experiments, even the worst result over an entire database of images (namely, the recovered image with the highest error-ratio), looks reasonably acceptable in terms of visual quality; whereas conventional deblurring methods do not produce much better visual results than the present invention for that worst-result image. In contrast, the worst results of conventional deblurring methods are usually unacceptable in terms of visual quality; whereas the deblurring method of the present invention yields visually good results in most cases, and obtains much lower error ratios.
The present invention may be further utilized for “blind dereverberation”, namely, removal of an unknown reverberation from an audio signal. A reverberant signal y may be modeled as related to a desired non-reverberant signal x through Equation (18), where k now represents the reverberation filter. In accordance with the present invention, in a non-reverberant audio recording x of e.g., speech and/or music, short segments recur “as is” at multiple time-stretched scales (obtained using e.g., a phase vocoder or other suitable time-stretching method). This cross-scale recurrence significantly diminishes in reverberant audio y. Segments from a time-stretched version yα (corresponding to a faster speed) of a reverberant audio signal y, tend to be less reverberant than segments from y itself. Consequently, Algorithm (2) may be adjusted or adapted to allow recovering the reverberation filter k and the desired non-reverberant signal x from an input reverberant signal y. This may be done, for example, by modifying Step 1 to perform time-stretching to an α-times faster speed using e.g., a phase vocoder (instead of down-sampling with a sinc kernel). Other suitable tasks may utilize the methods of the present invention.
Reference is made to FIG. 9A, which is a block-diagram illustration of a system 900 in accordance with some demonstrative embodiments of the present invention. System 900 may be implemented by using hardware components and/or software modules, and may be adapted to perform SR, deblurring, digital zoom, image enhancement, or other suitable tasks which may utilize the algorithms of the present invention.
System 900 may be implemented as, for example, a computer, a desktop computer, a laptop computer, a server, a “cloud”-based computing server or service, a Software as a Service (SaaS) system, a workstation, a tablet, a smartphone, a mobile electronic device, a mobile phone, a portable electronic device, a wearable electronic device, a portable gaming device, a gaming console, a digital camera, a video camera, an imager, a medical imaging device, an image editing apparatus, a photo editing apparatus, a medical imaging apparatus or system, an image processing apparatus, or other suitable device or system.
System 900 may comprise hardware components and/or software modules, which may be co-located or may be distributed across multiple locations or multiple devices. System 900 may utilize wired communication links, wireless communication links, cellular communication, Internet-based or IP-based communication, client/server architecture, peer-to-peer architecture, centralized architecture, distributed architecture, or other suitable architectures or protocols.
System 900 may comprise, for example, a processor 901 able to execute code or programs or instructions; a memory unit 902 (e.g., ROM, RAM, Flash memory, volatile memory, non-volatile memory); a storage unit 903 (e.g., hard disk drive, solid state drive, optical disk drive, CD drive, DVD drive); an input unit 904 (e.g., keyboard, mouse, stylus, trackball, joystick, microphone, scanner); an output unit 905 (e.g., screen, monitor, display unit, speakers, printer); a communication unit 906 (e.g., wireless or wired modem or transceiver, network interface adapter); an Operating System (OS) 907; one or more applications 908; and one or more image/signal processing module(s) 910. The components of system 100 may operate, or may be adapted or programmed or configured, to perform one or more of the operations, steps, algorithms and/or methods in accordance with the present invention.
Reference is made to FIG. 9B, which is a block-diagram illustration of some demonstrative image/signal processing module(s) 910 which may operate in accordance with the algorithms of the present invention. One, or some, or all of the image/signal processing module(s) 910 may be included in particular implementations, systems and/or devices.
In a demonstrative implementation, image/signal processing module(s) 910 may comprise one or more of the following modules: a Super Resolution (SR) module 911A able to perform SR; an SR blur kernel recovery module 911B (which may optionally be a sub-module of SR module 911A, or may be a stand-alone or separate module) to recover the SR blur kernel; a deblur module 912 able to perform deblurring; a sharpening module 913, able to perform sharpening of an image or other signals (e.g., by performing deblurring and/or other suitable tasks); an image enhancement module 914 able to enhance or improve an image (e.g., by performing SR and/or deblurring and/or other suitable tasks); a digital zoom module 915 able to perform a “digital zoom” function which utilizes methods or algorithms in accordance with the present invention; a camera shake correction module 916 able to correct camera shake, by utilizing methods or algorithms in accordance with the present invention; a PSF recovery module 917 (which may optionally be a sub-module of deblur module 912, or may be a stand-alone or separate module) able to estimate or compute or recover a PSF value of an imager or camera or other image acquisition unit or other signal acquisition unit; a non-uniform blur handling module 918, which may be adapted to handle and/or enhance an image (or other signal) having non-uniform blur (e.g., by applying algorithms separately to multiple regions or areas or zones within the image or the signal); a space-time SR module 919 able to recover the temporal or spatio-temporal (three-dimensional) blur kernel for performing temporal or spatio-temporal SR (e.g., to increase temporal resolution of a video sequence); a de-reverberation module 920 or other reverberation removal module or reverberation reducer module, to reduce or remove reverberation from an audio signal; and/or other suitable modules, which may be implemented by using hardware components and/or software elements.
Reference is made to FIG. 9C, which is a block-diagram illustration of some demonstrative sub-units of an exemplary image/signal processing module 910 which may operate in accordance with the algorithms of the present invention. One, or some, or all of the sub-units of FIG. 9C may be included in particular implementations, systems and/or devices.
In a demonstrative implementation, image/signal processing module 910 may comprise, for example: a scale modifier 931 able to up-scale or down-scale or otherwise modify the scale of the input image or signal, optionally utilizing a down-scaling module 932, a transformed version generator 933, and/or low-quality signal generator 934; a patch recurrence searcher 935 able to search for patch recurrence, optionally utilizing a patch property comparison module 936 and/or a reference patch extractor 937 and/or other suitable components (e.g., a Nearest Neighbor searcher); as well as an initial blur kernel estimator 938 able to estimate or define the initial blur kernel, which may then be updated by a blur kernel estimate updater 939, optionally in an iterative process controlled or managed by an iterative process controller 940.
The components of FIG. 9C may operate to perform methods and/or algorithms in accordance with the present invention, in relation to an input image or other suitable input signal. For example, a method for performing a signal-processing task on an input signal, may comprise: estimating a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal which is a related version of said input signal.
In some embodiments, the reference signal may be at least one of: the input signal, a scaled-down version of said input signal, a lower-resolution version of said input signal, a deblurred version of said input signal, a sharper version of said input signal, a higher-quality version of said input signal, a filtered version of said input signal, a transformed version of said input signal.
In some embodiments, the input signal may be at least one of: an image, a photograph, a video sequence, an animation sequence, a multimedia clip, a medical signal, a Magnetic Resonance Imaging (MRI) signal, a functional MRI signal, an audio signal, a single-dimensional signal, a multi-dimensional signal.
In some embodiments, the signal patches may be at least one of: spatial patches, space-time patches, temporal patches, single-dimensional patches, multi-dimensional patches.
In some embodiments, the reference signal may be a transformed version of said input signal. The transformed version of the input signal may be obtained by one or more of the following transformations: scaling-down, scaling-up, replication, interpolation, rotation, shear, a homography, an affine transformation, a parametric transformation, a non-parametric transformation, a geometric transformation, a photometric transformation, a color transformation, an intensity transformation, a transformation to a descriptor space, a Fourier Transformation, a short-time Fourier Transform, a wavelet transform, a spectral transformation, time scaling using a phase vocoder, a transformation to another representation space.
In some embodiments, the method may estimate a blur kernel which may be at least one of: a Super-Resolution kernel, a spatial Super-Resolution kernel, a temporal Super-Resolution kernel, a space-time Super-Resolution kernel, a single-dimensional Super-Resolution kernel, a multi-dimensional Super-Resolution kernel, an optical blur, a camera Point Spread Function (PSF), a temporal exposure blur, a motion blur, a degradation kernel, a transform kernel, a convolution kernel, a uniform kernel, a non-uniform kernel, a sensor acquisition kernel, a reverberation kernel.
In some embodiments, system 900 may perform at least one of: signal up-sampling utilizing said blur kernel, signal interpolation utilizing said blur kernel, signal deblurring utilizing said blur kernel, super-resolution utilizing said blur kernel, digital zoom utilizing said blur kernel, signal enhancement utilizing said blur kernel, signal dereverberation utilizing said blur kernel, sensor characterization utilizing said blur kernel, sensor identification utilizing said blur kernel, signal compression utilizing said blur kernel, fractal encoding utilizing said blur kernel, increasing signal dynamic range utilizing said blur kernel.
In some embodiments, system 900 may perform a method comprising: (a) defining an initial estimate of said blur kernel; (b) generating from said reference signal an auxiliary low-quality signal by utilizing said estimate of said blur kernel; (c) for input patches in said input signal, finding similar patches in said auxiliary low-quality signal; (d) extracting reference patches in said reference signal which correspond to said similar patches in said auxiliary signal; (e) updating said estimate of said blur kernel to be an updated estimated blur kernel which best relates said reference patches to said input patches; (f) iteratively repeating steps (b) through (e) with said updated estimated blur kernel.
In some embodiments, the method may comprise: estimating a Super-Resolution version of said input signal by utilizing the final said updated estimated blur kernel, and wherein said reference signal is said input signal.
In some embodiments, the method may comprise: (a) defining an initial estimate of said blur kernel; (b) defining an initial estimate of said reference signal; (c) generating a down-scaled signal by down-scaling said estimate of said reference signal; (d) generating an updated estimate of said reference signal, wherein patches in said updated estimate of said reference signal are similar to patches in said down-scaled signal and also wherein convolving said updated estimate of said reference signal with said estimate of said blur kernel is similar to said input signal; (e) updating said estimate of said blur kernel to be the blur kernel which best relates said updated estimate of said reference signal and said input image; (f) iteratively repeating steps (c) through (e) with said updated estimate of said blur kernel and said updated estimate of said reference signal.
In some embodiments, generating said updated estimate of said reference signal may further comprise: (d1) composing an intermediate signal by replacing patches in current said estimate of said reference signal with a weighted average of their similar patches within said down-scaled signal, while averaging overlaps; (d2) updating said estimate of said reference signal to be a solution to a least-squares problem containing the following two quadratic terms: (i) a term which enforces that said updated estimate of said reference signal to be close to said intermediate signal, and (ii) a term which enforces that the convolution of said updated estimate of said reference signal with current said estimate of said blur-kernel be close to said input signal; (d3) iteratively repeating steps (d1) and (d2) with said updated estimate of said reference signal.
In some embodiments, the method may comprise: estimating a deblurred version of said input signal by utilizing the final said estimate of said blur kernel; wherein said initial estimate of said blur kernel is a delta function; and wherein said initial estimate of said reference signal is said input signal.
In some embodiments, the recurrence of signal patches may be detected by one or more of the following similarity measures: normalized correlation, Lp-norm, mutual information, Sum of Square Differences (SSD), and mean-square-error.
In some embodiments, the recurrence of signal patches may be determined by comparing one or more of the following patch properties: patch colors, patch intensities, patch frequency content, patch Laplacians, patch gradients, patch derivatives, filtered versions of the patch, high-pass filtered versions of the patch, low-pass filtered versions of the patch, band-pass filtered versions of the patch, patch descriptors, a function applied to the patch, features of the patch.
In some embodiments, the method may comprise: detecting recurrence of signal patches by an approximate Nearest Neighbor search.
In some embodiments, the recurrence of signal patches may be searched locally within a constrained portion of said reference signal.
In some embodiments, a method of performing Blind Super-Resolution of a low-resolution signal may comprise: utilizing patch recurrence across scales of said low-resolution signal to recover a super-resolution blur kernel; utilizing said super-resolution blur kernel for generating a high-resolution signal.
In some embodiments, a method of performing blind Super-Resolution of a low-resolution signal may comprise: performing the blind Super Resolution by utilizing recurrence of patches of said low-resolution signal in an external database of patches obtained from high-resolution signals.
In some embodiments, a method of performing Blind Deblurring of an input signal may comprise: estimating a blur kernel and a sharp version of said input signal, wherein said sharp version of said input signal is related to said input signal by said blur kernel, and wherein patch similarity is maximized across scales of said sharp version of said input signal.
In some embodiments, a method may comprise: estimating a blur kernel for a signal-processing task, by computing the blur kernel which maximizes patch similarity across scales of a deblurred version of an input signal obtained using said blur kernel.
In some embodiments, a device for performing a signal-processing task on an input signal may comprise: a blur kernel estimator to estimate a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal which is a related version of said input signal.
In some embodiments, the device may comprise: a Super Resolution module to perform Blind Super-Resolution of a low-resolution signal, by utilizing patch recurrence across scales of said low-resolution signal to recover a super-resolution blur kernel, and by utilizing said super-resolution blur kernel for generating a high-resolution signal.
In some embodiments, the device may comprise: a deblur module to perform Blind Deblurring of said input signal, by estimating a blur kernel and a sharp version of said input signal, wherein said sharp version of said input signal is related to said input signal by said blur kernel, and wherein patch similarity is maximized across scales of said sharp version of said input signal.
Some implementations of the present invention may be utilized in conjunction with, or may operate in conjunction with, one or more devices, systems and/or methods that are described in U.S. patent application Ser. No. 13/138,894, titled “Super Resolution from a Single Signal”, published as United States patent application publication number 2012/0086850, which is hereby incorporated by reference in its entirety.
Some implementations of the present invention may be utilized in conjunction with, or may operate in conjunction with, one or more devices, systems and/or methods that are described in U.S. patent application Ser. No. 13/461,796, titled “Device, System, and Method of Image Processing Utilizing Non-Uniform Image Patch Recurrence”, published as United States patent application publication number 2012/0281923, which is hereby incorporated by reference in its entirety.
The present invention may be implemented by utilizing a device comprising suitable hardware components and/or software modules. Such device may be or may comprise, for example, a computer, a computing device, a server, a workstation, a personal computer, a laptop computer, a tablet, a portable computing device, a web server, a server of a search engine website or service, a server of a social network website or a social network service, or the like. Such device may comprise, for example, a processor, a central processing unit (CPU), a digital signal processor (DSP), an integrated circuit (IC), one or more processing cores or controllers, one or more buffers or accumulators or databases, a memory unit, a storage unit, an input unit (e.g., keyboard, mouse, touch-pad, touch-screen, microphone), an output unit (e.g., display unit, monitor, screen, audio speakers), a power source, a wireless transceiver, a wired transceiver, an operating system (OS), one or more applications, and/other suitable hardware components and/or software modules.
The present invention may be implemented as a stand-alone or integrated application or module or service or software; as an image processing or photo processing software or module; as an image editing or photo editing software or module; as a filter or plug-in or extension or add-on to a software application or to a browser; as part of a “cloud computing” system, or as part of a Software as a Service (SaaS) implementation; or in other suitable products.
The present invention may be implemented to operate in conjunction with an imager, a sensor, an image sensor, a camera, a camcorder, a smartphone or mobile device or tablet having a camera, a gaming device or gaming console having a camera, a stand-alone camera or imaging device, a point-and-shoot camera, an SLR camera, or other suitable imaging devices or photo capturing devices or systems.
The present invention may optionally be implemented by using a software application which may reside on a storage medium or storage article. For example, a storage article may store machine-readable code or program or instructions, which may be executed by a machine or a processor or a computing device, in order to cause such machine or processor or computing device to perform one or more operations of the present invention. Optionally, the present invention may be implemented by a software application which may be downloaded (e.g., from an “application store” or “app store”) or may be otherwise obtained (e.g., may be pre-installed by a supplier or provider of computing devices). Other suitable implementations may be used.
Functions, operations, components and/or features described herein with reference to one or more embodiments of the present invention, may be combined with, or may be utilized in combination with, one or more other functions, operations, components and/or features described herein with reference to one or more other embodiments of the present invention.
While certain features of the present invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents may occur to those skilled in the art. Accordingly, the claims are intended to cover all such modifications, substitutions, changes, and equivalents.

## Claims

1. A computer implemented method for performing a signal-processing task of blind deblurring on an input signal, the method comprising:
estimating a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal, wherein said reference signal is a related version of said input signal, and said blur kernel is a blur function relating said input signal and a sharper output version of said input signal having same scale; and
utilizing said estimate of said blur kernel for deblurring said input signal;
wherein said estimating comprises steps of:
generating a down-scaled signal by down-scaling said reference signal;
generating an estimate of said sharper output; and
generating said estimate of said blur kernel;

wherein patches in said estimate of said sharper output are similar to patches in said down-scaled signal;
and wherein convolving said estimate of said sharper output with said estimate of said blur kernel is similar to said input signal.

2. The method of claim 1, wherein said reference signal is at least one of:
said input signal,
a scaled-down version of said input signal,
a deblurred version of said input signal,
a sharper version of said input signal,
a higher-quality version of said input signal,
a filtered version of said input signal,
a transformed version of said input signal.

3. The method of claim 1, wherein said input signal is at least one of:
an image, a photograph, a video sequence, an animation sequence, a multimedia clip, a medical signal, a Magnetic Resonance Imaging (MRI) signal, a functional MRI signal, an audio signal, a single-dimensional signal, a multi-dimensional signal.

4. The method of claim 1, wherein said signal patches are at least one of:
spatial patches, space-time patches, temporal patches, single-dimensional patches, multi-dimensional patches.

5. The method of claim 1, wherein said reference signal is a transformed version of said input signal; wherein said transformed version of said input signal is obtained by one or more of the following transformations:
scaling-down, scaling-up, replication, interpolation, rotation, shear, a homography, an affine transformation, a parametric transformation, a non-parametric transformation, a geometric transformation, a photometric transformation, a color transformation, an intensity transformation, a transformation to a descriptor space, a Fourier Transformation, a short-time Fourier Transform, a wavelet transform, a spectral transformation, time scaling using a phase vocoder, a transformation to another representation space.

6. The method of claim 1, wherein said blur kernel is at least one of:
an optical blur,
a camera Point Spread Function (PSF)
a temporal exposure blur,
a motion blur,
a degradation kernel,
a convolution kernel.
a transform kernel,
a uniform kernel,
a non-uniform kernel,
a sensor acquisition kernel,
a reverberation kernel.

7. The method of claim 1, further comprising performing at least one of:
signal deblurring utilizing said blur kernel,
signal enhancement utilizing said blur kernel,
signal dereverberation utilizing said blur kernel,
sensor characterization utilizing said blur kernel,
sensor identification utilizing said blur kernel.

8. The method of claim 1, wherein said method is implemented by a device selected from the group consisting of:
a computer, a desktop computer, a laptop computer, a server, a cloud-based computing server, a cloud-based computing system, a Software as a Service (SaaS) system, a workstation, a tablet, a smartphone, a mobile electronic device, a cellular phone, a portable electronic device, a wearable electronic device, a gaming device, a gaming console, a digital camera, a video camera, an imager, a medical imaging device, an image editing apparatus, an image processing apparatus, a photo editing apparatus, a medical imaging apparatus, a medical imaging system.

9. The method of claim 1, wherein said generating said estimate of said blur kernel comprising iteration algorithm steps of:
(a) defining an initial estimate of said blur kernel;
(b) defining an initial estimate of said reference signal;
(c) generating a down-scaled signal by down-scaling said estimate of said reference signal;
(d) generating an updated estimate of said reference signal, wherein patches in said updated estimate of said reference signal are similar to patches in said down-scaled signal and also wherein convolving said updated estimate of said reference signal with said estimate of said blur kernel is similar to said input signal;
(e) updating said estimate of said blur kernel to be the blur kernel which best relates said updated estimate of said reference signal and said input signal;
(f) iteratively repeating steps (c) through (e) with said updated estimate of said blur kernel and said updated estimate of said reference signal.

10. The method of claim 9, wherein said generating said updated estimate of said reference signal further comprises iteration algorithm steps of:
(d1) composing an intermediate signal by replacing patches in current said estimate of said reference signal with a weighted average of their similar patches within said down-scaled signal, while averaging overlaps;
(d2) updating said estimate of said reference signal to be a solution to a least-squares problem containing the following two quadratic terms: (i) a term which enforces that said updated estimate of said reference signal to be close to said intermediate signal, and (ii) a term which enforces that the convolution of said updated estimate of said reference signal with current said estimate of said blur-kernel be close to said input signal;
(d3) iteratively repeating steps (d1) and (d2) with said updated estimate of said reference signal.

11. The method of claim 9, wherein said initial estimate of said blur kernel is a delta function; and wherein said initial estimate of said reference signal is said input signal.

12. The method of claim 1, wherein said recurrence of signal patches is detected by one or more of the following similarity measures: normalized correlation, Lp-norm, mutual information, Sum of Square Differences (SSD), and mean-square-error.

13. The method of claim 1, wherein said recurrence of signal patches is determined by comparing one or more of the following patch properties: patch colors, patch intensities, patch frequency content, patch Laplacians, patch gradients, patch derivatives, filtered versions of the patch, high-pass filtered versions of the patch, low-pass filtered versions of the patch, band-pass filtered versions of the patch, patch descriptors, a function applied to the patch, features of the patch.

14. The method of claim 1, further comprising: detecting recurrence of signal patches by an approximate Nearest Neighbor search.

15. The method of claim 1, wherein said recurrence of signal patches is searched locally within a constrained portion of said reference signal.

16. The method of claim 9, wherein said estimate of said sharper output is set to be at least one of:
the final said updated estimate of said reference signal; and
the output of any non-blind deblurring method by providing it the final said estimate of said blur kernel.

17. A device for performing a signal-processing task of blind deblurring on an input signal, the device comprising: at least one processor in communication with at least one memory unit, wherein said at least one processor is configured for:
estimation of a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal, said reference signal is a related version of said input signal, and said blur kernel is a blur function relating said input signal and a sharper output version of said input signal having same scale; and
utilization of said estimate of said blur kernel for deblurring said input signal:
wherein said estimation comprises:
generation a down-scaled signal by down-scaling said reference signal:
generation an estimate of said shaper output, and
generation said estimate of said blur kernel;

wherein patches in said estimate of said sharper output are similar to patches in said down-scaled signal;
and wherein convolving said estimate of said sharper output with said estimate of said blur kernel is similar to said input signal.

18. A computer implemented method for performing a signal-processing task on an input signal, the method comprising estimating a blur kernel for associating said input signal and a higher-resolution version of said input signal having a larger scale, by:
(a) defining an initial estimate of said blur kernel;
(b) generating from a reference signal an auxiliary low-quality signal by utilizing said estimate of said blur kernel;
(c) for input patches in said input signal, finding similar patches in said auxiliary low-quality signal;
(d) extracting reference patches in said reference signal which correspond to said similar patches in said auxiliary signal;
(e) updating said estimate of said blur kernel to he an updated estimated blur kernel which best relates said reference patches to said input patches;
(f) iteratively repeating steps (b) through (e) with said updated estimated blur kernel.

19. The method of claim 18, further comprising: estimating a Super-Resolution version of said input signal by utilizing the final said updated estimated blur kernel.

20. The method of claim 18, wherein said reference signal is at least one of: said input signal, a collection of one or more other signals, a transformed version of said input signal, and a filtered version of said input signal.

21. A device for performing a signal-processing task on an input signal, the device comprising: at least one processor in communication with at least one memory unit, wherein said at least one processor is configured to estimate a blur kernel for associating said input signal and a higher-resolution version of said input signal having a larger scale; said at least one processor is further configured to:
(a) define an initial estimate of said blur kernel;
(b) generate from said reference signal an auxiliary low-quality signal by utilizing said estimate of said blur kernel:
(c) for input patches in said input signal, find similar patches in said auxiliary low-quality signal;
(d) extract reference patches in said reference signal which correspond to said similar patches in said auxiliary signal;
(e) update said estimate of said blur kernel to he an updated estimated blur kernel which best relates said reference patches to said input patches;
(f) iteratively repeat steps (b) through (e) with said updated estimated blur kernel.

22. A computer implemented method for performing a signal-processing task on an input signal, the method comprising estimating a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal, wherein said reference signal is a related version of said input signal, and by:
(a) defining an initial estimate of said blur kernel;
(b) defining an initial estimate of said reference signal;
(c) generating a down-scaled signal by down-scaling said estimate of said reference signal;
(d) generating an updated estimate of said reference signal, wherein patches in said updated estimate of said reference signal are similar to patches in said down-scaled signal and also wherein convolving said updated estimate of said reference signal with said estimate of said blur kernel is similar to said input signal;
(e) updating said estimate of said blur kernel to be the blur kernel which best relates said updated estimate of said reference signal and said input signal;
(f) iteratively repeating steps (c) through (e) with said updated estimate of said blur kernel and said updated estimate of said reference signal.

23. The method of claim 22, wherein said generating said down-scaled estimate of said reference signal further comprises;
(d1) composing an intermediate signal by replacing patches in current said estimate of said reference signal with a weighted average of their similar patches within said down-scaled signal, while averaging overlaps;
(d2) updating said estimate of said reference signal to be a solution to a least-squares problem containing the following two quadratic terms; (i) a term which enforces that said updated estimate of said reference signal to be close to said intermediate signal, and (ii) a term which enforces that the convolution of said updated estimate of said reference signal with current said estimate of said blur-kernel be close to said input signal;
(d3) iteratively repeating steps (d1) and (d2) with said updated estimate of said reference signal.

24. The method of claim 22, wherein said initial estimate of said blur kernel is a delta function; and wherein said initial estimate of said reference signal is said input signal.

25. The method of claim 22, further comprising estimating a deblurred version of said input signal comprising at least one of:
setting said deblurred version of said input signal to he the final said updated estimate of said reference signal; and
setting said deblurred version of said input signal to be the output of any non-blind deblurring method by providing it the final said estimate of said blur kernel.

26. A device for performing a signal-processing task on an input signal, the device comprising: at least one processor in communication with at least one memory unit, wherein said at least one processor is configured to estimate a blur kernel associated with said input signal, by utilizing recurrence of signal patches across multiple scales inside a reference signal, wherein said reference signal is a related version of said input signal; said at least one processor is further configured to:
(a) define an initial estimate of said blur kernel;
(b) define an initial estimate of said reference signal;
(c) generate a down-scaled signal by down-scaling said estimate of said reference signal;
(d) generate an updated estimate of said reference signal, wherein patches in said updated estimate of said reference signal are similar to patches in said down-scaled signal and also wherein convolving said updated estimate of said reference signal with said estimate of said blur kernel is similar to said input signal;
(e) update said estimate of said blur kernel to be the blur kernel which best relates said updated estimate of said reference signal and said input signal;
(f) iteratively repeat steps (c) through (e) with said updated estimate of said blur kernel and said updated estimate of said reference signal.