JPS63191272A - Display method for retrieved picture - Google Patents

Abstract

PURPOSE:To display plural retrieved pictures at a high speed by displaying only a specific area that is designated by a user among each retrieved picture data. CONSTITUTION:The position of a partial area of a retrieved picture to be displayed on a display screen is designated and the recorded position of the picture data part corresponding to a designated position on a file medium is obtained based on the position information included in the index record corresponding to the retrieved picture. Then the recorded position on the file medium receives an access and the picture data record is partly read out. This read picture data is restored and outputted onto the display screen. Thus it is possible to display at a high speed the retrieved picture data including the information on the part desired by a user.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to an image data display method, and more specifically,
This paper relates to a high-speed display method for searched images in an image file system.

[Conventional technology]

In recent years, document image file systems (electronic files) using large-capacity optical disks have been attracting attention as a new means of document management. Optical discs have a large data storage capacity and can store a large amount of data such as image data, so they can be used to store ledgers and blueprints.

Normally, when searching for these document images, it is preferable to use indexes such as predetermined document names, classification names, and keywords. As indexes become more complex, the effort required to store document images with these added increases, and it is often difficult to remember these indexes when searching.
In practice, data is often accumulated by adding only simple indexes such as classification names. Furthermore, it is common practice to search for images that have been stored with complex indexes by specifying only a simple index. In this case, in order to search for a target document image, a plurality of candidate data searched by index designation such as classification name are sequentially displayed on the display.

It is necessary for the operator to visually check the displayed content and extract the target document.

For example, as described on pages 6-7 of Hitachi's Optical Disk File System Operator (manual number 6O-10-001-20), the method for selecting the document image described above is as follows: Alternatively, there is a method using the next page key. In this method, a plurality of pieces of image data are displayed one by one on the display each time a key is pressed. One possible improvement to this method is 1. For example, when the page break key is pressed, we may consider a method in which the search data is automatically page-broken until the next key press, which means a stop command, is displayed sequentially on the display image. It will be done.

[Problem that the invention seeks to solve]

As mentioned above, when document images that have been index searched (-next search) are sequentially displayed and a target document is extracted from them by visual search (secondary search), it is determined whether the displayed document is the target document or not. It is desirable to speed up page feed operations to the extent possible and shorten the time required for secondary searches. However, in conventional search systems, the next retrieved document data is read one page (code) from the document image file and displayed sequentially, and the reading speed of each image data is limited by the file device. Since the display is limited by performance, it is not possible to update the displayed content at a cycle shorter than the time required to read data per document, resulting in a waiting time until the next screen appears.

However, when performing a visual search, it is not necessary to display each document in its entirety; for example, the title, author, abstract, etc.
For example, it is often possible to achieve the search objective by displaying only a portion of a document.

If the operator remembers the location where the content that specifies the target document is written, the operator will focus on the location to determine whether or not the displayed document is necessary. It is only necessary to display only a specific partial area designated by the operator.

An object of the present invention is to provide a method for displaying searched images that can display a plurality of searched images at high speed by displaying only a specific partial area specified by the user out of each searched image data. There is a particular thing.

[Means for solving problems]

In order to achieve the above object, a search image display method according to the present invention includes a data compressed image data record,
In an image file system in which an index record containing position information of the image data record is stored on a file medium, a first step of specifying the position of a partial area of the search image to be displayed on a display screen; , a second step of determining the recording position of the image data portion corresponding to the specified position on the file medium based on the position information included in the index record corresponding to the search image; and the recording position on the file medium. The present invention is characterized by comprising a third step of accessing the image data record and partially reading out the image data record, and a fourth step of restoring the read image data and outputting it to the display screen.

If there is a plurality of search images, the operations from the second step to the fourth step are continuously repeated according to the position specification of the partial area specified in the first step.

