JPH03211682A - Compressed picture data reproducing method - Google Patents

Abstract

PURPOSE:To reproduce and display a large capacity picture within practical time even by using a small-size computer by reproducing the summarized picture and the local partial picture of the large capacity picture directly from com pressed picture data. CONSTITUTION:A personal medical picture work station 108 consists of the small-size computer 109, a picture display device 110, and an optical disk drive device 111. Then, only the summarized picture and the partial picture including an observed object for specifying the position of the observed object are reproduced directly from the compressed data of the large capacity picture of an optical disk cartridge 107 written by a medical picture filing device. Thus, processing time and working memory capacity required for reproducing the compressed picture data of the large capacity picture are reduced, and the large capacity picture can be reproduced and displayed within the practical time even by the personal medical picture work station using the small-size computer slow in its processing speed and small in its memory capacity.

Description

[Detailed Description of the Invention] [Industrial Field of Application] The present invention is applicable to, for example, digitized XfI! Regarding the compressed image data reproducing method used in a device that reproduces and displays compressed image data obtained by compressing large-capacity medical image data such as film images and OR images as required for diagnosis, the processing speed is particularly slow and the memory capacity is limited. The present invention relates to a method for reproducing compressed image data suitable for small devices.

[Conventional technology]

In recent years, digitized X-ray film images, OR images, and CT
A medical image filing device that records the digital medical image data of both images on an optical disk or magnetic disk, which allows a doctor to search for the latest and past images of a patient and compare and interpret them on an image display device. is being commercialized.

The medical image filing device (100 in FIG. 6 is one example) is connected to a CT device (101) and an X-ray film reader (102) for image input, and is connected to an image display device (103), (104). ), an optical disk drive device (105) for image storage, an operation console (106), etc.

3.5 inch for optical disk cartridge (1o7),
There are 5 inches, 12 inches, 14 inches, etc., and the capacity is 3
．． loOMB for 5 inch, 6000MB for 14 inch
Some products have been commercialized.

Even with such a large capacity optical disc, Digimol X! When recording large-capacity images such as film images or CR images, the amount of data is several MB per image, and irreversible data compression is essential. However, ordinary computers cannot perform irreversible compression of large-capacity images of around 4 million pixels.
When trying to perform playback processing, as described in the proceedings of the 32nd National Conference of the Information Processing Society of Japan (first half of 1986), page 1351, even with non-equal length block encoding, which has a relatively short processing time, the processing time is limited. It takes about 25 minutes to compress and 5 minutes to play. Furthermore, in general computers, frequent disk access is required due to memory capacity limitations, which approximately doubles the processing time.

The medical image filing device that was put into practical use was
As described in the Proceedings of the Poster Session on Image Management and Communication (Washington, USA, June 1989), No. 16, dedicated hardware for compression and playback processing and a large-capacity frame memory are built-in, and the combination of these is described. achieves high-speed processing.

[Problem to be solved by the invention]

On the other hand, in addition to the above-mentioned large-scale medical image filing devices, personal medical image workstations for doctors to personally observe medical images in their laboratories or at home are also being commercialized. These personal medical imaging workstations are based on small general purpose computers for economic reasons.

Personal medical imaging workstation (108) in Figure 6
) are examples, such as a small computer (109), an image display device (110), and an optical disk drive device (111).
Consists of. In the case of FIG. 6, a personal medical image workstation (108) reads and displays image data from an optical disk cartridge (107) written on a shared medical image filing device (IOO), and displays the image data for the doctor's personal use. It is used for image observation.

However, as mentioned above, in order to reproduce large-capacity image data that is usually data-compressed on a small general computer, it requires a long processing time. XA!, which is used only for comparatively small-capacity CT plane images, plays a fundamental role in image diagnosis. Large-capacity images such as film images and CR images could not be handled.

An object of the present invention is to reduce the processing time and working memory capacity required for reproducing compressed image data of large-capacity images, so that it can be used even in personal medical image workstations such as JN-type computers with slow processing speed and small memory capacity. The object of the present invention is to enable reproduction and display of large-capacity images within a practical amount of time.

[Means to solve the problem]

