VIDEO IMAGE BAND ADJUSTMENT METHOD, AND FILTER ARRANGEMENT

Abstract: The invention relates to a video image band adjustment method and a filter arrangement. An image, composed of pixels, is subjected to at least pre-filtering in a filter (21), coding in an encoder (22) and storage in a buffer (23) for further transmission. The pre-filter (21) is arranged to generate for each image pixel a reference value, which is a function of the values of a pixel block associated with the pixel. The value filtered for the pixel by the pre-filter (21) is a function of the difference between the original pixel value and the generated reference value and the filtering threshold value. To decrease the bandwidth of the image signal bit stream, the filter arrangement further comprises adjustment means (24), arranged to change the pre-filter (21) threshold value according to the buffer (23) fill rate.

Description: VIDEO IMAGE BAND ADJUSTMENT METHOD, AND FILTER ARRANGEMENT FIELD OF THE INVENTION The invention relates to a video image band adjustment method in which an image, composed of pixels, is subjected to at least pre-filtering, cod- ing and storage in a buffer for further transmission, in which pre-filtering a reference value dependent on the pixel values in a pixel block associated with the pixel in location and/or in time is generated for the image pixel, and in which pre-filtering the filtered pixel value depends on the relation of the difference between the original pixel value and the generated reference value to a filtering threshold value. The invention also relates to a filter arrangement for optimizing the amount of image information, the arrangement comprising a pre-filter, coding means and a buffer, which are arranged to perform at least pre-filtering, coding and storage in the buffer for the image, composed of pixels, for further transmission, the pre-filter being arranged to generate for the image pixel a reference value which is a function of the pixel values of a pixel block associated with the pixel in location and/or in time, and the filtered pixel value being a function of the difference between the original pixel value and the generated reference value and the filtering threshold value. BACKGROUND OF THE INVENTION The problem in transmitting digital video images are the wide bandwidth variations required by the bit stream generated by video coding. The variations are particularly wide when video coding techniques utilizing motion estimation are used. Usually a constant bandwidth has to be reserved for video transmission in practical implementations, whereby the video coding bit stream has to be adjusted at the cost of image quality. Let us study briefly some prior art solutions by means of patent publications US 5,367,629, EP 0 396 846, US 4,691 ,233, US 4,700,226, US 4,047,221 , US 5,134,476 and US 4,189,748, which are incorporated herein by reference. Patent publication US 5,367,629 discloses a video image compression system wherein a pre-processing section comprises a median filter and an adaptive filter. On the basis of the buffer fill rate the compression system adjusts the bandwidth of the adaptive temporal filter in the pre-processing stage, the bandwidth of the spatial and temporal inner filter, and quantization. Patent publication EP 0 396 846 discloses a DCT encoding device in which the bandwidth of a digital low-pass filter inserted before the DCT encoder is reduced as the buffer fill rate increases. Patent publications US 4,691 ,233 and US 4,700,226 disclose a so- lution for adjusting decimation in an adaptive pulse code modulator according to the buffer fill rate. Patent publication US 4,047,221 discloses a coding apparatus in which the attenuation and upper limit frequency of a comb filter coupled after an A/D converter are adjusted on the basis of the buffer fill rate. Patent publication US 5,134,476 discloses a video signal encoding method in which the quantization step and/or the pre-filtering are adjusted according to the buffer fill rate. Patent publication US 4,189,748 discloses a video bandwidth reduction system using two-dimensional transformation, in which an adaptive filter is used. The buffer fill rate is used to adjust a threshold, and the transform coefficients that fall below said threshold are eliminated. However, prior art solutions have several drawbacks. The simplest method of saving band is not to transmit entire video images, but the variations in image frequency caused by this method cause the viewer much dis- turbance. In block-based video coding solutions based on DCT (Discrete Cosine Transform), the band is usually adjusted by changing quantization, i.e. reducing the accuracy of received DCT components, which, however, easily results in emphasized block limits which disturb the viewer. A version of the present solution is not to transmit the DCT components corresponding to higher frequencies and sometimes resulting from noise, but even this method leads to the same problems. BRIEF DESCRIPTION OF THE INVENTION Thus it is the object of the invention to provide a method and an apparatus implementing the method so as to solve the above problems. In spite of the available limited bandwidth, image frequency is not changed. When DCT is used, quantization does not have to changed either, and the transmission of high-frequency DCT components does not have to be limited. This is achieved with a method of the type described in the introduction, characterized by changing the pre-filtering threshold value according to the buffer fill rate. The filter arrangement of the invention, in turn, is characterized by comprising adjustment means arranged to change the pre-filter threshold value according to the buffer fill rate. The method and arrangement of the invention provide a plurality of advantages. The inventive solution enables continuous and rapid bandwidth adjustment without causing segmentation or changes in image frequency. Image signal noise can also be limited. BRIEF DESCRIPTION OF THE INVENTION In the following the invention will be described in greater detail by preferred embodiments with reference to the attached drawings, in which Figure 1 shows an image signal transmission arrangement, Figure 2 shows an image signal filtering arrangement, and Figure 3 shows the efficiency of the inventive solution. DETAILED DESCRIPTION OF THE INVENTION The solution of the invention is particularly applicable to transferring digital video images, without, however, being restricted to it. Figure 1 shows a typical video image transmission arrangement comprising a camera 10, compression means 11 , a transmission network 12, decompression means 13, and a monitor 14. In the inventive solution the camera 10 is a usual monochrome or colour, analog or digital video camera. A signal propagates from the camera 10 to the compression means 11 which process the image signal digitally. With an analog camera 10, the signal is converted in the compression means 11 , at the latest, by an A/D converter into digital form before compression. A digital video image usually comprises im- ages generally sampled by a rectangular matrix at regular intervals. Thus a digital image is composed of a matrix of pixels, i.e. image samples. Because of analog television transmission, interleaved sampling is also used, in which either odd or even rows of the sampling matrix are transmitted alternately at successive moments of time. The resolution of a sampling matrix is not always the same vertically and horizontally. The compression means 11 compress the image information comprised by an image signal digitally so that it can be transmitted in the transmission network 12, which possibly has limited transmission capacity. The transmission network 12 is any known prior art cable network or radio network enabling image transmission. The image information propagates from the transmission network 12 to the compression means 13 in which the image is decompressed, and the signal propagates further to the monitor 14 for displaying the image. Let us study the image signal and its processing in more detail. Displaying colours is possible by using three numerical values of each pixel. The significance and properties of these numerical values vary according to the colour space used. The video camera 10 measures the amount of red (R), green (G) and blue (B) light being reflected from the target, thus using a prior art RGB colour space in sampling. For transmission and processing the image signal is usually transformed into another colour space. Since the display means, i.e. the monitor 14, generates the image by combining red, green and blue light, an inverse transformation is required at the end of the transmission chain on the side of the monitor 14. A person's eyes are more sensitive to brightness than to colour information. Consequently image signal transmission generally employs a trans- formation of the YUV colour space in which more transmission band has been reserved for the luminance component (Y) than for colour difference information (U, V). The U and V components of the PAL system (Phase Alternation Line) are modulation axes of the sub-carriers of a colour coding system. Scaled and filtered colour difference signals B-Y and R-Y are used to modu- late the PAL sub-carrier in the U and V axes. The eyes are also sensitive to slow spatial luminance variation. In an analog image signal, the vertical luminance information comprises double the number of details of the colour information. In a studio-quality digital image signal the colour difference information is consequently sampled vertically by half of the resolution of the luminance information. Often when a digital image is compressed, the horizontal resolution of the colour difference information is also dropped by half. Very rapid spatial luminance variations, in turn, are probably noise. Modification components corresponding to high frequencies are consequently reduced in many codecs by what is known as pre-filtering to remove noise without blurring the edges of the image. Even strong filtering does not cause the eyes as distinctly observable artefacts than discarding the DCT components of block-based codecs. Discrete cosine transform DCT resembles Fast Fourier Transform FFT. It transforms data between the time domain and the frequency domain, the transformation having a corresponding inverse transformation for restoring the original data. DCT is applied to the compression of an image. The DCT transformation is quite heavy computationally. For example, performing a two- dimensional DCT transformation for an 8 x 8 pixel block involves the following formula: F ™ (x x ) , x = 0 _, 1. 7, where is pixel value of i, and C(x) = 1 otherwise In MPEG-1 and MPEG-2 (Moving Picture Expert Group) video coding standards, for example, the correlation of adjacent pixels is utilized by dividing the image into 8 x 8 pixel blocks, which are subjected to DCT transformation. A few components with high values remain in the DCT-transformed block, whereas the values of the other components remain low. By quantization the low-value components are set to zero, whereby run-length encoding from low frequencies to high frequencies, combined with entropy encoding, generates a significantly smaller bit stream as compared with the original. MPEG standards utilize the temporal correlation between images by employing motion estimation to search for the best equivalents from the previous image for a 16 x 16 pixel macro-block of the present image and by transmitting only the motion vectors of the movement and the difference signal of the DCT transformation. Besides DCT transformation, other known video coding methods can also be used in the inventive solution. The most operative video coding methods creatively combine several methods. Table 1 present different coding methods. Table 1. Image coding methods. still — analysis/synthesis model " picture __ semantic L video — L object-based pixel- prediction based ' vector quantization block- • fractals based location L- BTC level — image ■ still _ - by area — segmentation coding picture -transforrrH subimage — pyramid coding __ compo- DCT nent frequency level L band subband coding location frequency— wave set level -video Let us now study image signal filtering in greater detail. Figure 2 shows in the compression means 11 the most important processing blocks of an image signal generated in the camera 10. The arrangement comprises decimation means 20, pre-filtering means 21 , coding means 22, a buffer 23 and adjustment means 24. The decimation means 20 decrease image signal sampling in accordance with prior art, thereby reducing the number of samples. The pre-filtering means 21 remove noise without blurring the edges of the image. At this stage even intense filtering does not cause as clearly noticeable interference patterns to the image as does decreasing the DCT components of block-based codecs. In the coding means 22 a pre-filtered image signal is subjected to coding which typically includes DCT transformation. The energy, i.e. high values, of a block which is used in the DCT transformation and can be of the size of the entire image or e.g. 8 x 8 pixels, are concentrated on a few DCT components while the values of the other components remain low. When quantization is used, most low values become zeroes, which reduces the bandwidth of the bit stream. A coded image signal is applied from the coding means 22 to the buffer 23, from which the signal is transmitted further to e.g. the transmission network. The buffer 23 is preferably an electronic memory circuit storing digital data. The decimation means 20, pre-filtering means 21 and coding means 22 can also be implemented as hardware solutions or in software by using electronic circuits. In the inventive solution the focus is particularly on compressing the luminance of the image signal. Since the buffer 23 is able to store only a limited amount of image signal data, the buffer 23 may become filled if the image signal is not sufficiently compressed. The bit stream of an uncompressed image signal is typically 150 Mbps. For this purpose, the buffer 23 fill rate information is fed back in the inventive solution via the adjustment means 24 to the pre-filtering means 21 , in which the information is filtered from the image signal to such a degree that the storage capacity of the buffer 23 will never be exceeded. This also ensures that the storage capacity of the buffer 23 is always optimally utilized. A reference value, which is dependent on the pixel values of a pixel block associated either in place and/or time with a pixel, is generated for the image pixel in the pre-filtering means 21 in accordance with prior art. In the pre-filtering means 21 , the pixel is further provided with a filtered value, which depends on the relation of the difference between the original pixel value and the generated reference value to a threshold value used in the filtering. These operations are preferably carried out separately for the pixels of each image area to be treated. In this case a pixel value keeps its original value only if the difference between the pixel value and the reference value exceeds the threshold value. Otherwise the original pixel value is replaced by the reference value. The difference can be measured absolute, e.g. as a difference, or rela- tive, e.g. as a quotient. The reference value is typically an average value of a block or the entire image area, such as the mean or median. Median filters are non-linear and remove impulse noise from the image and similarly maintain sharp discontinuity points, such as edges. Block size is preferably 3 x 3 pixels in an area shaped as a square or a cross. In the inventive solution the adjustment means 24 change the pre-filtering threshold value according to the buffer 23 fill rate. The buffer 23 informs the adjustment means 24 of the storage space left in the buffer 23 or of the amount of storage space in use. The fuller the buffer 23, the higher will the adjustment means 24 change the threshold value, whereby more and more pixels deviate from the reference value by less than the threshold value, and are given the value of the reference value. This narrows the bandwidth of the image signal bit stream. If the pixel value is given by e.g. 8 bits, the threshold value may get values step-wise in the range of 0 to 2 8 , i.e. 0 to 256. When block-based video coding is used, each video coding block is separately pre-filtered utilizing motion estimation information. The inventive solution reduces the disturbance caused by the video source and video electronics, e.g. noise. Thus the solution improves the efficiency of coding and enables the use of a low-quality, i.e. even an inexpensive camera. Figure 3 shows measurement results for different pre-filtering methods and thresholds. The vertical axis shows band saving compared with a non-pre-filtered situation. The horizontal axis shows the DCT quantization co- efficient of the coding means 22. In all cases a 3 x 3 pixel block and median filtering have been used, of which plus-median filtering is separately mentioned. In plus-median filtering the selected pixels form a cross-shaped pattern, whereas in ordinary median filtering the selected pixels form a square area. The upper curve 30 represents a case where the threshold value was 18. In the case of curve 31 , the threshold was 18, too, but the filtering was plus-median filtering. Curve 32 presents a measurement in which the threshold was 9 and plus-median filtering was used. Curve 33 also involves a threshold of 9. The pair of curves 34 and 35 involved a threshold of 0. Curve 34 involved plus-median filtering. Although the invention has been described above with reference to the example according to the attached drawings, it is obvious that the invention is not restricted thereto, but can be varied in a variety of ways within the scope of the inventive idea disclosed in the attached claims.

