METHOD FOR DATA PROCESSING

Abstract: In a method for processing data in the form of a grid of discrete source values, at least one target value situated among the source values is determined by means of interpolation. According to the invention account is also taken of the character and the definition of the source data by determining a local minimum and a local maximum of the surrounding source values in a region round the target value for determining and by determining a measure for the dynamics of the surrounding source values in a region round the target value to be determined. The target value calculated by interpolation is adjusted in the direction of either the local maximum or the local minimum on the basis of the thus calculated measure for the dynamics of the surrounding source values in order to express the character and the definition of the source data.

Description: Method for data processing The present invention relates to a method for processing data in the form of a gricTof discrete source values, wherein at least one target value situated among the source values is determined by means of interpolation. Such a method can be used for data of diverse nature, and particularly to expand, compress or decompress computer data with a non-critical bit value, such as for instance sound and animation files. The starting point is always a one- or multi-dimensional grid of discrete source values among which concrete target values have to be predicted by means of interpolation. The source values herein comprise numerical values which, in the case of for instance an image, indicate the colour intensity of a basic colour present therein and, in the case of a sound file, represents the frequency, or pitch, or the intensity thereof. In the case of other types of data a different information component in the source data will similarly be taken as measure. For digital images there exists a number of more or less standardized forms in which the data is stored. The so-called bitmap format is for instance a form wherein the data is stored in a series of discrete numerical values. This series can be converted comparatively simply into a two-dimensional matrix of source values which each indicate the colour intensity of pixels corresponding therewith. In a monochromatic image there thus results a single matrix, while in a colour image such a matrix can be constructed for each of the basic colours. One of the simplest ways of enlarging such an image is to expand the discrete pixels. The result hereof is shown in figures 1 and 4, wherein the lower image TI is roughly a five-fold enlargement of the source image S. It can be seen clearly that such a method of enlargement detracts significantly from the resolution of the final image. Because each pixel of the source image S reappears in the result TI as a rectangular image area of a uniform colour (intensity), a clear block structure is created which does not correspond with the original source image. A better result is obtained by determining target values among the source values in the output data by interpolation. In the case of an image the most probable colour value of an intermediate target value is herein determined on the basis of the colour values of a group of surrounding pixels. The starting point here is preferably a weighted average of the colour values of the surrounding pixels, wherein a heavier weighting is normally assigned to pixels located closer than to pixels located further away. The result of such a method, which is applied by many modern graphic computer programs in a form which may differ somewhat from each other, is shown in figures 2 and 5. The point of departure is the same source image S and the same enlargement factor as in the other figures to obtain the end result T2. A block structure as in a simple pixel expansion is thus avoided to a significant extent in that pixels of the source material S are as it were smeared in the end result T2. While for an image such as that in figure 5 this does produce a reasonable result, the image of figure 2 still loses a lot of its definition because the edges of the image become relatively blurred. Such blurred edges are relatively unavoidable assuming an interpolation technique since interpolation between black and white as in the present image will always produce a certain grey value at the edges. The larger the enlargement chosen, the more pronounced this effect becomes. The present invention has for its object to provide a method of the type stated in the preamble which to at least a significant extent prevents such a blurring of the image, so that the quality of the image is better preserved. In order to achieve the stated objective a method of the type stated in the preamble has the feature according to the invention that in a region round the target value for determining a local minimum and a local maximum is determined of the surrounding source values, that in a region round the target value to be determined a measure for the dynamics of the surrounding source values is determined and that the target value calculated by interpolation is adjusted in the direction of either the local maximum or the local minimum on the basis of the calculated measure for the dynamics of the surrounding source values. Not only is an intermediate value herein determined by interpolation, an analysis is also carried out in the source data in order to define the dynamics or contrast thereof in at least the region where a new target value has to be calculated. On the basis of the thus determined dynamics the interpolated value is adjusted more or less to the value of a local minimum or maximum. In the case of for instance an already relatively blurred source image, the thus adjusted target value will not differ from the interpolated value, or hardly so, but in the case of a relatively dynamic image with sharp local differences in the source values this adjustment will be capable of shifting the interpolated value considerably toward the local maximum or minimum so that the contrast in the source data is retained to a significant degree. The result T3 of an embodiment of the method according to the invention is illustrated in figures 3 and 6, utilizing the same source image S and expansion factor as in the other figures, and clearly shows the improvement compared to the existing expansion techniques. In a particular embodiment the method according to the invention has the feature that a source value which lies closest to the target value for determining in the grid is taken as source of a region extending over a finite number of mutually adjacent source values and that the local maximum and the local minimum are determined in this region. In order to determine the local minimum and maximum for each target value which has to be calculated a uniform framework is herein always used as starting point with just as large a number of source values as reference. The same applies for the determining of the local dynamics of the source values in a further particular embodiment of the method according to the invention, characterized in that the measure for the dynamics of the source values is determined in a second region extending over a finite number of mutually adjacent source values, which second region is optionally of the same size as the first region in which the local maximum and minimum are determined. In the context of the present invention local dynamics in the source values are understood to mean the degree in which the source values in the relevant region differ from each other and also the steepness with which these differences are present. A further particular embodiment of the method according to the invention comprises in this respect an algorithm which assigns a numerical value hereto and is characterized for this purpose in that the dynamics are derived from a normalized difference between a source value and an average of all source values in the second region. For the average of all source values in the second region a weighted average is herein preferably taken which assigns a heavier weighting to source values located closer in the grid than to source values located further away and which particularly utilizes a non-linear density distribution for the purpose of determining the weighting factors and more particularly a Gaussian distribution, at least an exponential density distribution. In order to determine the different factors which play a part in predicting the target value within the scope of the invention, the starting point is always a number of source values in a finite first and second region as frame of reference. Relatively far-removed source values can be ignored because they make no or hardly any contribution towards the precision with which the target value is calculated and can even detract from this precision in that there is a lack of any relationship with the target value for predicting. The calculation time of the method moreover increases when more source values are taken as frame of reference. Conversely, only one or two reference values will in many cases be too few to enable prediction of the target value in reliable manner. A particular embodiment of the method according to the invention has been found effective in practice wherein the first and second region both extend over nine source values in the grid. The adjustment of the interpolated value to the local maximum or minimum within the scope of the present invention can be performed per se in diverse ways. A further particular embodiment of the method according to the invention has the feature however that the final target value is a weighted average of the target value determined on the basis of interpolation and the local maximum and minimum, wherein a weighting factor is employed which depends on average local dynamics of the source values located around the target value and the relative location of the target value determined on the basis of interpolation relative to the local maximum and minimum. In order to determine the local minima, maxima and dynamics it is per se possible to carry out a separate calculation for each target value to be determined. A preferred embodiment of the method according to the invention has the feature however that for all source values an associated local minimum and maximum and an associated dynamic value is determined beforehand so as to be read for the purpose of determining the target value. A calculation is herein performed once for all source values together in order to determine said values, so that these are then immediately available. This saves considerable calculation time since calculations which would otherwise be performed repeatedly now take up calculation time once-only. The invention is not only suitable for data with only a single information component but also for data in the form of source values with separate numerical values for separate information components. In accordance with a further embodiment of the method according to the invention, for each information component a target value located among the source values is herein determined individually for this information component. The invention will now be further elucidated with reference to an embodiment and an associated drawing. In the drawing: figure 1 shows the enlargement of a first image based on an existing technique making using of pixel expansion; figure 2 shows an enlargement of the first image based on a second existing technique making using solely of pixel interpolation; figure 3 shows an enlargement of the first image based on an embodiment of the method according to the present invention; figure 4 shows the enlargement of a second image based on an existing technique making using of pixel expansion; figure 5 shows an enlargement of the second image based on a second existing technique making using solely of pixel interpolation; figure 6 shows an enlargement of the second image based on the embodiment of the method according to the present invention used in figure 3. Although the invention lends itself in principle to any type of data wherein the exact bit value is not critical, it is best elucidated within the scope of the present invention on the basis of an example with graphic data in the form of an image S. The data on the basis of which the image can be constructed is possibly already in the form of a grid or matrix corresponding with the pixels of the image, with for each pixel a numerical source value indicating a colour value or, with a view to the method according to the invention, is brought into such a form. In the case of a monochromatic image the colour value amounts only to an intensity, for instance a grey value; in the case of a colour image this will be a set of for instance three values, one for each basic colour. A much used format in which images are digitally stored is the so-called bitmap format which, for each pixel of a colour image, comprises three channels of 8 bits each, and therefore has 256 values for each basic colour. This format can be employed relatively directly by the method according to the invention, other formats possibly require a conversion similar to that with which such a format is transferred to the (image) memory of a computer. Assuming a black/white image S, a part of the thus assembled matrix is shown by the grid of figure 7, wherein the points in the grid represent the pixels of the source image S with for each grid point S y a discrete value of I from 0 to 255 from the matrix to thereby designate the grey value of the relevant pixel. In order to enlarge such an image while retaining resolution, intermediate points have to be created, of which the value of the grey value has to be calculated. One of these points T is shown in the figure. A first estimate of the grey value I, of the intermediate pixel T can be obtained by inteφolation on the basis of the values of the surrounding pixels. The point of departure herefor in this example is a weighted average of the values of the surrounding pixels, wherein the weighting assigned to each pixel is highly dependent on its distance from T. A more particular point of departure herein for the weighting factors is a normalized Gaussian distribution, of which pixel T forms the origin. Owing to the shaφ fall in the weighting factors according to this curve, it is possible to suffice for the inteφolation with a finite region A of for instance 4x4 pixels around T, which pixels are hatched in the figure. On the basis of this inteφolation there results an inteφolated grey value P t for the pixel T to be calculated in accordance with the following relation: P = T G I where ) G = 1 According to the invention a local maximum and a local minimum around the pixel T to be calculated is also determined in addition to the inteφolated value P t . In the embodiment described here the starting point for this purpose is a reference region B of 4x4 pixels S., . „S 00 S 22 , an origin S 00 of which is formed by the pixel in the original image lying just in front of the pixel for calculating. This region is shown hatched in the figure. A local maximum 1-^ and a local minimum I mm of the grey values of the original pixels are determined within this region. In addition, the local dynamics in the grey values are determined according to the invention within a reference region around the pixel T for calculating. The starting point herefor in this embodiment is the same reference region B as that in which the local minimum and maximum have been determined. These dynamics provide a measure for the hardness or contrast of the image and are derived in this embodiment from the normalized average difference between the grey values of the pixels S y in reference region B and a weighted average of the pixels in a reference region C of 5x5 pixels around the pixel S y for which the local dynamics has to be calculated. This region C therefore differs for each pixel S y and is indicated by way of example in the figure for S 00 . This is expressed in the following formula: "here /„„ = ∑ ( , lβ - /„-G' with ∑ ipJlls -G„ = 1 PI The starting point for the weighted average L gem here are weighting factors G'^ on the basis of a normalized Gaussian distribution which attributes a greater weighting to pixels close to the pixel T for calculating than to further removed pixels. For the resulting factor D, there applies: 0--D y ≤ l. A value D =1 indicates that the source image in the relevant region is very hard, i.e. has very shaφ transitions in intensity, while a value D y =0 indicates precisely the opposite, i.e. no differences in intensity occur within the region. The local dynamics D t associated with the pixel T to be calculated are derived from the weighted average of the values D from the reference region B around the pixel T to be calculated. The grey value of the pixel T to be calculated is established by adjusting the inteφolated value P t to the local maximum or minimum on the basis of the thus found hardness value D t . Taken for this puφose in this embodiment is a weighted average of P t and the local maximum and minimum, wherein a weighting factor is applied which depends on the difference from P t and is proportional to the hardness value D t . This is expressed for instance by the following formula applied in this example: /, = P r (\ - D t) + D r [I mm + (/ miX - 7 min ).sin„( P ' ~ _ Imm )] max mm where sin 0 (t) = !/> + yi.sm ' fπft- 1 /?) and sin n (t) = sin 0 .sin,,,, (t) with n * 5 If in the relevant reference region B the source image is completely level and has no differences in intensity, which is reflected by a value D=0, no shifting or adjustment of the inteφolated value P t takes place. In the case of a comparatively hard image with great differences in intensity, wherein D will move in the direction of a value D=l, the adjustment will in contrast be maximal. The final value I, will in that case be shifted to the local minimum or maximum, depending on which value lies closest to the inteφolated value P t , thereby resulting in more definition. The local dynamics of the original image S are thus taken into account in the final grey value I t which is calculated for the pixel T to be added. The foregoing algorithm is applied for all pixels which have to be calculated among or adjacently of the original pixels in order to create the desired enlargement while retaining resolution. In practice this means that for all pixels of the original source image the associated local maxima, minima and average hardness values are calculated beforehand so that these are then immediately available for the above stated calculations. The stated algorithm allows of simple translation into computer software with which a suitable computer can be loaded to perform the calculations fully automatically. In a user interface adapted thereto setting options can be offered for fine-tuning of the size of the reference regions, the relations for the weighting factors and other parameters. The result on the basis of this embodiment of the method according to the invention is shown in figures 3 and 6 for respectively a relatively hard source image in the form of a shaφly defined character and a more variegated source image corresponding with a photographic image. It can clearly be seen that the definition of the character in figure 3 has been retained despite the great enlargement thereof, while the variegation in the image of figure 6 is retained with the method according to the invention and is even better preserved than on the basis of solely an inteφolation method as shown in figure 5. Although the invention has been further elucidated above with reference to only two embodiments, it will be apparent that the invention is by no means limited to the given embodiments. The invention can thus also be applied to images with more colours, wherein the above stated algorithm is applied separately to each basic colour. The invention can advantageously also be applied for the inteφolation of sound data and other data with non- critical bit values while retaining dynamics. The above stated weighting factors and frames of reference, although very effective, have been given solely as examples. Depending on the concrete situation, a fine-tuning thereof can take place to further enhance the quality of the final result. Larger, smaller or identical reference regions can for instance thus be applied to calculate the various above stated factors and, in order to determine the final grey value of the pixel for calculating, a different algorithm can also be chosen which takes account of the local dynamics derived in this pixel and the local maximum and minimum. The invention generally provides a method of inteφolating data while retaining dynamics, which implies that the character and the definition of the source data is retained to a significant degree in the result.