In actual image observation by doctors, it is rare that the entire large-volume image such as an X-ray film image or CR image is observed in detail, and in many cases only a specific local part is observed in detail. . Therefore, by directly reproducing only the summary image for identifying the position of the observation target and the partial image containing the observation target from the compressed data of these large images, it is possible to reproduce the image without impairing the image diagnosis function. The processing time and working memory capacity required for processing can be reduced, and the above object of the present invention can be achieved.

[Effect]

As a specific example, consider a case where image data of a digitized X-ray film image of 4 million pixels (2000 pixels each in the vertical and horizontal directions) is compressed to 1/8 using the non-equal length block encoding method.

As mentioned above, it takes about 5 minutes to reproduce the entire compressed data on a general computer. Furthermore, in order to obtain this processing time, a working memory capable of storing at least the entire compressed data (5 million pixels) and the entire reproduced image data (4 million pixels) is required. Since digitized X-ray film image data requires a capacity of 2B per pixel, a total memory capacity of 90079B is required. If this memory capacity cannot be secured, magnetic disk access etc. will be required during processing, which will significantly increase processing time.

On the other hand, consider a case where image observation is performed using a summary image and a partial image using the method of the present invention. It is assumed that the image size of both images is 250,000 pixels (500 pixels each in the vertical and horizontal directions), and three partial images are used for observation. In this case, since the processing time is approximately proportional to the number of pixels, it takes about 20 seconds per image, and the total processing time is about 1 minute and 15 degrees, which is 1/4 of the time in the above example. Also,
The working memory capacity required for this process is 200,000 B, which can store the reproduced image data of one summary image and one partial image (500,000 B each) and the entire compressed data (1 million B).
1,000,000 B, which is about 1/5 of the above example.

〔Example〕

Hereinafter, one embodiment of the present invention will be described with reference to the accompanying drawings.

The compressed image data reproducing method of the present invention converts digitized XM film image data of 4 million pixels (2000 pixels each in the vertical and horizontal directions) inputted from the XM film reading device (102) shown in FIG. Using a dedicated compression and reproduction processing device (not shown in the figure) installed in Data is transferred to an optical disk drive (10
5) onto the optical disk cartridge (107), and the compressed image data on the optical disk cartridge (107) is transferred to the personal medical image workstation (108).
When the image is read out by the optical disk drive device (111), reproduced by the personal medical image workstation (108), and displayed on the image display device (110) with an image display area of 250,000 pixels (500 pixels each in the vertical and horizontal directions). , is used as a method for reproducing compressed image data in personal medical image workstations (iOS).

FIG. 7(a) is a block diagram of a personal medical image workstation (108) that executes the compressed image data reproduction method of the present invention. - Inside the dotted chain line is a small computer (108), which includes a CPU (112), a working memory (113), a magnetic disk drive (114L), an operation console (11) equipped with a keyboard and a character display;
5) and a path line (116) connecting them.

Image display device (110), optical disk drive device (11)
1) is connected to the pass line (116).

The XAi film image display program using the compressed image data reproducing method of the present invention is written on a magnetic disk (not shown in the figure), and is read out by the magnetic disk drive device (114) at the time of execution.
2) is executed. FIG. 1 shows a flowchart of the X-ray film image display program. Note that, prior to executing this program, the compressed image data on the optical disk cartridge (107) is read by the optical disk drive device (111),
It must be written to the working memory (i13). Further, details of the subprograms used in this program will be described later.

In the XM film image display program, first, 16:
In the i-summarized image reproduction subprogram (1), a Digimolized X#lI film image of 2000 pixels each in length and width is divided into small regions of 4 pixels each in length and width, and each small region is represented by one pixel. 16 pixels of 500 pixels each in the vertical and horizontal directions
=1 Regenerate the summarized image directly from the compressed image data. 7th
As shown in Figure (b), the 16:1 summary image data reproduced in the summary image storage area (201) on the working memory (113) is displayed on the image display device (110) on the image display (2).
) and presented to the operator as an image showing the overall shape of the X-ray film image. Next, in magnification selection (3), the operator is made to select a magnification of 4x or 16x using the console (115).