(Operation) In image data file systems, in order to effectively utilize the memory area and store a large number of images on one file medium, it is common practice to compress the data of the original image by encoding and store it as a record. In this case, information is distributed in records on data-compressed file media at a density different from that of the original image, so for example, even if half of the information is read from one record, this is not the same as the original image. According to the present invention, based on the position information included in the index record, a file corresponding to the position of a partial area on the original image or reproduced image specified by the user to be displayed is displayed. By determining the recording position of the image data on the medium and selectively reading out only the data portion of each image record at the position corresponding to the above portion or area from the file medium, the amount of image data read out can be reduced. For example, in one embodiment of the present invention, in order to associate the partial area on the original image specified by the user with the recording position of compressed image data on the file medium, , At the time of storing the image data in a file, the original image is divided in advance into a plurality of partial areas, and the compressed data recording position of each partial area is stored in the index record.And, The display position specification from the user is made to specify one or more of the divided partial areas.
If the original image is registered without being divided, each compressed image record is divided into multiple partial areas, etc., based on the position information in the index record mentioned above, when the display position is specified by the user. , extracts a partial region corresponding to the position specified by the user. Since the regenerated (restored) image of the partial area obtained in this way deviates from the partial area at the position intended by the user, in the present invention, the readout area is set in excess of the partial area obtained by dividing. , reads the image data.

As a result, search image data including information on the part intended by the user can be displayed at high speed.

〔Example〕

Embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is an overall configuration diagram of an image file system according to the present invention, where 1 is a scanner for inputting image data, 2 is a controller for scanner 1, and 3A is a compressed encoded form of registered image data. 3B is an index file for storing index data prepared for searching each image data; 4 is a controller for writing and reading data to and from the image file 3A and the index file 3B; A display device for displaying image data and character data such as commands, 6 a controller for controlling the display device [5, 7 a keyboard for inputting character data such as commands and index data, 8 a system Processor (C, PU) that performs overall control, 9
11A is a memory for storing programs executed by the CPU 8; 10 is a work memory for storing various variables or tables used by the CPU 8;

11B is a buffer memory for temporarily storing the encoded image read from the image file 3A; 13 is an image memory for storing the original image data input from the scanner 1;
14 is a dedicated processor for encoding the original image data, 15 is a dedicated processor for restoring the encoded image data, 16 is a bitmap memory corresponding to the display contents of the display image, and 17 is a bus. show.

In this configuration, the memories 9 to 13 and 16 do not need to be physically different devices, and may be allocated as different storage areas on the same memory device. The total memory amount can be reduced by sharing the area of Assume that different areas on two optical disks 3 are allocated to files 3A and 3B, respectively. Therefore, the file controller 4 has two files 3A
, 3B. It is assumed that the file controller 4 includes a drive device for the optical disk 73. Also,
Although the encoding processor 14 and the decompression processor 15 are different in terms of circuits, they are often implemented on the same LSI, so they are drawn adjacent to each other in the figure. Various types of encoding algorithms for image data performed by the encoding processor 14 are known in the past, including one example.

rFAX published by Nikkan Kogyo Shimbun and written by Takahiko Fukinuki.

``Image Signal Processing for OA'' (1982
The run-length encoding method described on pages 61 to 75 of 2003 can be used. However, the gist of the present invention does not change depending on the encoding algorithm, and any other algorithm may be used.

FIG. 2 is a diagram showing an image file area 3A and an index file area 3B on the optical disc 3. A single spiral track TR is formed on the optical disc 1 and continues from the center of the disc toward the outside. This truck TR.

Multiple tracks TR-0 to TR- are separated by the reference line.
Divided into m+n, each in order from the inner part to O"
A track number of m + n is given.

Furthermore, each track is divided into a plurality of sectors 5E-0 to 5E-p, which are the minimum units of data blocks to be read and written, and each sector includes read/write data when the optical disc 1 rotates in the R direction. In this embodiment, sector numbers 0 to p are given in the order in which the head passes.In this embodiment, an index, which is code data, is stored from the 0th sector of the 0th track TR-0 to the last sector of the 0th track TR-m. The index file area 3B for
The area from the 0th sector of track TR-m+1 to the final sector of m+nth track TR-m+n is defined as an image file area 3A for storing document image data. Note that the address of each sector can be uniquely determined by the track number and the sector number, but here, sector numbers are assigned in order starting from the 0th sector of the Oth track, for example, the jth sector is assigned to the ith track. [i.(p+1)+j) sector is defined.

FIG. 3 shows original image data 2 stored in the image memory 13.
In this embodiment, the original image data is divided into P partial areas, and each partial area is encoded into In this example, P=4
The original image data 20 is divided into four rectangular partial areas 21 to 24 of the same size. Each partial area 21 to 24 in the 0M image contains a different amount of information, so the partial area If the image data is encoded for each time, the partial areas 31 to 34 on the encoded image data 30 will have different thicknesses depending on the amount of data.
(i) indicates the data size of the i-th partial area on the encoded image. In practice, it is more convenient to express this data size by the number of bytes and the number of bits of the terminal byte, but in this embodiment, for convenience of explanation, it will be expressed by the total number of bits. In addition, A attached on the encoded image 30
(i) indicates the start address of the i-th partial area, and this address is the same as the image file area 3 described above.
Although it is more practical to represent the sector number in A, the byte position within the sector, and the terminal bit position, in this example, for convenience of later explanation, the sector number A' (i)
The bit position in the sector is expressed as 1ta (i).

In this embodiment, as described above, the original image data 20 is divided into a plurality of partial areas, each partial area is encoded, and when the partial area 21 on the original image is specified, the corresponding code is In order to identify the partial area 31 on the encoded image, the boundary position of each encoded partial area 31, here the start address A (i) and data size B (i), are recorded in advance on the index file 3B. In this case, the index record 40 recorded in the index file 3B is structured as shown in FIG. 4, for example.

In the figure, 41 is an index field, 42-1
and 43-1 are fields for recording the sector number A'(i) on the image file 3B in which the first partial area is recorded and the bit position a(i) within the sector; 44-1;
i is a field for recording the length B (i) of the encoded data of the first partial area, and A' (i) and a (i
) specifies the start address of the first partial area on the image file.

By configuring the index file in this manner, when outputting index-searched image data sequentially to the display device 15, for example, an operator may specify to display only the upper half of each image data. If this is done, only the encoded areas 31 and 32 corresponding to the partial areas 21 and 22 corresponding to the upper half of the original image can be selectively read out from the image file 3A. This selective data reading can shorten the time required to read out one piece of image data from an image file, thereby making it possible to significantly shorten the update cycle of display contents on a display image.

Next, with reference to the flowchart shown in FIG. 5, the formation of the above-mentioned image file and index file, and the control operation of the image filing system that uses these to display search image data at high speed will be described. The program shown in this flowchart is stored in the memory 9 and executed by the CPU 8. First, in step 102, the optical disk 3 is loaded into the file controller 4, and in step 104, the address on the optical disk where the next index record should be stored (index file pointer Pb) and the next image data should be stored. , an address (image file pointer Pa) on the optical disk is obtained by searching the optical disk 3 and stored in the work memory 10.

In step 106, the input command from the operator is determined,
If it is a registration command, the input image data from the scanner 1 is written in the image memory 13 in step 108, and in the next step Ho, the image data is transferred to the bitmap memory 16 ML and displayed on the display image. The operator determines the quality 1 of the image displayed on the display 5, such as the tilt and position.

Determine the shading, etc., and input the results (step 11)
2). If there is no problem with the input image, step 11
At step 4, index data such as a document name, classification name, etc., which serve as a search key for the image data, is input from the keyboard 7. These index data are input into the work memory 10. In this embodiment, for example, rTO is used as an index.
Next, in step 116, it is assumed that only character strings indicating document classification names, such as "KKYo (patent) J, rRONBUN (paper) J, rHOυ to 0 to υSYO (report)", are entered manually.

