Image processing apparatus

Abstract: The invention relates to an image processing apapratus having the function to encode or decode image data and discloses a technique in which an optimum encoding method is selected in accordance with the characteristics of an image and a high efficient encoding with little deterioration in image is executed.

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to an image processing apparatus which is used in a facsimile communication, an image data base, or the like. Related Background Art In recent years, as a method of encoding a natural image (multivalue color image), there has been proposed a method whereby an image is divided into blocks each comprising a plurality of pixels, a DCT (discrete cosine transform) is executed for each block, a coefficient of the DCT is quantized, and a Huffman code is assigned. However, in the above conventional method, since a high frequency portion of the DCT coefficient is roughly quantized in order to raise the encoding efficiency, a ringing occurs in an edge portion of a reproduction image, particularly, in a portion of a character and a blur of the peripheral portion of the character remarkably deteriorates the quality of image. Such a problem is not limited to the encoding method as mentioned above but also similarly occurs in other encoding methods such as orthogonal transformation encoding, vector quantization, and the like. On the other hand, techniques for extracting an edge component and executing an encoding according to the extracted edge component have been proposed by the same assignee of the present application in U.S. Patent Nos. 4,797,945 and 4,887,151 and U.S. Patent Application Serial Nos. 185,024, 261,276, 312,755, and 362,014. In addition, a technique for executing a process according to an edge component when encoded image data is decoded has been proposed by the same assignee of the present application in U.S. Patent Application Serial No. 146,084. However, the further improvement is demanded to solve the above problems and to improve both of the encoding efficiency and the reproducibility of the image. US-A-4,266,249 discloses a method for digitally encoding an image including the step of inputting multilevel input data. An edge peaking means is used to accentuate contours and edges in the original image. The emphasized edge data is then binarized with reference to a fixed DC level. Patent Abstracts of Japan, Vol 13, No 144 (E-740), dated 10 April 1989 and JP-A-63306768 discloses an encoding apparatus for an input image signal in which the image is divided into blocks with encoding taking place by DCT or BTC methods. SUMMARY OF THE INVENTION It is, therefore, an object of the invention to solve the above problems and to provide an image processing apparatus which can prevent a deterioration in image quality when executing the encoding or decoding. Another object of the invention is to prevent the occurrence of the ringing as mentioned above and to also improve an image quality when an image including characters were reproduced. To accomplish the above object, according to a first aspect of the invention, there is provided an image encoding apparatus comprising: input means for inputting multi-value image data for each pixel of an image; encoding means for encoding the multi-value image data using a plurality of encoding methods; and output means for outputting image data encoded by said encoding means, the apparatus being characterized in that said encoding means comprises: first encoding means for encoding multi-value image data for each pixel of the whole image as binary image data for each pixel using a first encoding method suitable for encoding binary image data; removing means for removing a high-frequency component from the multi-value image data input by said input means, and second encoding means for encoding the multi-value image data from which the high-frequency component has been removed by said removing means as the multi-value image data for each pixel using a second encoding method different from the first encoding method, the second encoding method being suitable for encoding multi-value image data. According to a second aspect of the invention there is provided an image encoding method comprising the steps of: an input step of inputting multi-value image data for each pixel of an image; an encoding step of encoding the multi-value image data using a plurality of encoding methods; and an output step of outputting the image data encoded in said encoding step, the method being characterized in that said encoding step further comprises, a first encoding step of encoding the multi-value image data for each pixel of the whole image as binary image data for each pixel using a first encoding method suitable for encoding binary image data, a removing step of removing a high-frequency component from the multi-value image data input in said input step, and a second encoding step of encoding the multi-value image data from which data the high-frequency component has been removed in said removing step as the multi-value image data for each pixel using a second encoding method different from the first encoding method, the second encoding method being suitable for encoding the multi-value image data. The above and other objects, operations, and advantages of the present invention will become apparent from the following detailed description and the appended claims with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram of an encode unit in the first embodiment of the present invention; Fig. 2 is a block diagram of a decode unit in the first embodiment of the invention; Fig. 3 is a diagram showing a block division of an input image; Fig. 4 is a diagram showing a block pattern of a natural image portion; Fig. 5 is a diagram showing a block pattern of a character portion; Fig. 6 is a diagram showing a block pattern of an input image; Fig. 7 is a diagram showing an example of a quantization table; Fig. 8 is a diagram showing an example of DCT transformation coefficients; Fig. 9 is a diagram showing an example of DCT quantization data; Fig. 10 is a diagram showing an example of DCT decode data; Fig. 11 is a diagram for explaining the principle of the second embodiment of the invention; Fig. 12 is a block diagram of an encode unit in the second embodiment of the invention; and Figs. 13, 14A, 14B, 15A, and 15B are diagrams for explaining other embodiments. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the invention will be described hereinbelow with reference to the drawings. [Embodiment 1] According to the first embodiment of the invention, means for classifying an image to be encoded to a natural image (flat) portion and a character (edge) portion in accordance with the characters of the image is provided and the portion which is classified as a character portion is first encoded by a BTC (block truncation coding) so as to raise a resolution. Then, a difference between the original image and the reconstructed image by the BTC is calculated and is DCT (discrete cosine transform) encoded so as to raise a gradation. As mentioned above, since the strong edge portion serving as a generation source of the ringing has already been eliminated by the first BTC encoding, a character of a high quality can be reproduced. Fig. 1 is a diagram showing a construction of an encode unit of the first embodiment of the invention. Reference numeral 1 denotes an image input unit such as image reading means for scanning an original and converting into image data every pixel, host computer for inputting image data, or the like. Reference numeral 2 denotes a classification unit for classifying the input image data to a character portion or a natural image portion; 3 a BTC encode unit for encoding using the BTC; 4 a BTC decode unit; 5 a differentiator for calculating a difference between the input image and the BTC decode image; 6 a DCT encode unit for executing the DCT to the difference data and quantizing transformation coefficients and executing a Huffman encoding; and 7 an encode data generation unit. In the above construction, input image data which was input by the image input unit 1 such as an image scanner comprising a CCD line sensor or the like is discriminated by the classification unit 2 to see if it relates to the character portion or not every block in accordance with the presence or absence of an edge. Such a discrimination is performed by the block of a unit basis of N x M pixels (M and N are arbitrary integers: explanation will now be made here on the assumption that N = M = 4). Assuming that a density of the pixels in the block is set to X ij (i = 1,..., 4, j = 1,..., 4), an average value is first obtained. Further, among x ij , an average P 1 of the pixels whose values are equal to or larger than X and its standard deviation a 1 and an average P 2 of the pixels whose values are smaller than X and its standard deviation a 2 are obtained (it is assumed that the image data consists of eight bits). It is determined that the block which satisfies the following relational equations is a character portion. P 1 - P 2 ≥ T 1 and a 1 < T 2 and a 2 < T 3 It is also assumed that the block which does not satisfy the above relational equations is a natural image portion. Although threshold values have been set such that T 1 = 100 and T 2 = T 3 = 30 in the embodiment, they are not limited to the above values. By providing the threshold values T 1 , T 2 , and T 3 , particularly, the character portion in the edge portion can be accurately discriminated. As a method of discriminating the character portion, it is also possible to use other well-known methods such as method whereby a spatial frequency filter for extracting an edge is used, method based on a difference between the maximum and minimum values of the pixels in the block, and the like. Then, with respect to the block which was determined to be a character portion by the classification unit 2, such a character pattern is expressed by the data of one bit per pixel and the average values P 1 and P 2 are encoded by the BTC encode unit 3. The above processing state will now be descriminated with reference to Fig. 3. Assuming that A indicates a block of a natural image and B denotes a block of a character, as shown in Fig. 4, all of the pixels in the portion A are set to 0. In the portion of B, the pixels whose values are larger than ( P 1 + P 2 / 2) are set to 1 and the other pixels are set to 0 (for instance, as shown in Fig. 5). By executing the above processes to the whole input image, all of the pixels other than the character portion are set to 0 and only the character pattern can be left (Fig. 6). The whole pattern data is encoded by a coding method of MH, MR, or MMR or by other entropy coding methods, so that a signal 101 indicative of the pattern information is obtained. On the other hand, the average values P 1 and P 2 of the character block are also Huffman encoded and a signal 102 indicative of average value information is derived. As mentioned above, with respect to the pattern information and the average value information, by using a reversible encoding, the resolution is raised and the ringing occurring in the periphery of the character portion can be eliminated. On the other hand, the BTC decode unit 4 reconstructs the image by decoding on the basis of the pattern information signal 101 and the average value information signal 102 and reproduces only the character (edge) block. The differentiator 5 calculates a difference between the image of the character block which was reconstructed and the input image which was input from the image input unit 1. The difference output is encoded by the DCT encode unit 6 on the basis of an encoding method such as an ADCT (adaptive discrete cosine transform) or the like. The DCT encode unit 6 first executes the two-dimensional DCT every block comprising 4 pixels × 4 pixels, thereby obtaining transformation coefficients as shown in, for instance, Fig. 8. Each of the transformation coefficients obtained is quantized by a quantization table as shown in Fig. 7, so that quantization data as shown in Fig. 9 is obtained. Practically speaking, each of the transformation coefficients of Fig. 8 is divided by the corresponding component of the quantization table of Fig. 7 on the matrix and the figures below a decimal point are omitted, so that the quantization data shown in Fig. 9 is obtained. The DCT code is constructed by zigzag scanning the coefficients which were quantized as shown in Fig. 9 and Huffman encoding, so that a signal 103 indicative of natural image information is derived. As mentioned above, for the natural image information, a compression ratio is raised by the irreversible encoding and an encoding efficiency can be improved. The cause of the ringing which caused the problem hitherto is based on the cutting of the high frequency component by the quantization. However, according to the invention, the character portion having a large amount of high frequency component is encoded by the BTC and the high frequency portion which is encoded by the DCT encoding portion is reduced, thereby clearing such a problem. That is, by encoding the edge portion and the other portions by respectively using the optimum encoding methods in accordance with the detection of the edge portion (character portion), a deterioration in image quality can be prevented. First, the natural image information signal 103 of an amount of one picture plane of the input image is first transmitted from the encode data generation unit 7. Then, with respect to the amount of one picture plane of the input image, classification information of one bit indicating whether each block is a character block or not is transmitted by the MMR or the like. Finally, the pattern information signal 101 and the average value information signal 102 are transmitted. A discrimination regarding the character block is performed by checking whether the signals 101 and 102 have been input to the encode data generation unit 7 or not. The result of the discrimination is held in an internal memory of the encode data generation unit 7 by an amount of one picture plane of the input image. That is, the encode data generation unit 7 has the memory for storing the natural image information signal 103, classification information, pattern information signal 101, and average value information signal 102. The memory has a capacity to store at least the classification information, pattern information signal 101, and average value information signal 102 as much as one picture plane. On the other hand, as a storage device such as an image file or the like, memory means such as optical disk, magnetic disk, hard disk, or the like can be used to store the data which is sent from the encode data generation unit 7 by an amount of a plurality of picture planes. The transmitting order of the above various information is not limited to the order mentioned above but a signal indicating whether the input image data relates to the character portion or not can be also first transmitted. Fig. 2 is a block diagram of a portion to decode the received encode data. The transmitted encode data is received by an encode data reception unit 8 and stored into an internal memory. Then, a BTC decode unit 10 decodes the block of the character portion by using a pattern information signal 201 from the encode data reception unit 8 and an information signal 202 of the average values P 1 and P 2 of each block. On the basis of the decoded block, a character image is reconstructed. Namely, when the pattern information was reconstructed as shown in Fig. 6, "0" in the character portion (portion in which "1" exists in the block) is replaced by P 2 and "1" is replaced by P 1 . A counter DCT decode unit 9 decodes quantized transformation coefficient information 203 and executes a counter quantization by using the quantization table (Fig. 7 (the same table as that used upon quantization)) in accordance with the procedure which is substantially opposite to the procedure upon quantization, thereby obtaining transformation coefficients (Fig. 10). That is, each component of the quantization table of Fig. 7 is multiplied to the quantization data of Fig. 9, thereby obtaining the transformation coefficients of Fig. 10. Then, a two-dimensional counter DCT is executed. The image obtained and the image which was output from the BTC decode unit 10 are added by an adder 11, thereby obtaining the final decode data. An image is output by a decode data output unit 12 such as laser beam printer for forming a latent image onto a photosensitive drum and forming a visible image by using a toner, ink jet printer, thermal printer, or the like. An image may be also formed onto a display. According to the embodiment, as mentioned above, the means for classifying an image to be encoded to a natural image (flat) portion and a character (edge) portion is provided. The portion which was classified to the character portion is first encoded by the BTC. A difference between the original image and the reconstructed image by the BTC is then calculated and DCT encoded. Thus, a strong edge portion as a generation source of the ringing has already been eliminated. Therefore, a character of a high quality can be reproduced. [Second embodiment] In the above first embodiment, in the BTC, both of the average value P 1 of the pixels whose values are equal to or larger than the intrablock average value X and the average value P 2 of the pixels whose values are less than X are Huffman encoded and transmitted. However, in the second embodiment, as shown in Fig. 11, a difference value P 1 - P 2 of P 1 and P 2 is Huffman encoded. As mentioned above, with respect to the block which was determined to be a character portion, by encoding only the pattern data of such a block and the difference value P 1 - P 2 , the encoding efficiency in the BTC can be remarkably improved. On the other hand, the high frequency component of a character block can be almost preferably reconstructed by the encoding by the BTC by using only the difference value P 1 - P 2 . However, the data of the hatched portion in Fig. 11 cannot be reconstructed by using only the BTC. Therefore, in the encoding apparatus of the embodiment, the encode data by the BTC is again decoded and a difference between the resultant data and the original image is calculated and is DCT encoded. Thus, the data of the hatched portion in Fig. 11 can be encoded by the DCT. Therefore, according to the second embodiment, the encoding efficiency when the character portion is block encoded can be improved. On the other hand, the data which is not used for block encoding is followed by the DCT encoding. Consequently, a deterioration in image quality which occurs due to the improvement of the encoding efficiency can be prevented. A construction of the encoding apparatus of the embodiment will now be described hereinbelow. The construction of the second embodiment is also fundamentally similar to that of the embodiment 1. Fig. 12 is a diagram showing a construction of an encode unit in the second embodiment of the invention. Reference numeral 1 denotes the image input unit; 2 indicates the classification unit for classifying whether the input image data relates to a character portion or a natural image portion; 3 the BTC decode unit for encoding by using the BTC; 4 the BTC decode unit; 5 the differentiator for calculating a difference between the input image and the BTC decode image; 6 the DCT encode unit for executing the DCT to the difference data and quantizing the transformation coefficients and executing the Huffman encoding; and 7 the encode data generation unit. In the above construction, the input image data which was input by the image input unit 1 such as a CCD sensor or the like is discriminated by the classification unit 2 to see if it relates to a character portion or not every block. Such a discrimination is performed by the block on a unit basis of N x M pixels (M and N are arbitrary integers: explanation will now be made on the assumption that N = M = 4 here). Assuming that a density of pixels in the block is set to x ij (i = 1,..., 4; j = 1,..., 4), the average value is first obtained. Further, among x ij , the average P 1 of the pixels whose values are equal to or larger than X and its standard deviation a 1 and the average P 2 of the pixels whose values are smaller than X and its standard deviation a 2 are obtained (it is assumed that the image data comprises eight bits). The block which satisfies the following relational equations is determined to be a character portion. P 1 - P 2 ≥ T 1 and a 1 < T 2 and a 2 < T 3 Although the threshold values have been set such that T 1 = 100 and T 2 = T 3 = 30, the invention is not limited to the above values. Classification information 104 of one bit of each block is directly sent to the encode data generation unit 7. The classification information of one picture plane of the input image is stored into an internal memory. With respect to the block which was determined to be a character portion by the classification unit 2, the block pattern is expressed by one bit and the difference value P 1 - P 2 of the average values P 1 and P 2 is encoded in the BTC encode unit 3. The above processing operations will now be described with reference to Fig. 3. Now, assuming that A indicates the natural image portion and B represents the character portion, all of the pixels in the portion A are set to 0 as shown in Fig. 4. The pixels whose values are larger than ( P 1 + P 2 / 2) in the portion B are set to 1 and the other pixels are set to 0 (for instance, as shown in Fig. 5). By executing the above processes to the whole input image, all of the pixels other than the character portion are set to 0 and only the character pattern can be left (Fig. 6). The whole pattern information is encoded by the MMR or entropy encoding, so that the signal 101 is obtained. On the other hand, the difference value P 1 - P 2 of the character block is also Huffman encoded, so that the signal 102 is derived. In the BTC decode unit 4, an image is reconstructed by the signals 101 and 102 and only a character block is reproduced. The differentiator 5 calculates a difference between the reproduced image and the input image. The difference output is encoded by the DCT encode unit 6. The DCT encode unit 6 first executes the two-dimensional DCT to 4 x 4 blocks, thereby obtaining the transformation coefficients as shown in, for example, Fig. 8. Each of the transformation coefficients obtained is quantized by the quantization table as shown in Fig. 7, so that the quantization data as shown in Fig. 9 is obtained. Practically speaking, each of the transformation coefficients of Fig. 8 is divided by the corresponding component of the quantization table of Fig. 7 on the matrix and the figures below the decimal point are omitted. Thus, the quantization data shown in Fig. 9 is derived. The DCT code is constructed by zigzag scanning the coefficients which were quantized as shown in Fig. 9 and Huffman encoding, so that the signal 103 is derived. The cause of the ringing which caused a problem hitherto is based on the cutting of the high frequency components by the quantization. However, according to the invention, the character portion having a large high frequency component is encoded by the BTC and the high frequency portion is reduced, thereby clearing the above problem. A block diagram of the portion to decode the received encode data in Fig. 2 is similar to that in the case of the first embodiment. That is, in the BTC decode unit 10, first, the block of the character portion is decoded by using the pattern information signal 201 and the information signal 202 of the difference value P 1 - P 2 of the average values P 1 and P 2 of each block which are output from the encode data reception unit 8. A character image is reconstructed on the basis of the decoded block. That is, when the pattern information is reconstructed as shown in Fig. 6, 0 in the character portion (portion in which 1 exists in the block) is set to 0 and 1 is replaced by P 1 - P 2 . On the other hand, in the counter DCT decode unit 9, the quantized transformation coefficient information 203 is decoded and executes the count quantization by using the quantization table (Fig. 7 (the same table as that used upon quantization)) in accordance with a procedure which is quite opposite to the procedure upon quantization, thereby obtaining the transformation coefficients (Fig. 10). That is, each component of the quantization table of Fig. 7 is multiplied to the quantization data of Fig. 9, thereby obtaining the transformation coefficients of Fig. 10. Then, a two-dimensional counter DCT is executed and the resultant image and the image which was output from the BTC decode unit 10 are added by the adder 11, thereby obtaining the final decode data. An image is output by the decode data output unit 12. As mentioned above, according to the embodiment, the encoding efficiency in the block encoding of the character portion can be improved and a deterioration in image quality of the reproduction image can be prevented. [Other embodiments] Although the above embodiments have been described with respect to a black and white multivalue image, the invention can be also applied to a color multivalue image. As a method of processing a color multivalue image, there can be mentioned a method whereby the invention is used with respect to each of the planes of R, G, and B, a method whereby the RGB data is converted into a color space such as YUV, L*a*b* or the like and the invention is used, or the like. Figs. 14A and 14B show an embodiment in the case where the invention was applied to the compression and transmission of a color multivalue image. In Fig. 14A, reference numeral 1 denotes the image input unit. In the embodiment, a flat head color image scanner which scans an image on an original base plate by three line sensors for R (red), G (green), and B (blue) and generates multivalue signals of R, G, and B every pixel is used as the image input unit 1. Reference numerals 201', 202', and 203' denote encode units for encoding the R, G and B signals, respectively. Each of the encode units is similar to that of the encode unit shown in Fig. 1. Reference numeral 204 denotes a transmission control circuit for controlling in a manner such that the data encoded by the encode units 201' to 203' are read out of the internal memory of the encode data generation unit 7 and are sequentially transmitted. In Fig. 14B, reference numeral 205 denotes a reception control circuit for discriminating to which one of the R, G, and B data the received encode data relates, for selecting either one of an R signal decode unit 206, a G signal decode unit 207, and a B signal decode unit 208, and for transmitting the received encode data to the selected corresponding decode unit. The R, G, and B data can be discriminated by, for instance, adding a flag. A construction of each of the decode units 206 to 208 is similar to the construction of that shown in Fig. 2. The multivalue R, G, and B data which were decoded by the decode units 206 to 208 are subjected to color processes such as logarithm conversion, masking, gamma correction, and the like by a color processing unit 209. The multivalue data of Y (yellow), M (magenta), C (cyan), and K (black) corresponding to recording agents are sent to the decode data output unit 12. The decode data output unit forms a visible image on the basis of the Y, M, C, and K data. An apparatus such as a printer to output a hard copy and an apparatus such as a display to output a soft copy can be used as the decode data output unit. In the case of displaying an image by the display apparatus, the R, G, and B data are directly output without executing the conversion into the Y, M, C, and K data by the color processing unit 209. As a printer, for instance, a printer of the electrophotographic type for forming a latent image onto a photosensitive drum and developing the latent image by using color toners of Y, M, C, and K can be used. On the other hand, Figs. 15A and 15B show an embodiment in the case where the function for the color component conversion was further added to the color encoding and decoding apparatuses in Figs. 14A and 14B. In Fig. 15A, a color component conversion unit 304 converts the input R, G, and B data into the color component data of L*, a*, and b*. L* denotes a luminance component and a* and b* indicate chromaticity components. Since the construction for converting the input color data into the luminance component and the chromaticity components has been used, a data amount of the chromaticity components can be further reduced as compared with that of the luminance component by using a nature such that a deterioration in chromaticity components is difficult to be recognized by the visual sense of human being. Since the other constructions are similar to those of Fig. 14A, their descriptions are omitted. On the other hand, in the BTC encode unit 3, it is also possible to use a method whereby for the average values P 1 and P 2 , a difference between P 1 and P 2 of the adjacent blocks is calculated and the Huffman coding or the entropy coding such as an arithmetic code or the like is used. The transmission and reception of the encode data can be also executed in a lump every block with respect to the flag indicative of the character portion, pattern information 101, average value information 102, and natural image information 103. The block encoding is not limited to the case of encoding the pattern information and the difference value information. For instance, the pattern information and the standard deviations can be also encoded. In the invention, the difference between the reproduced image by the BTC and the input image has been DCT encoded. However, as shown in Fig. 12, the DCT encoding is not executed to the character portion but only the BTC encoding is executed and the portions other than the character portion can be also DCT encoded. In Fig. 13, reference numeral 121 denotes image data which was input from the image input unit. A classification unit 122 discriminates whether the input block relates to an edge portion or not every block. The block which was determined to be the edge portion is encoded by a BTC encode unit 123. Pattern data 126 in the block and average value data P 1 and P 2 (127) are sent to an encode data generation unit 125. On the other hand, the block which was decided to be a portion other than the edge portion is quantized by a DCT encode unit 124 in a manner similar to the above. Quantization data 128 is sent to the encode data generation unit 125. In the encode data generation unit 125, the pattern data 126, average value data 127, and quantization data 128 are stored every block and encode data for transmission is formed. On the other hand, the decoding is executed in accordance with a procedure opposite to the encoding procedure. In the encode data which was received by an encode data reception unit 129, the BTC decoding is executed by using the pattern data 126 and average value data 127 by a BTC decode unit 130. The DCT decoding is performed by using the quantization data 128 by a DCT decode unit 131. An original image can be finally reconstructed in an internal memory of an image output unit 134 by using BTC decode data 132 of the edge portion and the DCT decode data of the natural image portion. Figs. 15B shows an apparatus on the reception side and a construction other than the color processing unit 310 is similar to that in Fig. 14B. The color processing unit 310 converts the luminance data L* and the chromaticity data a* and b* into the Y, M, C, and K data. As described above, by BTC encoding the character portion having a large high frequency component and calculating a difference between the BTC reconstructed image and the input image, the high frequency component can be reduced. Therefore, when the character portion was DCT encoded, no ringing occurs. The character portion of a high quality can be reproduced as compared with the conventional apparatus.

