JPH05241537A - Image processor - Google Patents

Abstract

PURPOSE:To prepare an icon including the required information of an original image by resistering minimun resolution image data which is obtd. by compressing image data with a JBIG (Joint Bi-Level Image Group) compression system. CONSTITUTION:An image is read by a scanner 14, then the image is stored in a main memory 2. The image data is changed in low resolution by a compression and expansion circuit 8 with the JBIG system and stored in the buffer of the main memory 2. The image information is outputted on a system bus and stored in a VRAM 4. Next, cutting off of the image data is instructed by a key board 17, then the image data which is designated to be cut off is stored in the main memory 2. The image data is compressed by the compression and expasion circuit 8 to a low-resolution image and the image data is stored two different buffers of a hard disk 11 and the main memory 2. Next, the image data stored in each buffer are resisterd as the icon.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing apparatus.

[0002]

2. Description of the Related Art Conventionally, if an application does not create an icon for an image file, the operator will create the icon, but it is difficult to display all the necessary information in the icon. It is used to display the text of or to display a certain fixed icon in the system.

[0003]

However, there are cases where the number of icons for an image file increases, and as time passes, it becomes difficult to understand what the image represented by the icon looks like.

An object of the present invention is to solve the above problems and provide an image processing apparatus capable of creating an icon containing necessary information of an original image.

[0005]

In order to achieve such an object, the present invention provides a storage means for storing image data,
It is characterized by further comprising: a compression means for compressing the image data stored in the storage means by the JBIG compression method; and a registration means for registering the minimum resolution image data obtained by compression by the compression means as an icon. ..

[0006]

In the present invention, the image data stored in the storage means is compressed by the compression means by the JBIG compression method, and the minimum resolution image data obtained by compression by the compression means is registered by the registration means as an icon.

[0007]

Embodiments of the present invention will now be described in detail with reference to the drawings.

First Embodiment FIG. 1 shows a first embodiment of the present invention.

In FIG. 1, 17 is a keyboard, and 18 is a mouse as a pointing device. A key interface 16 is an interface for a keyboard 17 and a mouse 18.

13 is a printer, 14 is a reading resolution 40.
It is a 0 dpi scanner. A scanner / printer interface 12 includes a printer 13 and a scanner 14.
Interface. Reference numeral 10 is a floppy disk and 11 is a hard disk. A disk interface 9 is an interface for the floppy disk 10 and the hard disk 11.

Reference numeral 6 is a LAN, and 7 is a LAN interface.

Reference numeral 3 is an I / O such as a ROM, SRAM, and RS232C. Reference numeral 2 is a main memory, 4 is a VRAM, 5 is a CRT having a resolution of 100 dpi, and 1 is a CPU.

A DMAC 15 is a floppy disk 1.
0, the hard disk 11, the printer 13, the scanner 14 and the main memory 2 directly transfer data.

Reference numeral 8 denotes a compression / expansion circuit, which is a JBIG (join
The data is compressed and expanded by the t-bi-level image group method.

FIG. 2 shows an area of the main memory 2 shown in FIG.

In FIG. 2, IMEM is an image area in which image data from the scanner 14 is stored. PMEM is a program area in which execution programs are stored. WMEM is a work area in which work data is stored.

Next, a JBIG compression / expansion method performed by the compression / expansion circuit 8 shown in FIG. 1 will be described.

The details of this method are disclosed in pp. 41 to 49 of Vol. 20, No. 1 (1990) of the Institute of Image Electronics Engineers of Japan. The JBIG compression / expansion method will be briefly described.

When the pixel data of 4 × 4 pixels as shown in FIG. 3 is compressed, for example, the pixel data A1 to A16 of 4 × 4 pixels of 400 dpi is converted into the pixel data B of 200 dpi.
1 to B4, and the difference between the compressed pixel data B1 to B4 and the original pixel data A1 to A16 is encoded. The compressed pixel data is newly added to the pixel data A1 to A1 to be compressed.
The compression process and the encoding process are performed again as 6. In this way, the image data having the lowest resolution of about 12.5 dpi is compressed, and the image data having the lowest resolution is used together with the encoded data for communication and storage.

On the other hand, when decompressing the image data of the lowest resolution, the image data of the lowest resolution (12.5 dpi) and its encoded data are used to obtain a resolution one rank higher (25 dpi).
The image data of i) is created, and thereafter, the image data of higher resolution is sequentially created to expand the original image data of 400 dpi.

Further, in the JBIG method, when one compressed pixel data is created, in the example of FIG. 3, when compressed pixel data of the pixel position of B4 is created, A6 to A8 surrounded by thick lines in FIG. , A10-A12, A14-A16 pixel position high-resolution pixel data and the already compressed pixel data B1-B3 are substituted into the weighting formula,
The compressed pixel data at the pixel position of B4 is determined.

Note that the data used for encoding also uses the pixel data at the reference pixel position. However, the reference pixel position near the pixel position to be encoded is set to the reference pixel position and the number according to the content of the pixel data at that pixel position. It is variable.

FIG. 4 shows the program area PMEM shown in FIG.
5 is a flowchart showing an example of a control program stored in the.