The number of divisions P of the original image described above is specified by inputting a command from the keyboard 7. This number of classifications P may be determined in advance to be treated as a fixed value on the system side.
In this case, the input operation at step 116 is not necessary.

Steps 118 to 126 divide the original image data 20 input into the one-image memory 13 into a plurality of partial areas by the number of divisions P, obtain coded image data in the buffer memory 11A, and store the image data on the work memory 10. 4 shows the sequence for forming the index record explained in FIG.
After initializing the value of L (i=1), the value of the image file pointer Pa obtained in step 104 is set in A(1). At this point, pointer Pa points to the first bit position of a specific sector, and a (1)=O. In step 120, the first partial area 21 of the original image is
Performs encoding processing.

This encoding process is performed by the encoding processor 14, and the encoded image data area 31 is encoded from immediately after the (i-1)th partial area on the buffer memory 11A (
The first partial area 31 is written (from the beginning of the buffer memory IIA). In step 122, the size B (i) of the partial area 31 of the encoded image is set to the address A (i)
At step 124, the storage address A (i+1) of the next i+1-th partial area 31+1 is added to the index record on the worder memory 10.
+1)”A (i)+B (i). A (
i+1) divided into sectors, address A' (i+1) and bit position a(i+1), the above address is a(i)+B(i) A'(i+1)=A' (i)+ () 2a(i+1
)=(a(i)+B(i)) mod K is calculated.