If 4x magnification is selected, select magnification area (4)
16 is displayed as shown in Figure 2(a).
1. A frame (5) having a size of 1/4 (1/2 each in the vertical and horizontal directions) of the entire image indicating the area of the partial image to be reproduced is displayed on the summarized image. In the enlargement area selection (4), the operator can move the frame (5) on the summary image by operating the numeric keys on the keyboard attached to the console (L5), and select the desired enlargement area. You can choose. The determination of the enlarged area is recognized by inputting the new line key on the keyboard, and then the 4:l summary 174 partial image reproduction subprogram (6)
begins execution. The 4:1 summarized 1/4 partial image reproduction subprogram (6) reproduces 1/4 (1/2 each in the vertical and horizontal directions) of the selected digitized XI film image of 2000 pixels each in the vertical and horizontal directions.
) is further divided into small regions of 2 pixels each in the vertical and horizontal directions, and each small region is represented by one pixel. A 4=1 summary image of 500 pixels in the vertical and horizontal directions is directly reproduced from the compressed image data. do.

On the other hand, if the magnification ratio of 16x is selected, the magnification area selection (7) is entered and the 16:1 magnification ratio is selected as shown in Figure 2 (b).
A frame (8) with a size of 1716 (1/4 in both the vertical and horizontal directions) of the entire image is displayed on the summary image. The operator selects a desired enlargement area by moving the frame (8) on the summary image by operating the numeric keypad. The 1/16 partial image reproduction subprogram (9) reproduces a partial image of 1/16 (1/4 in each vertical and horizontal) part of the selected Digimol X#J film image of 2000 pixels in each vertical and horizontal direction from compressed image data. Play directly.

In this way, the 4:1 summary 1/4 partial image reproduction subprogram (6) or the 1/16 partial image reproduction subprogram (9) reproduces the partial image in the partial image storage area (202) on the working memory (113). The resulting partial image data is transferred to the image display device (110) by image display (10) as shown in FIG. served.

After that, in the termination/re-execution selection (11), the operator is asked to select termination or re-execution using the console (115), and if termination is selected, this program is terminated and re-execution is selected. If so, return to image display (2) and repeat from presentation of the overall shape of the X-ray film image.

16 used in the above XM film image display program:
1 Summary image reproduction subprogram (1), 4:1. Summary 1
FIG. 8 shows the structure of compressed image data reproduced by the /4 partial image reproduction subprogram (6) and the 1716 partial image reproduction subprogram (9). In this compressed image data,
As shown in Figure 9 (a), an image of 2000 pixels vertically and horizontally is divided into a long and narrow image of 16 pixels vertically and 2000 pixels horizontally (120
) are handled separately. That is, as shown in FIG. 8(a), the number of divided image compressed data words (121) is sequentially written at the beginning of the compressed image data. In addition,
The l word is 16 bits.

Subsequently, the divided image compressed data (122) itself is sequentially written. Each divided image (120) is further divided into sub-images (123) of 166 pixels vertically and horizontally as shown in FIG.
22), sub-image compressed data (124) are sequentially written.

Each sub-image (123) is divided into non-equal length blocks described in a quadtree structure as shown in FIG. 1O during data compression using the image data encoding method described in Japanese Patent Application No. 62-297556.

That is, the sub-image (123) consists of a block of 2 pixels vertically and horizontally (hereinafter abbreviated as 2x2 block), a block of 4 pixels vertically and horizontally (hereinafter abbreviated as 4x4 block), and a block of 8 pixels horizontally and vertically (hereinafter abbreviated as 8x8 block). The pixels are treated as a combination of 166 pixels (hereinafter abbreviated as 16×16 block) or as a single 166-pixel block (hereinafter abbreviated as 16×16 block). The division form is determined according to the magnitude of the change in the warehouse temperature within the sub-image (123>), so that areas where the brightness changes are sharp are made into small blocks, and areas where the brightness changes are gradual are made into large blocks, and a quadtree structure is created as shown in Figure 11. It is described as

The quadtree structure shown in FIG. 11 describes the division form shown in FIG. ] is supported. In FIG. 11, the sub-image is first divided into four 8x8 blocks.