At step S1, the ship image is 400 dp.
When read by the scanner 14 of i, the information of the read image of 400 dpi is stored in the image area IMEM of the main memory 2. And image area I
The image information stored in the MEM is reduced in resolution by the JBIG encoding method by the compression / expansion circuit 8 and obtained 10
The information of the image of 0 dpi is stored in the buffer memory of the image area IMEM.

Then, in step S2, the image information of 100 dpi stored in the buffer memory is output onto the system bus, and in step S3, it is stored in the VRAM 4. An image 22 of a 100 dpi ship is output to the window 20 of the screen 20 of the CRT 5, as shown in FIG.

Then, in step S3-1, the keyboard 17 is instructed to cut the image data. Here, it is assumed that the entire image of the loaded ship has been instructed to be cut. Then, in step S3-2, the image data (400 dpi) designated to be cut out is copied on the image area IMEM of the main memory 2. Then, step S4
Then, the compressed image data prepared in the buffer in the image memory IMEM is compressed by the compression / expansion circuit 8 to JBIG.
A low-resolution image of 12.5 dpi is obtained by compression by the compression method. Then, in step S5, 12.5d
Pi image data and encoded data on hard disk 1
1 and the image data of 12.5 dpi is stored in another buffer of the main memory 2.

Then, in step S6, the image data stored in the buffer is registered as an icon and is output to the system bus and stored in the VRAM 4.
Then, the 12.5 dpi ship image reduced to the size of (1/16) × (1/16) of the original image is output to the clipboard window.

Second Embodiment FIG. 7 is a flowchart showing a second embodiment of the present invention. This embodiment shows a process of displaying an image on the CRT 6 at a resolution of 100 dpi.

In FIG. 7, in step S101, the scanner 14 reads image data of 400 dpi. That is, the actual image data of 400 dpi is stored in the image storage area IMEM of the main memory 2 (see FIG. 11). Next, in order to perform the hierarchical encoding of the JBIG method, in step S102, the data of C + C1 + C2 is created by performing two-stage compression by the JBIG method.
C, C1 and C2 in step S102 are low resolution data C (100 dpi) and differential code data C1 and C2 obtained when the resolution is sequentially reduced from 400 dpi by the JBIG method as shown in FIG.
Indicates.

In the next step S103, the data C (100 dp) stored in the IMEM of the main memory is stored.
image data of i: see FIG. 11) is transferred to the VRAM 4,
Display on CRT.

Further, in step S104, it is determined whether or not the hierarchical coded data obtained by the JBIG method is registered as a file. As a result, if a positive determination is obtained, in step S105, the next Three
Compress in stages, C3 + C4 + C5 + F (see Figure 8)
To create.

Then, in step S106, C1 + C2
+ C3 + C4 + C5 + F is stored in the disk, and the window is displayed as the F icon in step S107 as in the above-described embodiment (specifically, this icon is pasted in the clipboard).

As described above, in this embodiment, the image of 100 dpi obtained in the process of hierarchical encoding is directly stored in the VRAM.
Can be transferred to and made visible.

FIG. 9 shows another modification of this embodiment. In FIG. 9, image data (that is, low-resolution data F of 12.5 dpi and respective code data C1 to C5: see FIG. 8) stored in the hard disk 11 or the floppy disk 10 is read onto the main memory 2. After that, the process of displaying on the CRT 5 is shown.

First, in step S110, the data to be displayed is selected. Specifically, one of the displayed icons is selected with the mouse. Next, step S
At 111, an image processing paper window is displayed on the CRT. In the next step S112, it is determined whether or not there is an undisplayed image. As a result, when it is determined that there is an undisplayed image, in step S113,
A display image buffer area is acquired in the image storage area IMEM of the main memory 2.

In the next step S114, the data read from the hard disk or floppy disk is converted into 100 dpi through the decompression circuit and written in the display image buffer. Then, the next step S115
At, the image data (100 dpi) is transferred from the display image buffer to the VRAM, and the image is displayed on the image processing paper window.

If it is determined in step S112 that there is no undisplayed image, step S11.
Control is transferred to 6, and other text data, vector data, etc. are displayed in the image processing paper window.

As described above, according to the present embodiment, once 400
The lowest resolution image data (12.5 dpi) without the conventional procedure of reading the image data of dpi into the main memory 2 and then converting it into data of 100 dpi.
From the JBIG system characteristic that the resolution is gradually improved from 100 dp to the display image buffer.
The data of i can be stored directly.

FIG. 10 shows the prior art corresponding to the embodiment shown in FIG. 9 for reference, and by comparing FIG. 10 and FIG. 9, the feature of the present embodiment can be more clearly understood. Become.

The contents of each step in FIG. 10 are as follows. First, in step S120, the data to be displayed is selected. In the next step S121, the image processing paper window is displayed on the CRT.

