Abstract: From inputted multilevel image data it is generated, for each pixel, image area information constituted by an image area component indicating whether the pixel exists in a character•line drawing area or halftone area and an image area component indicating whether the pixel is chromatic or achromatic. The information is encoded by a lossless encoding unit on a block basis and stored, and an amount of code is monitored. When the amount of code exceeds a target amount, the lossless encoding unit performs encoding upon changing image area components, of subsequently input image area components, which coincide with a condition. The codes that have already been stored are temporarily decoded by a lossless code re-encoding unit, and the above image area components are changed. The resultant data is then re-encoded and stored.

Abstract: An image processing apparatus, image processing method, and program which enable generation of vector data capable of replicating a clipart region of a raw image as faithfully as possible are provided. To accomplish this, a raw image is segmented into region images according to attributes. From the segmented region images, a region image having a predetermined attribute is cut out from the raw image. At least one representative color which configures the predetermined region image is decided based on an appearance color of the cut out predetermined region image. A color image having the decided representative color is extracted from the predetermined region image. A contour line of the extracted color image is extracted. An edge image within the predetermined region image is extracted. The extracted contour line is corrected based on the extracted edge image. Using the corrected contour line, vector data of the predetermined region image is generated.

Abstract: This invention has as its object to provide an image processing apparatus, which can obviate the need for image re-input, can effectively generate encoded data that falls within a set size, and can minimize deterioration of image quality. To this end, an image processing apparatus according to this invention includes first discrimination unit for discriminating the type of image of each of a plurality of regions, which form image data input, second discrimination unit for discriminating if the image data is inputted by a continuous scan of images, selection unit for selecting an encoding method used in compression of each region on the basis of discrimination results of the first and second discrimination unit, first compression unit for compressing image data of each region using the encoding method selected by the selection unit, and second compression unit for compressing information that pertains to the type of image of each region.

Abstract: Disclosed is an image processing apparatus in which vector data from which noise has been removed and amount of data reduced can be generated in ideal fashion with regard to an illustration area selected from a document image. The document image is input to the apparatus and is segmented into a plurality of areas. A clip-art image is selected from these areas and a plurality of clusters are generated with regard to this image area. When a small area included in the plurality of clusters is determined as a noise, the noise is eliminated by combining the small area with a adjacent cluster. After noise is removed, the cluster group eventually obtained is converted to vector data.

Abstract: The present invention allows an image to be coded within a target size without necessitating the image to be input again during the coding of the image, with a mode reflecting a user's intention for coding. To solve this problem, input image data is coded at coding unit 102 and stored into first and second memories, respectively. Coding sequence unit 108 monitors the quantity of codes. When a set value is determined to be reached, coding sequence unit 108 makes data in first memory to be discarded and directs coding means to further increase a quantization step, and continues coding. As previous coded data is stored in second memory, the data is re-coded with the same quantization step as that of coding unit 102 after changing of a parameter at re-coding unit 109, and the re-coded data is stored into first and second memory.

Abstract: An image input through an input unit is compressed by an encoding unit and stored in first and second memories. A first counter counts the data in its code amount. When the amount of encoded data generated reaches a predetermined size, an encoding sequence control unit sets quantization steps in the encoding unit and re-encoding unit to increase compression ratios. The encoding sequence control unit clears the first memory, causes the re-encoding unit to re-encode the encoded data stored in the second memory, and stores the resultant data in the first memory. Since the encoding unit continues encoding data with the set quantization step, the encoded data are stored in the first memory from the start of the image. Subsequently, every time the data amount stored in the first memory reaches a predetermined amount, the quantization step is increased, and the processing is repeated.

Abstract: According to this invention, encoded data of a target data amount is generated by one image input operation while both lossless encoding and lossy encoding are adopted. For this purpose, a first memory stores encoded data of a shorter encode length among encoded data generated by a first encoding unit which performs lossy encoding and encoded data generated by a second encoding unit which performs lossless encoding. A second memory stores encoded data from a second encoding unit. When an encoding sequence control unit determines that the encoded data amount in the first memory has exceeded the target data amount, the encoding sequence control unit discards data in the first memory, sets a quantization parameter for a higher compression ratio for the first encoding unit, and causes the first encoding unit to execute encoding. Encoded data before the encoded data amount is determined to have exceeded the target data amount is re-encoded by a re-encoding unit.

