Abstract:
A method for sharpening of an image. The method combines edge sharpening and noise reduction on image and video data to eliminated artifacts, thereby creating natural looking output images and video without increased noise. The algorithm uses one dimensional look-up tables not requiring complex spatial frequency processing of input image and video data. The look-up tables reduce differences for small input differences which are likely noise, increase differences for mid-level input differences to increase edge slope and sharpness, and maintain high-level input differences to maintain sharp edges without noise increase on those edges that are already sharp. A device for sharpening an image is also disclosed, comprising of a processor in communication with a non-transitory computer readable medium storing the sharpening algorithm communicable to and executable by the processor.

Description:
[0001]    CROSS-REFERENCE TO RELATED PATENT APPLICATION 
         [0002]    This application is a continuation of International Application No. PCT/US14/68388, filed Dec. 3, 2014, which claims the benefit of U.S. Provisional Application No. 61/912,006 filed Dec. 4, 2013, the disclosure of which is incorporated herein by reference. 
     
    
     BACKGROUND 
       [0003]    1. Technical Field 
         [0004]    Color image processing and display, and in particular, rendering of color images that are perceived to be of high aesthetic quality. 
         [0005]    2. Description of Related Art 
         [0006]    Current techniques for the rendering of high quality color images include techniques for the sharpening of images. Sharpening of an image is needed when the image has some level of blur. The blur may be caused by camera optics, and/or the image receptor in a digital camera, and/or the lack of steadiness of the camera when the image was acquired. At some level, image blur will be sufficiently high so as to cause a human observer of the image to perceive the image to be of low quality. Additionally, sharpening may be needed because blur in an image prevents a human observer or a computer algorithm from obtaining information from the image that would otherwise be perceivable or available if the image were sufficiently sharp. 
         [0007]    Image and video processing to increase edge sharpness and reduce noise has been used to improve perceived quality since the inception of digital imaging due to the general implementation advantages of processing digital pixels in software or digital hardware over processing analog image and video data with complex analog electronics. Current image processing methods are directed to separate sharpening and noise reduction, with noise reduction most typically occurring before sharpening in order to reduce the visibility of sharpened image and video noise. 
         [0008]    Current algorithms for image sharpening include the “unsharp mask” (UM), digital enhancement filters, and edge based sharpening. Although these algorithms function to sharpen an image, because they preserve local mean values of input still images or video image sequences, they produce unnatural edge transitions. By way of illustration,  FIGS. 5A-5C  depict a blurred edge in an unprocessed image, the blurred edge sharpened according to a prior art sharpening algorithm, and the blurred edge sharpened according to a method and algorithm of the present invention respectively. It can be seen that the edge of  FIG. 5B  processed with the prior art algorithm has a “dip” on the low value side of and edge and a “peak” on the high value side of the edge, also called undershoot and overshoot. These are seen as unnatural to viewers and often referred to as glows around edges because they do not represent the type of edge transition from better optics that viewers are familiar with visually. Such glows are perceived negatively by viewers as artifacts in the output images. In contrast, the edge of  FIG. 5C  has been processed with an algorithm and method of the present invention, as will be described subsequently herein. It can be seen that the edge is narrower, i.e., it has been sharpened, while also not having any overshoot or undershoot. 
         [0009]    Current algorithms such as the unsharp mask also have the undesirable effect of enhancing image noise. Images having enhanced noise have poor aesthetics, i.e., they are perceived by observers to be “unpleasant to look at.” There are variations of the unsharp mask algorithm, such as weighted UM, but these operate such that the weights are dependent upon local pixel mean or edge intensity. Each of these variations of the UM algorithm has its own disadvantages and results in overshoot of edges or other artifacts. 
         [0010]    Additionally, certain currently practiced algorithms and methods have been complex to implement. They may include spatial frequency decomposition of image or video data, with high frequency data treated as noise, and reduced and low frequency data treated as edges, Hence, these methods are not suitable for real time high resolution video image processing. Instead, their use is limited to still image processing. 
         [0011]    Examples of noise reduction in currently practiced and algorithms include, but are not limited to, median filtering, statistical estimation, epilson non-linear gradient filters, and digital smoothing filers. These methods have been shown to be effective for reducing image and video noise but they also reduce edge sharpness, resulting in a need to have a combined method that sharpens edges and reduces noise that can be implemented in real time for high resolution video data. 
         [0012]    In an attempt to address this need, color transformations have been used to calculate the image or video pixel intensity for the sharpening and noise reduction processing to avoid changing color pixel data. These methods used well known color transformations to convert input RGB image or video data to Cie L*a*b* and Cie Luv with L being intensity, or HSV with H being intensity, or processed input RGB data directly with transformation that isolated the G luminance data. Since changing L*, L, H or G also changes color hue and saturation, however, these methods cause color shifts along edges and in noise areas, both of which are perceived negatively by viewers as unnatural artifacts. 
         [0013]    Furthermore, it is noted that most of the currently practiced algorithms are not suitable for software implementation as they require computation of mean or standard deviation around the “pixel of interest.” Current digital cameras have high resolution CCD sensors that have a very large number of pixels; even in cell phones, cameras having 8 megapixel CCDs are now common. With the pixel count of common digital images now being so high, a software implementation of current image sharpening algorithms is computationally prohibitive, especially using the processor in a cell phone, and with the desire by a user to perform image sharpening in a matter of seconds. 
         [0014]    Thus there remains a need for an image sharpening method that can sharpen a color image without enhancing noise in the image, and that is not computationally intensive such that it can be executed on a processor of modest capability and achieve the sharpening in an acceptably short time, and in particular, at a short enough time to enable real time sharpening of images at video of movie sequence rates. Additionally, there is a need for an image sharpening algorithm and method that is able to suppress noise in an image. Additionally, there is a need for an image sharpening algorithm and method that does not cause color shifts along edges and in noise areas. 
       SUMMARY 
       [0015]    The present invention meets at least one of these needs by providing a method for sharpening of an image. The image may be a grey scale image or a color image. In one aspect of the invention, an algorithm for performing image sharpening combines edge sharpening and noise reduction on image and video data to eliminated artifacts, thereby creating natural looking output images and video without increased noise. The algorithm is simple to implement, using one dimensional look-up tables (1D LUTs) that do not require complex spatial frequency processing of input image and video data. The 1D LUTs reduce differences for small input differences which are likely noise, increase differences for mid-level input differences to increase edge slope and sharpness, and maintain high-level input differences to maintain sharp edges without noise increase on those edges that are already sharp. 
         [0016]    In another aspect of the invention, an algorithm for performing image sharpening uses a two dimensional mask that differentiates between “noise pixels,” which are intended to not be sharpened, and “edge pixels,” i.e. pixels located along the edge of an object in the image, which are intended to be sharpened. In one embodiment, the two dimensional mask may be a 3×3 mask. Other sizes of two dimensional masks are contemplated. In another aspect of the invention, the algorithm is a generalization of an unsharp mask and an c-filter. The strength of the c-filter may be determined by look-up tables (LUT). 
         [0017]    In another aspect of the invention, an algorithm for performing image sharpening implements the sharpness and noise reduction processing on image and video brightness data, using the I data from a Cie IPT transformation of input RGB image or video data to produce output image or video data that does not include color changes that are produced when processing Cie L*a*b*, Cie LUV or RGB image or video data. Processing the I values preserves the color values on edges and therefore does not produce unnatural color artifacts. 
         [0018]    In summary, when sharpening an image according to the algorithms and methods of the present invention, image noise is suppressed, low intensity edges of objects in the image are enhanced, and objects in the image that are already sharp are left unchanged. 
         [0019]    More specifically, in accordance with the present invention, a method of sharpening an input image to produce an output image is provided. The method comprises providing the input image as a digital input image comprised of input image pixels, each input image pixel defined by input image pixel data; identifying center pixels of the digital input image, the center pixels defined as those image pixels that are surrounded by upper and lower vertical pixels, left and right horizontal pixels, and upper left, upper right, lower left, and lower right diagonal pixels; for each of the center pixels, calculating at least four input gradients of intensity relative to the center pixel; defining a gradient minimum value, and a gradient maximum value; applying a gradient gain function to each of the input gradients of intensity for each of the center pixels to produce respective output gradients of intensity for each of the center pixels, wherein the gradient gain function is defined to adaptively vary the amount of gain such that object edges in the input image that are perceived by a human observer to be of low intensity are enhanced, and object edges in the input image that are perceived by a human observer to be sharp are left substantially unchanged; for each of the center pixels, calculating output image pixel data based upon their output gradients of intensity, the output image pixel data defining output image pixels of the output image; and communicating the output image pixel data to an image data receiver. 
         [0020]    In certain embodiments, calculating the at least four input gradients of intensity relative to the center pixel may be comprised of calculating respective input gradients of intensity from the center pixel to the left horizontal pixel, from the center pixel to the right horizontal pixel, from the center pixel to the upper vertical pixel, and from the center pixel to the lower vertical pixel. In other embodiments, calculating the at least four input gradients of intensity relative to the center pixel may be comprised of calculating respective input gradients of intensity from the upper vertical pixel to the lower vertical pixel, from the left horizontal pixel to the right horizontal pixel, from the upper left diagonal pixel to the lower right diagonal pixel, and from the lower left diagonal pixel to the upper right diagonal pixel. In other embodiments, calculating the at least four input gradients of intensity relative to the center pixel may be comprised of calculating respective input gradients of intensity from the center pixel to the left horizontal pixel, from the center pixel to the right horizontal pixel, from the center pixel to the upper vertical pixel, from the center pixel to the lower vertical pixel, from the center pixel to the upper left diagonal pixel, from the center pixel to the lower left diagonal pixel, from the center pixel to the upper right diagonal pixel, from the center pixel to the lower right diagonal pixel. 
         [0021]    The gradient gain function may be a linearly increasing function over a low range of gradients, a constant over an intermediate range of gradients, and a linearly decreasing function over a high range of gradients. Such a the gradient gain function may include a region of negative gain over a second low range of gradients that is less than the first low range of gradients. In one embodiment, the gradient gain function may be a quantized Rayleigh distribution. 
         [0022]    The gradient gain function may be defined using a one-dimensional look-up table containing a gain value corresponding to each gradient value. Alternatively or additionally, the gradient gain function may be defined by the combination of an unsharp mask and a noise suppression filter. The gradient gain function may be further defined to adaptively suppress noise in regions of the input image that are perceived by a human observer to be smooth regions. In certain embodiments, the unsharp mask operates to increase the intensity of edges of objects in the input image that are of low intensity, and the noise suppression filter operates to decrease the intensity of pixel values around the center pixel that are greater than a predetermined threshold amplitude value. 
         [0023]    The input image to be sharpened may be a greyscale or other monotone image, or a color image comprised of input image pixels defined by color tristimulus values. Such color tristimulus values may be RGB tristimulus values, in which case the method may further comprise performing a color transformation to a color space having an image intensity component. The color transformation may be to a color space selected from CieL*a*b*, CieLuv, CieIPT, and HSV. 
         [0024]    The method of sharpening an image may be applied to a plurality of input images defining a video, to produce a plurality of output images defining a sharpened video. In certain embodiments, the image data receiver may be a display device, in which case the method further comprises displaying the image on the display device. 
         [0025]    In accordance with the present invention, a device for sharpening an image is also provided. The device is comprised of a processor in communication with a non-transitory computer readable medium storing an algorithm communicable to and executable by the processor. The algorithm includes the steps of sharpening an input image as described above and subsequently herein. The device may include an image data receiver, which, in certain embodiments, may be an image display. Alternatively, the image data receiver may be a non-transitory computer readable medium, such as a memory, or a data storage disc, either of which may be portable. The device may further include a data input port in communication with a source of the digital input image and in communication with the processor. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0026]    The present disclosure will be provided with reference to the following drawings, in which like numerals refer to like elements, and in which: 
           [0027]      FIG. 1  is a 3×3 matrix that may be used in an unsharp mask algorithm for sharpening images; 
           [0028]      FIG. 2  is an exemplary Laplacian matrix that may be used as a high pass filter in executing an unsharp mask algorithm for sharpening images; and 
           [0029]      FIG. 3  depicts an first exemplary gradient versus gain function that may be used in a combined noise suppression and sharpening filter of the present disclosure; 
           [0030]      FIG. 4  depicts a second exemplary gradient versus gain function, which is a Rayleigh based distribution that may be used in the combined noise suppression and sharpening filter; and 
           [0031]      FIGS. 5A-5C  depict a blurred edge in an unprocessed image, the blurred edge of the unprocessed image sharpened according to a prior art method and algorithm, and the blurred edge of the unprocessed image sharpened according to a method and algorithm of the present invention, respectively. 
       
    
    
       [0032]    The present invention will be described in connection with certain preferred embodiments. However, it is to be understood that there is no intent to limit the invention to the embodiments described. On the contrary, the intent is to cover all alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims. 
       DETAILED DESCRIPTION 
       [0033]    For a general understanding of the present invention, reference is made to the drawings. In the drawings, like reference numerals have been used throughout to designate identical elements. Additionally, as used herein, a “non-transitory computer readable medium” is meant to include all computer readable media, including but not limited to hard disks, compact disks, digital video disks, flash memory, random access memory, read-only memory, cache memory, and register memory; and to not include a transitory propagating signal 
         [0034]    As noted above in the SUMMARY, an algorithm in accordance with the present disclosure is a generalization of an unsharp mask and an c-filter. Further details on the unsharp mask, and on the c-filter will now be presented. 
         [0035]    Unsharp Mask 
         [0036]    The unsharp mask (UM) is a known method for image sharpening. It may be practiced according to the following equation: 
         [0000]        p   out   =p   0   +λ.h ( P ),   (1)
 
         [0037]    where p out  is the output pixel intensity or the resultant intensity, p 0  is the “pixel of interest” (also referred to herein as the input pixel or the “center pixel”), P−{p 0 , p 1 , . . . p 8 } is the 3×3 input pixel window vector, h(P) is a high pass version of an input image to be sharpened, and λ is a sharpening strength parameter. It is noted that λ is a constant, and therefore does not vary with the strength of an edge. 
         [0038]    In applying the unsharp mask algorithm, one may use a 3×3 mask, also referred to herein as a window  100 , as shown in  FIG. 1 . Additionally, one common high pass filter that may be used is a 4 or 8 neighbor Laplacian matrix. An exemplary filter or mask  200  is shown in  FIG. 2 . 
         [0039]    Thus Equation (1) can be rewritten as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             p 
                             out 
                           
                           = 
                             
                            
                           
                             
                               p 
                               0 
                             
                             - 
                             
                               λ 
                               · 
                               
                                 
                                   ∇ 
                                   2 
                                 
                                  
                                 
                                   ( 
                                   P 
                                   ) 
                                 
                               
                             
                           
                         
                         , 
                       
                     
                   
                   
                     
                       
                         
                           = 
                             
                            
                           
                             
                               p 
                               0 
                             
                             + 
                             
                               λ 
                               · 
                               
                                 [ 
                                 
                                   
                                     ∑ 
                                     
                                       i 
                                       = 
                                       1 
                                     
                                     8 
                                   
                                    
                                   
                                       
                                   
                                    
                                   
                                     ( 
                                     
                                       
                                         p 
                                         0 
                                       
                                       - 
                                       
                                         p 
                                         1 
                                       
                                     
                                     ) 
                                   
                                 
                                 ] 
                               
                             
                           
                         
                         , 
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             p 
                             0 
                           
                           + 
                           
                             λ 
                             · 
                             
                               
                                 [ 
                                 
                                   
                                     ∑ 
                                     
                                       i 
                                       = 
                                       1 
                                     
                                     8 
                                   
                                    
                                   
                                     Δ 
                                      
                                     
                                         
                                     
                                      
                                     
                                       p 
                                       i 
                                     
                                   
                                 
                                 ] 
                               
                               . 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0040]    Two observations are noteworthy with regard to performing image sharpening via this unsharp mask algorithm: 
         [0041]    (1) There are artifacts in an image that is sharpened using this unsharp mask. The algorithm is susceptible to noise, i.e., noise in an image will be increased. This deficiency may result in distortion and halos around sharp edges of objects in the image if the sharpening strength is high. 
         [0042]    (2) The algorithm will enhance sharp edges, as well as noise, which are desired to be left as is and not be further sharpened. 
         [0043]    In view of the above observations, the Applicants have realized that a different approach towards image sharpening is needed, which depends upon the strength of object edges, and which provides reduction of noise in an image. Also, it is desirable that an image sharpening function applies equal gain to all gradients, i.e., differences between pixels, in the image, thereby leading to intensity saturation of pixels to minimum and maximum values (e.g. 0 and 255 for 1 byte per channel). 
         [0044]    The Applicants have further realized that there is a need for sharpening to operate as a gain function that increases with the increase in gradient and then ramps-down after a certain cut-off to avoid intensity saturation to minimum and maximum. 
         [0045]    ε-Filter 
         [0046]    The ε-filter is a known method to reduce image noise. It may be practiced according to the following equation: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             p 
                             out 
                           
                           = 
                             
                            
                           
                             
                               p 
                               0 
                             
                             + 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 8 
                               
                                
                               
                                 
                                   w 
                                   i 
                                 
                                  
                                 
                                   f 
                                    
                                   
                                     ( 
                                     
                                       
                                         p 
                                         o 
                                       
                                       - 
                                       
                                         p 
                                         i 
                                       
                                     
                                     ) 
                                   
                                 
                               
                             
                           
                         
                         , 
                       
                     
                   
                   
                     
                       
                         
                           = 
                             
                            
                           
                             
                               p 
                               0 
                             
                             + 
                             
                               
                                 ∑ 
                                 
                                   i 
                                   = 
                                   1 
                                 
                                 8 
                               
                                
                               
                                 
                                   w 
                                   i 
                                 
                                  
                                 
                                   f 
                                    
                                   
                                     ( 
                                     
                                       Δ 
                                        
                                       
                                           
                                       
                                        
                                       
                                         p 
                                         i 
                                       
                                     
                                     ) 
                                   
                                 
                               
                             
                           
                         
                         , 
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             p 
                             0 
                           
                           + 
                           
                             
                               ∑ 
                               
                                 i 
                                 = 
                                 1 
                               
                               8 
                             
                              
                             
                               
                                 w 
                                 i 
                               
                                
                               
                                 f 
                                 i 
                               
                                
                               Δ 
                                
                               
                                   
                               
                                
                               
                                 
                                   p 
                                   i 
                                 
                                 . 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0047]    where p out  and p 0  are as defined above, w i  are the weights in the range [0,1], 
         [0000]    
       
         
           
             
               f 
                
               
                 ( 
                 x 
                 ) 
               
             
             = 
             
               { 
               
                 
                   
                     
                       
                         ɛ 
                         , 
                         
                           x 
                           &gt; 
                           ɛ 
                         
                       
                     
                   
                   
                     
                       
                         x 
                         , 
                         
                           
                              
                             x 
                              
                           
                           &lt; 
                           ɛ 
                         
                       
                     
                   
                   
                     
                       
                         
                           - 
                           ɛ 
                         
                         , 
                         
                           x 
                           &lt; 
                           
                             - 
                             ɛ 
                           
                         
                       
                     
                   
                 
                 , 
                 
                   
                     and 
                      
                     
                       
 
                     
                      
                     
                       ∑ 
                       
                           
                       
                        
                       
                         w 
                         i 
                       
                     
                   
                   = 
                   1. 
                 
               
             
           
         
       
     
         [0048]    This final condition on the weights, Σw i =1, ensures that the image intensity stays constant. If that is not a requirement for the particular image sharpening application, then that condition can be removed. It is also noted that the last step in equation set (3) is possible, because it is a discrete curve and ƒ i  can be adapted from ƒ such that the last step holds, i.e., is true. Because the pixel values are discrete, the function ƒ can be defined at each of the values as given in the equation above such that the two equations are mathematically equivalent. This is a key aspect of the invention. 
         [0049]    In summary, the operation of this ε-filter is clear: it suppresses any noise that is greater in amplitude than the threshold amplitude ε around the center pixel. 
         [0050]    Combined Noise Suppression and Sharpening Filter 
         [0051]    In accordance with the present disclosure, the Applicants&#39; method of adaptive sharpening in image processing and display includes a combined noise suppression and sharpening filter. Attributes of this filter include, but are not limited to the following: 
         [0052]    Suppression of noise present in the image, especially in the smooth regions (i.e., regions that do not include edges of objects) where artifacts are more perceptible (in a negative manner) to a human observer. 
         [0053]    Prevention of intensity saturation to minimum and maximum. Typically, the minimum to maximum are 0 and 255 but could be any pre-defined range based on a given application. 
         [0054]    Enhancement of object edges of that are low intensity, i.e., not clearly visible, thereby result in the best gain in image quality as perceived by a human observer. 
         [0055]    No action (i.e., no enhancement of) very sharp edges, because processing such edges will only result in artifacts, and not an improvement of image quality. 
         [0056]    In order to provide these attributes, it has been determined that the sharpening strength function must be dependent on the gradient calculated in the 3×3 (or larger) window (such as window  100  of  FIG. 1 ) with respect to the center pixel. This may be accomplished by rewriting equation (2) to have the following form: 
         [0000]        p   out   =p   0 +Σ i=1   8 λ i   Δp   i .   (4)
 
         [0057]    A significant change to equation (2) is to move the sharpening strength parameter λ to within the summation sign; in other words, λ becomes λ l  and is thus a variable dependent upon i instead of being a constant. Accordingly, λ can be adapted to the strength of a gradient Δp i . 
         [0058]    Comparing equation (3) with equation (4), the Applicants have realized that for sharpening, it is not required to maintain the average intensity of an image since edges are enhanced, and furthermore, that functions f i , and λ i  can be combined into one function. For values under ε, the combined function will be a noise reduction filter. For larger values it will act as a sharpening filter. Since the sharpening strength λ has been made a variable λ i  that is dependent upon the gradient strength, the behavior of the sharpening function is modified, so as to perform sharpening in an adaptive manner. 
         [0059]    The combined filter is a rewriting of equation (4), with introduction of a new combined function, c i . 
         [0000]        p   out   =p   0 +Σ i=1   8   c   i   Δp   i .   (5)
 
         [0060]    It is noted that for an 8-bit input image, c i  is a 511 point function. 
         [0061]    An adaptive sharpening algorithm that includes equation (5) has the flexibility to operate under the assumption that smaller gradients in the filter window are due to the noise present in the image. 
         [0062]    The modifications in the gradient gain function, or the gradient weight, i.e. the gain applied to the gradient are as follows: 
         [0063]    As the details increase the gain is increased. However, increasing the gain function continuously may lead to saturation to the maximum value. This can be avoided by reducing the enhancement gain after some point. This region represents edges with low intensity. If the gain is, for example, 2.0 for input intensity 128 and gradient 64, then the gradient of output will saturate (128+2×64=256) and any higher value will saturate to 256. Therefore, the weights for any higher values can be reduced, all the way down to 0. 
         [0064]    As the gradient or the edge intensity increases, the gain is reduced until finally it is reduced to zero for high intensity edges. 
         [0065]    For the purpose of illustration,  FIG. 3  depicts a first exemplary gradient versus gain function  300 . In this example, epsilon (c) has a chosen value of 8 and the maximum sharpness gain is chosen to be 2. It can be seen in  FIG. 3  that the entire range of gradients from 0-255 (assuming 8 bits per pixel) is subdivided into five bands of gains as follows: 
         [0066]    Region of negative gain  302 : this is the smoothing region. The initial slope of portion  301  is “−x” and then portion  303  having a slope of “x.” 
         [0067]    Region  304  of high gain for gradients. 
         [0068]    Flat gain region  306 . 
         [0069]    Decreasing gain region  308  for very (and increasingly) sharp edges. 
         [0070]      FIG. 4  depicts a second exemplary gain function  400 . In this example, a Rayleigh based distribution, i.e., a continuous probability distribution, is used, and the table is then quantized. (It is noted that the use of Rayleigh distribution as a gain function is only one example or illustration of a gain function. The gain function may be could be any non-linear function that is operable to adaptively sharpen edges in an image that are perceived by a human observer to be of low intensity, while leaving edges in an image that are perceived by a human observer to be of high intensity substantially unchanged. It is further noted that in general, a Rayleigh distribution is a continuous function, so it needs to be discretized/quantized as shown in  FIG. 4 , for it to be able to be applicable to image pixel data.) A first region  402  of the function  400  has negative contribution, but the region  402  is very small. This example shows the ability of the Applicants&#39; adaptive sharpening method to effect a tradeoff between smoothing and sharpening. 
         [0071]    Other gain functions are contemplated including, but not limited to, a Weibull distribution function. The gain functions may be based on any other function that fulfills the sharpening gain requirements of the user as described above. 
         [0072]    Computational Aspects 
         [0073]    Certain additional features of the adaptive sharpening algorithm may be provided, which reduce the degree to which the algorithm is “computation intensive,” thereby reducing image processing volume and speed requirements. Advantageously, in circumstances in which the computational power of a processor that executes the algorithm is low, the simplified algorithms described below are still executable by such a processor. 
         [0074]    In executing the adaptive sharpening algorithm, in order to avoid the need for computation of gradients and their subsequent multiplication with the coefficients, a two dimensional look-up table (LUT) may be created in which each index or address of this LUT will store the product of the coefficient and the gradient with respect to the center pixel. Referring to  FIG. 1 , the first index/dimension of this LUT will be the center pixel p 0  and the second index/dimension the LUT will be the neighboring pixel p 1 . For accessing the product of c 0 *(p 0 -p 1 ), the LUT will be indexed as LUT[p 0 ][p 1 ]. 
         [0075]    Assuming 8 bits per pixel, the total size of the above mentioned LUT will be 256×256=65536=64K. 
         [0076]    If a further reduction in LUT size is desired, then the center pixel p 0  can be quantized to 6 bits. Thus the memory required will be reduced to 64×256=16384=16K. The Applicants have determined through experimentation that quantization of the center pixel does not cause any noticeable degradation in video quality. 
         [0077]    It is further noted that the algorithm can work on only an individual Y, U, or V component of an image defined in the YUV color space, or H, S, of V component of an image in the HSV color space, or all three RGB components simultaneously. (It is further noted that applying sharpening to only the Y, U, or V component reduces the artifacts described previously herein.) 
         [0078]    The pseudo code of the 2D adaptive sharpening algorithm for a single pixel, as described above, is presented as follows: 
         [0079]    1. Load 9 pixels, the center pixel p 0  and the 3×3 pixel window. 
         [0080]    2. For each pixel pair, get the product of the gradient and coefficient from the LUT: 
         [0081]    BaseLUT=LOAD(p0) 
         [0082]    Res0=LOAD(BASELUT+p1) 
         [0083]    Res1=LOAD(BASELUT+p2) 
         [0084]    Res2=LOAD(BASELUT+p3) 
         [0085]    Res3=LOAD(BASELUT+p4) 
         [0086]    Res5=LOAD(BASELUT+p5) 
         [0087]    Res6=LOAD(BASELUT+p6) 
         [0088]    Res7=LOAD(BASELUT+p7) 
         [0089]    Res8=LOAD(BASELUT+p8) 
         [0090]    3. Compute the output as: 
         [0091]    Res9=p0 +Res0 
         [0092]    Res10=Res9+Res1 
         [0093]    Res11=Res10+Res2 
         [0094]    Res12=Res11+Res3 
         [0095]    Res13=Res12+Res5 
         [0096]    Res14=Res13+Res6 
         [0097]    Res15=Res7+Res8 
         [0098]    Res16=Res14 +Res15 
         [0099]    Four-Gradient Approach 
         [0100]    In order to increase image processing speed and/or reduce computational requirements of an image processor, in certain embodiments, the algorithm is further modified such that only four gradients are considered in the adaptive sharpening method instead of all eight gradients. More specifically, in one embodiment, the four corners values in the 3×3 mask are neglected. In this embodiment, equation (5) can be rewritten as follows: 
         [0000]        p   out   =p   0 +Σ i=2,4,5,7   c   i   Δp   i .   (6)
 
         [0101]    Accordingly, the above expression requires the computation of only four gradients. The number of additions to compute the output pixel is also halved. 
         [0102]    The pseudo code of the Four-Gradient 2D adaptive sharpening algorithm for a single pixel is presented as follows:. 
         [0103]    1. Load all five pixels, i.e., the center pixel p 0 , the two horizontal neighbors p 4  and p 5 , and the two vertical neighbors p 2  and p 7  in a 3×3 pixel window. (See  FIG. 1  for pixel locations.) 
         [0104]    2. For each pixel pair get the product of the gradient and coefficient from the LUT: 
         [0105]    BaseLUT=LOAD(p 0 ) 
         [0106]    Res0=LOAD(BASELUT+p 2 ) 
         [0107]    Res1=LOAD(BASELUT+p 4 ) 
         [0108]    Res2=LOAD(BASELUT+p 5 ) 
         [0109]    Res3=LOAD(BASELUT+p 7 ) 
         [0110]    3. Compute the output as: 
         [0111]    Res4=P 0 +Res0 
         [0112]    Res5=Res4+Res1 
         [0113]    Res6=Res2+Res3 
         [0114]    Res7=Res5+Res6 
         [0115]    Further Simplifications For Software Porting 
         [0116]    Further simplifications of the algorithm may be performed, and are applicable to a 3×3 window as shown in  FIG. 1 . The simplifications pertain to the gradient calculation and the use of a static look-up table as follows: 
         [0117]    Gradient calculation: In the original algorithm, the gradients are computed with respect to the center pixel. To adopt a simpler approach, while performing a lesser number of gradient calculations, the gradients can be computed as (p 2 -p 7 ), (p 4 -p 5 ), (p 1 -p 8 ) and (p 3 -p 6 ), where (p 2 -p 7 ) and (p 4 -p 5 ) represent the vertical and horizontal edge pixels, respectively; and (p 1 -p 8 ) and (p 3 -p 6 ) represent the diagonal edges, all as depicted in  FIG. 1 . 
         [0118]    Static LUT: Instead of computing filter coefficients in situ based on the gradients as derived in step 1 above, the static filter coefficient sets may be computed and stored in one or more look-up tables (LUTs). The filter sets are selected based on the combination of the horizontal and vertical gradients. The diagonal edges are always given a constant filter coefficient i.e. irrespective of the gradient; in other words, the ratio of contribution of the diagonal edges to the sharpening is fixed. 
         [0119]    Multiple stored look-up tables may be provided for a variety of different purposes. In certain embodiments, the look-up tables may be defined based on the magnitude of the sum of input pixel differences, with smaller pixel difference increases for larger input pixel difference sums. Alternatively, they may be defined based on average values for the input neighbor pixels, thereby adjusting sharpening and noise reduction differently for dark and bright input image and video blocks. The look-up tables may be defined to process the input pixel differences with user selected levels of sharpness increase and/or user selected levels of noise decrease 
         [0120]    The values in the look-up tables, and the resulting table that is selected for image sharpening may be based upon the imaging application, the objects in the image to be displayed, and/or the type of display that is rendering the image. For example, the different look-up tables may be defined for different image or video data types including but not limited to games, movies, personal photos, military intelligence image or video data, medical modality image or video data, and commercial image or video data for exploration or industrial analysis. Additionally, for a given input image or sequence of images, different look-up tables may be chosen using additional information about the type of data in the image to be sharpened, including but not limited to information about whether the image includes faces or skin, text, graphics, uniform data, or structured/patterned data such as trees or grass. Additionally, the different look-up tables may be defined for different displays that are to render the image(s), including but not limited to televisions, computer monitors or computer screens, smartphones, tablets, and digital signs. Additionally, the different look-up tables may be defined based upon information about the importance of a particular image or image block to the user/viewer of the output image. The values in the look-up tables may be defined based upon a model of the human visual system region adaptation to image brightness. 
         [0121]    It is further noted that one of the disadvantages of sharpening using the 3×3 window is that it can result in jagged edges that are too close to the horizontal or the vertical line or direction, i.e., a line or a column. This is due to the edge detection being limited to the maximum slope that can be detected using a 3×3 window. Also, for very large images and 4K video (i.e. video having a horizontal resolution on the order of 4000 pixels), the range of frequencies that such a window can accommodate may not be sufficient. A larger window may be necessary. 
         [0122]    If an image processor is provided that has sufficient computational capability, then the window size may be increased to 5×5, or 3×5, or any other larger size. A 3×5 window may be more applicable to video images because more edges are along the horizontal direction. Accordingly, the algorithms disclosed herein are applicable to a 3×5 window, as will be apparent to one skilled in the art. 
         [0123]    It is noted that the methods of the present invention may be performed by a device for sharpening an image comprising a processor in communication with a data input port for receiving input data of a digital image, and also in communication with a non-transitory computer readable medium that stores one or more of the adaptive sharpening algorithms described herein. The algorithms are communicable to and executable by the processor. The device may be further comprised of an image data receiver that is in communication with the processor, and that receives the output image pixel data defining output image pixels of the output image. In certain embodiments, the image data receiver may be a non-transitory computer readable medium, such as a memory, or a data storage disc, either of which may be portable, i.e., separable from the processor and transportable to interface with another computer or communications port or network. In other embodiments, the image data receiver may be an image display. 
         [0124]    In certain embodiments, the device for sharpening and (optionally) noise reduction of an image may include a camera that captures still images or a sequence of images as a video or movie. In such embodiments, the sharpening and noise reduction of the images may be performed in real time using the device itself. 
         [0125]    Alternatively, the methods may be performed in real time using a device that is separate from the device that is providing the digital input image. Such separate devices include but are not limited to a separate computer, tablet, or smartphone in the hardware and/or software thereof, in an image or video display, in an attached processor of images received via cable or wireless transmission, or in a central processing facility prior to image or video creation or reprocessing for improved libraries or distribution. 
         [0126]    Additionally, it is noted that the resulting images (which have enhanced sharpness) produced by the methods of the present disclosure may be further processed to have enhanced contrast and/or enhanced brightness. Such further image processing may include the image processing using the Contrast methods as disclosed in the Applicant&#39;s commonly owned copending international application, Docket No. RPT0001 WO, entitled “ADAPTIVE CONTRAST IN IMAGE PROCESSING AND DISPLAY,” the disclosure of which is incorporated herein by reference. 
         [0127]    It is, therefore, apparent that there has been provided, in accordance with the present invention, a method for sharpening of an image. Having thus described the basic concept of the invention, it will be rather apparent to those skilled in the art that the foregoing detailed disclosure is intended to be presented by way of example only, and is not limiting. Various alterations, improvements, and modifications will occur to those skilled in the art, though not expressly stated herein. These alterations, improvements, and modifications are intended to be suggested hereby, and are within the spirit and scope of the invention. Additionally, the recited order of processing elements or sequences, or the use of numbers, letters, or other designations therefore, is not intended to limit the claimed processes to any order except as may be specified in the claims.