If it is determined in step S122 that there is an undisplayed image, in step S123 the real image buffer (that is,
It is determined whether or not the 400 dpi buffer area has been acquired. As a result, if the real image buffer area has already been acquired, the real image buffer is erased in step S124, and then step S124 is performed.
Move on to 125.

In step S125, a real image buffer and a display image buffer area are acquired in the image storage area IMEM of the main memory. Next, in step S126, the stored image data (400 dpi) is written from the hard disk or the floppy disk to the real image buffer. Step S1
At 27, a display image (100 dpi) is created in the display image buffer based on the image data (400 dpi) read in the real image buffer. Further, in the next step S128, the image data (100 dpi) is VRA from the display image buffer.
The image is transferred to M and displayed as an image in the image processing paper window.

On the other hand, if it is determined in step S122 that there is no undisplayed image, step S129.
In, other text data, vector data, etc. are displayed in the image processing paper window.

Unlike the prior art shown in FIG. 10, in this embodiment, 100 dp obtained in the extension process of the JBIG system
Since the image data of i is used as it is as the display data, even when performing scroll display, for example, as shown in FIG.
Follow the process as shown in 1 to convert 400 dpi data to 1
The process of converting to 00 dpi can be omitted.

In FIG. 12, first, in step S130, scrolling is instructed. In the next step S131, it is determined whether or not there is an image in the scroll area, and if it is determined that there is an image, the step S131 is performed.
At 132, the display image (100 dpi) expanded by the JBIG method is transferred to the VRAM. Further, in step S133, other text data, vector data, etc. are displayed in the scroll area.

Embodiment 3 The embodiment described in detail below shows a processing procedure for expanding and displaying an identification mark (that is, an icon pasted on the clipboard) displayed on a part of the CRT surface. ing.

FIG. 13 is a flow chart showing the processing procedure of the third embodiment. In addition, in FIGS. 14 to 16, an icon pasted on the clipboard (this icon is a reduced image of 12.5 dpi as described in the previous embodiment) is selected and the desired editing position is selected. The specific display example of the process of fitting is shown.

Next, the flow chart of FIG. 13 will be described with reference to FIGS.

First, in step S135, image data to be pasted is selected. For example, as shown in FIG. 14, a ship picture (12.5 dpi) is selected from a plurality of icons attached to the clipboard 141. Next, in step S136, the attachment destination is designated on the image processing paper window 140 (see FIG. 15).

Further, in step S137, a display pasting image buffer area is acquired in the image storage area IMEM of the main memory 2.

Next, in step S138, the compression / expansion circuit 8 performs 10 based on the data (minimum resolution data and differential code data) stored in the hard disk.
The resolution is improved to 0 dpi, and the image data of 100 dpi is written in the pasting image buffer for display. In the final step S139, the image data (100 dpi) is VR-processed from the display image buffer.
The image is transferred to the AM and the pasting image is displayed in the image processing paper window (see FIG. 16).

As described above, in the present embodiment, the data of 100 dpi obtained during the process of decompressing the icon (12.5 dpi) on the clipboard can be displayed as it is. The process of converting to can be omitted. This is more clearly understood by referring to the conventional process shown in FIG.

In the prior art shown in FIG. 17, first, in step S145, image data to be pasted is selected, in step S146 the pasting destination is designated on the image processing paper window, and in step S147, the image storage area of the main memory. Acquire the area of the actual pasted image buffer and the display pasted image buffer area on the IMEM.

Next, in step S148, the image data to be pasted is read from the hard disk into the actual pasting image buffer.

Further, in step S149, based on the image read in the actual pasting image buffer,
Create a display image in the display paste image buffer. In the final step S150, the image data is transferred from the display image buffer to the VRAM, and the pasted image is displayed on the image processing paper window.

Fourth Embodiment A fourth embodiment of the present invention intends to store more display images by effectively utilizing the image storage area IMEM in the main memory 2.

FIG. 18 shows the occupied state of a general image buffer in the main memory. In the image storage area IMEM in the figure, a display image for displaying two images A and B (neither shown) on the CRT is stored.

The process of forming this IMEM state is as follows. First, the first image A read by the scanner 14 is first used as an actual image of 400 dpi in IMEM.
Stored in the IRT, and then converted into a display image (100 dpi) for display on a CRT, and the converted data is used as an image A display image (100 dpi) in the IME.
Store in M. Next, the second image B is read by the scanner 14 and is overlaid on the area in which the actual image (400 dpi) of the image A is stored as the actual image data of 400 dpi. As a result, the real image (400 dpi) of the image B is stored in the IMEM. Therefore, the display image (100 dpi) of the image B is stored again after being converted into the resolution of 100 dpi.

However, if more display image data (100 dpi) is to be stored, the storage area may become insufficient.

Therefore, in the present embodiment, a lower resolution image (for example, 25 dpi) is stored as the display image without being limited to the resolution of 100 dpi as the display image. That is, in the present embodiment, attention is paid to the fact that a low-resolution image is formed by the hierarchical encoding performed by the JBIG method, and all necessary image data is stored in the IMEM.

FIG. 19 shows a state in which the display images (25 dpi) of the three images A, B and C are stored in the image storage area IMEM of the main memory 2. The display image data may have a resolution of 50 dpi. Further, it can be set to 12.5 dpi.

When displaying these images on the CRT, it is provided whether to perform the decompression process to obtain an image of 100 dpi or to display a plurality of images at the same time as the reduced image of 25 dpi. It can be arbitrarily selected according to the existing window system.

In the above description, it is premised that the actual image read by the scanner is stored as a display image. However, the 12.5 dpi low-resolution image and differential code data already stored in the disk are used. It is also possible to decompress it to 25 dpi and use the decompressed image as a display image.

The procedure for forming a 25 dpi display image and storing the data in the IMEM is as follows.
Since it is apparent from other embodiments, the processing flowchart is omitted here.

Fifth Embodiment Next, a fifth embodiment of the present invention will be described with reference to FIGS. The fifth embodiment is an example in which an image can be displayed easily even when high-speed page turning is used, instead of the image that was conventionally difficult to display when high-speed page turning. FIG. 20 is a circuit configuration of a main part for realizing the present embodiment, FIG. 21 is a display state at the time of high-speed page turning in the present embodiment, FIG. 22 is a display state of a decompressed image, and FIG. 23 is an operation of the present embodiment. Means, and FIGS. 24 and 25 show specific examples of the interpolation processing of this embodiment.

In FIG. 20, reference numeral 224 denotes an image interpolation circuit 224 for enlarging the size of the reduced image (low resolution image). For example, reduced image data of 25 dpi is interpolated as shown in FIG. 24 or FIG. It has the function of expanding to the size of the image and sending it to the CRT 5 via the VRAM 4. Now, the image data of a plurality of screens supplied from the scanner 14 or the like is converted into the reduced image data of 25 dpi and the encoded data by the image compression processing of the JBIG system shown in FIG.
Be stored in.

The operation of this embodiment will be described in more detail with reference to the flow chart of FIG. Keyboard 1 in Figure 1
When there is an instruction for high-speed image display (high-speed page turning) from 7 or the like (step S201), data to be displayed is selected (step S202), and an image processing paper window is displayed on the display screen 221 of the CRT 5 as shown in FIG. 220 is displayed (step S203). Next, main memory 2
A 25 dpi display image buffer area is acquired on the inside image memory IMEM (step S20).
5). The image data to be displayed is read from the hard disk 11 or the floppy disk 10 into the display image buffer (step S206). That is, 25d above
Only the reduced image data of pi is separated from the encoded data and stored in the display image buffer in the image memory IMEM.