Here, the symbol [ ] is a Gauss symbol indicating integerization by truncation, K is the number of bits per sector, and mad is the remainder due to division.

In step 126, increase the value of parameter i by 1,
By repeating steps 120 to 126 until the division number P of i is exceeded, the encoded image 30 of FIG. 3 and the index record of FIG. 4 are obtained in the buffer memory 11A and work memory 0, respectively.

The data symbol capacity per sector on the optical disk is 100.
Bytes, that is, = 800 (bits), and when the sector address pointed to by file pointer Pa is "50", each encoded partial area B (a) to B (4)
The size of each is r1200J.

The partial area addresses A(1) to A(4) are given as values r4800J, r2400J, and r2400J.

Encoded image data 3 obtained in buffer memory IIA
0 is recorded in a multiple sector area starting from address A(1) of the image file area 3A on this disk in step 128, and the index record 40 formed on the work memory 10 is optically recorded in step 130. It is recorded in the sector at the address position pointed to by the index file pointer Pa on the index file area 3B on the disk. In step 132, in preparation for the next image data registration process, the values of the image file pointer Pa and the index file pointer pb are updated to values indicating the next recording start sector, respectively. In step 134, it is determined whether or not an end command has been input, and if it is the end, the process returns to step 106; otherwise, step 1
In step 08, input processing for the next image is performed.

Next, a control operation when the operator inputs a command specifying image search will be described.

FIG. 6 is a diagram schematically depicting the search function in the file system of the present invention, and is 20.20'.

20' indicate the retrieved images, respectively.

The shaded area in the figure represents the area displayed on the screen. (A) is a state in which the entire image is displayed, CB) is a state in which the upper half of the image (first and second partial areas) is displayed, and (C) is a state in which the upper half of the image (first partial area) is displayed. The displayed layer (D) is the second layer located in the center of the image. (E) represents a state in which the third partial area is displayed, and (E) represents a state in which the second partial area starting from the - position from the top of the image is displayed. The selection of each of the above display states can be arbitrarily specified from the keyboard 7 shown in FIG. 7, and the sequential display of images can also be arbitrarily specified as either forward or reverse.

In FIG. 7, 71 is a command entry key 172 for turning over and displaying the next image by one page in the forward direction.
173 is a command entry key for turning the next image in the reverse direction and displaying it one page at a time - 173 is a command entry key for continuously turning the next image in the forward direction and displaying it sequentially until the stop key 70 is pressed. -174 indicates a key for inputting a command to continuously turn pages in the reverse direction and display them in sequence.1 Changing the display size is shown in (A) - (B), ( The display position can be changed by using the numeric keys 75 to 78 corresponding to the numbers shown between B) and (C) ((B) to CD in FIG. 6).

This is done using the cursor keys 79 and 80 corresponding to the arrows shown between (C) and (E). Here, the size of the image displayed using the numeric keypad with number j is the entire (1--)
The value of P is r4J, and the amount of change in the display position changed with the cursor keys 79 and 80 is an amount corresponding to one time of the entire original image. In the keyboard shown in FIG. 7, a group of keys 82 is used for inputting character strings such as indexes.

The above search function is realized by the control sequences shown in FIGS. 5(B) to 5(D) that are executed when a search command is input. First, in step 134, the index of the target image data, for example rTOKKYOJ, is input from the keyboard 7. The input index is stored in a predetermined area in work memory 0, and step 136
The index file 3B is searched to find the record having the above index. This search is performed by sequentially reading the data in the index file 3B to work memory 0 and matching the index strings, and the set of searched index records is stored in work memory 0 as shown in Figure 8. record table 80
is stored as.

Each record includes an index field 81 and an address field 82-1 for each partial area, as in FIG.
, 83-1. and a size field 84-i. Q indicates the number of data items extracted by index search.

Next, in step 138, a variable r indicating the size of the displayed image
S I ZEJ and a variable rPO8J indicating the starting position of one display partial area are initialized. Here rS I ZEJ,
The unit of rPO8J is 1/P of the entire image, and its initial value is "P" for rs I ZEJ.

rPO8J is “0”, that is, the sixth screen where the entire image is displayed.
The state is shown in (A) in the figure. In step 140, the image specification parameter 4j to be displayed next is initialized to rOJ, and IIA is specified as a buffer memory for storing the next image read from the image file 3A.In step 142, Waits for command input from the operator,
In step 144, the validity of the input command is checked.

