JPH05110832A - Restoration display system for picture - Google Patents

Abstract

PURPOSE:To avoid a sense of dissatisfaction of the user by displaying picture with interleaving and restoring for each integral number of lines to display the compressed and stored picture in a simulating way at high speed. CONSTITUTION:At first coordinates X, Y and a parameter (i) representing interleave stage are initialized by an initializing function 1. When decoding of one line is finished, a succeeding processing line is skipped by an integral number K at an interleave line setting function 10 and the decoding of a picture of one line is repeated. The decoding of the picture for each line reaches the end of a page, one rough picture interleaved for each of K lines is decoded on a display screen. Then an initializing data revision function 11 initializes the data of the picture to be decoded next as i=i+1, X=0, Y=Y+1 to decode a new interleaved picture. When the decoding of the K-th interleaved picture is finished, the picture is completely decoded. Thus, a sense of displeasure of the user is avoided.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image restoration display system for high-speed pseudo-restoration display of images compressed and stored in image processing used in general industrial fields.

[0002]

2. Description of the Related Art Recently, a filing system for images or documents using a computer has been put into practical use and is becoming widespread. In order to store image information such as an image or a document, a hardware means such as a disk device for storing a very large amount of data is required. Therefore, a method of compressing and storing the data is currently used. When the stored data is taken out as an image, the image is restored in reverse to the compression and the information is utilized.

FIG. 3 shows an algorithm for decompressing a compressed binary image by an MH (Modified Huffman) system or an MR (Modified READ) system, which is standardized as an international standard G3, for example. In the case of images such as characters and line drawings, white or black pixels are often consecutively arranged within one scanning line. In MH coding, when a change from white to black or black to white occurs,
Encode a continuous length of black and white (run length). At this time, since the distribution of white runs is usually biased in the longer direction than that of black runs, the code for black run and the code for white run are prepared separately. In the MH encoding, the run length r1 is represented by r1 = (64 · m) + t, where 64 · m is a makeup code and t is a terminating code.

As shown in FIG. 4, the decompression process, contrary to the compression process, changes the encoded run length to white or black 1.
Dot / pixel, and finally a two-dimensional image of X _Z × Y _Z. 5 illustrates a conventional compressed image restoration display system. In FIG. 5, 1 is a data initialization function, 2 is a compressed data reading function, 3 is a black pixel code restoration function, and 4 is white. A pixel code restoration function, 5 is a line end determination function, 6 is a function of copying a restored image to a display screen, 7 is a page end determination function of a drawing or the like, and 8 is a restoration line increment function.

Next, the operation will be described. Many encoding methods have been proposed so far, but here,
Since the encoding method departs from the essence, for convenience of explanation, MH
The encoding method will be used. In the MH coding, when a change from white to black or from black to white occurs, a continuous length (run length) of white and black is coded. At that time, since the distribution of white runs is generally biased in the longer direction than that of black runs, the code w for black runs and the code w for white runs are prepared separately.