The top branch of the quadtree corresponds to the 8x8 blocks from left to top left, top right, bottom left, and bottom right. The other 8x8 blocks except the upper right are further divided into four 4x4 blocks.

The second branch from the top of the quadtree corresponds to a 4x4 block, and in each 8x8 block, from left to top left,
They are arranged in the following order: top right, bottom left, bottom right. Furthermore, the 8X8 on the upper left
Taking blocks as an example, the 4x4 blocks at the top right and bottom right are divided into four 2x2 blocks. The numbers [1 to [37] assigned to each block indicate the order of the ends of the tree structure constructed in this way, starting from the youngest to the left.

The second quadtree structure is a 4-bit binary number 8×8RF (
125) and 4X4RF (1
26). 8×8 RF (125) corresponds to the topmost branch of the quadtree, and is arranged from the left with an “O” if each branch branches further, and a “1” if not.

In the example of FIG. 11, it is ro 100J. 4x4RF
(126) corresponds to the second branch from the top of the quadtree, and is "0" if each branch branches further, otherwise "1"
They are arranged from left to right. However, [1 in Figure 11]
1] where there is no corresponding branch, rl l 1
I am using 1J. Therefore, the 4X4RF (1
26) becomes rlOlolllooooollooJ.

In the image data encoding method described in Japanese Patent Application No. 62-297556, pixels in each block thus divided are approximated by a bilinear function. That is, N x N blocks (N is 2
．． 4 or 8) pixels in a two-dimensional array and LTf,t (
1=o-N-1, j=o~N-1). here,
The subscript "ri" is added from left to right, and the subscript "j" is added from top to bottom. Then, f is approximated by equation (1).

Lt= (A/aN)IJ +(B/βN)I+ (C/βN)J +D/N0μ, ・・・・・・・・・ (1) r=i (
N-1)/2゜JEj (N-1)/2゜aN3N-(N-1)-(N+1)/12゜β, Mi Ja
NN.

Here, A, B, C, and D are coefficients determined for each block under the condition of minimum square error, and μ is the arithmetic mean (hereinafter referred to as DC component) of the pixels of the sub-image before compression.

Figure 8(b) shows the structure of the compressed data of the sub-image divided and approximated in this way.The first word contains a 2-bit flag RM (127) and the number of sub-image compressed data words (128 ) are stored. Here, RM(1
27) is an auxiliary description of the block division form; in the case of RM=rOOJ, the sub-image is not divided and is a single 16 x 16 block, and in the case of "01", it is 4 of 8. It is divided into ×8 blocks,
In the case of rlOJ, it means that the division format does not include 2×2 blocks other than those mentioned above, and in the case of “11”, it means that the division format includes 2×2 blocks.

The second word is the DC component (129) mentioned above.

The third word stores 8X8RF (125) starting from the MSB, and the fourth word stores 4X4RF (126). The coefficient data (130) from the 5th word onward includes:
Coefficients A, B, C of the bilinear function that approximates each block
. That is, the first
In the case of FIG. 0 and FIG. 11, they are stored in the order of [1] to [37]. In addition, if the above RM (127) is roOJ or "01", the third and fourth words are
In the case of "10", the fourth word is omitted.

16:1 summary image reproduction subprogram (1) in Figure 1
, 4:l summary 1/4 partial image reproduction subprogram (6)
and 1716 partial image reproduction subprogram (9), reproduction of the sub-image is executed according to the flowcharts of FIGS. 12 to 15.

However, 16X1 that appears in the flowcharts from Figures 12 to 15
The contents of the 6 block playback subprogram (140), 8x8 block playback subprogram (141), 4x4 block playback subprogram (145), and 2x2 block x 4 playback subprogram (150) will be described later. 16:1 summary image reproduction subprogram (1), 4:
1 summary 1/4 partial image reproduction subprogram (6) and 1
/16 Different for each partial image reproduction subprogram (9).

FIG. 12 is a flowchart of the sub-image reproduction subprogram, in which the RM in the first word of the sub-image compressed data (124)
(127) is taken.