Abstract: This invention can play back a smooth moving image in both normal and slow playback modes in consideration of the human visual recognition level, even when moving image data to be decoded (played back) is recorded (encoded) at a high frame rate. To this end, in this invention, respective frames, which form a moving image at 60 frames/sec, are compressed to be independently decodable. In the normal playback mode, since frames are played back using one of two frames (decimating one of two frames), a moving image is played back at 30 frames/sec which can assure sufficiently high image quality as a moving image. On the other hand, in the slow play back mode, since the number of frames to be decimated is set to be zero, and 60 frames are played back for 2 sec, a moving image is played back at the same frame rate of 30 frames/sec as that in the normal playback mode.

Abstract: The present invention allows an image to be coded within a target size without necessitating the image to be input again during the coding of the image, with a mode reflecting a user's intention for coding. To solve this problem, input image data is coded at coding unit 102 and stored into first and second memories, respectively. Coding sequence unit 108 monitors the quantity of codes. When a set value is determined to be reached, coding sequence unit 108 makes data in first memory to be discarded and directs coding means to further increase a quantization step, and continues coding. As previous coded data is stored in second memory, the data is re-coded with the same quantization step as that of coding unit 102 after changing of a parameter at re-coding unit 109, and the re-coded data is stored into first and second memory.

Abstract: Although methods employing chain codes or Fourier descriptors are known for calculating an outline similarity between a model image and an object image, these methods are difficult to achieve detection of both an approximate similarity and local similarity. In view of this, according to the present invention, wavelet transformation is performed on outline points of an object image, and similarity calculation is performed on a plurality of model images with the use of a low frequency component of the transformation result. Only the model image, having a close agreement in matching processing, is subjected to similarity calculation using a high frequency component of the transformation result. By virtue of this processing, similarity calculation can be performed at high speed with high precision.

Abstract: This invention has as its object to provide an image processing apparatus, which can obviate the need for image re-input, can effectively generate encoded data that falls within a set size, and can minimize deterioration of image quality. To this end, an image processing apparatus according to this invention includes first discrimination unit for discriminating the type of image of each of a plurality of regions, which form image data input, second discrimination unit for discriminating if the image data is inputted by a continuous scan of images, selection unit for selecting an encoding method used in compression of each region on the basis of discrimination results of the first and second discrimination unit, first compression unit for compressing image data of each region using the encoding method selected by the selection unit, and second compression unit for compressing information that pertains to the type of image of each region.

Abstract: This invention does not unconditionally fix the upper limit of encoding but adjusts it in accordance with the size of an input image, thereby effectively utilizing a memory and maintaining high image quality regardless of an image size. In this invention, input image data is compression-encoded by an encoder 102 and stored in first and second memories 104 and 106. An image size detector 111 detects the size of the input image data. An encoding sequence controller 108 determines the upper limit of the code amount of the input image data currently being encoded, and monitors whether this upper limit is exceeded. Upon determining that the upper limit is exceeded, the encoding sequence controller 108 sets encoding parameters of the encoder 102 to set a higher compression ratio, and continues the encoding. Encoded data before this determination is decoded and re-encoded by a re-encoder 109 so as to have a compression ratio higher than before.

Abstract: An analyzer estimates the time for rendering image data based on the number, types, etc., of rendering commands, stored in an intermediate memory, and determines whether or not there is a possibility of overrun. If there is the possibility of overrun, image data of respective bands formed in a band buffer are sequentially compressed and stored into a compressed image memory. When the image data for one page has been stored, the data in the compressed image memory is sequentially expanded and supplied to a printer engine. This avoids failure of image output due to overrun, while reducing the capacity of the image memory.

