| 摘要 |
PROBLEM TO BE SOLVED: To realize increase of the speed of the data extending processing of a binary data compressed, e.g. by MMR method, by making detectable efficiently a changing pixel existent on a reference line. SOLUTION: There is prepared previously a table wherein, with respect to all the bit-patterns each of which is represented by a bit-data having a predetermined bit- number, there are described the bit-numbers each of which represents the bit-number whereby the bits having an identical color with a certain bit included in each bit- pattern exist continuously from the certain bit in the direction of its right side. The two such tables corresponding to the two values of the certain bit, etc., are also prepared. Then, from the bit-string constituting a reference line, reference bit-data having the predetermined bit-number are derived in succession, and the reference bit-data and a noted bit included in the reference bit-data are so used as to search the foregoing tables. Consequently, the bit-number whereby the bits having the identical color with the noted bit exist continuously from the noted bit in the direction of its right side is detected. Further, the pixel whose position is separated by the bit-number equal to the detected bit-number plus one from the noted bit in the direction of its right side is found as a changing pixel. Then, a compressed data is decoded based on the position of the found changing-pixel.
|