Next, the image data (reduced image data) from the display image buffer is transferred to the VRAM 4 through the image interpolation circuit 224, and the image is displayed on the image processing paper window 220 of the CRT 5 (step S207). At this time, the image interpolation circuit 224 outputs the reduced image data as a zero value as shown in FIG. 24 or 25.
Alternatively, since the size of the original image is enlarged by performing relatively simple data interpolation such as interpolation of the same data, images as shown in FIG. 21 are sequentially displayed at high speed in the image processing paper window 220.

If all the image data in the display image buffer has been transferred to the VRAM 4, step S204
If the undisplayed image is on the hard disk 11 or the like, the above steps S205 to S207 are repeated, and if there is no undisplayed image, the step S2 is performed.
After the necessary post-processing of 08, it returns to the main program.

If there is no instruction for high-speed image display, 1
A normal display process of decompressing the reduced image data of 2.5 dpi and the encoded data into the original image by the compression / expansion circuit 8 and displaying the original image on the CRT 5 is performed (step S209). The image display in this case is a clear image display in a state almost the same as the original image, as shown in FIG.

In the present embodiment, since high-speed image display is not accompanied by image expansion processing, high-speed image display can be performed easily and quickly, and can be realized with a small image memory. However, as schematically shown in FIG.
Although the image quality is inferior to the normal display state through the decompression processing of FIG. 22, it is sufficient for the user to confirm what image is being displayed at the time of high-speed page turning, so that there is no practical problem. There is no. Although 25 dpi is exemplified as the reduced image data in the above description, it is 12.5 dpi.
But it's okay.

Embodiment 6 FIGS. 26 to 32 show Embodiment 6 of the present invention. Example 6
Is an example in which when the clip of the image data is clipped, the stepwise reduced image data is sequentially displayed and the display is erased at the end so that the user can be clearly informed of the progress of the clip clipping process. 26 shows an operation procedure of the present embodiment, FIGS. 27 to 31 show display examples of the progress process, and FIG. 32 shows an operation procedure of a modified example of the present embodiment.

The operation of this embodiment will be described in detail with reference to the flowchart of FIG. Now, in the image processing paper window 220 on the display screen 221 of the CRT 5, FIG.
It is assumed that the image as shown in is displayed. When there is an instruction to cut the image data from the keyboard 17 in this state, the clipboard window 225 is displayed on the display screen 221 (step S211), and the user then instructs the cutting range of the image data using a mouse or the like (not shown). Is performed as indicated by the pointer of arrow P in FIGS. 27 to 28. For example, when the designation of the cutting range is completed in the state of FIG. 28 (step S213), the CPU 1
Acquires a cut-out image data buffer area in the image memory IMEM of the image memory 2 (step S
214).

Next, the image data of 400 dpi in the cut range specified by the above is transferred from the real image buffer in the image memory IMEM to the cut image data buffer (step S215).