Abstract: This invention is designed to encode the image area information of a multilevel image within a target size without re-inputting the information. For this purpose, from the multilevel image data input from the input unit (101), an image area information generating unit (1701) generates, for each pixel, image area information constituted by an image area component indicating whether the pixel exists in a character•line drawing area or halftone area and an image area component indicating whether the pixel is chromatic or achromatic. A lossless encoding unit (1705) encodes this information on a block basis, and stores the resultant information in a third memory (1709). An encoding control unit (1713) monitors an amount of code. Upon determining that the amount of code exceeds a target amount, the encoding control unit causes the lossless encoding unit (1705) to perform encoding upon changing image area components, of subsequently input image area components, which coincide with a condition.

Abstract: This invention is designed to effectively generate encoded data within a set size by inputting image data once. For this purpose, the image input through an input unit (101) is compressed by an encoding unit (102) and stored in first and second memories (104, 106). A first counter (107) counts the data in its code amount. When the amount of encoded data generated reaches a predetermined size, an encoding sequence control unit (108) sets quantization steps in the encoding unit (102) and an re-encoding unit (109) to increase compression ratios. In addition, the encoding sequence control unit (108) clears the first memory (104), causes the re-encoding unit (109) to re-encode the encoded data stored in the second memory, and stores the resultant data in the first memory (104). Since the encoding unit (102) continues encoding data with the set quantization step, the encoded data are stored in the first memory (104) from the start of the image.

Abstract: Analyzer 121 estimates time for rendering image data based on the number, the types etc. of rendering commands, stored in intermediate memory 113, and determines whether or not there is a possibility of overrun. If there is the possibility of overrun, image data of respective bands formed in band buffer 118 are sequentially compressed and stored into compressed image memory 115. When the image data for one page has been stored, the data in the compressed image memory 115 is sequentially expanded and supplied to printer engine 130. This avoids failure of image output due to overrun while reducing the capacity of the image memory.

Abstract: Coding efficiency is improved by adopting dynamic probability estimation, and the adaptation rate is adjusted by a minimum number of times by adding means for detecting a change in predicted state of encoding, thereby shortening encoding/decoding time.In an arithmetic encoding/decoding method for updating a cumulative probability when the generation frequency of a symbol to be encoded/decoded exceeds an allowable maximum value, an entropy associated with the generation state of the symbol to be encoded/decoded is calculated when the generation frequency has exceeded the allowable maximum value (S103), it is determined if the currently calculated entropy and previously calculated entropy have a significant difference (S104), and the cumulative probability is updated when it is determined that the two entropy values have the significant difference (S105).

Abstract: An image processing apparatus includes an input unit for inputting image data having undergone orthogonal transformation, a generation unit for generating interframe difference image data, of adjacent frames with respect to the image data input by the input unit, using orthogonal transform coefficients, and an encoding unit for encoding the image data output from the generation unit. An image processing apparatus includes an input unit for inputting encoded data obtained by performing block encoding of interframe difference data using orthogonal transformation, a decoding unit for decoding the encoded data input by the input unit into orthogonal transform coefficient difference data, and an addition unit for adding the orthogonal transform coefficient data of a block different from a processed block to the difference data decoded by the decoding unit.

Abstract: Disclosed are an image processing method and apparatus whereby the capability of coding/decoding processing accompanied by learning is improved, this also making it possible to achieve high-speed image formation processing without error. The apparatus includes a coder for generating coded data by arithmetically coding image data, a counter for counting the number of times learning is performed by the coder, and a comparator which, when a count recorded by the counter attains a value stored in a register, stops the learning operation executed by the coder.

Abstract: An image processing apparatus in which image data is input, a generator generates area information and a processor processes the image data in accordance with the area information. The generator includes a first generator for generating the area information by using area data for each pixel having a predetermined size stored in a memory, and a second generator for generating the area information by use of a central processing unit (CPU) without using the area data stored in memory. A selector selects one of the area information generated by the first and second generators so that the processor can process the image data in accordance with one of the area information generated by the first and second generators.