# Patent

## Title
Regression-based learning model for image upscaling

## Abstract

Methods and systems for a regression-based learning model in image upscaling are disclosed. In one embodiment, a set of image patch pairs for each of a set of images is generated. Each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image. A regression model based at least in part on the set of image patch pairs is defined. The regression model represents a gradient of a function of the downscaled lower-resolution image. An image is upscaled based at least in part on the regression model.

## Background
CLAIM OF PRIORITY TO PROVISIONAL APPLICATION
This application claims benefit of priority of U.S. Provisional Application Ser. No. 61/515,791 entitled “Robust Patch Regression based on In-Place Self-similarity or Image Upscaling” filed Aug. 5, 2011, the content of which is incorporated by reference herein in its entirety.


BACKGROUND
Description of the Related Art
In computer graphics, image scaling is the process of resizing a digital image. Scaling is a non-trivial process that involves a trade-off between efficiency, smoothness and sharpness. As the size of an image is increased, so the pixels which comprise the image become increasingly visible, making the image appear “soft.” Conversely, reducing an image will tend to enhance its smoothness and apparent sharpness.
Single image super-resolution or image upscaling is the technique of generating a high-resolution image from a low-resolution input. The problem is dramatically under-constrained, as one needs to predict millions of unknown pixel values based on only small number of input pixels.
Conventional solutions to the problem of upscaling thus depend on the quality of available image priors. The image priors used by conventional solutions range from simple “smoothness” priors, to more sophisticated statistical priors learned from natural images. For conventional image upscaling, the most popular and simplest methods are those based on analytical interpolations, e.g., bicubic or bilinear interpolation, with an analytical “smoothness” assumption.
SUMMARY
Methods and systems for a regression-based learning model in image upscaling are disclosed. In one embodiment, a set of image patch pairs for each of a set of images is generated. Each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image. A regression model based at least in part on the set of image patch pairs is defined. The regression model represents a gradient of a function of the downscaled lower-resolution image. An image is upscaled based at least in part on the regression model.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates a module that may implement robust patch regression based on in-place self-similarity for image upscaling, according to some embodiments.
FIG. 2A depicts an example of an image upscaled according to previously available methods.
FIG. 2B illustrates an example of an image upscaled using robust patch regression based on in-place self-similarity, according to an embodiment.
FIG. 3 depicts an image data flow for robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment.
FIG. 4 illustrates image in-place patch matching for image upscaling, according to an embodiment.
FIG. 5A depicts an example of an image upscaled using a genuine fractal upscaling method and an example of an image upscaled using the Glasner upscaling method.
FIG. 5B illustrates an example of an image upscaled using the Freedman upscaling method and an example of an image upscaled using an embodiment.
FIG. 5C depicts an example of an image upscaled using a nearest neighbor interpolation upscaling method and an example of an image upscaled using a bicubic interpolation upscaling method.
FIG. 5D illustrates an example of an image upscaled using the Freedman upscaling method and an example of an image upscaled using an embodiment.
FIG. 6A depicts an example of an image upscaled using a nearest neighbor interpolation method and an example of an image upscaled using the bicubic interpolation upscaling method.
FIG. 6B illustrates an example of an image upscaled using the Freedman upscaling method and an example of an image upscaled using an embodiment.
FIG. 7A depicts an image used for measurement of Q values calculated as described herein.
FIG. 7B illustrates a mapping of Q values calculated as described herein for FIG. 7A.
FIG. 8A is a flowchart of a method for robust patch regression based on in-place self-similarity for image upscaling, according to some embodiments.
FIG. 8B is a flowchart of a method for robust patch regression based on in-place self-similarity for image upscaling with colorspace translation, according to some embodiments.
FIG. 9 is a flowchart of a method for estimation in robust patch regression based on in-place self-similarity for image upscaling, according to some embodiments.
FIG. 10A is a flowchart of a method for iterative robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment.
FIG. 10B is a flowchart of a method adaptive robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment.
FIG. 10C is a flowchart of an alternative method for tile-decomposed robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment.
FIG. 10D is a flowchart of a method for a regression-based learning method, according to an embodiment.
FIG. 11 illustrates an example computer system that may be used in embodiments.