Subsequently, the data of the cut image data buffer is hierarchically compressed and encoded by the compression / expansion circuit 8 by the JBIG method of FIG. 8 described above, and is first encoded with the reduced image data (200 dpi) of the first stage. Data is obtained (step S216). This reduced image data is written to the cut image data buffer by overlay and VR
Send to AM4 and display on CRT5. That is, the image data having a resolution of 1/2 is displayed on the image processing paper window 220 (step S21).
7). Until all of the hierarchical image coding is done,
The processes of steps S216 and S217 described above are repeated. The image is 400 dp by such compression encoding processing.
i → 200 dpi → 100 dpi → 50 dpi → 25d
The resolution changes from pi to 12.5 dpi, and the resolution decreases by 1/2 and the size of the display image also decreases by 1/4. Therefore, the image (the ship figure in this example) to be clipped on the image processing paper window 220 is shown in FIG.
8 → FIG. 29 → FIG. 30, the images are sequentially reduced and displayed in a stepwise reduced image according to the processing stage of the compression encoding, and as a result, the progress process of the clip clipping process can be clearly understood by the user.

When the image coding is completed (step S
218). While storing the final reduced data in the clipboard, as shown in FIG. 31, the image data on the image processing paper window 220 is erased, and the clipped 12.5 dpi reduced image is used as an icon in the VRAM 4.
It is pasted on the clipboard window 225 via (step S219). Control then returns to main memory. As a result, the user can immediately know that the clip clipping process has been completed.

Conventionally, the image to be clipped is displayed for a few seconds to several tens of seconds in the display state of the same size until the clip clipping process is completed, and the image suddenly disappears when the clip process is completed. However, according to the present embodiment, since the reduced image data is displayed successively smaller, the progress of the process becomes clear,
Inconvenience is eliminated.

The flowchart of FIG. 32 shows the procedure of a modification of the sixth embodiment, but the difference from the flowchart of FIG. 26 is that step S2, which is the next stage of step S216.
In FIG. 20, image data having a resolution of 1/2 is displayed on the image processing paper window 220 through an image interpolation circuit 224 as shown in FIG. Therefore,
According to this example, instead of the image being gradually reduced as shown in FIGS. 29 and 30, the size of the image is unchanged and the image is gradually thinned as shown in FIG. The image disappears in accordance with (step S21
9). Obviously, in the case of this example, the same effect as in the above case can be obtained.

Embodiment 7 FIGS. 33 to 37 show Embodiment 7 of the present invention. Example 7
When the capacity a of the remaining area RM of the display image buffer area secured in the image memory IMEM on the main memory 2 becomes less than one screen T as shown in FIG. This is also an example in which at least one more screen can be displayed to effectively use the memory and improve workability.

First, an example of the operation of this embodiment will be described with reference to the flowchart of FIG. When there is an instruction to display image data from the keyboard 17 (step S22
1) It is determined whether the display image buffer for one screen can be acquired in the display image buffer area of the image memory IMEM (step S222). This can be judged by comparing the capacity a of the remaining area RM with the necessary capacity T for one screen. When it is determined that the display image buffer can be acquired when a ≧ T (step S2)
23) The normal image display process of storing one screen of the new 100 dpi display image data in the display image buffer and displaying it on the CRT 5 via the VRAM 4 is performed (step S229), and the process returns to the main routine. To do.

When the display image buffer for one screen cannot be acquired, that is, when a <T, step S2
Proceeding to step 24, an image having a resolution of 1/2 that of the previous time is obtained. That is, the first time, the reduced image data of 12.5 dpi and the encoded data by the JBIG system stored in the hard disk 11 or the floppy disk 10 are sent to the compression / expansion circuit 8 and the expansion process by the above-mentioned JBIG system is performed to obtain the 50 dpi The reduced image data is obtained (step S224). Subsequently, it is determined whether or not one screen of display image buffer having a resolution of ½ of the last time can be acquired. That is, as shown in FIG.
The required capacity b of the reduced image data of pi and the capacity a of the remaining area RM are compared, and if b ≦ a, it is determined that it can be acquired, and if b> a, it is determined that it cannot be acquired.

When it is determined that the acquisition is not possible (step S226), the above step S224 is performed until the acquisition is possible.
And the processing of S225 are repeated. That is, in the case of the second time, 25 dpi of reduced image data is created by the compression / expansion circuit 8, the required capacity c of this reduced image data (see FIG. 35) is compared with the capacity a of the remaining area RM, and if c ≦ a, it is acquired. You can
If c> a, it is determined that it cannot be acquired.

At this time, for example, c ≦ a and 25 dp
If the display image buffer for one screen of i can be acquired in the image memory IMEM, the process proceeds from step S226 to step S227. In step S227, image data with a resolution of 1 / n (for example, reduced image data of 25 dpi) decoded up to the resolution of the buffer is read into the display image buffer (step S227). Then, the image data of the resolution 1 / n is read out from the display image buffer and the image interpolation circuit 2 of FIG.
VRAM after expanding to the size of the original image through 24
Image processing paper window 2 on the CRT 5
The image with the resolution 1 / n is displayed on 20 (see FIG. 22) (step S228). The interpolation processing at this time is performed as shown in FIG. 25 or FIG. 24, for example, and the display state is slightly deteriorated as shown in FIG. After that, it returns to the main program. It should be noted that, in the case of knowing what the image content is, some deterioration of the image does not pose a problem, and thus it is generally considered to be sufficiently practical. Particularly in this example, there is an advantage that the entire image is always visible.

