referring now to fig2 , an acquired image g is supplied for filtering according to the present invention . while the embodiment is described in terms of processing an image in rgb space , the invention can be applied to luminance channels only or other color spaces . only one input image , g , is used and a running average on each color channel is computed 20 as each pixel value is read . therefore for each pixel g ( i , j , k ) of each plane k = 1 . . . 3 , we compute : another variant is to compute on each color channel , the sum of 2n + 1 pixel values around the pixel g ( i , j , k ) and divide by 2n + 1 . from the moving average values , r , g , b , correction terms γ r , γ b are calculated , step 25 , as follows : preferably , both correction terms , γ r and γ b values are limited within a chosen interval ( e . g . between 0 . 95 and 1 . 05 ; if any of γ r and γ b values is below 0 . 95 their value is set to 0 . 95 ; if any of γ r and γ b values is above 1 . 05 their value is set to 1 . 05 ). this prevents over - amplification of the red and blue channels in further processing . in parallel with generating the moving average values , the pixels are parsed on rows or columns and for each pixel of a color plane g ( i , j , k ), a coefficient h ( i , j ) is calculated as follows : in fig2 , this processing is broken into step 30 : α is a positive value less than 1 ( e . g . α = 0 . 125 ); and α is the pole of the corresponding recursive filtering , e . g . α can have values between 0 . 05 and 0 . 8 ). the comparison with δ is used in order to avoid division by zero and to amplify dark pixels ( e . g . δ = 15 ). the initial value h ( 1 , 1 ) can have values between 1 and 2 . using this filter , darker areas are amplified more than illuminated areas due to the inverse values averaging and , therefore , an automatic correction of uneven luminance in the foreground / background is obtained . it will be seen from the above that the recursive filter , h , doesn &# 39 ; t filter the pixel values . for example , if α = α = ⅛ and δ 5 = 15 , the filter 30 / 40 is filtering a sequence of numbers that varies between 1 and 3 depending on actual pixel value g ( i , j , k ) and the preceding values of the image . if the filter 40 simply uses as input the pixel values g ( i , j , k ), it generates a simple low pass filtered image , with no luminance correction . in one implementation of the embodiment , the modified pixel values , g 1 ( i , j , k ), are given by a linear combination , step 50 , of the filter parameters h and the correction terms γ r , γ b : g 1 ( i , j , 1 )= g ( i , j , 1 )· h ( i , j )· γ r g 1 ( i , j , 3 )= g ( i , j , 3 )· h ( i , j )· γ b . one more complex alternative to the linear model is a logarithmic model . in such an implementation , the output pixel g 1 ( i , j , k ) corresponding to the enhanced color plane ( r / g / b color planes ), is as follows : d is the maximum permitted value ( e . g . 255 for 8 bit representation of images ); and ε is a constant whose indicated values are between 1 and 3 . examination of the formula above shows that only values smaller than d may be obtained . in this implementation , the degree of color and brightness boost are obtained by varying the pole value ( α ) and the logarithmic model factor ( ε ). the computations can be adapted for the ycc or other color spaces . for example , when using ycc color space in the embodiment of fig2 , there is no need to compute the correction terms γ r , γ b , and ε = 1 for the y channel if the logarithmic model is used . the inverting function for the y channel is therefore : the linear model can be applied for the luminance channel and the logarithmic model can be used for the chrominance channels using the h ( i , j ) coefficient computed on the luminance channel . this approach leads to computational savings and add the possibility of adjusting the color saturation by using a different positive value for ε ( e . g . ε = 0 . 9 ) when computing the new chrominance values . the brightness of the enhanced image can be varied by multiplying the y channel with a positive factor , ε , whose value can be different than the value of ε used for the chrominance channels . in a second embodiment of the invention , the processing structure of fig2 can be used to sharpen an image . in this embodiment , the image is preferably provided in ycc format and the processing is performed on the y channel only . the ratio of the next pixel and the current pixel value is computed and filtered with a one pole iir filter ( e . g . α = 1 / 16 ), step 40 . the operations can be performed on successive or individual rows or columns . the initial h coefficient is set to 1 and in case of operating on row i we have : again , this processing can be broken down in step 30 : again , the comparison with δ is used in order to avoid division by zero ( δ is usually set to 1 ). h ( i , j ) is a coefficient that corresponds to the current pixel position ( i , j ) of the original image . the initial coefficient can be set to 1 at the beginning of the first row or at the beginning of each row . in the first case , the coefficient computed at the end of the one row is used to compute the coefficient corresponding to the first pixel of the next row . the enhanced pixel value y 1 ( i , j ) is given by the following formula : where ε ( i , j ) can be a constant gain factor or a variable gain depending on the h coefficients . another alternative for ε ( i , j ) is to use the difference between consecutive pixels or the ratio of successive pixel values . for example , if the difference between successive pixels is small ( or the ratio of consecutive pixel values is close to 1 ) the value of ε ( i , j ) should be lower , because the pixel might be situated in a smooth area . if the difference is big ( or the ratio is much higher or much lower than 1 ), the pixels might be situated on an edge , therefore the value of ε ( i , j ) should be close to zero , in order to avoid possible over - shooting or under - shooting problems . for intermediate values , the gain function should vary between 0 and a maximum chosen gain . an example of ε ( i , j ) according to these requirements has a rayleigh distribution . in some implementations , a look up table ( lut ) can be used if a variable ε ( i , j ) is chosen , because the absolute difference between consecutive pixels has limited integer values . this method is highly parallelizable and its complexity is very low . the complexity can be further reduced if luts are used and some multiplications are replaced by shifts . furthermore , this second embodiment can also be applied to images in rgb space . the second embodiment can be applied in sharpening video frames either by sharpening each individual video frame or identified slightly blurred frames . in each embodiment , the pixels can be parsed using any space - filling curves ( e . g . hilbert curves ), not only by rows or columns . the corrected image can be thought as a continuously modified image , pixel by pixel , through a path of a continuously moving point . it will also be seen that the image sharpening image processing of the second embodiment can be applied after the luminance correction of the first embodiment to provide a filtered image with even superior characteristics to either method implemented independently . indeed , either method can be applied in conjunction with other image processing methods as required for example following the processing described in pct application no . pct / ep2007 / 009939 and u . s . application ser . no . 11 / 856 , 721 , which are incorporated by reference . while an exemplary drawings and specific embodiments of the present invention have been described and illustrated , it is to be understood that that the scope of the present invention is not to be limited to the particular embodiments discussed . thus , the embodiments shall be regarded as illustrative rather than restrictive , and it should be understood that variations may be made in those embodiments by workers skilled in the arts without departing from the scope of the present invention . in addition , in methods that may be performed according to preferred embodiments herein and that may have been described above , the operations have been described in selected typographical sequences . however , the sequences have been selected and so ordered for typographical convenience and are not intended to imply any particular order for performing the operations , except for those where a particular order may be expressly set forth or where those of ordinary skill in the art may deem a particular order to be necessary . in addition , all references cited herein , as well as u . s . applications 60 / 945 , 558 , ser . nos . 10 / 764 , 339 , 12 / 042 , 335 , 11 / 753 , 098 , 11 / 752 , 925 , 60 / 944 , 046 , 11 / 767 , 412 , 11 / 624 , 683 , and 11 / 856 , 721 , and us published application 2005 / 0041121 , 2006 / 0204110 , 2006 / 0120599 , 2006 / 0098890 , 2006 / 0039690 , 2006 / 0285754 , 2007 / 0189748 , 2008 / 0037840 , and 2007 / 0269108 , and u . s . pat . no . 7 , 352 , 394 , as well as the background , invention summary , abstract and brief description of the drawings , are each incorporated by reference into the detailed description of the preferred embodiments as disclosing alternative embodiments .