Here, the forward direction continuous display command C corresponding to key 73
1, a forward one-page display command C2 corresponding to the key 71, and a backward continuous display command C corresponding to the key 74.
3, reverse one page display command C4 corresponding to key 72, keys 75 to 78 for changing the size of one display, keys 79 and 80 for changing the display position, and end command corresponding to key 81 only. shall be valid. Also, inputting the forward display command while the final image with image number Ω is already being displayed, and inputting the backward display command when the first image with image number 1 is already being displayed. is also invalid, just like inputting an undefined command. At step 148, the display command is forward (C1 or C2).
) is in the opposite direction (C3 or C4) and step 1
50 or 152 is selectively executed to determine the designated parameter number j of the image to be read out first.

In step 154, it is checked whether a command to change the display size or a command to change the display position has been input, and if it has been input, the variable 5IZE is input.

Change pos.

FIG. 9 shows a detailed flowchart of a subroutine corresponding to step 154 above. In step 802, numeric keys 75-78. That is, it is determined whether a command for changing the display size has been input, and if the command has been input, the sequence of steps 804 to 814 is executed. After confirming in step 804 that the specified new size is not equal to the current size, in step 806 it is determined whether the new size is smaller than the current size. If the size is small, in step 808, the part that is currently displayed and will no longer need to be displayed is stored in the bitmap memory 1.
Clear on 3. In step 810, if the image is changed to the specified size at the current display position, it is determined whether or not the image will protrude downward. Move @pos upwards. Finally, in step 814, the size 5IZE is changed.

If the size change command has not been input in step 802, it is determined in step 816 whether a command to move the display position downward has been input. If this command has already been input, in step 818.

After confirming that the current position is not the bottom end, step 820
Then, a portion of the currently displayed portion that will no longer be displayed after the display position is moved is cleared on the bitmap memory 13. lastly,
In step 820, the value of the position Rpos is incremented;
Move the display area downward.

If the downward movement command has not been input, the process proceeds to step 824, and it is determined whether the upward movement command has been input.

If this command has been entered, step 82
Execute steps 6 to 830. In steps 824-830,
The display position is moved upward using the same concept as steps 816 to 822 above. Note that in this subroutine, commands for changing the size of the display area and commands for changing the display position are accepted in any order. After processing each command, the process returns to the first step 802 and the next command is input. I am trying to repeatedly judge whether or not it has been completed.

Returning to FIG. 5(B), in the next step 156, the eighth
rS I from sector Aj' (POS) of the optical disk by referring to the record with image number j in the table shown
A, j' (PO5+S I ZE
-1) Read the divided image data up to the sector and store it in a predetermined buffer memory. Which buffer memory, 11A or 11B, is to be read is determined depending on the state at that time, as described later, but in the initial state, the image data is read to IIA set in step 140, and the end of image data reading is determined in step 158. After confirmation, in step 160, the buffer memory from which image data is to be read next is switched from 11A to 11B (next time, from 11B to 11A).

Hereinafter, when the command input in step 142 is a forward direction display command, step 164 shown in FIG. 5(C)
~186. In the case of a reverse direction display command, steps 188 to 210 shown in FIG. 5(D) are executed.

In the case of a forward display command, j and a are compared in step 164, and if the latest read image is not the final search data with image number Ω, steps 166 to 182 are executed. At step 166, the data of image number j in the buffer memory IIA or IIB is restored by the restoration processor 15 and stored in the bitmap memory 13. The image data to be restored is stored in the a-th file on the buffer memory.
From the a (POS) bit, Ba (PO
S)+BJ (PO8+1)+・−・・−・+BJ
(PO8+5IZIl!-1) bits. After executing the subroutine of FIG. 9 again in step 168,
In step 170, reading the j+1 image into a buffer memory different from the buffer memory from which the fifth image was read;
The restoration process in step 166 and the read process in step 170 are performed by using the bus 17 in a time-sharing manner.

It shall be done in parallel. After confirming in steps 172 and 174 that the restoration process and continuation process have ended, it is confirmed in step 176 whether or not the stop command 70 has been input by the operator. If the command has been input, the process returns to step 142, where the command is waiting for input. If it has not been entered, first step 178
At step 180, the buffer memory from which one image data is to be read is switched to 11B when IIA is already in use, and to 11A when 11B is in use.
It is determined whether the forward continuous display command is a forward one page display command, and if it is the former, after executing step 182, steps 164 and subsequent steps are repeated.