Claims: CLAIMS 1. A video image band adjustment method in which an image, composed of pixels, is subjected to at least pre-filtering, coding and storage in a buffer (23) for further transmission, in which pre-filtering a reference value de- pendent on the pixel values in a pixel block associated with the pixel in location and/or in time is generated for the image pixel, and in which pre-filtering the filtered pixel value depends on the relation of the difference between the original pixel value and the generated reference value to a filtering threshold value, characterized by changing the pre-filtering threshold value ac- cording to the buffer (23) fill rate. 2. A method as claimed in claim 1, characterized in that the original pixel value is maintained only if the difference between the pixel value and the reference value exceeds the threshold value, and otherwise the original pixel value is replaced with the reference value, and the fuller the buffer (23), the higher the threshold value used. 3. A method as claimed in claim 1, characterized in that when the buffer (23) fill rate is less than a predetermined value, the threshold value is kept at a fixed, predetermined value. 4. A method as claimed in claim 1, characterized in that median filtering or the like is used as the pre-filtering. 5. A method as claimed in claim 1, characterized in that filtering is performed only for the luminance components of the image. 6. A method as claimed in claim 1, characterized in that when block-based video coding is used, each video coding block is pre-filtered separately by utilizing motion estimation information. 7. A filter arrangement for optimizing the amount of image information, the arrangement comprising a pre-filter (21), coding means (22) and a buffer (23), which are arranged to perform at least pre-filtering, coding and storage in the buffer (23) for the image, composed of pixels, for further trans- mission, the pre-filter (21) being arranged to generate for the image pixel a reference value which is a function of the pixel values of a pixel block associated with the pixel in location and/or in time, and the filtered pixel value being a function of the difference between the original pixel value and the generated reference value and a filtering threshold value, characterized by com- prising adjustment means (24) arranged to change the pre-filter threshold value according to the buffer (23) fill rate. 8. A filter arrangement as claimed in claim 7, characterized in that the pre-filter (21) is arranged to maintain the original pixel value only if the difference between the pixel value and the reference value exceeds the threshold value, and otherwise the pre-filter (21) is arranged to replace the original pixel value with the reference value, and the fuller the buffer (23), the higher the threshold value the adjustment means (24) are arranged to generate. 9. A filter arrangement as claimed in claim 7, characterized in that when the buffer (23) fill rate is less than a predetermined value, the adjustment means (24) are arranged to keep the threshold value at a fixed, predetermined value. 10. A filter arrangement as claimed in claim 7, characterized in that the pre-filter (21 ) is arranged to use median filtering or the like. 11. A filter arrangement as claimed in claim 7, characterized by being arranged to perform the filtering only for the luminance components of the image. 12. A filter arrangement as claimed in claim 7, characterized in that when the coding means (22) are arranged to use block-based video coding, the pre-filter (21) is arranged to filter each block corresponding to the video coding separately by utilizing motion estimation information.

Inventors: MUSTONEN JUHA, SILVEN OLLI, MUSTONEN, JUHA, SILVEN, OLLI
Applicants: ELEKTROBIT OY, MUSTONEN JUHA, SILVEN OLLI, MUSTONEN, JUHA, SILVEN, OLLI
Application year: 1998
Main classification: H04N
IPC codes: G06T5, H04N7