36 and 37 show a modification of the seventh embodiment. In order to facilitate sequence processing in accordance with the scanner 14 or the like, normally, as shown in FIG. 36, d × m ≦
The image data for one screen is divided into a maximum of m stripes such that the number is T, and compression processing by the JBIG method is performed in stripe units, and the hard disk 11 or the floppy disk 10 has reduced image data of 12.5 dpi and encoded data. It is stored in the form of. In this example, the stripe data is used to display the image data of one screen by combining up to m stripes according to the size a of the remaining area RM without lowering the resolution from 100 dpi of the CRT5. Is.

Next, this will be described with reference to the flowchart in FIG. 34. Steps S231 to S233 and S239 are steps S221 to S221 in FIG.
223 and step S229, the description thereof will be omitted. First, when it is determined in step S233 that the image buffer for display of one screen cannot be acquired, the process proceeds to step S234, and one stripe less than the previous time from the hard disk 11 or the like via the compression / decompression circuit 8 is used.
Obtain 0 dpi image data. Then, step S
At 234, it is determined whether or not the display image buffer having one stripe less than the previous time can be acquired in the image memory IMEM. For example, if it is the i-th time (m-i)
Xd and the above-mentioned capacity a of the remaining region RM are compared, and (m−
If i) × d ≦ a, it can be acquired. If (m−i) × d> a, it is determined that it cannot be acquired. Note that i = 1, 2, ..., M-1.

When it is determined that the acquisition is not possible (step S236), the above step S234 is performed until the acquisition is possible.
And the processing of S235 are repeated.

After that, when it is determined in step S236 that the acquired image data can be acquired, the image data composited by the acquired stripes is read (step S237), and then the image processing paper window 220 ( 22), the corresponding image data in the display image buffer is displayed at the original stripe position (step S238). Then, the process returns to the main routine.

Here, the selection order of stripes in step S234 can be variously considered according to the type of image. For example, if important image information is concentrated in the upper part of the screen (for example, in the management table), you can discard the stripes from the lower part of the screen, and important image information is concentrated in the center of the screen. In such a case (for example, a design drawing), the stripes may be alternately discarded from above and below the screen so that the stripe at the center of the screen remains to the end. Therefore, in the image displayed on the CRT 5 in step S238, a relatively important image portion is displayed in a combination of stripes. In the case of this example, there is an advantage that the image is displayed at 100 dpi, which is the same as the resolution of the CRT 5, and the image interpolation circuit 224 is not necessary.

It should be noted that in the above embodiment, step S2 is performed.
24, S225 (or steps S234, S235)
The above process was repeated until the display image buffer was acquired. However, by comparing the capacity a of the remaining area RM with the capacity value e _i set in advance for each resolution (or the capacity a and n × i). The resolution 1 / n (or the number i of stripes) that can be acquired by the display image buffer may be determined at once.

Further, in the process of step S228 of FIG. 34, the image is displayed through the image interpolation circuit 224, but the image is automatically expanded according to the resolution, for example, in the compression / expansion circuit 8 when the resolution is very low. Done 100
The image data of dpi may be displayed, or when the resolution is relatively high, it may be displayed as it is without image interpolation.

As described above, according to the present embodiment, an image can be displayed even when the display image buffer area becomes insufficient in capacity, and workability can be improved.

Embodiment 8 In the hierarchical encoding of image data by the JBIG encoding method, the following processing can be used to further efficiently use the memory and further improve the processing efficiency.

That is, as shown in FIG. 38, for example, original image data (resolution 40
0 dpi) is divided into a plurality of stripes (areas) arranged in the vertical direction (long in the horizontal direction), and the original image data is hierarchically encoded by the compression / expansion circuit 8 for each stripe in the main memory 2. At this time, based on the data from the stage of the hierarchical encoding process from the compression / expansion circuit 8, the comparison circuit 301 causes the data size of the original image / n ≧ the compressed data size (the data size of the reduced image of the stage + the stage Encoded data up to) (compressed data size / previous stage compressed data size) ≤
X (for example, n is 2 to 1000 and X is 0.5 to 0.99) is compared, and when the condition is satisfied, the hierarchical encoding process for the stripe is terminated at this stage. .. The reason for doing this is as follows.
That is, the compressed data cannot be significantly (effectively) reduced even if the hierarchical encoding process is further performed, and the memory capacity consumed by performing the further hierarchical encoding process is reduced. This is because you can save money. Figure 3
9 is the flow chart of the processing in the compression / expansion circuit 8 corresponding to the above, and FIG. 40 is the CPU in S301.
In response to an instruction to start encoding the original image data (image data) of 400 dpi in the main memory 2 from 1, the image data of the first stripe in the main memory 2 is read in S302 and the read in S303. The image data is subjected to the first-stage hierarchical encoding processing, and S3
04A (FIG. 39) or S304B (FIG. 40), and the signal indicating the result of the processing of or by the comparison circuit 301 is judged there. If NO (that is, the condition of or is not satisfied), the process returns to S303. Then, the process of the next stage of the hierarchical coding process of the stripe is performed, and if YES (that is, the condition of or is satisfied), the hierarchical coding process of the stripe is finished, and the process proceeds to S305 and the main memory It is determined whether or not the hierarchical encoding processing of all the stripes of the target original image data in 2 has been completed, and until completion, S302 to S304A.
Alternatively, the process of B is repeated.

