METHOD OF IMAGE SIGNAL ENCODING BY ORTHOGONAL TRANSFORMATION

Abstract: A method of image signal encoding comprises the steps of conducting two-dimensional orthogonal transformation on each block of two-dimensional image signals based on a pre­ determined orthogonal function, recognizing a region, where absolute values of almost all of the transformed signals ob­ tained by the orthogonal transformation are smaller than a pre­ determined value, from a matrix of the transformed signals ar­ ranged in the order of sequency of the orthogonal function in the block, and sampling only the transformed signals outside of the recognized region. Or, characteristic values correspond­ ing to absolute values of the transformed signals are added from the high frequency component side toward the low fre­ quency component side, and only the transformed signals on the frequency side lower than the frequency corresponding to the transformed signal at which the sum obtained by the addi­ tion comes up to a predetermined value are sampled. The sam­ pled signals are encoded respectively with an intrinsic code length.

Description: This invention relates to a method of encoding image signals according to the generic clause of claim 1. Image signals representing half tone images, such as television signals, are composed of enormous amounts of information, and a broad-band transmission line is required for transmission of the image signals. Such image signals involve much redundancy, and various attempts have been made to compress the image signals by restricting the redundancy. Also, in recent years, recording of half tone images on optical disks, magnetic disks, or the like has been generally put into practice. In this case, image signal compression is conducted generally for the purpose of efficiently recording image signals on a recording medium. As one of the methods of image signal compression, a method utilizing orthogonal transformation of image signals is well known. In this method, digital two-dimensional image signals are divided into blocks comprising an appropriate number of samples, and orthogonal transformation of a value string comprising the sample values is conducted for each block. Since energy is concentrated at a specific component by the orthogonal transformation, a component of high energy level is encoded (quantized) by allocating a long code length thereto, and a component of low energy level is encoded coarsely with a short code length, thereby reducing the number of codes per block. As the orthogonal transformation, Fourier transformation, cosine transformation, Hadamard transformation, Karhunen-Loève transformation, or Harr transformation is usually used. The aforesaid image signal compression method will hereinbelow be described in further detail by taking the Hadamard transformation as an example. As shown in Figure 2, blocks are formed by dividing digital two-dimensional image signals in a unit of, for example, two signals in a predetermined one-dimensional direction. When sample values x(0) and x(1) in the block are plotted on an orthogonal coordinate system, since correlation therebetween is high as mentioned above, most of the sample values are distributed near the straight line represented by the formula x(1)=x(0) as shown in Figure 3. Therefore, as shown in Figure 3, the orthogonal coordinate system is transformed by an angle of 45° to determine a new y(0)-y(1) coordinate system. On the y(0)-y(1) coordinate system, y(0) represents the low frequency component of the original image signals prior to transformation, and attains a value slightly larger than x(0) and x(1) [a value approximately √2 times the values of x(0) and x(1)]. On the other hand, values of y(1) representing the high frequency component of the original image signals are distributed just within a very narrow range near the y(0) axis. In the case where a code length of, for example, seven bits is required for encoding of x(0) and x(1), seven bits or eight bits are required for encoding of y(0). On the other hand, y(1) can be encoded with a code length of, for example, four bits. Consequently, the code length per block is shortened, and compression of the image signals is achieved. Orthogonal transformation of second order wherein each block is constituted by two image signals is conducted as mentioned above. As the order is increased, the tendency of energy concentrating at a specific component is increased, and it becomes possible to improve the effect of decreasing the number of bits. In general, the aforesaid transformation can be conducted by use of an orthogonal function matrix. In an extreme case, when an intrinsic function of the objective image is selected as the orthogonal function matrix, the transformed image signals are constituted by the intrinsic value matrix, and the original image can be expressed just by the diagonal component of the matrix. Also, instead of dividing the image signals just in a single direction to form blocks as mentioned above, each block may be constituted by two-dimensional image signals. In this case, the effect of decreasing the number of bits is markedly improved over the one-dimensional orthogonal transformation. The transformed signals obtained by the aforesaid two-dimensional orthogonal transformation are arranged in the order of the sequency (i.e. the number of "0" position crossing) of the orthogonal function utilized for the transformation in each block. Since the sequency is correlated with the spatial frequency, the transformed signals are put side by side in the longitudinal and transverse directions in the order of the frequency as shown in Figure 4. Therefore, the code length per block may be shortened by allocating a comparatively long code length to the transformed signals representing the low frequency component (i.e. the signals on the left upper side in Figure 4) as in the case where a longer code length is allocated to y(0) in the aforesaid one-dimensional orthogonal transformation of second order, and allocating a comparatively short code length to or discarding the transformed signals representing the high frequency component (i.e. the signals on the right lower side in Figure 4). As well known, the aforesaid discarding of the transformed signals is conducted by zonal sampling. Specifically, since the transformed signals are arranged side by side in the order of the frequency in the longitudinal and transverse directions in each block B as shown in Figure 4, the transformed signals y of the same frequency component are placed on a circular arc R having its center at the transformed signal y(1,1) of the sequency 0. Therefore, when the transformed signals y inside of, for example, a zone Z indicated by hatching in Figure 4, are sampled and only the sampled transformed signals y are encoded, it is possible to compress the signals markedly. However, the condition of distribution of the transformed signals inside of the block B is different among images or blocks. Therefore, when the zone Z is fixed, there arises problem that the transformed signals useful for image reproduction are discarded and the image quality of the reproduced image is deteriorated in some blocks, or that even transformed signals which are not so useful for image reproduction are sampled and the effects of image signal compression cannot be increased in other blocks. In order to eliminate these problems, there has heretofore been proposed a method wherein a plurality of sampling zone patterns are prepared, a suitable zone pattern is selected by recognizing the condition of distribution of the transformed signals in each block, and zonal sampling is conducted based on the selected zone pattern. However, with this proposed method, since the number of zone patterns which can be prepared is practically limited, it may occur that zonal sampling is conducted based on a zone pattern which is not so suitable. A method in accordance with the generic clause of Claim 1 is known from Clarke R.J. (1985) "Transform Coding of Images", Academic Press, London, Chapter 5, Section 5.1.2.1.2, pages 195-197 The object of the present invention is to provide a method of image signal encoding by orthogonal transformation, in which the effects of image signal compression is increased markedly for every block of image signals without deteriorating the image quality of the reproduced image, which is free from the drawback that useful transformed signals are discarded in the course of encoding of the transformed signals and the image quality of the reproduced image is deteriorated, and which prevents block distortion from arising in the reproduced image. This object is solved by the features mentioned in claim 1. As the characteristic values correspond to the absolute values of the transformed signals, it is possible to use the absolute values of the transformed signals themselves, the square values of the transformed signals, or the like. With the method of image signal encoding by orthogonal transformation in accordance with the present invention, in the course of zonal sampling of the transformed signals obtained by conducting orthogonal transformation of each block of image signals, it is possible to adjust the sampling region to a very small region ensuring that all of the transformed signals useful for image reproduction are sampled. Therefore, it is possible to markedly increase the signal compression ratio without deteriorating the image quality of the image reproduced through signal compression. According to the preferred embodiment of claim 3, the sampling regions of the blocks adjacent to each other are prevented from becoming greatly different from each other, it is possible to eliminate block distortion, i.e. a difference in density at the boundary between the adjacent blocks, in the reproduced image. Figures 9 and 17 are explanatory views respectively showing the zonal samplings according to the preferred embodiments of claim 1 and 2 of image signal encoding by orthogonal transformation in accordance with the present invention. In the case where the transformed signals which are not so important for image reproduction are comparatively broadly distributed in the high frequency region on the right lower side in Figure 9 or 17, the absolute values of said transformed signals are generally small, and therefore the transformed signal at which the sum of the aforesaid characteristic values comes up to the predetermined value is present on a lower frequency side. According to the invention the region of the zonal sampling is adjusted to be comparatively narrow, many transformed signals which are not so important are discarded, and the effect on image signal compression is enhanced. On the other hand, in the case where many transformed signals having large absolute values, which are important to some extent for image reproduction, are present in the high frequency region in Figure 9 or 17, the transformed signal at which the sum of the aforesaid characteristic values comes up to the predetermined value is present on a higher frequency side. Accordingly, in this case, the region of the zonal sampling is adjusted to be comparatively broad, and there is no risk of transformed signals useful for image reproduction being discarded, though the effect on image signal compression becomes somewhat small. Also, with the preferred embodiment of claim 2, the transformed signals on the frequency side lower than the critical frequency are zone-sampled in the case where the frequency corresponding to the transformed signal at which the sum of the aforesaid characteristic values comes up to the predetermined value is higher than the critical frequency, there is no risk of the zonal sampling region being enlarged unnecessarily when the transformed signals which are not so important for image reproduction are broadly distributed in the high frequency region, and the signal compression ratio is maintained to be high. In the following, the present invention will be described in more detail with reference to the accompanying drawings. Figure 1 is a block diagram showing a general configuration of an apparatus for carrying out a method of image signal encoding by orthogonal transformation, Figures 2 and 3 are explanatory views showing the orthogonal transformation, Figures 4, 5, 6 and 7 are explanatory views showing a principal embodiment of a method of image signal encoding by orthogonal transformation shown in Figure 1, Figure 8 is a block diagram showing the configuration of an apparatus for carrying out the inventive method of claim 1, Figure 9 is an explanatory view for explaining the method of image signal encoding by orthogonal transformation in accordance with the present invention, Figure 10 is an explanatory view showing the block division of an image in a preferred embodiment of claim 1 of the invention Figure 11 is an explanatory view showing the bit allocation table Figure 12 is a flow chart respectively showing the flows of bit allocation decision processing. Figure 13 is a flow chart respectively showing the flows of bit allocation decision processing in a second embodiment. Figure 14 is a flow chart respectively showing the flows of bit allocation decision processing in a further embodiment. Figure 15 is an explanatory view for explaining the zonal sampling in an embodiment of the invention Figure 16 is an explanatory view showing a zonal sampling in preferred embodiments of the invention. Figures 17 and 18 are explanatory views showing the zonal sampling in preferred embodiments of the invention. Referring to Figure 1 schematically showing an apparatus for carrying out a first embodiment of the method of image signal encoding by orthogonal transformation, image signals (original image signals) x representing a half tone image are first sent to a pre-processing circuit 10 and subjected therein to pre-processing for improvement of the signal compression efficiency, for example, smoothing for noise removal. The pre-processed image signals x are sent to an orthogonal transformation circuit 11 and subjected therein to two-dimensional orthogonal transformation. For example, as shown in Figure 5, the two-dimensional orthogonal transformation is conducted in a unit of a square block B comprising MxM number of samples (picture elements) in a half tone image F represented by the image signals x. As the orthogonal transformation, Hadamard transformation may be used. Since the transformation matrix in Hadamard transformation is constituted just by +1 and -1, Hadamard transformation can be executed by use of a transformation circuit simpler than in the other orthogonal transformations. Also, as well known, two-dimensional orthogonal transformation can be reduced to one-dimensional orthogonal transformation. Specifically, the two-dimensional orthogonal transformation is carried out by subjecting the image signals at the MxM number of picture elements in the two-dimensional block B to one-dimensional orthogonal transformation in the longitudinal direction, and then subjecting the MxM number of transformed signals thus obtained to one-dimensional orthogonal transformation in the transverse direction. The transformation in the longitudinal direction and the transformation in the transverse direction may be conducted in the reverse order. As shown in Figure 4, transformed signals obtained by the two-dimensional orthogonal transformation are put side by side in each block in the longitudinal and transverse directions in the order of the sequency of the function on which the orthogonal transformation is based (for example, the Walsh function in the case of Hadamard transformation, or the trigonometrical function in the case of Fourier transformation). Since the sequency corresponds to the spatial frequency, the transformed signals y are arranged in the order of the spatial frequency, i.e. in the order of the density of the detail components of the image, in the longitudinal and transverse directions in the block B. In Figure 4, a transformed signal y(1,1) at the left end column on the top line corresponds to sequency 0 (zero). As well known, the transformed signal y(1,1) represents the average image density in the block B. The transformed signals y thus arranged are sent to an encoding circuit 12 and encoded thereby. At this time, the encoding circuit 12 extracts the transformed signals y along a circular arc R having its center at the position of the transformed signal y(1,1) as shown in Figure 4 in each block B, and compares the absolute values of the transformed signals y thus extracted with a predetermined value "a". The comparison is conducted by starting with a circular arc R having a substantially small radius, ceasing the comparison when at least one of the absolute values of the transformed signals y along the circular arc R is found to be not smaller than the predetermined value "a", and then repeating the same operation by increasing the radius of the circular arc R by a single signal column. When the comparison operations are conducted sequentially and all of the transformed signals y along the circular arc R are found to become smaller than the predetermined value "a", the encoding circuit 12 encodes the transformed signals y along the circular arc R in accordance with a predetermined format. Or, the comparison may be conducted by starting with a circular arc R having a substantially large radius, repeating the same operation by decreasing the radius of the circular arc R by a single signal column when all of the absolute values of the transformed signals y along the circular arc R are smaller than the predetermined value "a", and repeating the comparison until at least one of the absolute values of the transformed signals y along the circular arc R is found to be not smaller than the predetermined value "a". Also, the encoding circuit 12 samples all of the transformed signals y present in a zone Z inward of the circular arc R toward the transformed signal y(1,1), and encodes the transformed signals y thus sampled. Since energy is concentrated at the low frequency component in the transformed signals y as mentioned above, it is possible to decrease the number of bits required per block B and to achieve image signal compression by allocating a comparatively long code length to the low frequency component with high energy, and allocating a comparatively short code length to the high frequency component with low energy. Also, in this case, since the transformed signals y on the higher frequency side with respect to the circular arc R are discarded without being sampled, it is possible to compress the image signals to a high extent. The predetermined value "a" defining the zonal sampling region Z is adjusted to such a value that the transformed signals y which are not so useful for image reproduction are discarded as much as possible. When the zonal sampling region A is determined for each block B based on the predetermined value "a" thus adjusted, the region Z varies in accordance with the distribution condition of the transformed signals y in each block B, i.e. in accordance with the distribution condition of the image signals x, and minimum transformed signals y useful for image reproduction are sampled in every block B. The image signals f(y) encoded in the aforesaid manner, including the encoded signals representing the circular arc R, are recorded on a recording medium (image file) such as an optical disk, or a magnetic disk in a recording and reproducing apparatus 13. Since the image signals f(y) have been markedly compressed as compared with the original image signals x, a large number of images can be recorded on the recording medium, which may be an optical disk. When the image is to be reproduced, the image signals f(y) are read out from the recording medium, and decoded into the transformed signals y in a decoding circuit 14. At this time, based on the signals representing the circular arc R, the decoding circuit 14 allocates a null bit to the transformed signals y in the region on the higher frequency side with respect to the circular arc R in each block, i.e. in the region unhatched in Figure 4. The transformed signals y thus decoded are sent to an inverse transformation circuit 15 and transformed inversely to the aforesaid two-dimensional orthogonal transformation. The original image signals x are thus restored, and sent to an image reproducing apparatus 16 for use in reproduction of the image which the image signals x represent. In the aforesaid embodiment, the zonal sampling region Z is determined by comparing all of the transformed signals y along the circular arc R in Figure 4 with the predetermined value "a". However, the region Z may be determined by use of any other method. For example, as shown in Figure 6, the transformed signals y on the end line in the block B and the transformed signals y on the end column in the block B may be compared with a predetermined value "b", and a straight line L passing through transformed signals y(p,1) and y(1,q) which are smaller than the predetermined value "b" and nearest to the transformed signal y(1,1) may be taken as the boundary of the zonal sampling region Z. In this case, the predetermined value "b" is adjusted so that the straight line L contacts the circular arc R defining the sampling region based on the predetermined value "a". Accordingly, all of the transformed signals y useful for image reproduction are sampled. In this case, the transformed signals y in the regions indicated by dotting in Figure 6 are sampled though they are not so useful for image reproduction. Also, as shown in Figure 7, instead of using the straight line L mentioned above, the zonal sampling region Z may be defined by straight lines L1 and L2 extending in the array directions of the transformed signals y from the transformed signals y(p,1) and y(1,q). In this case, when the predetermined value "a" is used, instead of the predetermined value "b", in the course of finding the transformed signals y(p,1) and y(1,q), all of the transformed signals y useful for image reproduction are sampled. Also, in this case, the transformed signals y in the regions indicated by dotting in Figure 7 are sampled though they are not so useful for image reproduction. Figure 8 schematically shows the configuration of an apparatus for carrying out a first embodiment of the method of image signal encoding by orthogonal transformation in accordance with the present invention. In Figure 8, similar elements are numbered with the same reference numerals with respect to Figure 1. In this embodiment, the two-dimensional orthogonal transformation is conducted in a unit of, for example, a rectangular block B comprising MxN number of samples (picture elements) in a half tone image G represented by the image signals x as shown in Figure 10. The transformed signals y arranged in the order of the sequency of the function on which the two-dimensional orthogonal transformation is based are sent to the encoding circuit 12 as shown in Figure 8. The encoding circuit 12 encodes each of the transformed signals y in the block B with a code length (i.e. a number of bits) in accordance with a bit allocation table created as described later. In the bit allocation table, an intrinsic number of bits is allocated for each sequency, for example, as shown in Figure 11. As mentioned above, it is possible to decrease the number of bits required per block B and to achieve image signal compression by allocating a comparatively long code length to the low frequency component with high energy, and allocating a comparatively short code length to the high frequency component with low energy. The effect of image signal compression is more increased by allocating a null bit to the transformed signals y carrying a particularly high frequency component as shown in Figure 11, thereby discarding them, and sampling only the other transformed signals y (i.e. conducting the zonal sampling). However, it becomes impossible to substantially increase the effect of image signal compression when the region of the zonal sampling is too broad, and many transformed signals y useful for image reproduction are discarded when the region of the zonal sampling is too narrow. The requirement of the embodiment of Figure 8 for adjusting the zonal sampling region in accordance with the condition of distribution of the transformed signals y different among images and blocks will hereinbelow be described. A bit allocation determining section 20 connected to the encoding circuit 12 as shown in Figure 8 receives the transformed signals y arranged as mentioned above, and adds the absolute values of the transformed signals y sequentially from the high frequency component side to the low frequency component side. Specifically, as indicated by the arrow H in Figure 9, the addition is conducted by starting with the transformed signal y(M,N) at the maximum sequency, and adding the absolute values of the transformed signals y on a path along the circular arc R having the center at the position of the transformed signal y(1,1). When the sum obtained by the addition comes up to a predetermined value at a transformed signal y, the bit allocation determining section 20 allocates a code length of one bit or more only to the transformed signals y on the frequency side lower than the frequency corresponding to said transformed signal y at which the sum comes up to the predetermined value, and allocates a null bit to the other transformed signals y. More specifically, when the sum comes up to the predetermined value at the transformed signal yo in Figure 9, a null bit is allocated to the transformed signals y present on a circular arc Ro which is concentric with the circular arc R and on which the transformed signal yo lies, and to the transformed signals y present in the region on the right lower side with respect to the circular arc Ro. The number of bits allocated to each of the transformed signals y to which a code length of one bit or more is to be given may be determined in accordance with an allocating table stored in advance, or may be determined by investigating the actual values of the transformed signals y. The flow of processing for determining the bit allocation at the bit allocation determining section 20 is shown in detail in Figure 12. Information Q on the bit allocation determined as mentioned above is sent to the encoding circuit 12, which encodes the transformed signals y in accordance with the bit allocation information Q. In the course of the encoding, the transformed signals y to which a null bit is allocated are discarded as mentioned above, and only the transformed signals y allocated with a code length of one bit or more are sampled and encoded. Since the region of the transformed signals y allocated with a null bit is determined as mentioned above, the zonal sampling region is adjusted to be comparatively narrow in the case where the transformed signals y which are not so important for image reproduction, i.e. which have a small absolute value, are comparatively broadly distributed in the high frequency region in the block B. Accordingly, encoding of the transformed signals y which are not so useful is avoided, and the number of bits required per block B is decreased markedly. On the other hand, in the case where the transformed signals y comparatively important for image reproduction, i.e. having a comparatively large absolute value, are broadly distributed up to the high frequency region in the block B, the zonal sampling region is adjusted to be comparatively broad. Accordingly, in this case, there is no risk of the transformed signals y useful for image reproduction being discarded though the number of bits required per block B becomes larger than in the aforesaid case. The image signals g(y) encoded in the aforesaid manner and the information on the position of the circular arc Ro are recorded on a recording medium (image file) in the recording and reproducing apparatus 13. Since the image signals g(y) have been markedly compressed as compared with the original image signals x, a large number of images can be recorded on the recording medium. When the image is to be reproduced, the image signals g(y) and the information on the position of the circular arc Ro are read out from the recording medium, and decoded into the transformed signals y in the decoding circuit 14. The transformed signals y thus decoded are sent to the inverse transformation circuit 15 and transformed inversely to the aforesaid two-dimensional orthogonal transformation. The original image signals x are thus restored, and sent to the image reproducing apparatus 16 for use in reproduction of the image which the image signals x represent. A further embodiment of the invention will hereinbelow be described. This embodiment is carried out by use of an apparatus having a configuration basically identical with the apparatus shown in Figure 8, except that the bit allocation determining section 20 is provided with a memory means as described later. The processing for determining the bit allocation will be described below with reference to Figure 13 showing the flow of bit allocation determining processing and Figure 10. The bit allocation determining section 20 stores a predetermined critical frequency F', and a circular arc R' having its center at the position of the transformed signal y(1,1) and passing through the transformed signal corresponding to the critical frequency F' as shown in Figure 15 in the memory means. The circular arc R' defines the minimum zonal sampling region that does not cause deterioration of the image quality of the reproduced image. Specifically, when the zonal sampling region is constricted to the lower frequency side with respect to the circular arc R', there is the risk of the image quality of the reproduced image being deteriorated. Such a circular arc R' may be determined experimentally. In the same manner as in the first embodiment of Figure 8, the bit allocation determining section 20 adds the absolute values of the transformed signals y sequentially by starting with the transformed signal y(M,N), and finds the transformed signal yo at which the sum obtained by the addition comes up to the predetermined value. Then, the bit allocation determining section 20 judges whether a frequency Fo corresponding to the transformed signal yo or the critical frequency F' is higher. In the case where the frequency Fo corresponding to the transformed signal yo is higher than the critical frequency F' as shown in Figure 15, the bit allocation determining section 20 takes the region on the lower frequency side with respect to the circular arc Ro having the center at the position of the transformed signal y(1,1) and passing through the transformed signal yo, as the zonal sampling region as in the aforesaid second embodiment. Conversely, in the case where the critical frequency F' is higher than the frequency Fo, i.e. when the transformed signal yo is closer to the transformed signal y(1,1) than is a transformed signal y' on the circular arc R' in Figure 15, the bit allocation determining section 20 takes the region on the lower frequency side with respect to the circular arc R' as the zonal sampling region. Bit allocation to the transformed signals y in the zonal sampling region thus determined is conducted in the same manner as in the aforesaid second embodiment. The encoding circuit 12 encodes the transformed signals y in accordance with the bit allocation determined as mentioned above. In the second embodiment, since the zonal sampling region is determined as mentioned above, there is no risk of the zonal sampling region being constricted excessively even when transformed signals y having a small absolute value are distributed broadly in the high frequency region. That is, the zonal sampling region is adjusted to be at least equal to the region on the lower frequency side with respect to the circular arc R'. Since the zonal sampling region is thus adjusted, there is no risk of transformed signals y useful for image reproduction being discarded. A third embodiment of the method in accordance with the present invention will hereinbelow be described. The third embodiment is carried out also by use of an apparatus having a configuration basically identical with the configuration of the apparatus shown in Figure 8, except that the bit allocation determining section 20 is provided with a memory means for storing the zonal sampling region in the adjacent block B. The processing for determining the bit allocation will be described below with reference to Figure 14 showing the flow of bit allocation determining processing and Figure 16. The bit allocation determining section 20 determines the zonal sampling region in each block B and the bit allocation in the same manner as in the aforesaid second embodiment, and conducts correction processing so that a difference between the sampling regions in two adjacent blocks becomes smaller than a predetermined value. For example, as shown in Figure 16, the region on the lower frequency side with respect to a circular arc Rn-1 is taken as the zonal sampling region in a block Bn-1 subjected to n-1'th orthogonal transformation, and the region on the lower frequency side with respect to a circular arc Rn is taken as the zonal sampling region in a block Bn subjected to n'th orthogonal transformation. In the course of determining the bit allocation in the block Bn, the bit allocation determining section 20 stores the information on the circular arc Rn-1 in the memory means, and calculates the difference between the radii of the circular arc Rn-1 and the circular arc Rn. When the difference therebetween is larger than a predetermined value r, the bit allocation determining section 20 corrects the circular arc Rn so that the difference becomes equal to the predetermined value r. Figure 16 shows the case where the radius of the circular arc Rn is larger than the sum of the radius of the circular arc Rn-1 and the predetermined value r, and therefore the circular arc Rn is corrected to a circular arc Rn' having the radius equal to said sum. Also when the radius of the circular arc Rn is smaller than a value obtained by subtracting the predetermined value r from the radius of the circular arc Rn-1, the circular arc Rn is corrected so that its radius is equal to the value obtained by subtracting the predetermined value r from the radius of the circular arc Rn-1. The bit allocation determining section 20 defines the zonal sampling region by the circular arc Rn' thus corrected, or by the circular arc Rn when no correction is required, and determines the bit allocation in the defined region. Then, the bit allocation determining section 20 encodes the transformed signals y in accordance with the bit allocation. Also, the information on the circular arc Rn or Rn' is stored in the memory means in lieu of the information on the circular arc Rn-1 in the block Bn-1, and utilized for correcting the zonal sampling region in a block Bn+1 subjected thereafter to orthogonal transformation when necessary. Since the zonal sampling regions are corrected so that the zonal sampling regions in the adjacent blocks do not differ markedly from each other as mentioned above, it becomes possible to prevent block distortion, i.e. occurrence of a difference in density level at the boundary between the blocks in the reproduced image. In the first, second and third embodiments mentioned above, the absolute values of the transformed signals y are added in each block, and the sum thus calculated is compared with the predetermined value. However, it is only necessary that the characteristic values thus added be values with a fixed sign corresponding to the absolute values and, for example, square values of the transformed signals y or the like may be added. Also, since the transformed signals y on the lower frequency side are more important for image reproduction, values weighted with reciprocals of the spatial frequencies which the respective transformed signals y carry should preferably be employed as the aforesaid characteristic values. This is because, in such a case as where the transformed signals y having a small absolute value are distributed broadly in the high frequency region, it becomes possible to prevent the problem that the zonal sampling region is constricted excessively and transformed signals y useful for image reproduction are discarded undesirably. The predetermined value compared with the sum of the characteristic values may be a suitable value determined in advance, or a value calculated by cumulating all of the characteristic values in the block B and multiplying the cumulated value by a predetermined factor. Or, the characteristic values in the block B other than the characteristic value concerning the transformed signal y(1,1) of the sequency 0 and ordinarily attaining a markedly large value may be cumulated, and a value calculated by multiplying the cumulated value by a predetermined factor may be employed as the aforesaid predetermined value. A fourth embodiment of the method in accordance with the present invention will hereinbelow be described. The fourth embodiment is carried out by use of an apparatus having a configuration basically identical with the apparatus shown in Figure 8, except that the bit allocation determining section 20 is provided with the memory means for storing a predetermined critical frequency F', and a circular arc R' having the center at the position of the transformed signal y(1,1) and passing through the transformed signal corresponding to the critical frequency F' as shown in Figure 17. The circular arc R' defines the maximum zonal sampling region wherein a signal compression ratio not smaller than a desired value is obtained. Specifically, when the zonal sampling region is enlarged to the higher frequency side with respect to the circular arc R', it may become impossible to realize the desired signal compression ratio. Such a circular arc R' may be determined experimentally. In the same manner as in the first embodiment of Figure 8, the bit allocation determining section 20 adds the absolute values of the transformed signals y sequentially by starting with the transformed signal y(M,N), and finds the transformed signal yo at which the sum obtained by the addition comes up to the predetermined value. Then, the bit allocation determining section 20 judges whether a frequency Fo corresponding to the transformed signal yo or the critical frequency F' is higher. In the case where the frequency Fo corresponding to the transformed signal yo is higher than the critical frequency F' as shown in Figure 17, the bit allocation determining section 20 takes the region on the lower frequency side with respect to the circular arc R' as the zonal sampling region. Conversely, in the case where the frequency Fo is not higher than the critical frequency F', i.e. when the transformed signal yo is closer to the transformed signal y(1,1) than is a transformed signal y' on the circular arc R' as shown in Figure 18, the bit allocation determining section 20 takes the region on the lower frequency side with respect to a circular arc Ro having its center at the position of the transformed signal y(1,1) and passing through the transformed signal yo as the zonal sampling region. Bit allocation to the transformed signals y in the zonal sampling region thus determined is conducted in the same manner as in the aforesaid second embodiment. Processing for determining the bit allocation at the bit allocation determining section 20 is conducted as shown in Figure 13. The encoding circuit 12 encodes the transformed signals y in accordance with the bit allocation determined as mentioned above. In the fourth embodiment, since the zonal sampling region is determined as mentioned above, there is no risk of the zonal sampling region being enlarged excessively even when the transformed signals y considered to be comparatively important are distributed broadly up to the high frequency region. Thus since sampling is effected at most only in the region where the frequency is not higher than the critical frequency F', it is possible to always realize a high signal compression ratio. In a fifth embodiment of the method, the fourth embodiment is modified so that the bit allocation determining section 20 is provided with a memory means for storing the zonal sampling region in the adjacent block B, and corrects the zonal sampling region in the same manner as in the aforesaid third embodiment. In the fourth and fifth embodiments, various values may be employed as the characteristic values which are to be added and as the predetermined value which is to be compared with the sum of the characteristic values as mentioned with reference to the first, second and third embodiments. Also, in order to prevent the zonal sampling region from being adjusted to be very narrow, a second critical frequency lower than the aforesaid critical frequency F' may be determined, and the zonal sampling region may be adjusted to the region on the frequency side lower than the second critical frequency even though the frequency corresponding to the transformed signal at which the aforesaid sum comes up to the predetermined value is lower than the second critical frequency.

