Patent Application
20110150332
The present invention relates to the processing of images with blur to enhance the sharpness thereof.
Sharpening is one of the standard image processing techniques that are usually applied to visually enhance images. The effect of the sharpening usually appear very impressive to the users as it seems to bring out image details that were not there before. What sharpening actually does is to emphasize edges in the image and make them easier for the eye to pick out. No new details are created in the image.
The first step in sharpening an image is to blur it using one of many available prior art methods, e.g. pixel averaging, convolution with Gaussian mask or any other low-pass filtering. Next, the original image and the blurred version are processed so that if a pixel is brighter than the blurred version it is lightened further; if a pixel is darker than the blurred version, it is darkened. The result is to increase the contrast between each pixel and its neighbours. This process is usually called Unsharp Masking (UM) and can be represented by the following expression:
f
s(x,y)=f(x,y)+b(f(x,y)−fLP(x,y)) (1)
In (1), f(x,y) is the original image, fLP(x,y) is its low-pass filtered version and fs(x,y) is the result of sharpening. The boosting factor b determines how much the image difference is amplified.
The expression (1) can also be generalized by replacing the difference f(x,y)−fLP(x,y) by a general high-pass filter fHP(x,y):
f
s(x,y)=f(x,y)+bfHP(x,y) (2)
The majority of prior art image sharpening methods use either form (1) or (2). The methods differ by the ways of choosing the boosting factor b and applying low-pass or high-pass filtering.
U.S. Pat. No. 5,363,209 describes a variant of the UM method consisting of the following steps: 1) Converting the image to a luminance-chrominance format, wherein at least one signal represents overall image intensity; 2) Determining the maximum local contrast within the image; the local contrast is determined in 3×3-pixel neighbourhood; 3) Determining a 3×3 image filter, which increases maximum local contrast to a predetermined target value and all other contrast to an amount proportional thereto, and 4) Applying the determined filter function to the image to increase sharpness. Thus, in this method, fLP(x,y) is a 3×3 image average and b is a function depending on pixel position and image gradients: b=b(x,y,fx(x,y),fy(x,y)).
In the method described by Chiandussi and Ramponi in the paper entitled “Nonlinear Unsharp masking for the enhancement of Document Images”, in the Proceedings of the Eighth European. Signal Processing Conference, EUSIPCO-96, the structure of the UM method is maintained but a Laplacian-of-Gaussian (LoG) band-pass filter substitutes for the high-pass filter. The signal, which feeds the LoG filter, is processed by a quadratic operator which introduces a significant noise smoothing in uniform background areas. The overall structure of the algorithm corresponds to that of a homogeneous quadratic filter. The paper shows that quadratic filters are capable of edge enhancement in images with limited noise amplification.
Many image sharpening and deblurring methods have been developed in last two decades. The most powerful methods perform blind deconvolution of images when the shape and size of the convolution kernel are unknown. Such algorithms are usually used in off-line processing, when the image that requires enhancement has already been captured and stored in a memory or a hard disk. In off-line mode, the requirements of processing speed and amount of memory are not critical.
A number of problems exist with known image sharpening and deblurring methods.
For example, a first problem is that modern image sensors require real-time performance of the image enhancement algorithms. Miniaturization and low price of the sensors significantly constrain image processors, while keeping high requirements on quality of the result.
A second problem is that capturing of a non-flat subject results in variable blur in the image of that subject; the blur amount depends on distance from the current position of the sensor to the subject. The amount of blur affects the size (that is, the aperture) of the sharpening filter that is required to sharpen the image.
Prior art methods handle this problem by performing the sharpening algorithm a plurality of times, each time using a different size filter aperture and then fusing the resulting images. However, this is not efficient from the points of view of memory consumption and speed of computation.
Furthermore, prior art techniques do not concentrate on optimization, and are not suitable for direct embedded implementation and/or very low-cost implementation.
According to the present invention, there is provided, an apparatus and method for processing input image data to sharpen the image data. The input image data is converted to integral image data and a filter is applied to the integral image data to generate box-filtered image data.
This combination of integral image data and box filtering provides significant advantages in the computation time required to perform image sharpening.
Preferably, the integral image data is processed using a filter with a size that changes for different parts of the image in accordance with the amount of blur in that part. In this way, the filter size can be matched to the amount of blur in each different part. Furthermore, the use of integral image data and box filtering in this case provides additional advantages because the number of processing operations required is constant, irrespective of the size of the filter that is used.
The present invention also provides a computer program product, such as a storage medium or a signal, carrying computer program instructions to program a programmable processing apparatus to become operable to perform a method as set out above or to become configured as an apparatus as set out above.
Embodiments of the present invention provide a number of further advantages. In particular:
Embodiments of the invention can perform fast image sharpening, and are suitable for real-time implementation in a low-cost CPU embedded into linear image sensors.
Embodiments of the invention will now be described, by way of example only, with reference to the accompanying figures, in which:
An embodiment will be described below in which processing is performed in an image scanner to sharpen the image data produced by a line sensor in the image scanner. It will be appreciated, however, that the processing may be performed in other types of apparatus, and that the processing may be performed on image data from other types of sensor, such as a full-image sensor.
As will be described below, the present embodiment uses a variable aperture of the sharpening filter depending on a locally estimated blur amount. The variable aperture is a function r(x,y)∈[1 . . . rmax] available at any pixel (x,y).
As a result, the filter aperture is selected at each pixel position in dependence upon the amount of blur in the image local to that pixel position. In this way, as the amount of blur in the image changes from one pixel position to another, the filter aperture size changes appropriately. This avoids the disadvantage of the prior art mentioned above which processes the whole image a plurality of times, each time using a filter with a different size aperture, and then fuses the results.
In addition, the embodiment produces the result progressively, as soon as new image lines are captured by the sensor. Thus, the embodiment requires a relatively small image processing buffer even in the case of the variable aperture of the filter. This is another difference from the prior art methods that usually work on an entire image requiring large intermediate memory for image processing.
Furthermore, the embodiment applies a filter to integral image data to generate box-filtered data, instead of applying a sharpening filter directly to intensity data. As a result, the number of processing operations required to perform the filtering operation remains constant, irrespective of the size of the filter aperture that is used to generate the box-filtered data.
Before describing the apparatus of the embodiment and the actual processing operations performed thereby, the processing algorithm employed in the embodiment will be described first.
In the image scanner of the present embodiment, the input image is a colour image consisting of three channels: R,G and B. In order to reduce computational load required for three channels, the embodiment process an intensity channel derived from the colour channels using a colour space transformation. Then, after image sharpening has been performed on the intensity channel, the three colour channels are reconstructed using the three original colour channels, the derived intensity channel before sharpening and the processed intensity channel after sharpening.
There are many conventional colour-to-intensity conversions that could be used to derive the intensity channel to be processed from the RGB channels. The present embodiment uses the simplified expression given by equation (3) because this requires only two additions:
f(x,y)=R(x,y)+G(x,y)+B(x,y) (3)
The low-pass filter included in the basic method (1) is replaced by a box filter fBF, which is the sum of the pixels in a rectangular region 2r+1×2r+1. The box filter is computed independently of region size r using a well-known integral image representation. The integral image I(x,y) is computed by recursive 2×2 filtering (that is, using four pixel references) as follows:
I(x,y)=f(x,y)+I(x−1,y)+I(x,y−1)−I(x−1,y−1) (4)
In the present embodiment, the variable aperture size r=r(x,y) is determined in dependence upon the amount of blur in the neighbourhood of the pixel being processed, with the amount of blur being provided by the image scanner. The box filter fBF with variable aperture is computed using the integral image and only four memory references for any r, as follows:
f
BF(x,y,r)=I(x+r,y+r)−I(x−r−1,y+r)−I(x+r,y−r−1)+I(x−r−1,y−r−1) (5)
where r(x,y) is replaced by r for clarity.
The result of box filter (5) is used to obtain a “gain factor” g(x,y), which determine a multiplicative change of colour components:
g(x,y)=k+Lr[f(x,y)]fBF(x,y,r) (6)
where k is a pre-computed numerical constant, depending on boosting factor in (1), Lr[ . . . ] is a look-up-table pre-computed for each possible value r(x,y)∈[1 . . . rmax] and each value of intensity. The amount of memory required by this look-up-table is usually small, because the range of intensity values in equation (3) is [0 . . . 765], assuming byte range of the input colour channels.
The gain factor given by equation (6) is used to modify the input colours in other to obtain the output colours in accordance with equation (7) below, which are the final result of the algorithm:
C
s(x,y)=g(x,y)C(x,y), where C=R, G, or B (7)
One of the simplest methods of colour reconstruction based on processed intensity is the multiplicative method, in which the colour component value is assumed to be proportional to intensity. The present embodiment uses the multiplicative method of colour reconstruction, given by equations (8) and (9):
where R(x,y), G(x,y), B(x, y) and f(x, y) are original colours and intensity and Rs(x,y), Gs(x, y), Bs(x, y) and fs(x,y) are modified colours and intensity.
The present embodiment performs image sharpening, as indicated by the subscript “s”. The UM sharpening procedure (1) discussed previously can be represented in an equivalent form given by equation (10) indicating that the result of sharpening is a linear combination of the original image and its low-pass filtered version.
f
s(x,y)=(1+b)f(x,y)−bfLP(x,y) (10)
From equations (8) and (10) a new representation (11) of the gain factor g(x,y) is:
As noted above, the present embodiment implements a general low-pass filter fLP as the box filter fBF, which is the simplest variant of low-pass filtering. The box filter of variable size r(x,y) is the pixel sum in a (2r+1)×(2r+1) rectangular region, given by
where r(x,y) is replaced by r for clarity. At each pixel, equation (12) requires (2r+1)2 pixel references, which grows quadratically with an increase in the size of r.
In the present embodiment, the box filter uses a constant number of operations independently of the region size. This method is based on the representation of the image in the integral form I(x,y):
from which the sum in equation (12) can be replaced by four references to the integral image:
f
BF(x,y,r)=I(x+r,y+r)−I(x−r−1,y+r)−I(x+r,y−r−1)+I(x−r−1,y−r−1) (14)
where r(x,y) is replaced by r for clarity. Thus, the present embodiment reduces the complexity of the sharpening with a variable aperture to the complexity of a simple 2×2 filter.
The definition given by equation (13) can also be replaced by an equivalent recursive definition given by equation (15) below, that also requires only four references to the image buffers:
I(x,y)=f(x,y)+I(x−1,y)+I(x,y−1)−I(x−1,y−1) (15)
Using the box filter, the computation of the gain factor (11) is performed according to equation (16) below, where low-pass filter is replaced by a local image average:
The floating-point gain factor given by equation (16) is not convenient for low-cost embedded implementation. Therefore, the present embodiment uses a fixed-point format with a precision of p binary digits:
g
1(x,y)=2pg(x,y) (17)
For 32-bit integer representation, a large precision, e.g. p=22, can be used. In fixed-point representation the division operations in equation (16) can be performed in integer format. The present embodiment further reduces the complexity of the algorithm by excluding divisions from computations. More particularly, the present embodiment uses pre-computed look-up-tables Lr[f(x,y)] for all possible values of the variable aperture r∈[1 . . . rmax] and intensity f∈[0 . . . 765], assuming byte range of the input colour channels:
The final expression of the gain factor in fixed-point format is given by equation (19)
g(x,y)=k+Lr[f(x,y)]fBF(x,y,r) (19)
where k=2p(1+b).
After applying the colour reconstruction defined by equation (9), the obtained colour components are also represented in the fixed-point format. To return to the original range, equation (9) is divided by 2p, which is efficiently implemented in the present embodiment by bit shifting to the right by p bits (‘>>’ operation in C/C++):
C
s(x,y)=g(x,y)C(x,y)>>p, where C=R, G, or B (20)
Finally, the output values Cs(x,y) are clipped in order to fit into the original range, e.g. [0 . . . 255].
The present embodiment reduces the amount of intermediate memory required to perform image sharpening.
More particularly, in the computational procedure given by equations (3)-(7) above, only the integral image given by equation (4) needs additional memory buffer; all other values, such as intensity f(x,y), box filter fBF(x,y,r) and gain factor g(x,y) are used immediately after computing them. From the analysis of equations (6) and (7) one can conclude that the gain factor g(x,y) does not need storage for all pixels (x,y); g(x,y) can be stored in a local variable g, which is used to modify the colours given by equation (7) at the current pixel. Similarly, fBF(x,y,r) does not require any variable, as it can be directly substituted to equation (6). The intensity does not require a memory buffer due to simplicity of the equation (3); it can be recomputed in both the integral image given by equation (4) and the gain factor given by equation (6).
It will be seen from equation (14) that the box filter is not defined near the edges of the image, because pixel coordinates (x±r, y±r) can be outside the image. The present embodiment therefore expands the image so that the computation of box filter defined by equation (14) can be performed correctly at the edges and corners of the integral image. The preferred embodiment uses simple pixel replication, which means that each pixel of the expanded image lying outside the original image has a value equal to that of the nearest pixel of the original, non-expanded image. This expansion is defined for the outside pixels as follows:
1) f(−x,−y)=f(0,0), for 0<x≦rmax+1, 0<y≦rmax+1
2) f(x,−y)=f(x,0), for 0≦x<M, 0<y≦rmax+1
3) f(M+x,−y)=f(M−1,0), for 0<x≦rmax, 0<y≦rmax+1
4) f(−x,y)=f(0,y), for 0<x≦rmax+1, 0≦y<N
5) f(M+x,y)=f(M−1,y), for 0<x≦rmax, 0≦y<N (21)
6) f(−x,N+y)=f(0,N−1), for 0<x≦rmax, 0<y≦rmax
7) f(x,N+y)=f(x,N−1), for 0≦x<M, 0<y≦rmax
8) f(M+x,N+y)=f(M−1,N−1), for 0<x≦rmax, 0<y≦rmax,
where M and N are the width and height of the original image respectively.
Using the definitions in equation (21), the integral image defined by equation (15) is computed for all pixels from the extended range defined by equation (22) below.
x∈[−r
max
,M+r
max−1]
y∈[−r
max
,N+r
max−1] (22)
After this, the box filter can be computed correctly for all pixels locations.
In order to sharpen one image line, the algorithm uses an image neighbourhood consisting of 2rmax+2 lines (including the current line, rmax+1 previous lines and rmax next lines). This neighbourhood is used in the box filter defined by equation (5). Thus, the internal memory buffers should have a capacity to store pixel values for at least Nr×d pixels, where Nr is the expanded image width N so that Nr=N+2rmax+1 and dmax=2rmax+2 is the neighbourhood size used in the sharpening filter. At the initial stage, the algorithm processes rmax lines of the original image and fills the internal buffer with the intermediate result of processing, which is the integral image I. When a new line with number i=rmax+1, rmax+2, . . . , M is received from the scanner, the algorithm updates the internal buffer with the new line of the integral image I, and performs the sharpening algorithm for the line with number i−rmax. At the final stage, when all M lines of the image are scanned, and M−rmax lines are sharpened, the algorithm performs sharpening of the remaining rmax lines.
Having provided a summary of the algorithm employed in the present embodiment, the apparatus of the embodiment and the processing operations performed thereby will now be described.
Referring to
The processing apparatus 2 is programmed to operate in accordance with programming instructions input, for example, as data stored on a data storage medium (such as an optical CD Rom 4, semiconductor ROM, magnetic recording medium 6, etc), and/or as a signal 8 (for example an electrical or optical signal input to the processing apparatus 2, for example from a remote database, by transmission over a communication network such as the Internet, or by transmission through the atmosphere).
When programmed by the programming instructions, processing apparatus 2 can be thought of as being configured as a number of functional units for performing processing operations. Examples of such functional units and their interconnections are shown in
Referring to the functional units shown in
The local blur estimate storage section 12 is configured to receive and store an estimate of the local blur for each pixel of the image from the image scanner.
The image scan controller 14 is configured to control the flow of data to and from the RGB data storage section 10 during processing. In use of the apparatus, the image scan controller 14 determines, inter alia, which pixel to process next.
The variable aperture controller 16 is configured to control the size of the aperture of the filter employed to process each pixel in the input image data, in dependence upon the estimate of local blur stored for the pixel in the local blur estimate storage section 12.
The pre-computed look-up tables 18 store pre-computed values of the variable Lr[f] in equation (18) as function of image data intensity and filter aperture size. During the sharpening process, the pre-computed look-up tables are addressed using calculated values of image data intensity and filter aperture size to output a value of said variable without the need to evaluate equation (18), which includes computationally costly division calculations. Accordingly, the pre-computed look-up tables 18 remove the need to carry out division operations during the image sharpening process, thereby reducing processing requirements and speeding up processing.
The image data processing buffer 20 is configured to store the intermediate results produced during the image sharpening process, such as the integral data generated in accordance with equation (19) above.
The image sharpener 22 is configured to process image data, received from the RGB data storage section 10, to provide sharpened image data.
In the present embodiment, the image sharpener 22 comprises:
The output image data interface 36 is configured to communicate sharpened RGB pixel data, stored in the RGB data storage section 10, to a further component of the scanner or an external device.
Referring to
In step S2-10, intensity calculator 24 processes the RGB data from the RGB data storage section 10 to a generate a single intensity channel.
There exist many luminance-chrominance colour spaces, such as HSV, YCrCb, L*u*v*, L*a*b*, providing an intensity or luminance channel. All these colour spaces differ by the number of operations required to compute the intensity f from the colour components R,G and B. The present embodiment generates the intensity channel using the simplest intensity representation given by equation (3) above in integer format, thereby requiring by only two additions. However, any other more complex transformation of the colour to intensity f(x,y)=f(R(x,y),G(x,y),B(x,y)) can be used instead.
The result of the processing at step S2-10 is a single channel of data on which image sharpening is to be performed. This avoids the need to perform image sharpening of each of the R, G and B channels, thereby reducing processing requirements and/or time.
As noted previously, in order to avoid unwanted effects at the borders of the resulting sharpened image, it is necessary to extend the image prior to processing. Accordingly, in step S2-15, the image scan controller 14 determines whether the current pixel is located in a border of the input image which, in the present embodiment, has a depth of one pixel.
If the current pixel does lie in a border, then the image sharpener 22 carries out image expansion in step S2-20 using the image expander 26. This image expansion is performed in accordance with equation (21) above, producing intensity data for the expanded regions of the image, which is stored in the image data processing buffer 20.
Following image expansion, or if the current pixel is not a border pixel, integral image calculator 28 processes the intensity data to calculate integral image date in step S2-25. This processing is performed in accordance with equation (15) above.
In step S2-30, image scan controller 14 checks the number of lines of data that are stored in the image data processing buffer 20. More particularly, because the variable aperture filtering requires data from a neighbourhood centred on the currently selected pixel, it is only after a sufficient number of lines have been accumulated in the image data processing buffer 20, that the variable aperture filtering can commence. Accordingly, in step S2-30, the image scan controller 14 determines if a sufficient number of lines (comprising 2rmax+2 lines) have been accumulated in the image data processing buffer 20.
If a sufficient number of lines have not been accumulated, processing returns to step S2-05 and the processing at steps S2-05 to S2-30 described above is repeated until a sufficient number of lines have been accumulated in the image data processing buffer 20.
When a sufficient number of lines have been accumulated in the image data processing buffer 20, then the processing proceeds to step S2-32.
At step S2-32, the image scan controller 14 selects the next input image pixel for which sharpened image data has not yet been calculated.
In step S2-35, the variable aperture controller 16 determines a measure of the local image blur corresponding to the selected image pixel. In the present embodiment this is done by reading the estimated blur provided by the scanner and stored in the local blur estimate storage section 12 for the current pixel. One way in which the scanner may provide the local blur estimate is described in our co-pending patent application entitled “Document Scanner” (attorney reference 128 250) filed concurrently herewith, the entire contents of which are incorporated herein by cross-reference. However, if the processing apparatus 2 is employed within an apparatus which does not provide an estimate of blur, or if the processing apparatus 2 is a stand-alone apparatus, then the variable aperture controller 16 may itself perform processing to calculate a blur measure using a conventional technique, such as one of those described in U.S. Pat. No. 5,363,209.
In step S2-40, the variable aperture controller 16 selects an aperture for the filter to be applied to the integral image data in dependence upon the estimate of local blur determined at step S2-35. It will be appreciated that the method of selecting the size of the filter aperture is dependent upon the method used to measure the local blur and hence the values that the local blur will take. In the present embodiment, data is stored defining a respective aperture size for each range of the blur values produced for typical input images by the scanner. This stored data is generated in advance by testing images to determine the typical blur values thereof and assigning filter apertures to different ranges of these values. The maximum aperture size rmax is also assigned in this way.
In step S2-45, a filter with an aperture of the size selected in step S2-40 is applied to the integral image data to generate box-filtered image data in accordance with equation (14) above. The effect of this processing is the same as applying the box filter directly to the intensity data in accordance with equation (12) above. However, by applying the filter to the integral image data, a filtered value of the intensity data is obtained using a constant number of processing operations, irrespective of the size of the filter aperture. More particularly, the filtered image data is obtained with a number of processing operations equivalent to those required for a filter of size 2×2, as described previously.
In step S2-50, the size of the filter aperture selected in step S2-40 is used as one of two input values to query the pre-computed look-up tables 18. The other input value is the intensity of the image data for the current pixel. This was computed previously at step S2-10. However, in order to reduce memory requirements, the value computed at step S2-10 is not stored in the present embodiment, and instead it is recalculated at step S2-50 by processing the RGB data stored in the RGB data storage section 10 in the same way as at step S2-10.
As noted above, the use of the pre-computed look-up tables 18 is this way enables a value of Lr[f] in equation (18) above to be computed without computationally expensive division calculations.
In step S2-55, the gain factor calculator 32 calculates a value for the gain “g” in accordance with equation (6) above using the value Lr[f] read from the look-up tables at step S2-50 and the filtered data produced at step S2-45.
In step S2-60, the output colour channel calculator 34 modulates the RGB data for the current pixel stored in the RGB data storage section 10 by the gain “g” calculated at step S2-55 to generate sharpened RGB data for the current pixel in accordance with equation (7) above. The sharpened RGB data values are then written back into the RGB data storage section 10, overwriting the original RGB values for the current pixel, pending output from the processing apparatus 2.
In step S2-65, the image scan controller 14 determines whether all of the lines of the input image have been converted to integral image data and buffered in the processing at steps S2-05 to S2-30.
If it is determined that not all of the lines of the input image have been processed in this way, then the processing returns to step S2-05, and the processing described above is repeated.
On the other hand, when it is determined that all of the lines of the input image have been converted to integral image data and buffered, then processing returns to step S2-35 via step S2-70 (at which the next pixel to be processed is selected). Steps S2-35 to S2-60 are then repeated in this way for each pixel that has not yet been processed to calculate a corresponding gain factor.
Referring to
When the first line 30 of the input image is scanned, the sliding buffer has position 131. The first line is replicated in the buffer according to the first five rules in equation (21). During scanning of the next rmax−1 lines, the sliding buffer remains in the position 131 and pixels are replicated according to rules (4) and (5) in equation (21). As a result of this processing, replicated pixel values are generated in the shaded region shown in
After the first rmax lines have been scanned, the integral image data in the sliding buffer is ready for the processing at steps S2-35 to S2-65 to apply the box filter and produce the first line 133 of the sharpened image data. Thus, a delay of rmax lines is created between the scanning of the RGB input mage data and the generation of the sharpened RGB data.
During subsequent scanning 134, the sliding buffer is moved to a new position 135. This is implemented by a cyclic shift of the pointers to the buffer's lines. In the new position 135, rules (4) and (5) from equation (21) are applied to replicate pixels in the shaded areas of position 135 shown in
At the final line 136 of the input image, the sliding buffer is in position 137, and rules (4)-(8) from equation (21) are applied to replicate the pixels.
During this scanning, there is always a delay of rmax lines between the input and output lines, which makes it possible to use the in-place processing described above, in which the sharpened image data for the output line is written directly to RGB data storage section 10 to replace the data of the input line.
Modifications and Variations
Many modifications and variations can be made to the embodiment described above.
For example in the embodiment above, the processing apparatus 2 forms part of an image scanner. However, instead, the processing apparatus 2 may be a stand-alone apparatus, such as a personal computer, or it may form part of a different type of apparatus, such as a digital camera, copier or printer.
Although the embodiment described above processes image data from a linear image sensor, the method of processing images disclosed hereinabove is equally applicable to image data captured using a rectangular array of image sensors, such as a CCD camera.
In the embodiment above, the size of the filter aperture is selected for each pixel position at step S2-40, so that the filter aperture size changes throughout the image. However, instead, a constant size of filter aperture may be used for the whole integral image. In this case, the computation time is significantly decreased by processing the integral image data defined by equation (15) above to give box-filtered data defined by equation (14), without using the variable function r(x,y).
The embodiment described above performs in-place processing to write the sharpened image data back into the RGB data storage section 10 overwriting the original RGB data of the input image. However, instead, a different memory may be provided to store the sharpened image data.
Although embodiments of the invention have been described above with reference to an input image represented as three colour channels with a range of intensity values of 0 to 255, it would be obvious to the skilled person that embodiments of the invention may be provided, which process an input image represented using any number of channels with any range of intensity values.
Although the embodiment above is configured to process colour input data, it may instead be configured to process black and white input data. In this case, the intensity calculator 22 would no longer be required because a single channel of intensity data of the black and white data would already be available for processing.
In the embodiment described above, processing is performed by a programmable processing apparatus using processing routines defined by computer program instructions. However, some, or all, of the processing could be performed using hardware instead.
Other modifications are, of course, possible.
| Number | Date | Country | Kind |
|---|---|---|---|
| 08156448.6 | May 2008 | EP | regional |
| Filing Document | Filing Date | Country | Kind | 371c Date |
|---|---|---|---|---|
| PCT/EP2009/056061 | 5/19/2009 | WO | 00 | 2/7/2011 |