FIG. 41 shows a state in which processing steps are different for each stripe by such processing. That is, the processing is completed up to 4 steps for stripe 1, 2 steps for stripe 2, and 3 steps for stripe 3.

Embodiment 9 When clipping a clip of an image displayed on the CRT 5 and pasting the clipped image to, for example, other appropriate document data, the following processing is performed under the control of the CPU 1 to save the memory. It can be used more efficiently.

That is, the image data (100 dpi) on the image memory IMEM in the main memory 2 displayed on the CRT 5 is divided into a plurality of stripes as in the eighth embodiment. Then, as shown in FIG. 42, when the cutting process to the clipboard is started, CR is executed in S311
Specify the cropping range using the image on T5, and press S
In 312, for example, as shown in FIG. 43, the stripe on which the image A in the specified cutoff range is (belongs) is determined (stripe 2 in FIG. 43), and in S313, based on this determination result, Whether the image data (100 dpi) of the corresponding stripe in the image memory IMEM is hierarchically encoded up to, for example, a resolution of 12.5 dpi, and the encoding of all stripes to which the image A is applied (belongs to) in S314 is completed. 43 (only the stripe 2 in FIG. 43, but the image A may span a plurality of stripes), S313 is repeated until the end, and the process proceeds to S315 by the end and With respect to all the stripe data to which it belongs, a header portion (code in image data on the image memory IMEM) as shown in FIG. The position of the processed stripe, the position (position X, Y) in the stripe of the image A, the image (image) data size (consisting of the width (W) and the height (H)), and the encoded data (of the corresponding stripe). (Including image data of 12.5 dpi) is written in a predetermined area of the clipboard of the image memory IMEM of the main memory 2. This makes it possible to reduce the write capacity to the clipboard and to use the memory efficiently.

Next, the pasting of the image data A cut out in this way into the screen currently displayed on the CRT 5 will be described. First, copy the clipboard to CRT5
When it is displayed above, the image A that was cut out earlier is displayed as an icon, and this is designated as the pasting image, and then the image data for which this pasting image A is to be pasted is displayed on the CRT.
5 is displayed, and as shown in FIG. 45, the CRT is performed in S316.
5. The paste position (position) is specified using the image on FIG. 5, the paste data buffer is acquired in the image memory IMEM in the main memory 2 in S317, and S31
In FIG. 8, the data (FIG. 44) of all stripes to which the image A belongs written in the predetermined area of the clipboard of the image memory IMEM in the main memory 2 is decoded (100 dpi) to obtain the image memory IMEM. In step S319, the actual pasted image A is extracted from the image data of 100 dpi of the decoded stripe of the image memory IMEM based on the information in the header part of the predetermined area of the clipboard, and S
It is stored in the buffer acquired in 317, and the image A extracted from the buffer in S320 is displayed in the specified sticking position on the CRT 5 based on the information specified in S316. By doing so, it is possible to process only the data of the necessary part (stripe) and to use the memory efficiently.

Embodiment 10 In an image processing system in which an apparatus having a configuration as shown in FIG. 1 is used as a workstation as a server and a plurality of workstations as clients are connected via a network, the following is done. By
Efficient operation can be performed.

That is, in FIG. 46, WS4 is shown in FIG.
WS1 and WS3 are workstations having a configuration as shown in FIG. 1, WS1 and WS3 are workstations having no printer and a hard disk, and WS2 is a workstation having a hard disk 11A. WS1
In WS3, in addition to CRT5 and VRAM4, FIG.
The CPU 1, the main memory 2, the I / O 3, the LAN interface 7, the compression / expansion circuit 8, the key interface 16, the keyboard 17 and the mouse 19 shown in FIG. 6 is a LAN.