Claims: Claims 1. Method for processing data in the form of a grid of discrete source values, wherein at least one target value situated among the source values is determined by means of inteφolation, characterized in that in a region round the target value for determining a local minimum and a local maximum is determined of the surrounding source values, that in a region round the target value to be determined a measure for the dynamics of the surrounding source values is determined and that the target value calculated by inteφolation is adjusted in the direction of either the local maximum or the local minimum on the basis of the calculated measure for the dynamics of the surrounding source values. 2. Method as claimed in claim 1, characterized in that use is made of inteφolation on the basis of a non-linear density distribution which assigns a heavier weighting to source values located closer in the grid than to source values located further away, in particular a Gaussian distribution, at least an exponential density distribution. 3. Method as claimed in claim 1 or 2, characterized in that a source value which lies closest to the target value for determining in the grid is taken as source of a region extending over a finite number of mutually adjacent source values and that the local maximum and the local minimum are determined in this region. 4. Method as claimed in claim 3, characterized in that the measure for the dynamics of the source values is determined in a second region extending over a finite number of mutually adjacent source values, which second region is optionally of the same size as the first region in which the local maximum and minimum are determined. 5. Method as claimed in claim 4, characterized in that the dynamics are derived from a normalized difference between a source value and an average of all source values in the second region. 6. Method as claimed in claim 5, characterized in that for the average of all source values in the second region a weighted average is taken which assigns a heavier weighting to source values located closer in the grid than to source values located further away and which particularly utilizes a non-linear density distribution for the puφose of determining the weighting factors and more particularly from a Gaussian distribution, at least from an exponential density distribution. 7. Method as claimed in any of the foregoing claims, characterized in that the final target value is a weighted average of the target value determined on the basis of inteφolation and the local maximum and minimum, wherein a weighting factor is employed which depends on average local dynamics of the source values located around the target value to be determined and the relative location of the target value determined on the basis of inteφolation relative to the local maximum and minimum. 8. Method as claimed in any of the foregoing claims, characterized in that for all source values an associated local minimum and maximum and an associated dynamic value are determined beforehand so as to be read for the puφose of determining the target value. 9. Method as claimed in any of the foregoing claims, characterized in that the source values comprise separate numerical values for separate information components in the source data and that for each information component individually a target value located among the source values is determined for this information component. 10. Method as claimed in claim 9, characterized in that the data comprises the pixels of an image with a separate discrete source value for each basic colour therein and that for each basic colour individually a target value located among the source values is determined. 11. A computer loaded with software for performing the method as claimed in one or more of the foregoing claims. a computer.

Inventors: EIJKELHOF ROGIER, EIJKELHOF, ROGIER
Applicants: EIJKELHOF ROGIER, ESSENTIAL RESOURCE B V, EIJKELHOF, ROGIER, ESSENTIAL RESOURCE B.V.
Application year: 2000
Main classification: G06T5
IPC codes: G06T1, G06T3, G06T5, H04N1