While the invention is described herein by way of example for several embodiments and illustrative drawings, those skilled in the art will recognize that the invention is not limited to the embodiments or drawings described. It should be understood, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention. The headings used herein are for organizational purposes only and are not meant to be used to limit the scope of the description. As used throughout this application, the word “may” is used in a permissive sense (i.e., meaning having the potential to), rather than the mandatory sense (i.e., meaning must). Similarly, the words “include”, “including”, and “includes” mean including, but not limited to.
DETAILED DESCRIPTION OF EMBODIMENTS
In the following detailed description, numerous specific details are set forth to provide a thorough understanding of claimed subject matter. However, it will be understood by those skilled in the art that claimed subject matter may be practiced without these specific details. In other instances, methods, apparatuses or systems that would be known by one of ordinary skill have not been described in detail so as not to obscure claimed subject matter.
Some portions of the detailed description which follow are presented in terms of algorithms or symbolic representations of operations on binary digital signals stored within a memory of a specific apparatus or special purpose computing device or platform. In the context of this particular specification, the term specific apparatus or the like includes a general purpose computer once it is programmed to perform particular functions pursuant to instructions from program software. Algorithmic descriptions or symbolic representations are examples of techniques used by those of ordinary skill in the signal processing or related arts to convey the substance of their work to others skilled in the art. An algorithm is here, and is generally, considered to be a self-consistent sequence of operations or similar signal processing leading to a desired result. In this context, operations or processing involve physical manipulation of physical quantities. Typically, although not necessarily, such quantities may take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to such signals as bits, data, values, elements, symbols, characters, terms, numbers, numerals or the like. It should be understood, however, that all of these or similar terms are to be associated with appropriate physical quantities and are merely convenient labels.
Unless specifically stated otherwise, as apparent from the following discussion, it is appreciated that throughout this specification discussions utilizing terms such as “processing,” “computing,” “calculating,” “determining” or the like refer to actions or processes of a specific apparatus, such as a special purpose computer or a similar special purpose electronic computing device. In the context of this specification, therefore, a special purpose computer or a similar special purpose electronic computing device is capable of manipulating or transforming signals, typically represented as physical electronic or magnetic quantities within memories, registers, or other information storage devices, transmission devices, or display devices of the special purpose computer or similar special purpose electronic computing device.
Various embodiments of methods and systems for a regression-based learning model in image upscaling are disclosed. In one embodiment, a set of image patch pairs for each of a set of images is generated. Each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image. A regression model based at least in part on the set of image patch pairs is defined. The regression model represents a gradient of a function of the downscaled lower-resolution image. An image is upscaled based at least in part on the regression model.
In some embodiments, upsampling is the process of increasing the sampling rate of a signal. For example, upsampling raster images such as photographs means increasing the resolution of the image. An upsampled image intermediate is a data structure to which upsampling has been applied. In some embodiments, a low frequency band image intermediate is a result of a downsampling. Down-sampling of an image is the elimination of image frequencies higher than half the sampling frequency in the result image, which is called a smoothed image or low-frequency band image intermediate. In some embodiments, downscaling is the process of reducing the size of an image. In some embodiments, a natural image is an image resulting from photographic image capture. In some embodiments, a low frequency band image intermediate can be divided into low-resolution image patches. Image patches are subdivisions of an image. A Gaussian blur is an example of a downsampling operation usable by some embodiments. In some embodiments, a regression model is a model for analyzing several variables, when the focus is on the relationship between a dependent variable and one or more independent variables. More specifically, regression analysis helps one understand how the typical value of the dependent variable changes when any one of the independent variables is varied, while the other independent variables are held fixed. Most commonly, regression analysis estimates the conditional expectation of the dependent variable given the independent variables—that is, the average value of the dependent variable when the independent variables are fixed. A gradient is the measure of the intensity and direction of a change of a value in a selected direction.
In some embodiments, the defining the regression model based at least in part on the set of image patch pairs further includes defining a regression model based at least in part on the set of image patch pairs using an external database. In some embodiments, the defining the regression model based on the set of image patch pairs further includes defining a regression model based on a set of traning patch pairs sampled from natural images. In some embodiments, the defining the regression model based on the set of image patch pairs further includes defining a regression model as a weighted average of regression model predictions.
In some embodiments, the defining the regression model based on the set of image patch pairs further includes defining a regression model as a weighted average of first order regression model predictions. In some embodiments, the upscaling the image based at least in part on the regression model further includes, for each low resolution image patch in an upsampled image intermediate, identifying a match in a local neighborhood of the low frequency band image intermediate to the estimate a result image. In some embodiments, the upscaling the image based at least in part on the regression model further includes estimating a high resolution patch for a set of spatially overlapping, densely sampled low resolution patches to generate a set of overlapping pixels.
Some embodiments may include a means for a regression-based learning model in image upscaling. For example, using an image upscaling module, a set of image patch pairs for each of a set of images is generated. Each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image. A regression model based at least in part on the set of image patch pairs is defined, as described herein. The regression model represents a gradient of a function of the downscaled lower-resolution image. An image is upscaled based at least in part on the regression model, as described herein. The image upscaling module and an external database may in some embodiments be implemented by a non-transitory, computer-readable storage medium and one or more processors (e.g., CPUs and/or GPUs) of a computing apparatus. The computer-readable storage medium may store program instructions executable by the one or more processors to cause the computing apparatus to perform generating a set of image patch pairs for each of a set of images, wherein each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image, defining a regression model based at least in part on the set of image patch pairs, wherein the regression model represents a gradient of a function of the downscaled lower-resolution image, and upscaling an image based at least in part on the regression model, as described herein. Other embodiments of the image upscaling module may be at least partially implemented by hardware circuitry and/or firmware stored, for example, in a non-volatile memory.
Various embodiments of methods and apparatus for denoising and artifact removal in image upscaling are disclosed. In one embodiment, a low frequency band image intermediate is obtained from an input image. An upsampled image intermediate is obtained. A result image is estimated, based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image. The input image is of a smaller scale than the result image. The estimating the result image further includes eliminating from the result image noise that is present in the input image.
In some embodiments, the eliminating from the result image noise further includes eliminating compression artifacts. In some embodiments, the estimating the result image further includes, for each low resolution image patch in the upsampled image intermediate, identifying a single or multiple best matches as well as estimating a high-resolution patch from the upsampled image intermediate, the low frequency band image intermediate, and the input image. In such embodiments, the estimating the result image further includes repeating the identifying a single or multiple best matches and estimating a high resolution patch for a set of spatially overlapping, densely sampled low resolution patches to generate a set of overlapping pixels.
In some embodiments, the identifying best matches includes find k nearest neighbor patches. In some embodiments, the estimating a high resolution patch includes denoising the center pixel of the low resolution patch by averaging it with center pixels of the best matching patches, and performing regression for each of the best matching patches to generate a set of regression results, and obtaining a final result using a weighted linear combination of the set of regression results. Some embodiments further include performing iterative repetitions of the obtaining the low frequency band image intermediate, the obtaining an upsampled image intermediate and the estimating the upscaling result image. Some embodiments further include, in response to an iterative repetition exceeding a user-designated upscaling parameter, generating a final result image by downscaling a result of the iterative repetition exceeding the user-designated upscaling parameter. In some embodiments, each of iterative repetitions further comprises upscaling the image by a factor of 1.5. In some embodiments, the obtaining the low frequency band image intermediate from the input image further includes translating the input image from a native colorspace to an intermediate colorspace, and the estimating the result image further comprises generating a result image in the native colorspace.
Various embodiments of methods and apparatus for robust patch regression based on in-place self-similarity for image upscaling are disclosed. Embodiments employ a robust regression model for image upscaling based on in-place self-examples. In some embodiments, a first-order approximation of a nonlinear mapping function from low-resolution to high-resolution image patches is learned from a set of training patches sampled from natural images. For self-example search, some embodiments employ in-place patch matching for small scaling factors, constraining the patch searching space to be as small as 9 patches. To this end, some embodiments execute a robust regression formulation by a weighted average of prediction values based on multiple in-place neighbors to reduce variance of the regression model. In some embodiments, such a robust regression model enhances practical applications, as many input images are contaminated by noise (e.g., mobile photos) or JPEG artifacts (e.g., internet images). Examples of results from some embodiments demonstrate enhanced accuracy and robustness.
Embodiments provide a technique for high-quality single image upscaling. Some embodiments recursively upscale the input image by a small scale factor at each iteration until a desired magnification factor is reached. Some embodiments are based on a patch regression model which takes advantage of in-place self-similarities. As described below, a regression model is represented as a first-order approximation of a nonlinear mapping function from low-resolution to high-resolution image patches, which is learned from a set of training patches sampled from natural images.
For self-example search, results of some embodiments show that the patch matching can be in-place for small scaling factors, constraining the patch searching space to be as small as 9 patches. To this end, some embodiments employ a robust regression formulation by a weighted average of all the prediction values based on multiple in-place neighbors to reduce the variance of the regression model, which assists in mitigating strong image noise and JPEG artifacts. Some embodiments also extend the technique to an adaptive method for faster processing. A gradient-based content metric is used by some embodiments to selectively process noise and/or texture patches for faster processing and better realism on under-sampled texture areas. Both quantitative and qualitative results of some embodiments are described and compared below.
Some embodiments exhibit enhanced signal reconstruction accuracy due to the use of a regression learning-based model. Some embodiments are also faster than alternative patch self-similarity-based approaches due to localized search. Some embodiments use “In-Place” across-scale self-similarity, which constrains a patch search region to exactly the same corresponding location at lower scales to increase the speed of the super-resolution process. Some embodiments also integrate super-resolution, denoising, and JPEG artifact removal into a simultaneously executed unified framework. Such embodiments achieve this integration by averaging multiple regression predictions for multiple nearest patches.
Some embodiments produce higher quality results for natural and realistic images by using bicubic filters to estimate an upsampled low-frequency band, which leads to more realistic upscaling results on natural images due to the predictive accuracy of bicubic filtering. In addition, some embodiments use Gaussian filters to obtain a low frequency band of the input image and thereby preserve information in low contrast areas
Some embodiments perform recursive upscaling of an image (in every iteration scaling by a factor of 1.5 or a value between 1.0 and 1.5) to produce more realistic results with fewer artifacts. Some embodiments use adaptive patch processing to improve efficiency. Such embodiments employ an adaptive framework using a gradient-based local image content metric, where patches are processed selectively for faster runtime on uniform/noise/low-texture areas while limiting expensive computation to regular high-texture image structures. Some embodiments, using adaptive content metrics and “In-Place” search regions, generate realistic results on under-sampled texture areas.
Some embodiments include a means for designating an input image for upscaling. For example, an image upscaling module may receive input identifying an input image on which upscaling is to be performed and may perform the upscaling according to user-designated parameters, such as a scale factor, as described herein. The image upscaling module may in some embodiments be implemented by a non-transitory, computer-readable storage medium and one or more processors (e.g., CPUs and/or GPUs) of a computing apparatus. The computer-readable storage medium may store program instructions executable by the one or more processors to cause the computing apparatus to perform receiving input identifying input image on which upscaling is to be performed, and performing the upscaling according to user-designated parameters, such as a scale factor, as described herein. Other embodiments of the image upscaling module may be at least partially implemented by hardware circuitry and/or firmware stored, for example, in a non-volatile memory.
Some embodiments include a method that includes obtaining a low frequency band image intermediate from an input image, upsampling the input image by a scale factor to obtain an upsampled image intermediate, and estimating a result image based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image. In some embodiments, the input image is of a smaller scale than the result image. In some embodiments the estimating the result image further includes, for a low resolution image patch in the upsampled image intermediate, identifying a match in a local neighborhood of the low frequency band image intermediate. In some embodiments, the obtaining a low frequency band image intermediate from the input image further includes applying a Gaussian filter to the input image. In some embodiments, the upsampling the input image by the scale factor to obtain the upsampled image intermediate further includes applying bicubic interpolation. In some embodiments, the defining the regression model based on the set of image patch pairs further includes defining a regression model as a weighted average of second-or-higher order regression model predictions.
In some embodiments, the method further comprises translating an RGB input image into a luminance and chrominance image data structure to generate the input image. As will be apparent to one of skill in the art from having read this disclosure, color spaces supported by various embodiments will vary without departing from the scope and intent of the present disclosure. For gray-scale images, some embodiments directly execute the upscaling algorithms and procedures discussed herein. Likewise for a color RGB image, for efficiency, some embodiments convert the input image to YCbCr space, and execute the upscaling algorithms and procedures discussed herein on the luminance channel Y only, run bicubic interpolation on the Cb and Cr channels, and finally convert the upscaled YCbCr image back to an RGB result image. Other embodiments execute the upscaling algorithms and procedures discussed herein on all color channels (e.g. RGB, YCbCr, or CMYK).
In some embodiments, the estimating the result image further includes, for each low resolution image patch in the upsampled image intermediate, identifying a single or multiple best matches in a local neighborhood of the low frequency band image intermediate, estimating a high-resolution patch from the upsampled image intermediate, the low frequency band image intermediate, and the input image, and repeating the identifying a single or multiple best matches and estimating a high resolution patch for a set of spatially overlapping, densely sampled low resolution patches to generate a set of overlapping pixels, and averaging the overlapping pixels. In some embodiments, identifying best matches means finding multiple nearest patches in terms of patch distance. In some embodiments, patch distance can be computed from either a single color channel or multiple color channels. Some embodiments compute patch distance based only on a single color channel, and other embodiments compute patch distance based on (a weighted sum) of patch distances from multiple color channels (e.g. RGB, YCbCr, or CMYK) for better matching accuracy.
Some embodiments provide a system including at least one processor and a memory including program instructions. In some embodiments the program instructions are executable by the at least one processor to obtain a low frequency band image intermediate from an input image, upsample the input image by a scale factor to obtain an upsampled image intermediate, and estimate a result image based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image. In some embodiments, the input image is of a smaller scale than the result image.
In some embodiments, the program instructions executable by the at least one processor to obtain a low frequency band image intermediate from the input image further include program instructions executable by the at least one processor to apply a Gaussian filter to the input image. In some embodiments, the program instructions executable by the at least one processor to upsample the input image by the scale factor to obtain the upsampled image intermediate further include program instructions executable by the at least one processor to apply bicubic interpolation.
In some embodiments, the program instructions further include program instructions executable by the at least one processor to translate an RGB input image into a luminance and chrominance image data structure to generate the input image. In some embodiments, the program instructions executable by the at least one processor to estimate the result image further include, for a low resolution image patch in the upsampled image intermediate, program instructions executable by the at least one processor to identify a best match in a local neighborhood of the low frequency band image intermediate.
In some embodiments, the program instructions executable by the at least one processor to estimate the result image further include program instructions executable by the at least one processor to, for each low resolution image patch in the upsampled image intermediate, identify a single or multiple best matches in a local neighborhood of the low frequency band image intermediate, program instructions executable by the at least one processor to estimate a high-resolution patch from the upsampled image intermediate, the low frequency band image intermediate, and the input image, program instructions executable by the at least one processor to repeat identifying a single or multiple best matches and estimating a high resolution patch for a set of densely sampled, spatially overlapping low resolution patches to generate a set of overlapping pixels, and program instructions executable by the at least one processor to average the overlapping pixels.
Some embodiments include a non-transitory computer-readable storage medium storing program instructions, wherein the program instructions are computer-executable to implement obtaining a low frequency band image intermediate from an input image, upsampling the input image by a scale factor to obtain an upsampled image intermediate, and estimating a result image based at least in part on the upsampled image intermediate, the low frequency band image intermediate, and the input image. In some embodiments, the input image is of a smaller scale than the result image.
In some embodiments, the program instructions computer-executable to implement obtaining a low frequency band image intermediate from the input image further include program instructions computer-executable to implement applying a Gaussian filter to the input image. In some embodiments, the program instructions computer-executable to implement upsampling the input image by the scale factor to obtain the upsampled image intermediate further include program instructions computer-executable to implement applying bicubic interpolation.
In some embodiments, the program instructions further include program instructions computer-executable to implement translating an RGB input image into a luminance and chrominance image data structure to generate the input image. In some embodiments, the program instructions computer-executable to implement estimating the result image further comprise program instructions computer-executable to implement, for a low resolution image patch in the upsampled image intermediate, identifying a single or multiple best matches in a local neighborhood of the low frequency band image intermediate.
In some embodiments, upsampling is the process of increasing the sampling rate of a signal. For example, upsampling raster images such as photographs means increasing the resolution of the image.
Example Implementations
FIG. 1 illustrates an image upscaling module that may implement one or more of the robust patch regression based on in-place self-similarity for image upscaling techniques and tools illustrated in FIGS. 2 through 10. Image upscaling module 120 may, for example, implement one or more of an image upscaling tool, an image denoising, an artifact removal tool, or an integrated upscaling and denoising tool. FIG. 11 illustrates an example computer system on which embodiments of module 120 may be implemented. Module 120 receives as input one or more digital images 110. Module 120 may receive user input 112 activating one or more of an image upscaling tool, an image denoising, an artifact removal tool, or an integrated upscaling and denoising tool. Module 120 then upscales and/or denoises the input image(s) 110, according to user input 112 received via user interface 122, using the activated one or more of a matching module 150, a regression module 160, a tiling module 180, an adaptive processing module 170, a Gaussian processing module 190, a color translation module 185, and a denoising module 195. Module 120 generates as output one or more modified (upscaled) images 130. Output image(s) 130 may, for example, be stored to a storage medium 140, such as system memory, a disk drive, DVD, CD, etc., which may also store an external database as described herein.
In some embodiments, module 120 may provide a user interface 122 via which a user may interact with the module 120, for example to select an image for upscaling and select parameters such as an upscaling factor or efficiency/accuracy settings.
Some embodiments employ a robust patch regression model for image upscaling based on across-scale self-similar examples. Based on the self-similar examples, embodiments exploit an accurate first order approximation of this regression function with an external training dataset, which reduces the impact of a limited number of self-examples. Some embodiments employ nearest-patch matching can be done in-place, constraining the search space to be as small as 4 patches. To this end, some embodiments employ a robust regression model by a weighted average of the multiple regression predictions on the k-nearest patches from the local neighborhood to reduce the variance of the regression model, which is helpful for handling noise and JPEG artifacts for practical use. Additionally, some embodiments perform upscaling adaptively based on the content of local image structures, offering opportunities to significantly enhance the speed of such embodiments.
Robust Patch Regression Based on Self-Example
Given an input image X0, some embodiments of example-based super-resolution methods first upscale the image X0 to generate a blurry large image Y, and then recover the high-resolution image patch x for each low-resolution image patch y of Y, with the aid of either an external database or self-examples, or both containing high- and low-resolution image patch pairs.
Essentially, for single image super-resolution, some embodiments approximate the mapping function ƒ from the low-resolution image patch y to its corresponding high-resolution image patch x, i.e., x=ƒ(y). This function ƒ is learned from a set of high- and low-resolution training image patch pairs {xi}i=1N sampled from X and {yi}i=1N sampled from Y.
However, learning such a regression function presents obstacles due to several factors. The first of these factors is the ill-posed nature of image super-resolution. For single image upscaling, unknowns outnumber knowns. For example, use of embodiments to upscale an image by three times on both dimensions generally requires the embodiments to fill eight times more pixels than the pixels in the input image. Therefore, the mapping function ƒ from a low-resolution image patch y to x is severely ambiguous and is a problem that embodiments seek to properly regularize. Additionally, large variations may exist in the low-resolution image patch space. The content of natural images is so rich that it is difficult to capture all the instances with a compact model. Even for image patches as small as 5×5, the patch space is still huge, as there are 256 values at each pixel location.
Example-Based Regression Model
For a low-resolution input image patchy, embodiments obtain a prior example patch pair {y0; x0}, where the two patches are related by the same mapping function x0=ƒ(y0) and y0 is very close to y. Such embodiments employ the following equation from the Taylor expansion, i.e.:




  
    
      
        
          
            
              x
              =
              
              ⁢
              
                f
                ⁡
                
                  (
                  y
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                f
                ⁡
                
                  (
                  
                    
                      y
                      0
                    
                    +
                    y
                    -
                    
                      y
                      0
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  f
                  ⁡
                  
                    (
                    
                      y
                      0
                    
                    )
                  
                
                +
                
                  
                    ∇
                    
                      
                        f
                        T
                      
                      ⁡
                      
                        (
                        
                          y
                          0
                        
                        )
                      
                    
                  
                  ⁢
                  
                    (
                    
                      y
                      -
                      
                        y
                        0
                      
                    
                    )
                  
                
                +
                ...
              
            
          
        
        
          
            
              ≈
              
              ⁢
              
                
                  x
                  0
                
                +
                
                  
                    ∇
                    
                      
                        f
                        T
                      
                      ⁡
                      
                        (
                        
                          y
                          0
                        
                        )
                      
                    
                  
                  ⁢
                  
                    
                      (
                      
                        y
                        -
                        
                          y
                          0
                        
                      
                      )
                    
                    .
                  
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




Example-Based Regression Model

Embodiments exploit a first-order approximation of x, because x−x0 and y−y0 are related by a locally linear function ∇ƒT (y0), which is the derivative off at location y0. For purpose of further description herein, this function is referred to as g(y0). As most of the information contained in x is explained by x0, and g is one degree of freedom simpler than ƒ, embodiments exploit the expectation that learning g can be much simpler than learning ƒ directly.
If the low-resolution image patch space Y spans a manifold on which function g is locally linear, embodiments can ascertain the function g on a set of anchor points {c1, c2, . . . , cK} sampled from Y. Note that the function values on the anchor points are easily expressed as a set of matrices, i.e., g(ck)εd×d, where d is the dimension of the vectorized image patch. For ease of notation, we denote Wk=g(ck). For any low resolution image patch yi0, embodiments project it to a local coordinate space spanned by




  
    
      
        
          
            y
            0
            i
          
          =
          
            
              ∑
              
                
                  c
                  k
                
                ∈
                
                  N
                  ⁡
                  
                    (
                    
                      y
                      0
                      i
                    
                    )
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                w
                k
              
              ⁢
              
                c
                k
              
            
          
        
        ,
      
    
    
      
        (
        2
        )
      
    
  




where N(yi0) denotes the set of anchor points falling into the local neighborhood of yi0. The set of weights wk's are derived from least square fitting





  
    
      
        
          min
          
            
              w
              k
              ′
            
            ⁢
            s
          
        
        ⁢
        
          
            
              
              
                
                  y
                  0
                  i
                
                -
                
                  
                    ∑
                    
                      
                        c
                        k
                      
                      ∈
                      
                        N
                        ⁡
                        
                          (
                          
                            y
                            0
                            i
                          
                          )
                        
                      
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      w
                      k
                    
                    ⁢
                    
                      c
                      k
                    
                  
                
              
              
            
            2
            2
          
          .
        
      
    
    
      
        (
        3
        )
      
    
  




Assuming function g is locally linear,





  
    
      
        
          g
          ⁡
          
            (
            
              y
              0
              i
            
            )
          
        
        =
        
          
            
              ∑
              
                
                  c
                  k
                
                ∈
                
                  N
                  ⁡
                  
                    (
                    
                      y
                      0
                      i
                    
                    )
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                w
                k
              
              ⁢
              
                g
                ⁡
                
                  (
                  
                    c
                    k
                  
                  )
                
              
            
          
          =
          
            
              ∑
              
                
                  c
                  k
                
                ∈
                
                  N
                  ⁡
                  
                    (
                    
                      y
                      0
                      i
                    
                    )
                  
                
              
            
            ⁢
            
              
            
            ⁢
            
              
                w
                k
              
              ⁢
              
                
                  W
                  k
                
                .
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




Given a training set of example patch pairs {xi,yi}i=1N and their prior example pairs {x0i,y0i}i=1N, embodiments ascertain the function g on the K anchor points by




  
    
      
        
          
            min
            
              
                {
                
                  W
                  k
                
                }
              
              
                k
                =
                1
              
              K
            
          
          ⁢
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                
                
                  
                    (
                    
                      
                        x
                        i
                      
                      -
                      
                        x
                        0
                        i
                      
                    
                    )
                  
                  -
                  
                    
                      g
                      ⁡
                      
                        (
                        
                          y
                          0
                          i
                        
                        )
                      
                    
                    ⁢
                    
                      (
                      
                        
                          y
                          i
                        
                        -
                        
                          y
                          0
                          i
                        
                      
                      )
                    
                  
                
                
              
              2
              2
            
          
        
        ,
      
    
    
      
        (
        5
        )
      
    
  




where g(yi0) is given by Equation 4.

Once the function g on the K anchor points is known, embodiments can estimate the derivative function g on any input low-resolution image patch y from Equation 4, and then infer the high-resolution patch x using first-order regression by Equation 1.
FIGS. 2A-2B show the super-resolution result comparison between zero-order approximation and first-order approximation. In some embodiments, results are obtained by recovering the high-resolution image patches from overlapping low-resolution image patches, where the result overlapping pixels are averaged. FIG. 2A is a result of zero-order approximation on a portrait 210. As the zero-order approximation tends to have large approximation errors, the overlapping pixel values at the same location do not always agree with each other, and therefore, averaging them tends to blur image details. FIG. 2B is a result of first-order approximation on a portrait 220. In some embodiments, the first order approximation is more accurate and preserves the image details well.
Turning now to FIG. 3, an embodiment of an upscaling method based on in-place patch matching is portrayed. For each low-resolution patch y 345 from the upsampled image Y 340, some embodiments find its best match y0 365 from the low-frequency band Y0 355 of the input image X0 310 in the area around its original location 360 (+/−1 due to subpixel interpolation). Based on x0 315, embodiments perform first-order regression 335 to generate the desired high-resolution image patch x 330. With respect to FIG. 3, some embodiments of an image upscaling approach based on in-place patch matching are described.
Some embodiments upscale the image by a small factor of s(s≦1.5). The input image 310 is denoted as X0. Embodiments first obtain a low-frequency band image Y0 355 by blurring 370 input image X0 310 with, for example with a low-pass Gaussian filter. Some embodiments then zoom 350 X0 using bicubic interpolation by the factor of s to get Y 340, an upsampled version of input image X0 310 which is missing high-frequency information. From X0 315, Y0 365, and Y 345, embodiments estimate 320 the high-resolution image X 325. For each low-resolution image patch y 345 of Y 340 at location (x′, y′), with the upper left corner of the image as the origin, embodiments search for its best match y0 365 in a small local neighborhood 360 of (x′=s, y′=s) in Y0.
Once embodiments have idenitified x0 315, embodiments employ a regression model to estimate 320 the high-resolution image patch x 330. Embodiments repeat the procedure for overlapping patches of Y 340, and the final image X 325 is obtained by averaging those overlapping pixels of the estimated high-resolution image patches.
For large upscaling factors, embodiments iteratively upscale the image by multiple times, each with a scaling factor of s. Empirically, searching the above example patch pair {x0, y0} for y can be done in a restricted local search region around the original location of y in Y0. Embodiments further demonstrate that the searching region is not only local, but even in-place for small scaling factors (i.e., less than 1.5).
By using in-place matching, some embodiments are configured such that the coordinates (x0, y0) of the desired y0 (in Y0) for y at (x′, y′) (in Y) are at most one pixel away from the original location (x′/s, y′/s) in Y0, i.e., |x0−x′/s|<1 and |y0−y′/s|<1. Natural images often contain sparse singular structures, such as edges and corners. For image upscaling, some embodiments keep those singular structures the same while linearly scaling the remaining areas. Such embodiments are built on the assumption that use of small image patches captures these basic singular structures that are independent of image scales. Therefore, a small patch bearing a singular structure in an upper scale image should match well with a patch from the corresponding location in a lower scale image (up to a small shift) if the upscaling factor is sufficiently small.
FIG. 4 illustrates image in-place patch matching for image upscaling, according to an embodiment. Some embodiments perform matching that is in-place when the upscaling factor s≦1.5. For simplicity, the discussion herein is only based on continuous image signals, though embodiments within the scope of the present disclosure are not so limited. Given a low-resolution patch y 445 from Y 440, centered at location (x′, y′) 460, shown in FIG. 4, a center point (p′; q′) 455 exists on a singular structure within this patch, which has a shift from the patch center 460 by p′=x′+G and q′+ty(tx, ty<2.5, where 2.5 is the half patch size). Note that (x, y) 430 and (p, q) 435 are the continuously scaled down points for (x, y) 460 and (p, q) 455 respectively on image plane Y0 410, i.e., x=x′/s, y=y′/s and p=p′/s, q=q′/s.
When embodiments search a match 420 in Y0 410 for y 445, embodiments seek to match the singular point (p, q) 455 to (p, q) 435 and infer the high-frequency information for the singular structure in y 450. Therefore, the center 425 of the desired y0 415 will be at x0=p−tx; y0=q−ty, such that




  
    
      
        
          
            
              
                
                
                  
                    x
                    0
                  
                  -
                  x
                
                
              
              =
              
              ⁢
              
                
                
                  p
                  -
                  
                    t
                    x
                  
                  -
                  
                    
                      x
                      ′
                    
                    /
                    s
                  
                
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                
                  
                    
                      p
                      ′
                    
                    /
                    s
                  
                  -
                  
                    t
                    x
                  
                  -
                  
                    
                      x
                      ′
                    
                    /
                    s
                  
                
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                
                  
                    
                      x
                      ′
                    
                    /
                    s
                  
                  +
                  
                    
                      t
                      x
                    
                    /
                    s
                  
                  -
                  
                    t
                    x
                  
                  -
                  
                    
                      x
                      ′
                    
                    /
                    s
                  
                
                
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    
                    
                      
                        (
                        
                          1
                          -
                          s
                        
                        )
                      
                      ⁢
                      
                        
                          t
                          x
                        
                        /
                        s
                      
                    
                    
                  
                  <
                  
                    
                      t
                      x
                    
                    /
                    3
                  
                  <
                  1
                
              
              ,
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




and similarly |y0−y|<1, which means that the center 425 of the desired y0 415 will be constrained to be less than one pixel away from (x, y) 430, the origin of (x′, y′) 460 before scaling, and thus the matching is in-place.

Robust Regression Formulation

In practice, input images are usually contaminated by noise (e.g., mobile photos) or JPEG artifacts (e.g., internet images). Therefore, some embodiments use a regression model that is robust to such contaminations. Some embodiments denoises the center pixel of the low resolution patch by averaging it with center pixels of the best matching patches as the preprocessing for regression to remove the noise from y. Instead of finding only one best match in the local neighborhood of (x′=s±1, y′=s±1) for y 445 at location (x, y) 430 (in Y 440), embodiments keep track of T nearest neighbors, perform regression for each of them, and obtain a final result by a weighted linear combination of all the T regression results. Suppose the T matched example pairs for y 445 are {y0i, x0i}i=1T. Some embodiments exploit the observation that




  
    
      
        
          x
          =
          
            
              ∑
              i
              T
            
            ⁢
            
              
            
            ⁢
            
              
                a
                i
              
              ⁢
              
                {
                
                  
                    x
                    0
                    i
                  
                  +
                  
                    
                      g
                      ⁡
                      
                        (
                        
                          y
                          0
                          i
                        
                        )
                      
                    
                    ⁢
                    
                      (
                      
                        y
                        -
                        
                          y
                          0
                          i
                        
                      
                      )
                    
                  
                
                }
              
            
          
        
        ,
        where
      
    
    
      
        (
        8
        )
      
    
  
  
    
      
        
          
            a
            i
          
          =
          
            
              1
              Z
            
            ⁢
            
              exp
              ⁡
              
                (
                
                  -
                  
                    
                      
                        
                        
                          y
                          -
                          
                            y
                            0
                            i
                          
                        
                        
                      
                      2
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                
                )
              
            
          
        
        ,
        and
      
    
    
      
        (
        9
        )
      
    
  
  
    
      
        Z
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
          
          ⁢
          
            
              exp
              ⁡
              
                (
                
                  -
                  
                    
                      
                        
                        
                          y
                          -
                          
                            y
                            0
                            i
                          
                        
                        
                      
                      2
                      2
                    
                    
                      2
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                
                )
              
            
            .
          
        
      
    
    
      
        (
        10
        )
      
    
  




Adaptive Patch Processing

Natural images frequently contain large smooth regions as well as strong discontinuities, e.g., edges and corners. Although simple interpolation methods for image upscaling, e.g., bilinear or bicubic interpolation, will result in noticeable artifacts along the edges and corners, such as ringing, jaggy and blurring effects, embodiments exploiting such methods may perform very well on smooth regions. Thus, some embodiments selectively process those textured regions using the advanced upscaling model and methods disclosed herein, while leaving the large smooth regions to those simple interpolation techniques. On the other hand, on smooth regions or subtle texture regions with noise, even with a very small search window, the matching may overfit to noise. Therefore, some embodiments either leave those regions to interpolation or further constrain the matching to be exact in-place.
Some embodiments measure image structures by image gradients. In particular, consider the gradient matrix over an M×M window:




  
    
      
        
          G
          =
          
            [
            
              
                
                  ⋮
                
                
                  ⋮
                
              
              
                
                  
                    
                      g
                      x
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
                
                  
                    
                      g
                      y
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              
                
                  ⋮
                
                
                  ⋮
                
              
            
            ]
          
        
        ,
      
    
    
      
        (
        11
        )
      
    
  




where [gx(k)gy(k)] denotes the gradient of the image at location (xk, yk) within the window. By Singular Value Decomposition (SVD) on G, some embodiments calculate the singular values s1≧s2≧0 representing the energies in the dominant local gradient and edge orientations. Some embodiments, therefore, use the following two image content metrics:





  
    
      
        
          R
          =
          
            
              
                s
                1
              
              -
              
                s
                2
              
            
            
              
                s
                1
              
              +
              
                s
                2
              
            
          
        
        ,
        
          Q
          =
          
            
              s
              1
            
            ⁢
            
              
                
                  s
                  1
                
                -
                
                  s
                  2
                
              
              
                
                  s
                  1
                
                +
                
                  s
                  2
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




to differentiate smooth and textured regions.

FIG. 7A depicts an image used for measurement of Q values calculated as described herein. FIG. 7B illustrates a mapping of Q values calculated as described herein for FIG. 7A. Turning now to FIG. 7A, a test image 710 is shown for which R and Q are calculated and displayed in a graph 720 with a scale 730 in FIG. 7B. Thus R and Q are large for textured regions and small for smooth regions. FIG. 7B shows the Q values over spatial locations for a natural image, where Q is small on most pixel locations (smooth regions). Pixel values are pre-scale between 0 and 1.
Implementation and Results
Some embodiments upscale the given input image X0 by a factor of 1.5 (or a value between 1.0 and 1.5) each time. In such embodiments, the low-frequency band Y of the target high-resolution image is approximated by the bicubic interpolation of X0 with the same factor. The low-frequency band of X0 is obtained by a low-pass Gaussian filtering with standard deviation 0.55. Given the regression model, for each low-resolution patch y of Y, embodiments find its in-place matching path in Y0 and the corresponding high-resolution image patch x0 from X0, and then perform regression using Equation 8. Some embodiments set T=1 in Equation 8 for clean input images and T=9 (or T can be larger for better accuracy but slower computation speed) for noisy images. The image patches are processed with overlapping pixels, and some embodiments average the multiple predictions of each pixel location on the result image.
For adaptive patch processing, some embodiments compute the R and Q values on each pixel location. Such embodiments then will skip processing a patch or use exact in-place matching if its center R value is smaller than 0.4 or Q value is smaller than 0.03. For large upscaling factors, some embodiments upscale the image iteratively by multiple times.
Preparing Training Data
To train the regression model, some embodiments are exposed to a set of natural images {Xi}i=1M. The corresponding low-resolution images {X0i}i=1M are generated by downscaling with a factor of 1.5. The corresponding two low-frequency band image sets {Yi}i=1M and {Y0i}i=1M are created as described above. Then image patch pairs are randomly sampled from {Yi}i=1M and {Xi}i=1M to obtain the low- and high-resolution patch pairs {xi,yi}i=1N and at the same time get the corresponding in-place matching image pairs {x0i,y0i}i=1N from {X0i}i=1M and {Y0i}i=1M. The anchor points {c1, c2, . . . , cK} are obtained from clustering on the low-resolution image patch set {yi}i=1N. The first order regression model is learned by solving a least square problem.







TABLE 1







Prediction RMSEs for different approaches on the testing patches.












bicubic
0 order
freq. trans.
1st order

















RMSE
6.08
9.39
5.82
4.08










Preliminary comparisons of the present embodiments to alternative methods on single image super-resolution differ both quantitatively and qualitatively. Table 1, above, shows the prediction errors of different approaches. “freq. trans.” stands for high-frequency band transfer used by previous example-based approaches. “1st order” denotes the regression model embodiments described herein. “0 order” performs the worst, even worse than “bicubic”. But by simply adding Δy, “freq. trans.” performs better than “bicubic”. By using a more accurate model, some embodiments described herein (“1st order”) regression model performs well.
FIG. 5A depicts an example of an image upscaled using a genuine fractal upscaling method 510 and an example of an image upscaled using the Glasner upscaling method 520. FIG. 5B illustrates an example of an image upscaled using the Freedman upscaling method 530 and an example of an image upscaled using an embodiment 540.
FIGS. 5A-5B show a comparison of results of the embodiments described herein 540 with Genuine Fractal 510, Glasner 520, and Freedman 530 methods on the “Kid” image. Both embodiments described herein 540 and the Glasner 520 and Freedman 530 methods perform much better than Genuine Fractal 510. Glasner's result 520 is overly sharp with significant visual artifacts. Freedman's result 530 is a little blurred and creates vertical, horizontal, and triangle type artifacts on the texture regions. Embodiments described herein recover more details (eye pupilla) and are relatively free of noticeable visual artifacts.
FIG. 5C depicts an example of an image upscaled using a nearest neighbor interpolation upscaling method 550 and an example of an image upscaled using a bicubic interpolation upscaling method 560.
FIG. 5D illustrates an example of an image upscaled using the Freedman upscaling method 570 and an example of an image upscaled using an embodiment 580. FIGS. 5C-5D shows the super-resolution result on the “cameraman” image. Notice that Freedman's method 570 performs very badly in the grass region, creating many artificial triangle type false edges, while the result of embodiments 580 is much more visually pleasing.
FIG. 6A depicts an example of an image upscaled using a nearest neighbor interpolation method 610 and an example of an image upscaled using the bicubic interpolation upscaling method 620. FIG. 6B illustrates an example of an image upscaled using the Freedman upscaling method 630 and an example of an image upscaled using an embodiment 640. FIGS. 6A-6B demonstrate the robustness of embodiments to noise and JPEG compression artifacts that are common in practice. The “baby” image used for upscaling in FIGS. 6A-6B was captured by a mobile phone in suboptimal conditions, and thus was contaminated by some amount of noise. Results of Freedman's method 630 enhanced the noise, while results of embodiments of the methods described herein 640 almost totally eliminate the noise and at the same time keep the image sharp.
Methods for Robust Patch Regression Based on in-Place Self-Similarity for Image Upscaling
FIG. 8A is a flowchart of a method for robust patch regression based on in-place self-similarity for image upscaling, according to some embodiments. A low-frequency band image Y0 is obtained from X0 (block 800). A bicubic interpolation (upscaled) result Y is generated from X0 (block 802). A high-resolution image is estimated X from Y, Y0 and X0 (block 804).
FIG. 8B is a flowchart of a method for robust patch regression based on in-place self-similarity for image upscaling with colorspace translation, according to some embodiments. Colorspace translation from a native colorspace, such as RGB, to a luminance-based colorspace is performed (block 808). A low-frequency band image Y0 is obtained in the luminance component from X0 (block 810). A bicubic interpolation result Y is generated from X0 (block 812). A high-resolution image is estimated X from Y, Y0 and X0 (block 814). Colorspace translation from the luminance colorspace back to the native colorspace is performed (block 816). In some embodiments, blocks 810-814 are performed with respect to the luminance component, or otherwise on a single channel, and a traditional method of bicubic interpolation or other upscaling is performed with respect to remaining channels, such as chroma channels. The resulting data from all available channels may then be combined for translation back to the native colorspace in such embodiments. In other embodiments, other colorspaces may be used, including a single-channel colorspace such as grayscale.
FIG. 9 is a flowchart of a method for estimation in robust patch regression based on in-place self-similarity for image upscaling, according to some embodiments. In some embodiments, the operations portrayed with respect to FIG. 9 are an embodiment of block 804 of FIG. 8A. For each low-resolution image patch y of Y at location (x′, y′) a search for its best match y0 in a small local neighborhood of (x′=s; y′=s) in Y0 is performed (block 918). A regression model is used to estimate the high-resolution image patch x from Y, Y0 and X0 (block 920). Blocks 918-920 are repeated for overlapping patches of Y (block 922). Overlapping pixels of the estimated high-resolution image patches are averaged, which, in some embodiments, results in denoising (block 924).
FIG. 10A is a flowchart of a method for iterative robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment. Upscaling by a fixed maximum is performed (block 1026), e.g., by executing the method of FIG. 8A by a fixed factor of 1.5. A determination is made as to whether the upscaling has exceeded a user-configurable target (block 1028). If the upscaling has not exceeded the user configurable target, the process returns to block 1026, which is described above. If the determination indicates that the upscaling has exceeded the user-configurable target, then a downscaling to the target is performed (block 1030).
FIG. 10B is a flowchart of a method adaptive robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment. An image is divided into regions based on content characteristics (block 1050). An upscaling technique is selected based on the content type of a region (block 1055). The selected upscaling technique is applied to the region (block 1060).
FIG. 10C is a flowchart of an alternative method for tile-decomposed robust patch regression based on in-place self-similarity for image upscaling, according to an embodiment. An image is divided into tile segments (block 1062). For each tile segment, a low-frequency band image Y0 is obtained from X0 (block 1064). For each tile segment, a bicubic interpolation result Y is generated from X0 (block 1066). For each tile segment, a high-resolution image is estimated X from Y, Y0 and X0 (block 1068). The tile segments are recombined (block 1070).
FIG. 10D is a flowchart of a method for a regression-based learning method, according to an embodiment. A set of natural images is downscaled to generate a set of low-resolution images (block 1072). Corresponding low frequency band image sets are created (block 1074). Image patch pairs are sampled to obtain low- and high-resolution patch pairs (block 1076). Corresponding in-place matching image pairs are generated (block 1078). Anchor points are obtained from clustering on the low resolution image patch set (block 1080). A first order regression model is learned by solving least squares equation (block 1082).
Example System
Embodiments of a image upscaling module and/or of the various robust patch regression based on in-place self-similarity for image upscaling techniques as described herein may be executed on one or more computer systems, which may interact with various other devices. One such computer system is illustrated by FIG. 11. In different embodiments, computer system 1100 may be any of various types of devices, including, but not limited to, a personal computer system, desktop computer, laptop, notebook, or netbook computer, mainframe computer system, handheld computer, workstation, network computer, a camera, a set top box, a mobile device, a consumer device, video game console, handheld video game device, application server, storage device, a peripheral device such as a switch, modem, router, or in general any type of computing or electronic device.
In the illustrated embodiment, computer system 1100 includes one or more processors 1110 coupled to a system memory 1120 via an input/output (I/O) interface 1130. Computer system 1100 further includes a network interface 1140 coupled to I/O interface 1130, and one or more input/output devices 1150, such as cursor control device 1160, keyboard 1170, and display(s) 1180. In some embodiments, it is contemplated that embodiments may be implemented using a single instance of computer system 1100, while in other embodiments multiple such systems, or multiple nodes making up computer system 1100, may be configured to host different portions or instances of embodiments. For example, in one embodiment some elements may be implemented via one or more nodes of computer system 1100 that are distinct from those nodes implementing other elements.
In various embodiments, computer system 1100 may be a uniprocessor system including one processor 1110, or a multiprocessor system including several processors 1110 (e.g., two, four, eight, or another suitable number). Processors 1110 may be any suitable processor capable of executing instructions. For example, in various embodiments, processors 1110 may be general-purpose or embedded processors implementing any of a variety of instruction set architectures (ISAs), such as the x86, PowerPC, SPARC, or MIPS ISAs, or any other suitable ISA. In multiprocessor systems, each of processors 1110 may commonly, but not necessarily, implement the same ISA.
In some embodiments, at least one processor 1110 may be a graphics processing unit. A graphics processing unit or GPU may be considered a dedicated graphics-rendering device for a personal computer, workstation, game console or other computing or electronic device. Modern GPUs may be very efficient at manipulating and displaying computer graphics, and their highly parallel structure may make them more effective than typical CPUs for a range of complex graphical algorithms. For example, a graphics processor may implement a number of graphics primitive operations in a way that makes executing them much faster than drawing directly to the screen with a host central processing unit (CPU). In various embodiments, the image processing methods disclosed herein may, at least in part, be implemented by program instructions configured for execution on one of, or parallel execution on two or more of, such GPUs. The GPU(s) may implement one or more application programmer interfaces (APIs) that permit programmers to invoke the functionality of the GPU(s). Suitable GPUs may be commercially available from vendors such as NVIDIA Corporation, ATI Technologies (AMD), and others.
System memory 1120 may be configured to store program instructions and/or data accessible by processor 1110. In various embodiments, system memory 1120 may be implemented using any suitable memory technology, such as static random access memory (SRAM), synchronous dynamic RAM (SDRAM), nonvolatile/Flash-type memory, or any other type of memory. In the illustrated embodiment, program instructions and data implementing desired functions, such as those described above for embodiments of a image upscaling module are shown stored within system memory 1120 as program instructions 1125 and data storage 1135, respectively. In other embodiments, program instructions and/or data may be received, sent or stored upon different types of computer-accessible media or on similar media separate from system memory 1120 or computer system 1100. Generally speaking, a computer-accessible medium may include storage media or memory media such as magnetic or optical media, e.g., disk or CD/DVD-ROM coupled to computer system 1100 via I/O interface 1130. Program instructions and data stored via a computer-accessible medium may be transmitted by transmission media or signals such as electrical, electromagnetic, or digital signals, which may be conveyed via a communication medium such as a network and/or a wireless link, such as may be implemented via network interface 1140.
In one embodiment, I/O interface 1130 may be configured to coordinate I/O traffic between processor 1110, system memory 1120, and any peripheral devices in the device, including network interface 1140 or other peripheral interfaces, such as input/output devices 1150. In some embodiments, I/O interface 1130 may perform any necessary protocol, timing or other data transformations to convert data signals from one component (e.g., system memory 1120) into a format suitable for use by another component (e.g., processor 1110). In some embodiments, I/O interface 1130 may include support for devices attached through various types of peripheral buses, such as a variant of the Peripheral Component Interconnect (PCI) bus standard or the Universal Serial Bus (USB) standard, for example. In some embodiments, the function of I/O interface 1130 may be split into two or more separate components, such as a north bridge and a south bridge, for example. In addition, in some embodiments some or all of the functionality of I/O interface 1130, such as an interface to system memory 1120, may be incorporated directly into processor 1110.
Network interface 1140 may be configured to allow data to be exchanged between computer system 1100 and other devices attached to a network, such as other computer systems, or between nodes of computer system 1100. In various embodiments, network interface 1140 may support communication via wired or wireless general data networks, such as any suitable type of Ethernet network, for example; via telecommunications/telephony networks such as analog voice networks or digital fiber communications networks; via storage area networks such as Fibre Channel SANs, or via any other suitable type of network and/or protocol.
Input/output devices 1150 may, in some embodiments, include one or more display terminals, keyboards, keypads, touchpads, scanning devices, voice or optical recognition devices, or any other devices suitable for entering or retrieving data by one or more computer system 1100. Multiple input/output devices 1150 may be present in computer system 1100 or may be distributed on various nodes of computer system 1100. In some embodiments, similar input/output devices may be separate from computer system 1100 and may interact with one or more nodes of computer system 1100 through a wired or wireless connection, such as over network interface 1140.
As shown in FIG. 11, memory 1120 may include program instructions 1125, configured to implement embodiments of a image upscaling module as described herein, and data storage 1135, comprising various data accessible by program instructions 1125. In one embodiment, program instructions 1125 may include software elements of embodiments of an image upscaling module as illustrated in the above Figures. Data storage 1135 may include data that may be used in embodiments. In other embodiments, other or different software elements and data may be included.
Those skilled in the art will appreciate that computer system 1100 is merely illustrative and is not intended to limit the scope of a image upscaling module as described herein. In particular, the computer system and devices may include any combination of hardware or software that can perform the indicated functions, including a computer, personal computer system, desktop computer, laptop, notebook, or netbook computer, mainframe computer system, handheld computer, workstation, network computer, a camera, a set top box, a mobile device, network device, internet appliance, PDA, wireless phones, pagers, a consumer device, video game console, handheld video game device, application server, storage device, a peripheral device such as a switch, modem, router, or in general any type of computing or electronic device. Computer system 1100 may also be connected to other devices that are not illustrated, or instead may operate as a stand-alone system. In addition, the functionality provided by the illustrated components may in some embodiments be combined in fewer components or distributed in additional components. Similarly, in some embodiments, the functionality of some of the illustrated components may not be provided and/or other additional functionality may be available.
Those skilled in the art will also appreciate that, while various items are illustrated as being stored in memory or on storage while being used, these items or portions of them may be transferred between memory and other storage devices for purposes of memory management and data integrity. Alternatively, in other embodiments some or all of the software components may execute in memory on another device and communicate with the illustrated computer system via inter-computer communication. Some or all of the system components or data structures may also be stored (e.g., as instructions or structured data) on a computer-accessible medium or a portable article to be read by an appropriate drive, various examples of which are described above. In some embodiments, instructions stored on a computer-accessible medium separate from computer system 1100 may be transmitted to computer system 1100 via transmission media or signals such as electrical, electromagnetic, or digital signals, conveyed via a communication medium such as a network and/or a wireless link. Various embodiments may further include receiving, sending or storing instructions and/or data implemented in accordance with the foregoing description upon a computer-accessible medium. Accordingly, the present invention may be practiced with other computer system configurations.
CONCLUSION
Various embodiments may further include receiving, sending or storing instructions and/or data implemented in accordance with the foregoing description upon a computer-accessible medium. Generally speaking, a computer-accessible medium may include storage media or memory media such as magnetic or optical media, e.g., disk or DVD/CD-ROM, volatile or non-volatile media such as RAM (e.g. SDRAM, DDR, RDRAM, SRAM, etc.), ROM, etc., as well as transmission media or signals such as electrical, electromagnetic, or digital signals, conveyed via a communication medium such as network and/or a wireless link.
The various methods as illustrated in the Figures and described herein represent example embodiments of methods. The methods may be implemented in software, hardware, or a combination thereof. The order of method may be changed, and various elements may be added, reordered, combined, omitted, modified, etc.
Various modifications and changes may be made as would be obvious to a person skilled in the art having the benefit of this disclosure. It is intended that the invention embrace all such modifications and changes and, accordingly, the above description to be regarded in an illustrative rather than a restrictive sense.

## Claims

1. A method, the method comprising:
using one or more processors to perform
generating a set of image patch pairs for each of a set of images, wherein each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image;
defining a regression model based at least in part on the set of image patch pairs, wherein the regression model represents a gradient of a function of the downscaled lower-resolution image; and
upscaling an image based at least in part on the regression model.

2. The method of claim 1, wherein the defining the regression model based at least in part on the set of image patch pairs further comprises defining a regression model based at least in part on the set of image patch pairs using an external database.

3. The method of claim 1, wherein the defining the regression model based on the set of image patch pairs further comprises defining a regression model based on a set of training patch pairs sampled from natural images.

4. The method of claim 1, wherein the defining the regression model based on the set of image patch pairs further comprises defining a regression model as a weighted average of regression model predictions.

5. The method of claim 1, wherein the defining the regression model based on the set of image patch pairs further comprises defining a regression model as a weighted average of first order regression model predictions.

6. The method of claim 1, wherein the defining the regression model based on the set of image patch pairs further comprises defining a regression model as a weighted average of second-or-higher order regression model predictions.

7. The method of claim 1, wherein the upscaling the image based at least in part on the regression model further comprises estimating a high resolution patch for a set of spatially overlapping, densely sampled low resolution patches to generate a set of overlapping pixels.

8. A system, comprising:
at least one processor; and
a memory comprising program instructions, wherein the program instructions are executable by the at least one processor to:
generate a set of image patch pairs for each of a set of images, wherein each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image;
define a regression model based at least in part on the set of image patch pairs, wherein the regression model represents a gradient of a function of the downscaled lower-resolution image; and
upscale an image based at least in part on the regression model.

9. The system of claim 8, wherein the program instructions executable by the at least one processor to define the regression model based at least in part on the set of image patch pairs further comprise program instructions executable by the at least one processor to define a regression model based at least in part on the set of image patch pairs using an external database.

10. The system of claim 8, wherein the program instructions executable by the at least one processor to define the regression model based on the set of image patch pairs further comprise program instructions executable by the at least one processor to define a regression model based on a set of training patch pairs sampled from natural images.

11. The system of claim 8, wherein the program instructions executable by the at least one processor to define the regression model based on the set of image patch pairs further comprise program instructions executable by the at least one processor to define a regression model as a weighted average of regression model predictions.

12. The system of claim 8, wherein the program instructions executable by the at least one processor to define the regression model based on the set of image patch pairs further comprise program instructions executable by the at least one processor to define a regression model as a weighted average of first order regression model predictions.

13. The system of claim 8, wherein the program instructions executable by the at least one processor to upscale the image based at least in part on the regression model further comprise program instructions executable by the at least one processor to, for each low resolution image patch in an upsampled image intermediate, identify a match in a local neighborhood of the low frequency band image intermediate to the estimate a result image.

14. The system of claim 8, wherein the program instructions executable by the at least one processor to upscale the image based at least in part on the regression model further comprise program instructions executable by the at least one processor to estimate a high resolution patch for a set of spatially overlapping, densely sampled low resolution patches to generate a set of overlapping pixels.

15. A non-transitory computer-readable storage medium storing program instructions, wherein the program instructions are computer-executable to implement:
using one or more processors to perform
generating a set of image patch pairs for each of a set of images, wherein each of the image patch pairs contains a natural image and a corresponding downscaled lower-resolution image;
defining a regression model based at least in part on the set of image patch pairs, wherein the regression model represents a gradient of a function of the downscaled lower-resolution image; and
upscaling an image based at least in part on the regression model.

16. The non-transitory computer-readable storage medium of claim 15, wherein the program instructions computer-executable to implement the defining the regression model based at least in part on the set of image patch pairs further comprise program instructions computer-executable to implement defining a regression model based at least in part on the set of image patch pairs using an external database.

17. The non-transitory computer-readable storage medium of claim 15, wherein the program instructions computer-executable to implement the defining the regression model based on the set of image patch pairs further comprise program instructions computer-executable to implement defining a regression model based on a set of traning patch pairs sampled from natural images.

18. The non-transitory computer-readable storage medium of claim 15, wherein the program instructions computer-executable to implement the defining the regression model based on the set of image patch pairs further comprise program instructions computer-executable to implement defining a regression model as a weighted average of regression model predictions.

19. The non-transitory computer-readable storage medium of claim 15, wherein the program instructions computer-executable to implement defining the regression model based on the set of image patch pairs further comprise program instructions computer-executable to implement defining a regression model as a weighted average of first order regression model predictions.

20. The non-transitory computer-readable storage medium of claim 15, wherein the program instructions computer-executable to implement upscaling the image based at least in part on the regression model further comprise program instructions computer-executable to implement, for each low resolution image patch in an upsampled image intermediate, identifying a match in a local neighborhood of the low frequency band image intermediate to the estimate a result image.