In the latter case, the process returns to step 142 to wait for command input. If it is determined that the image read out in step 164 is the final data, there is no need to read out the next image data, so step 18 corresponding to steps 168 and 172
4, 186 is executed, and the process returns to the command waiting state of step 142.

The sequence of steps 188-210 executed when the reverse display command is selected is the same as step 164 described above, except that the order of image readout is reversed.
- 186, and detailed explanation thereof will be omitted.

As can be seen from the above operation explanation, recording and searching are performed in separate modes, so the memory 13 required only for registration is
can be physically used as memory IIA or 11B. Further, in the above embodiment, an image file system that allows both registration and search has been described, but the image file medium can be removed from the system and transferred to another system. Therefore, it is possible to separate a system intended only for registration processing and a system provided only with a search function. In the above embodiment, the original image is divided into partial areas of equal size by the number of divisions P, but it is also possible to divide this into partial areas of predetermined unequal sizes, or to In addition, in the above embodiment, information indicating the size and position of each partial area is stored in the index and file as information indicating the division state, but the size information or position information may be changed. It is also possible to store only one of the pieces of information and obtain it by position or size calculation at the time of search.

Further, in the above embodiment, one index record is provided for one image, but an index record may be provided for each partial area.

Next, a second embodiment of the present invention will be described.

In this second embodiment, an image data record is recorded in an image file 3A without dividing it into a plurality of areas in advance, and when a search image is read out from the image file 3A, an image that substantially corresponds to a partial area specified by an operator is recorded. Data storage position If! (area), and one part of the image data is selectively read out and output to a display device.

In other words, when registering image data to an image file,
As shown in FIG. 10, after the index input is completed in step 114, the entire input image is encoded (compressed) in step 120', and this is written in the image file area 3A of the optical disk in step 128. , step 13
0, an index record is written to the index file area 3B. In this case, the index record has an index field 41 and the storage address of the compressed image data record corresponding to this index, as shown in FIG. In FIG. 0, index records m, m+
1. Image data D (m), D (m
+1).

D (m+2) are sector addresses A (m) and A (m+1) of the image file area 3A, respectively.

It is stored in the recording area starting from A (m+2),
The length of each image data is S (m) and S (m+1).

S (m+2).

A file search in which the index and image data are recorded in the above format is also performed according to the control procedure shown in FIGS. 5(B) to 5(D). In this case, the index searched by the 514th (B) index search (step 136)
A set of records is recorded on the work memory 10 as a record table 80' shown in FIG. Each record consists of an index field 81, an address field 82 for image data, and a field 83 indicating the length of the image data.

The size 5IZE of the partial image to be displayed and the extraction position pos of this partial image are specified in the same manner as in the first embodiment described above, and the reading range of the image data in step 156 is specified as follows. In other words, when reading the image D (mj) corresponding to the j-th record of the record table 80', the first sector of the read range is determined by the following formula (1), and the last sector is determined by the following formula (2). demand.