In such a configuration, it is assumed that the disk 11 of WS4 has image data of C + C1 + C2 (FIG. 8). Now, when an image corresponding to A (FIG. 8) is displayed on the CRT in WS1 and an editing operation is to be performed, WS4
From C to V of WS1 via LAN6
It just needs to be transferred to RAM (or main memory).
By doing this, in WS1, CR
The image of C can be displayed on T, and the displayed image can be edited using a mouse, a keyboard, or the like. The edited contents (denoted as H) are stored in the main memory of WS1 and, for example, the edited image C '
In order to print out an image based on, the edit content H alone is sent from the main memory of WS1 to the main memory of WS4 via LAN6, and in WS4, first,
The image data of A is decoded from the data of C + C1 + C2 in the disk 11, the edit corresponding to H is added, and the edited image data A ′ is output from the printer 13. When the image data A'is stored in the disk 11, A'is hierarchically coded and C '+ C1' (C1
(Corresponding to C2) + C2 '(corresponding to C2), and store this in the disk 11.

As described above, at the time of image processing in each WS, the total amount of processing data of the entire system can be minimized, and each WS only requires the minimum memory capacity and the processing is efficient. In addition, LAN traffic can be reduced.

[0102]

As described above, according to the present invention,
Since it is configured as described above, there is an effect that it is possible to create an icon including necessary information of the original image.

[Brief description of drawings]

FIG. 1 is a block diagram showing a first embodiment of the present invention.

FIG. 2 is a diagram showing an area of a main memory 2 shown in FIG.

FIG. 3 is an explanatory diagram illustrating a JBIG compression / expansion method.

FIG. 4 is a flowchart showing an example of a control program stored in a program area PMEM shown in FIG.

FIG. 5 is a diagram showing an example of an original image.

FIG. 6 is a diagram showing an example of a created icon.

FIG. 7 is a flowchart showing a procedure for displaying image data generated in a JBIG system processing process.

FIG. 8 is a diagram showing low-resolution data and differential code data generated by JBIG-based hierarchical coding.

FIG. 9 is a flowchart showing a procedure for displaying image data generated in the JBIG system processing process.

10 is a flowchart illustrating a conventional example corresponding to FIG.

FIG. 11 is a diagram showing a configuration of a main memory.

FIG. 12 is a flowchart showing a processing procedure for scroll display.

FIG. 13 is a flowchart showing a procedure for expanding an icon on the clipboard and pasting it on another display area.

FIG. 14 is an explanatory diagram specifically exemplifying the procedure shown in FIG.

FIG. 15 is an explanatory diagram specifically exemplifying the procedure shown in FIG.

16 is an explanatory diagram specifically illustrating the procedure shown in FIG.

FIG. 17 is a flowchart showing a conventional example corresponding to FIG.

FIG. 18 is an explanatory diagram showing a state in which a 100 dpi display image is stored in the main memory.

FIG. 19 is an explanatory diagram showing a state in which a 25-dpi display image is stored in the main memory.

FIG. 20 is a block diagram showing a circuit configuration of essential parts of a fifth embodiment of the present invention.

FIG. 21 is a plan view schematically showing an image display state during high-speed page turning in the fifth embodiment of the present invention.

FIG. 22 is a plan view showing an image display state at the time of normal display in which an image after decompression processing is displayed.

FIG. 23 is a flowchart showing an operation procedure according to the fifth embodiment of the present invention.

FIG. 24 is a conceptual diagram showing an example of interpolation processing according to the fifth embodiment of the present invention.

FIG. 25 is a conceptual diagram showing another example of interpolation processing according to the fifth embodiment of the present invention.

FIG. 26 is a flowchart showing an operation procedure according to the sixth embodiment of the present invention.

FIG. 27 is a plan view showing an example of a display screen at an initial point of instructing a clip clipping range of image data according to the sixth embodiment of the present invention.

FIG. 28 is a plan view showing an example of a display screen at the final time point of instructing a clip clipping range of image data in Example 6 of the present invention.

FIG. 29 is a plan view showing an example of a display screen during the clip cutting process of image data in the sixth embodiment of the present invention.

FIG. 30 is a plan view showing an example of a display screen at the final stage of the clip cutting processing of image data according to the sixth embodiment of the present invention.

FIG. 31 is a plan view showing an example of a display screen after the clip cutting processing of image data in the sixth embodiment of the present invention is completed.

FIG. 32 is a flowchart showing an operation procedure of a modified example of the sixth embodiment of the present invention.

FIG. 33 is a memory map diagram showing an example of a display image buffer used in Embodiment 7 of the present invention.

FIG. 34 is a flowchart showing an operation procedure of the seventh embodiment of the present invention.

FIG. 35 is a diagram schematically showing an example of the size of reduced image data handled in the processing of the seventh embodiment of the present invention.

FIG. 36 is a diagram schematically showing a stripe structure of an image handled in a modified example of the seventh embodiment of the present invention.

FIG. 37 is a flowchart showing an operation procedure of a modified example of the seventh embodiment of the present invention.

FIG. 38 is a block diagram showing another example of the compression / expansion circuit.

FIG. 39 is a flowchart of a compression number adjustment operation.

FIG. 40 is another flowchart of the compression number adjustment operation.

FIG. 41 is a diagram showing an individual compression mode for each stripe.

FIG. 42 is an operation flowchart when clipping a clip.

[Fig. 43] Fig. 43 is a diagram illustrating an encoding mode of only necessary stripes at the time of clip clipping.

FIG. 44 is a diagram showing stored data relating to clipped image data in the clipboard.

FIG. 45 is an operation flowchart when pasting clipped image data.

FIG. 46 is a block diagram of an image processing system.

[Explanation of symbols]

 1 CPU 2 Main Memory 3 I / O 4 VRAM 5 CRT 7 LAN Interface 8 Compression / Expansion Circuit 9 Disk Interface 10 Floppy Disk 11 Hard Disk 12 Scanner / Printer Interface 13 Printer 14 Scanner 15 DMAC 16 Key Interface 17 Keyboard 18 Mouse 220 Image Processing Paper window 221 Display display screen 222,223 Display image (normal time) 222A, 223A Display image (high speed display) 224 Image interpolation circuit 225 Clipboard window 301 Comparison circuit

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁵ Identification code Internal reference number FI Technical display location G09G 5/36 9177-5G H04N 1/21 8839-5C // H04N 1/41 B 8839-5C

Claims (1)

[Claims] 1. A storage unit for storing image data, a compression unit for compressing the image data stored in the storage unit by a JBIG compression method, and a minimum resolution image data obtained by compression by the compression unit. An image processing apparatus, comprising: a registration unit that registers the icon as an icon.