If the RM is roOJ, a 16x16 block reproduction subprogram (140) is executed. If RM is "01", the 8x8 block reproduction subprogram (141) is executed four times. However, the 8x8 block playback subprogram (1
4],) are configured to sequentially reproduce 8×8 blocks at the upper left, upper right, lower left, and lower right. RM is "10"
In the case of RM=2 sub-image reproduction subprogram (142
), but if RM is "11", the RM=3 sub-image reproduction sub-program (143) is executed.

FIG. 13 shows the RM=2 sub-image reproduction subprogram (14
2) is a flowchart. Using 8X8RF (125) in the third word of sub-image compressed data (124), first 8
In ×8RF determination (L44), the MSB of 8×8RF (125) is determined and shifted to the left by 1 bit. MSB is “1”
”, the 8×8 block playback subprogram (141
), and in the case of "O", the 4x4 block reproduction subprogram (145) is performed four times. However, the 4×4 block reproduction subprogram (145) is configured to sequentially reproduce the upper left, upper right, lower left, and lower right 4×4 blocks in one 8×8 block. Next, repeat judgment (1
46), the process from 8×8 RF determination (144) to repetition determination (146) is repeated four times.

However, this repetition is sequentially upper left, upper right, lower left, lower right 8.
It is configured to play x8 blocks.

FIG. 14 shows the RM=3 sub-image reproduction subprogram (14
3), which differs from the RM=2 sub-image reproduction subprogram (142) in FIG. 13 in the following points. That is, the 4X4 block reproduction subprogram (145)
The 4×4 area reproduction subprogram (147) performs the 4×4 area reproduction subprogram (147) instead of the 4×4 area reproduction subprogram (147).
Since F (126) is used, a 4x4RF4 bit left shift (148) is performed after the 8x8 block reproduction subprogram (141).

FIG. 15 is a flowchart of the 4×4 area reproduction subprogram (147).
At determination (149), the MSB of 4×4RF (126) is determined and shifted one bit to the left. If the MSB is r14, execute the 4x4 block playback subprogram (145).
In the case of roj, a 2×2 block×4 reproduction subprogram (150) is executed. The 2 x 2 block x 4 playback subprogram (150) is a 2 x 2 block x 4 playback subprogram (150) that
Play two adjacent 2X2 blocks.

16:1 summary image reproduction subprogram (1) in Figure 1
Now, for all the sub-images (123) of all the divided images (120) constituting the image explained in FIG.
:1 to summarize and play. Figure 3 schematically shows this 16:1 summarization method, where (a) shows a 16x16 block, (b) shows an 8x8 block, (c) shows a 4x4 block, and (d) shows a 4x4 block. The solid lines in the figure represent the boundaries of the small areas, and the broken lines represent the boundaries of the original pixels. The value of a pixel representing a small area is the value at the position indicated by a circle in the figure of a bilinear function that approximates each block. That is, the 16×16 block reproduction subprogram (1
40), in equation (1), N is set to 16, and ■ and J are -6
, -2, 2, and 6, and in the 8X8 block reproduction subprogram (141), the pixel value is determined by setting N to 8 and ■ and J to -2 and 2 in equation (1). seek. 4x4 block playback subprogram (145)
In the case of , the pixel value can be found by setting N to 4 and ■ and J to 0 in equation (1), but this can be expressed as D/4 + μ using only the coefficient and the DC component μ from equation (1). can be obtained more easily. In the case of the four adjacent 2×2 blocks separated by the dash-dotted lines in Figure 3(d), there is no bilinear function that approximates the entire small area, so the 2×2 blocks indicated by triangles in the figure Let the average value of the values at the center position be the value at the position indicated by the circle. Therefore, in the case of a 2 x 2 block x 4 playback subprogram (150), in equation (1), set N to 2, and set ■ and J to 0 to find the pixel value of the triangle mark, and find the average. From equation (1), this becomes (
D, +D20Dj+D4)/80μ, which makes it easier to obtain. Here Dl, D2, Dl, D
4 indicates the coefficients of the bilinear function of four 2×2 blocks.