Claims: An image encoding apparatus comprising: input means (1) for inputting multi-value image data for each pixel of an image; encoding means (3, 6) for encoding the multi-value image data using a plurality of encoding methods; and output means (7) for outputting image data encoded by said encoding means, the apparatus being characterized in that said encoding means comprises: first encoding means (3) for encoding multi-value image data for each pixel of the whole image as binary image data for each pixel using a first encoding method suitable for encoding binary image data; removing means (5) for removing a high-frequency component from the multi-value image data input by said input means (1), and second encoding means (6) for encoding the multi-value image data from which the high-frequency component has been removed by said removing means (5) as the multi-value image data for each pixel using a second encoding method different from the first encoding method, the second encoding method being suitable for encoding multi-value image data. An apparatus according to claim 1, wherein said input means (1) is an image reading apparatus for scanning an original and converting into image data of every pixel. An apparatus according to claim 1, wherein said input means (1) is a host computer. An apparatus according to claim 1, wherein the image data input by said input means (1) is colour image data, and said encoding means (3,6) output is arranged to encoded data representing a colour image. An apparatus according to claim 1, wherein said first encoding method raises the resolution for the image data determined to represent an edge portion in the input image data, and said second encoding method raises the gradation of the data determined to represent portions other than an edge portion in the input image data. An apparatus according to claim 5, wherein the first encoding method encodes the input image data by extracting pattern information in units of blocks having a plurality of pixels. An apparatus according to claim 5, wherein the second encoding method is an encoding method using an orthogonal transformation. An apparatus according to claim 7, wherein the orthogonal transformation is a discrete cosine transformation. An apparatus according to claim 1, further comprising memory means for storing the encoded data. An apparatus according to claim 1, further comprising transmitting means (204) for transmitting the encoded data. An apparatus according to claim 1 wherein said input means (1) is arranged to input colour multi-value image data, said encoding means (3,6) is arranged to encode the colour multi-value image data, and said output means (7) is arranged to output colour image data. An image encoding method comprising the steps of: an input step of inputting multi-value image data for each pixel of an image; an encoding step of encoding the multi-value image data using a plurality of encoding methods; and an output step of outputting the image data encoded in said encoding step, the method being characterized in that said encoding step further comprises, a first encoding step of encoding the multi-value image data for each pixel of the whole image as binary image data for each pixel using a first encoding method suitable for encoding binary image data, a removing step of removing a high-frequency component from the multi-value image data input in said input step, and a second encoding step of encoding the multi-value image data from which data the high-frequency component has been removed in said removing step as the multi-value image data for each pixel using a second encoding method different from the first encoding method, the second encoding method being suitable for encoding the multi-value image data. An image encoding method according to claim 12 comprising: wherein during said input step colour multi-value image data is input during said encoding step said colour multi-value image data is encoded, and during said output step colour image data is output.

Inventors: KATAKAYA AKIHIRO, KATO SHIGEO, YASUDA YASUHIKO, KATAYAMA, AKIHIRO, KATO, SHIGEO, YASUDA, YASUHIKO, KATAKAYA, AKIHIRO, C/O CANON KABUSHIKI KAISHA
Applicants: CANON KK, CANON KABUSHIKI KAISHA
Application year: 1990
Main classification: G06T9
IPC codes: H04N7, G06T9, H04N1, H04N11