Claims: A method of image signal encoding by orthogonal transformation, conducting two-dimensional orthogonal transformation on each block of two-dimensional image signals on the basis of a predetermined orthogonal function, characterized in that characteristic values corresponding to absolute values of the respective transformed signals (y) in said block (B) are added sequentially from the high frequency component side toward the low frequency component side, that in each block (B) only the transformed signals (y) of the frequency side lower than the frequency (F o ) corresponding to the transformed signals (y) at which the sum obtained by said addition comes up to a predetermined value are sampled, and that the sampled transformed signals are encoded respectively with an intrinsic code length. The method of claim 1 characterized in that in each block (B) a frequency corresponding to the transformed signal (y) at which the sum obtained by said addition comes up to a predetermined value is compared with a critical frequency (F') specified in advance and that only the transformed signals (y) on the frequency side lower than said critical frequency (F') is sampled in the case where said frequency (F o ) corresponding to the transformed signal at which the sum obtained by said addition comes up to said predetermined value is higher than said critical frequency (F') and that only said transformed signals on the frequency side lower than said frequency (F o ) corresponding to the transformed signal at which the sum obtained by said addition comes up to said predetermined value are sampled in the case where said frequency (F o ) corresponding to said transformed signal is not higher than said critical frequency (F'). The method of claim 1 or 2 characterized in that the sampling regions in said blocks (B) adjacent to each other are corrected so that the difference (D) between said sampling regions becomes not larger than a second predetermined value when said difference is larger than said second predetermined value. The method of any of the claims 1 to 3 characterized in that said characteristic values are the absolute values of said transformed signals. The method of any of the claims 1 to 3 characterized in that said characteristic values are square values of said transformed signals. The method of any of the claims 1 to 3 characterized in that said characteristic values are weighted with reciprocals of spatial frequencies which the corresponding transformed signals carry. The method of any of the claims 1 to 6 characterized in that said predetermined value is a value calculated by multiplying a value which is obtained by summing all of the characteristic values in said block by a predetermined factor. The method of any of the claims 1 to 6 characterized in that said second predetermined value is a value calculated by multiplying a value which is obtained by summing all of the characteristic values other than the characteristic value concerning the transformed signal of sequency 0 (zero) in said block by a predetermined factor.

Inventors: TANAKA, NOBUYUKI C/O FUJI PHOTO FILM CO., LTD.
Applicants: FUJI PHOTO FILM CO., LTD.
Application year: 1987
Main classification: H04N7
IPC codes: H04N7