4:1 Summary In the case of the 1/4 partial image reproduction subprogram (6) and the 1/16 partial image reproduction subprogram (9), the compressed data is skipped before the sub-image is reproduced. From the position of frame ■(5) or frame ■(8) on the 16:1 summary image representing the area,
The number of skipped pixels in the vertical direction is 5V (20
) and the number of skipped pixels in the horizontal direction S, (21) are determined in advance.

However, Sv and SH are the number of pixels on the 16:1 summary image. Skip reading is at the divided image (120) level and sub-image (
123) To skip the 9 divided image (120) level, add the number of divided image compressed data words (121) stored at the beginning of the compressed image data in Figure 8 (a) by Sv/4 from the beginning. This is done by skipping the number of words from the beginning of the area where the divided image compressed data (122) are continuously stored, based on the number of words obtained. To skip the sub-image (123) level, read the number of words of the sub-image compressed data stored at the beginning of the sub-image compressed data (124), and read the sub-image compressed data (124).
124) is performed by skipping the corresponding number of words from the beginning of the sub-image compressed data unit. 5H74 from the beginning of data (122)
This is done by repeating the test several times.

The 4:1 summary 174 partial image reproduction subprogram (6) converts the sub-image (123) within the enlarged area indicated by the frame ■(6) or the frame ■(8) in FIG. By representing the image with one pixel, it is summarized and reproduced at a ratio of 4:1. Figure 5 schematically shows this 4:1 summarization method, where (a) shows a 16x16 block, and (b) shows an 8x
8 blocks, (c) 4x4 blocks, (d)
represents a 2×2 block, solid lines in the figure represent boundaries of small areas, and broken lines represent boundaries of original pixels. The value of a pixel representing a small area is the value at the position indicated by a circle in the figure of a bilinear function that approximates each block. That is, in the 16×16 block reproduction subprogram (140), in equation (1), N is set to 16, and ■ and J are set to -7, -5, -3, -1, 1, 3.
, 5 and 7, and in the 8×8 block reproduction subprogram (141), N is set to 8 using equation (1).
The pixel values are determined by setting ■ and J to -3, -1, 1, and 3, and the 4×4 block reproduction subprogram (145
), the pixel value is determined by setting N to 4 and T and J to -1 and 1 in equation (1). In the case of the 2 x 2 block x 4 playback subprogram (150), for four adjacent 2 x 2 blocks corresponding to one 4 x 4 block, N is set to 2 in equation (1), and ■ and J are set to 0. By doing so, the pixel value can be found, but this can be expressed more easily as D/20μ from equation (1) using only the coefficient and the DC component μ.