In the image restoration process, the coded run length is used for an image of black 1 dot / pixel (logical value “1” × bl, then white 1 dot / pixel (logical value “0”) × wl 1 horizontal line. Each time X _Z pixels are restored up to the vertical Y _Z line which is the end of the page, that is, in the flow chart shown in Fig. 5, first, the coordinate value of the restored image P (X, Y) is set by the data initialization function 1. Initialization (X = 0, Y = 0) is performed. Based on an image restoration command (not shown), the compressed data of the image is stored in a computer such as a disk device of a workstation by a compressed data reading function 2. Read into main memory.

Since the compressed image is coded alternately in black and white, the restored coordinates are determined by the code restoration function 3 for black pixels and the code restoration function 4 for white pixels until the determination function 5 determines the end of the line. Write black: 1, white: 0 information to
This is repeated for each black and white run length. When the end of the line comes, the restored image is copied to the display screen by the function 6 every time one line ends. When the line comes to the end, the restore run increment function 8
The image restoration for each image line is repeated as described above until the restoration line is incremented and the restoration of one sheet such as a drawing is completed by the end determination function 7. End judgment function 7
When the end of the page is determined by, the image is completely restored and displayed.

[0008]

However, in the above-mentioned conventional method, when the image compression / decompression function is configured by software, for example, by a workstation, it is used particularly for decompressing and displaying one page of the drawing. It took some time for the person to feel dissatisfied. The restoration display time that does not leave the user feeling unsatisfied is generally said to be about 0.5 to 1 second until one image appears on the screen, which is 1/2 to several minutes of the conventional time. The fast restoration display of 1 is required. Therefore, conventionally, when performing high-speed image restoration of a compressed image, a dedicated restoration device (dedicated hardware) attached to a computer such as a workstation has been required.

The present invention has been made in order to solve the above problems, and therefore, it is possible to display a compressed and saved image in a pseudo high-speed decompression display and to eliminate the user's dissatisfaction. The purpose is to provide a restoration display method.

[0010]

In order to prevent the user from feeling dissatisfied when restoring one image (one page), the image restoration display method according to the present invention is initially set for every integer line. A pseudo display is performed by thinning out restoration, and this is performed an integral number of times to finally complete the complete restoration.

[0011]

In the image restoration display method according to the present invention, since the thinned restoration display is performed for each K line, the time required to restore one image (one page) in a pseudo manner is 1 / K in the initial stage. Therefore, the discomfort of the user can be eliminated. However, K is an integer.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT An embodiment of the present invention will be described below with reference to FIG. In FIG. 1, the same parts as those in FIG. 5 are designated by the same reference numerals, 9 is a complete restoration determination function, 10 is a thinning restoration line setting function, and 11 is an initialization data changing function. In this embodiment, In the initial stage, a pseudo display is performed by thinning out every integer line, and by performing this an integer number of times, the complete restoration is finally completed.

Next, a specific operation will be described. In FIG. 1, the description of the one-line restoration operation part indicated by the same reference numerals as those in FIG. 5 is omitted. In addition to the X and Y parameters, the data initializing function initializes a parameter i (i = 0) indicating the stage of the thinning-out restoration process.

When the image restoration of one line is completed by the above-mentioned conventional method, the next restoration processing line is set by skipping K lines by the thinning line setting function 10 and set to 1.
Repeat the restoration of the line image. When the restoration of the image for each line reaches the end of the page, one coarse image (one page) thinned for each K line is restored on the display screen, which attracts the user's attention.

Then, the X of the image to be restored next,
A parameter i representing the Y coordinate and the stage of the thinning-out restoration process is initialized as follows, and a new thinned-out screen is restored. i = i + 1 X = 0 Y = i Each time the restoration of the thinned image is completed once, screen information is added one after another, and when the restoration of the Kth thinned image is finished, the screen is completely imaged. Will be restored and displayed.

FIG. 2 illustrates the restoration of an image when K = 2. At the first time, the image of the solid line indicated by i = 1 is restored. At this time, in the conventional method,
Only about half of one screen has been restored. According to the present embodiment, the image restored for the first time has a rough image quality, but the image quality is sufficient for humans to see, and the user can see the entire screen, so dissatisfaction is eliminated. The second time, as shown by i = 2,
The dashed line is restored and complete image restoration is complete.

[0017]

As described above, according to the present invention, first, one image is thinned out every integer K lines to be restored and displayed, and then the remaining image information is sequentially added and corrected K times. As a result, the initial pseudo restoration display can be speeded up by 1 / K as compared with the conventional one, the user's discomfort can be eliminated, and finally, an image restored with the same accuracy as the conventional one can be obtained. It is effective.

[Brief description of drawings]

FIG. 1 is a flowchart showing an image restoration display method according to an embodiment of the present invention.

FIG. 2 is an explanatory diagram illustrating image restoration display according to the present invention.

FIG. 3 is an explanatory diagram illustrating a conventional decompression display of a compressed image.

FIG. 4 is an explanatory diagram illustrating a method of restoring a compressed image.

FIG. 5 is a flowchart showing a conventional compressed image decompression display method.

[Explanation of symbols]

 1 Data initialization function 2 Compressed data reading function 3 Black pixel code decompression function 4 White pixel code decompression function 5 Line end discrimination function 6 Copying decompressed image to display screen 7 Determining page end Function 8 Line increment function 9 Complete restoration judgment function 10 Thinning restoration line setting function 11 Initialization data change function

─────────────────────────────────────────────────── ───

[Procedure amendment]

[Submission date] August 19, 1992

[Procedure Amendment 1]

[Document name to be amended] Statement

[Name of item to be corrected] 0003

[Correction method] Change

[Correction content]

FIG . 5 shows an algorithm for decompressing a compressed binary image by an MH (Modified Huffman) system or an MR (Modified READ) system standardized as an international standard G3, for example. In the case of images such as characters and line drawings, white or black pixels are often consecutively arranged within one scanning line. In MH coding, when a change from white to black or black to white occurs,
Encode a continuous length of black and white (run length). At this time, since the distribution of white runs is usually biased in the longer direction than that of black runs, the code for black run and the code for white run are prepared separately. In the MH encoding, the run length r1 is represented by r1 = (64 · m) + t, where 64 · m is a makeup code and t is a terminating code.

[Procedure Amendment 2]

[Document name to be amended] Statement

[Correction target item name] 0005

[Correction method] Change

[Correction content]

Next, the operation will be described. Many encoding methods have been proposed so far, but here,
Since the encoding method departs from the essence, for convenience of explanation, MH
The encoding method will be used. In the MH coding, when a change from white to black or from black to white occurs, a continuous length (run length) of white and black is coded. At that time, usually, since the distribution of the white run compared to black run biased towards the long direction, sign of a code white run for black runs is prepared separately.

[Procedure 3]

[Document name to be amended] Statement

[Correction target item name] 0007

[Correction method] Change

[Correction content]

Since the compressed image is coded alternately in black and white, the restored coordinates are determined by the code restoration function 3 for black pixels and the code restoration function 4 for white pixels until the determination function 5 determines the end of the line. Write black: 1, white: 0 information to
This is repeated for each black and white run length. When the end of the line comes, the restored image is copied to the display screen by the function 6 every time one line ends. When the line ends, the restoration line increment function 8
The image restoration for each image line is repeated as described above until the restoration line is incremented and the restoration of one sheet such as a drawing is completed by the end determination function 7. End judgment function 7
When the end of the page is determined by, the image is completely restored and displayed.

[Procedure amendment 4]

[Document name to be amended] Statement

[Correction target item name] 0011

[Correction method] Change

[Correction content]

[0011]

Restoring the display method of the image in the DETAILED DESCRIPTION OF THE INVENTION The present invention, in order to have so as to decimation restores displayed every K lines initially artificially one (1 page) time 1 / K required to restore the images of Therefore, the discomfort of the user can be eliminated. However, K is an integer.

[Procedure Amendment 5]

[Document name to be amended] Statement

[Correction target item name] 0016

[Correction method] Change

[Correction content]

FIG. 2 illustrates the restoration of an image when K = 2. At the first time, the image of the solid line indicated by i = 1 is restored. At this time, in the conventional method ,
As shown in FIG. 3, only about half of one screen has been restored. According to the present embodiment, the image restored for the first time has a rough image quality, but the image quality is sufficient for humans to see, and the user can see the entire screen, so dissatisfaction is eliminated. The second time is i
= 2, the dashed line is restored and complete image restoration is complete.

Claims (1)

[Claims] 1. A decimation line setting function for performing a pseudo display while decimation and restoration for every integer line in an image restoration display system for decompressing and displaying image information of a two-dimensional array compressed and saved by encoding, and the decimation and restoration. An image restoration display method with a full restoration judgment function that finally performs a full restoration display after adding and correcting the pseudo display by an integer number of times.