A(mj)+[S(mj)(PO8/P)/Kl
−a −(1)A(mj)+(S(mj)(
(PO8+SIZE)/P)/K)+β ・(2)
Here, K is the number of data bytes per sector, α and β
are respectively predetermined positive or O constants. Also,
The symbol (X) represents a Gaussian symbol that converts the real number This is based on the idea that the compressed image can be approximately read out by providing margins α and β in the partial areas obtained by equally dividing the compressed image into 1/P.

FIG. 13 is a diagram showing the correspondence between partial areas on the compressed image data 30 recorded in the image file area 3A and partial areas on the image 20 obtained by restoring this. In this example, the compressed image is equally divided into 30ttP (=4) partial areas 31, 32, 33 degrees 34, and α is placed above and below the third partial area 33.

A case is shown in which the area 36 including the spare sector β is set as the data read range. Compressed image 30.

Modified Huff introduced in the above literature
When the original image is compressed by encoding that maintains the breaks between lines, such as in the man encoding method, the final position of each line is located on the compressed image as indicated by the symbol rEOLJ.

An EOL code consists of a specific bit pattern, for example, one bit "1" after a predetermined number of consecutive "0"s, and is a string that is selected from an arbitrary code string read from a file. It can be extracted by matching. When the compressed image includes an EOL code, the data before the first EOL (shaded area) included in the margin area α and the data after the last EOL included in the margin area β are divided into lines or rows on the restored image. There is a possibility that the data is cut off in the middle of the code. Therefore, these data
In step 166 of FIG. 3C, the data is excluded before being restored by the restoration processor, and the data from the first EOL to the last EOL of the read area 36 is restored and output to the display device.

In the two embodiments described above, since one image is displayed, the display position of each image on the display 5 remains unchanged even if the position or size of the partial image specified for display changes. remains unchanged.

However, it is also possible to display a plurality of images in one image by changing the display position of each image as follows.

FIG. 14 shows the display contents of the display 5 when two pieces of partial image data cut out in the state of FIG. 6 (B) or (D) are displayed in each image. The numbers represent image numbers, and in this example, corresponding partial areas of the next image are displayed alternately above and below one image. FIG. 15 shows the display contents of the display 5 when four pieces of partial image data cut out in the state of FIG. 6 (C) or (E) are displayed in one image. The corresponding partial image of the next image is displayed cyclically in the divided display area. These display formats can be easily realized by sequentially changing the addresses of the bitmap memory 16 that stores the restored images in steps 166, 184, 190, and 208 in the flowchart of FIG.

〔Effect of the invention〕

As is clear from the above description, according to the present invention, a part of image data encoded and stored in a file is selectively read out, restored and displayed.
When displaying a plurality of search images in sequence, all of one image can be displayed in a short time. As a result, if the operator remembers the approximate location of the characteristic portion of the target image to be searched, the desired image can be quickly selected from among a large number of images.

[Brief explanation of the drawing]

Figure 1 is a block diagram showing the overall configuration of the image file system, and Figure 2 is one of the storage media that makes up the image file.
A diagram showing an example, FIG. 3 is a diagram for explaining the correspondence between a partial area on the original image data 20 and a partial area on the record 30 recorded on the file, and FIG.・A diagram showing an example of the format,
FIGS. 5A to 5D are flowcharts showing one embodiment of a file system control program according to the present invention;
FIG. 6 is an explanatory diagram of a data search function in a file system to which the present invention is applied, FIG. 7 is a diagram showing an embodiment of a keyboard, and FIG. 8 is an illustration of an index record consisting of an index record of image data to be displayed.・An explanatory diagram of a table; FIG. 9 is a flow chart showing an example of a program for changing the display position and size of image data; FIG. 10 is a flow chart showing an example of a program for changing the display position and size of image data; FIG. 11 is a diagram for explaining the relationship between the record format of the index file and the image data file in the second embodiment, and FIG. 12 is a program flowchart for recording the search record in the second embodiment. A diagram showing a table, FIG. 13 is a diagram for explaining the relationship between the readout range of image data and a restored image in the second embodiment, and FIGS. 14 and 15 respectively show other data display formats according to the present invention. It is a figure showing an example. 3A... Image file, 3B... Index file, 20... Original image data, 21-24... Partial area, 30... Compressed data (encoding) record, 31
~34... Encoding partial area, A(1) to A(4)...
·address.

Claims (1)

[Claims] 1. An image file storing compressed image data records and index records containing position information of the image data records on a file medium.
A method for displaying a search image in the system, which includes a first step of specifying the position of a partial area of the search image to be displayed on the display screen, and a step based on the position information included in the index record corresponding to the search image. , a second step of determining a recording position of an image data portion corresponding to the designated position on the file medium, and a third step of accessing the recording position on the file medium to partially read the image data record; and a fourth step of restoring the read image data and outputting it to a display screen. 2. According to the position of the partial area specified in the first step, the operations from the second step to the fourth step are continuously repeated for a plurality of search images. How to display search images. 3. Each of the image data records is made up of partial areas divided into a plurality of parts, and each index record stores position information of the corresponding image data record for each of the partial areas, and the first step 2. The method according to claim 1 or 2, wherein the partial region position designation in step 1 is performed using the divided partial regions as a unit, and the second step is performed according to position information for each partial region. How to display search images. 4. In the second step, the corresponding image data record is equally divided into a plurality of partial areas based on the position information, and among these partial areas, the area expanded from the partial area corresponding to the designated position is 3. The search image display method according to claim 1 or 2, wherein the image data is partially read out in the third step.