In the 1/16 partial image reproduction subprogram (9), the second
All the original pixels of the sub-image (123) within the enlarged area indicated by the frame (5) or (8) in the figure are reproduced according to equation (1). That is, in the 16×16 block reproduction subprogram (14c, N is set to 16 in equation (1),
The pixel value is determined by setting j and j to 0°1.2...15, and in the 8×8 block reproduction subprogram (141,), N is set to 8 in equation (1), and i and j are set to 0. ．． 1.2・
- Calculate the pixel value by setting N to 7, and in the 4×4 block reproduction subprogram (145), set N to 4 in equation (1),
i and j are 0. 1. 2. 3 to find the pixel value. 2×2 block×4 playback subprogram (150
), the pixel values are determined for four adjacent 2×2 blocks corresponding to one 4×4 block by setting N to 2 and i and j to O and above in equation (1).

Although one embodiment of the present invention has been described above, it goes without saying that the present invention is not limited to the above embodiment and can be modified in various ways. For example, various image data compression methods to which the method of the present invention is applied can be considered in addition to the non-equal length block encoding method described in the embodiment. - For example, Video Information (M), 18, (1986), pp. 719-7.
Even in orthogonal transform methods such as the discrete cosine transform method discussed on page 24, images are often divided into blocks of about 16 x 16 pixels or 8 x 8 pixels, and the above example It is easy to extract partial image data by skipping similar compressed data, and a summary image can also be created by reproducing every few pixels during inverse transformation during reproduction. At this time, it is also possible to reproduce from a small number of transform coefficients by taking advantage of the fact that the Nyquist spatial frequency of the summary image is low.

〔Effect of the invention〕

Since the present invention is configured as described above, it is possible to reduce the processing time and working memory capacity required for reproducing compressed image data of large-capacity images, and to use a small computer with a slow processing speed and a small memory capacity. However, it is possible to reproduce and display large-capacity images within a practical amount of time without impairing the ability to observe images in detail.

[Brief explanation of drawings]

FIG. 1 is a flowchart showing the processing procedure of an X-ray film image display program using the compressed image data reproducing method of the present invention;
Fig. 2 is an explanatory diagram showing the enlargement area selection frame displayed to the operator when selecting an enlargement area in the X-ray film image display program, and Fig. 3 is an explanatory diagram showing the enlargement area selection frame displayed to the operator when selecting the enlargement area in the X-ray film image display program.
A schematic diagram for explaining the 16:1 summary reproduction method of sub-images in the 6:1 summary image reproduction subprogram, FIG. 4 is a 4:1 summary 1/4 in the X-ray film image display program.
An explanatory diagram showing the number of skipped pixels in the vertical direction and the number of pixels skipped in the horizontal direction used in the skipping of compressed data performed by the partial image reproduction subprogram and the 1716 partial image reproduction subprogram. 4=1 summary 174 A schematic diagram for explaining the 4:1 summary reproduction method of sub-images in the partial image reproduction subprogram, FIG.
An illustration showing the use of a personal medical imaging workstation running a line film image display program, FIG.
a) and (b) are block diagrams showing the configuration of a personal medical image workstation that executes an X-ray film image display program using the compressed image data reproducing method of the present invention, and FIG. X using the regeneration method
FIG. 9 is an explanatory diagram showing the structure of compressed image data reproduced by the X-ray film image display program, and FIG. An explanatory diagram showing how to handle it. Figure 10 is a schematic diagram to explain the division of sub-images into non-equal length blocks using the non-equal length block encoding method. Explanatory diagram showing the quadtree structure of non-equal length block division, Part 1
Fig. 2 is a flowchart showing the processing procedure of the sub-image reproduction subprogram, Fig. 13 is a flowchart showing the processing procedure of the RM = 2 sub-image reproduction subprogram, and Fig. 14 is a flowchart showing the processing procedure of the RM = 3 sub-image reproduction subprogram. FIG. 15 is a flowchart showing the processing procedure of the 4×4 area reproduction subprogram.6 [Explanation of symbols] 1...16:1 summary image reproduction subprogram, 5...
・Frame ■, 6... 4:1 summary 1/4 partial image reproduction subprogram, 8... Frame ■, 9... 1/16 partial image reproduction subprogram, 20... Vertical skip pixels Number SV, 21...Number of pixels skipped in the horizontal direction SN, 100
. . . Medical image filing device, 102 . . . XM film reader, 107 . . . Optical disk cartridge, 108 . , 120... divided image, 123... sub image. Figure Figure ((λ, n (b) Figure 3 (Kyu) 1; -6 1=-2 1:2 ni 6 (C) Figure 4 -7 to -H knee 3 to -1 1=+ r=3 L=5 1=7 (C) Fig. 70 Fig. 9 (f)) 11th closed g 11111-1
25/26 Figure 2 Figure 3 Whistle/Figure 4

Claims (1)

[Claims] 1. In a compressed image data reproduction method for reproducing compressed image data obtained by compressing large-capacity image data, a local partial image of the large-capacity image to be reproduced is directly reproduced from the compressed image data. A compressed image data reproducing method characterized by: 2. A compressed image data reproducing method for reproducing compressed image data obtained by data-compressing large-capacity image data, characterized in that a summary image of the large-capacity image to be reproduced is directly reproduced from the compressed image data. How to play. 3. In a compressed image data reproducing method for reproducing compressed image data obtained by data-compressing large-capacity image data, first, a summary image of the large-capacity image to be reproduced is directly reproduced from the compressed image data, and then the summary image is compressed image data, characterized in that the operator is prompted to input information regarding the position of a region to be observed in detail, and a local partial image including the region is directly reproduced from the compressed image data. How to play.