JPH0785096A - Image information filing device - Google Patents

Abstract

(57) [Summary] [Purpose] When storing code data for generating an image, it is possible to specify whether or not to store the image data generated from the code data together. [Arrangement] The designation means designates whether or not to store the image data, and the storage means stores the code data for generating the image information and also stores the image data generated from the code data based on the designation of the designation means, The display means reads and displays the image data for the code data whose image data is stored in the storage means, and reads the code data for the code data in which the image data is not stored in the storage means. Generate the image data and display it.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image information filing apparatus capable of turning over and searching coded image information.

[0002]

2. Description of the Related Art In a so-called image information filing apparatus for electronically storing and retrieving image information such as documents and drawings, it is necessary to eliminate complicated keyword assignment work.
A page-turning search search has been proposed in which a search performed by flipping through image information just recorded on paper is reproduced as it is on a display (for example, Japanese Patent Laid-Open No. 57-1).
08961).

In order to make such a page-turning search practical, the time required for the page-turning reading, that is, the time from displaying one image information to displaying the next image information is shortened, and the search is performed. It is necessary to reduce the total time required for

One of the techniques for shortening this time is to generate image data from code data, especially for those that generate image information of documents and drawings as code data, such as word processors and computer graphics. In order to exclude the required time from the execution time of the page-reading search, the code data and the image data generated from the code data are stored as a pair when the image information is registered, and are stored when the image information is searched. A technique has been proposed in which the image data that is read out is displayed and the corresponding code data is obtained as a search result (see, for example, Japanese Patent Laid-Open No. 60-207975).

[0005]

However, such a technique consumes a very large storage capacity as compared with the case of storing only the code data in order to always store both the code data and the image data. Therefore, there is a problem that the number of image information that can be stored is significantly reduced.

[0006] This will be specifically shown by taking the case of creating image information of a document by a word processor as an example. A single character such as Japanese kanji or kana can be expressed by 2-byte code data if expressed by an EUC code or the like. Even if it is assumed that additional 3 bytes of additional information is required as data such as character modification peculiar to a word processor, a capacity of 5 bytes per character is sufficient for storing code data. On the other hand, in order to store this character as image data composed of a binary 32 dot × 32 dot bitmap, for example, per character (32 ×
A capacity of 32/8) bytes, that is, 128 bytes is required. Even if it is assumed that the image data can be compressed to a one-fifth data amount by encoding such as run-length encoding, storage of the encoded image data requires a capacity of about 25 bytes per character. Therefore, when storing both character code data and image data,
Even if the increase in the image data due to the blank spaces normally provided on the top, bottom, left and right of the document image is ignored, the storage capacity is about (1 + 25/5) times, that is, about 6 times as large as that when only the code data is stored. As a result, the number of image information that can be stored will be reduced.

In order to solve the above problems, the present invention provides
This is done for the purpose of designating whether or not to also store the image data generated from the code data when storing the code data for generating an image.

[0008]

In order to achieve the above-mentioned object, the invention according to claim 1 includes a designation means for designating whether or not to store image data, and a storage of code data for generating image information. Storage means for storing the image data generated from the code data based on the designation of the designation means, and for the code data in which the corresponding image data is stored in the storage means, the image data is read and displayed to correspond. For code data whose image data is not stored in the storage means, a display means is provided for reading the code data and generating corresponding image data, and displaying the image data. The image data is displayed based on the image data displayed by the display means. An image information filing device characterized by searching code data corresponding to data

According to a second aspect of the present invention, the image information represented by the code data whose corresponding image data is stored in the storage means is represented by the image information represented by the code data whose corresponding image data is not stored in the storage means. The image information filing apparatus according to claim 1, wherein the image information filing apparatus is displayed with higher priority.

Further, the invention of claim 3 has an image generation time measuring means for measuring a time required for generating the image data from the code data, and the designating means is a measurement value of the image generation time measuring means. The image information filing apparatus according to claim 1, wherein whether to store the image data is designated based on the designation.

According to a fourth aspect of the present invention, a coding means for coding the image data, a decoding means for decoding the coded image data, and a time required for decoding the coded image data. Decoding time measuring means for measuring, the storing means stores encoded image data, and the designating means stores an image based on the measured value of the image generation time measuring means and the measured value of the decoding time measuring means. The image information filing apparatus according to claim 3, wherein whether or not to store the data is designated.

Further, the invention of claim 5 has free space measuring means for measuring the size of an unused area existing in the storage means, and the designating means is based on the measured value of the free space measuring means. The image information filing apparatus according to claim 1, wherein whether or not to store is designated.

Further, the invention according to claim 6 is the image information filing apparatus according to claim 1, characterized in that it has an erasing means for erasing the image data stored in the storage means.

According to a seventh aspect of the present invention, the storage means specifies the image data generating means for generating the image data from the code data and the image data generated by the image data generating means together with the storing of the code data in the designation means. The image information filing apparatus according to claim 1, further comprising means for storing based on the above.

According to the invention of claim 8, the storage means is an image data generating means for generating image data from the code data based on the designation by the designating means, and the image data generated by the image data generating means together with storing the code data. The image information filing apparatus according to claim 1, further comprising means for storing.

[0016]

With the above structure, in the invention of claim 1,
The designation means designates whether or not to store the image data, and the storage means pairs the code data for generating the image information with the image data generated from the code data based on the designation by the designation means, or Code data in which only image data is stored and corresponding image data in the display means is read out and displayed for the code data stored in the storage means, and corresponding image data is not stored in the storage means For, the code data is read and corresponding image data is generated and displayed.

According to the second aspect of the invention, the image information represented by the code data whose image data corresponding to the display means is stored in the storage means is represented by the code data in which the corresponding image data is not stored in the storage means. Is displayed with priority over the image information represented by.

Further, in the invention of claim 3, the image generation time measuring means measures the time required for generating the image data from the code data, and the designating means is based on the measured value of the image generation time measuring means. Specifies whether image data should be stored.

According to the invention of claim 4, the encoding means encodes the image data, the decoding means decodes the encoded image data, and the decoding time measuring means of the encoded image data. Should the time required for decoding be measured, the storage means store the encoded image data, and the designation means store the image data based on the measurement value of the image generation time measuring means and the measurement value of the decoding time measuring means? Specify whether or not.

Further, in the invention of claim 5, the free space measuring means measures the size of the unused area existing in the storage means, and the designating means stores the image data based on the measurement value of the free space measuring means. Specify whether or not to do it.

Further, in the invention of claim 6, the erasing means erases the image data stored in the storage means.

Further, in the invention of claim 7, the image data generating means generates the image data from the code data, and the storing means stores the code data and designates the image data generated by the image data generating means by the designating means. Memorize based on.

In the invention of claim 8, the image data generating means generates image data from the code data based on the designation of the designating means, and the storing means stores the image data generated by the image data generating means. .

[0024]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be described in more detail below with reference to the drawings.

FIG. 1 is a block diagram showing a first embodiment of an image information filing apparatus of the present invention.

In FIG. 1, reference numeral 100 is a data bus, and a CPU 10, a keyboard 11, an FDD 12, and a changeover switch 13 are connected to the data bus 100. Here, the changeover switch 13 is a switch whose state can be set to ON / OFF by the user, and the state can be read by the CPU 10.

A code data file 14 and an image data file 15 are connected to the data bus 100. The code data file 14 is a file provided on a storage medium such as a hard disk, an optical disk, or a memory, which stores code data for generating an image such as a document created by a word processor or the like. Also,
The image data file 15 is a file that stores image data of an image generated from code data and is provided on the same storage medium as the code data file 14.

A database 16 is connected to the data bus 100. The database 16 stores the accommodation address of the contents stored in the code data file 14 and the accommodation address of the contents stored in the image data file 15.

An image generator 17 is connected to the data bus 100. The image generator 17 receives code data as input, and uses a font table or a graphic processor for a general-purpose computer to generate image data for one page consisting of character images and graphic images according to the input code data. Is.

Further, an image memory 18 and a display 19 are connected to the data bus 100.

Next, the operation will be described. First, the case of registering image information will be described.

Now, it is assumed that the code data of the image information to be registered is given via the floppy disk. This floppy disk is set in the FDD 12.

In this state, if the user uses the keyboard 11 to instruct registration of image information, the CPU 10 causes the F
The DD 12 is driven, and the code data, which is the content thereof, is read from the set floppy disk. The read code data is input to the image generator 17, the corresponding image data is generated by the image generator 17, and is stored in the image memory 18. The image data stored in the image memory 18 is displayed on the display 19.

When the user confirms the content of the displayed image information and instructs the registration of the image information using the keyboard 11, the CPU 10 drives the FDD 12 again,
The same code data as before is read again from the floppy disk and stored in the code data file 14. Hereinafter, for convenience of description, the accommodation address on the code data file 14 in which this code data is stored is represented by A1.

The accommodating address A1 of the code data is stored in the database 16. After this, changeover switch 1
The state of 3 is read by the CPU 10.

When the changeover switch 13 is ON, the CPU 10 determines that the code data and the image data should be stored in association with each other, and the contents of the image memory 18 are stored in the image data file 15. At the same time, the accommodation address on the image data file 15 is stored in the database 16 in association with the accommodation address A1 of the code data. On the other hand, when the state of the changeover switch 13 is OFF, the image data corresponding to the code data should not be stored in the CPU.
Nothing is stored in the image data file 15, and a special value NULL indicating that the image data does not exist is stored in the database 16 in association with the accommodation address A1 of the code data.

Thereafter, in the same manner, new image information is sequentially registered. Next, the contents stored in the code data file 14, the image data file 15, and the database 16 will be described in more detail using concrete examples.

Now, five code data C for generating an image
21 to C25 are registered, and the code data C21,
When C23 is registered, the user has set the changeover switch 13 to ON, and the code data C22, C2
It is assumed that the user has set the changeover switch 13 to OFF when 4, C25 are registered. At this time, the code data file 14 and the image data file 1
5. The database 16 stores information as shown in FIG.

In FIG. 2, A21 to A25 are code data C21 to C21 stored in the code data file 14.
The accommodating address of C25, D21 and D23 are image data generated from the code data C21 and C23 using the image generator 17, and B21 and B23 are image data D2 stored in the image data file 15.
It is the accommodation address of D23.

In the code data file 14, the code data C21 to C25 are respectively stored addresses A21 to A.
25.

In the image data file 15, the image data D corresponding to the code data C21 and C23 registered while the changeover switch 13 is set to ON.
21 and D23 are accommodation addresses B21 and B23, respectively.
And the code data C22 and C2 stored in the register stored while the changeover switch 13 is set to OFF.
Image data corresponding to C4 and C25 are not stored.

The database 16 has a changeover switch 1
The storage addresses A21 and A23 of the code data C21 and C23 and the storage addresses B21 and B23 of the image data D21 and D23 registered while 3 is set to ON.
Are stored in association with each other, and the accommodating addresses A22, A of the code data C22, C24, C25 registered while the changeover switch 13 is set to OFF.
NULL is associated with each of 24 and A25 and stored.

Next, the case of retrieving code data will be described. When the user gives an instruction to search using the keyboard 11, all pairs of the code data accommodating address and the image data accommodating address stored in the database 16 are read. Next, the CPU 10 sequentially selects, from the read accommodation addresses, those whose image data accommodation address is not NULL, and sequentially reads the image data stored at the accommodation addresses in the image data file 15. Is displayed on the display 19. When the display of the image information in which the image data accommodating address is not NULL is completed, the image data accommodating addresses of NULL are sequentially selected, and the code data accommodating address read from the database 16 is used as an address in the code data file 1
The code data stored in FIG. 4 is read, and the image data is generated by the image generator 17 from the code data and displayed on the display 19.

For example, taking the case where the image information is stored as shown in FIG. 2, first, the image data file 15 to the image data D2 are stored with B21 as an address.
1 is read and displayed on the display 19, and then the image data file 1 with B23 as an address.
The image data D23 is read from 5 and displayed on the display 19. After that, A22, A24, A
The code data C22, C24, C25 is read from the code data file 14 using 25 as an address, and the corresponding image data is generated by the image generator 17 and displayed on the display 19.

Returning to FIG. 1, the user can display 19
The images displayed in are checked one by one, and when a desired image is displayed, a specific key of the keyboard 11 is pressed.
When the code data of the image displayed when this key is pressed is read from the code data file 14, the search result of the image information is obtained.

The read code data is FDD12.
It is also possible to write to a new floppy disk via, or to directly read by connecting a high speed network to the data bus 100 separately. Alternatively, the image generator 17 may generate corresponding image data and read the image data.

According to the present embodiment, when the user can assume that the user wants to take out the code data frequently when registering the image information, the changeover switch 13 is set to ON and the code data and the image data are paired. To remember,
It is possible to prevent the reading speed from slowing down depending on the operating speed of the image generator 17, and to turn off the changeover switch 13 for image information that can be assumed not to be taken out so much.
By setting to and storing only code data,
The storage capacity required to store image information can be reduced, and the number of image information that can be registered can be increased.

Further, according to the present embodiment, the image information stored by pairing the code data and the image data is first displayed on the display 19, and the image information storing only the code data is displayed thereafter. Therefore, it is possible to find the registered image information more quickly, assuming that the code data is frequently fetched, as compared with the case where all the image information is stored as a pair of code data and image data. FIG. 3 is a configuration diagram showing a second embodiment of the image information filing apparatus of the present invention.

In FIG. 3, 30 is a CPU, and 33
Is a clock. The time indicated by this clock can be read by the CPU 30.

Other components that operate in the same manner as in FIG. 1 are assigned the same numbers as in FIG. 1 and their detailed description is omitted.

In the operation of the image information filing apparatus of this embodiment, the CPU 30 determines whether or not image data should be stored at the time of registration, as compared with the image information filing apparatus of the first embodiment shown in FIG. Only the operation and the order in which the image information is displayed on the display 19 during the search are different.

First, the operation at the time of registration will be described.
Now, it is assumed that code data of image information to be registered is given via a floppy disk. This floppy disk is set in the FDD 12.

In this state, when the user uses the keyboard 11 to instruct registration of image information, the CPU 30 causes the F
The DD 12 is driven, and the code data, which is the content thereof, is read from the set floppy disk.

After reading the code data, the clock 3
The time of 3 is read by the CPU 30 and temporarily stored.

After that, the code data read from the floppy disk is input to the image generator 17, and the corresponding image data is generated by the image generator 17 and stored in the image memory 18.

The image data stored in the image memory 18 is displayed on the display 19.

When the user confirms the content of the displayed image information and instructs the registration of the image information using the keyboard 11, the CPU 30 drives the FDD 12 again,
The same code data as before is read again from the floppy disk, stored in the code data file 14, and its accommodation address is stored in the database 16.

When the image generator 17 has finished generating the image data from the code data,
The time of the timepiece 33 is read again by the CPU 30, and the time required to generate the image data from the code data is calculated as the difference between the time of being read from the timepiece 33 and temporarily stored.

If the calculated time is larger than a preset threshold value, the CPU 30 determines that the code data and the image data should be stored in association with each other, and the calculated time is determined to be greater than the threshold value. If it is smaller than or equal to the threshold value, it is determined that the image data corresponding to the code data should not be stored.

Since the registration operation thereafter is exactly the same as that of the image information filing apparatus of FIG. 1, its explanation is omitted.

Next, the case of retrieving code data will be described. When the user instructs a search by using the keyboard 11, the pair of the accommodation address of the code data and the accommodation address of the image data stored in the database 16 are sequentially arranged one by one from the one stored at the frontmost position. Read.

If the read image data accommodating address is not NULL, the image data file 1
The image data stored in the accommodation address in 5 is read and displayed on the display 19. On the other hand, when the image data accommodating address is NULL, the code data stored in the code data file 14 is read by using the code data accommodating address as an address, and the image generator 17 generates image data data from the code data. It is displayed on the display 19.

Thereafter, similarly, the already registered image information is sequentially read and displayed on the display 19.

For example, taking the case where the image information of FIG. 2 is stored as an example, first, the image data D21 is read from the image data file 15 using B21 as an address and displayed on the display 19, and then A2.
2 is used as an address to read the code data C22 from the code data file 14, and the image generator 1
The corresponding image data is generated by 7 and displayed on the display 19. After that, the image data D2 is read from the image data file 15 using B23 as an address.
3 is read and displayed on the display 19, and code data C24 and C25 are sequentially read from the code data file 14 using A24 and A25 as addresses, and corresponding image data is generated by the image generator 17 and displayed on the display 19. To be done.

Returning to FIG. 3, the user can display 19
The images displayed in are checked one by one, and when a desired image is displayed, a specific key of the keyboard 11 is pressed.
When the code data of the image displayed when this key is pressed is read from the code data file 14, the search result of the image information is obtained.

According to the present embodiment, by setting a value indicating a sufficiently short time (for example, 0.2 seconds or less) as the threshold value, there is no problem even when displaying while generating image data from code data. For image information that can generate image data at high speed enough to perform turn-over search without storing only code data and displaying while generating image data from code data takes too long to display Image data is generated in advance at the time of registration and stored as a pair with the code data, and at the time of retrieval, the stored image data is read and displayed at high speed regardless of the time required to generate the image data. Even for information, the storage capacity required to store image information can be reduced without sacrificing search speed, and registration can be performed. The number of image information it is possible to increase that. FIG. 4 is a block diagram showing a third embodiment of the image information filing apparatus of the present invention.

In FIG. 4, 40 is a CPU, and 41
Is an encoder and 42 is a decoder. Encoder 41
Is for encoding the image data by a data compression algorithm such as run-length encoding, and the decoder 42 is for decoding the encoded image data and restoring it.

A code memory 43 is connected to the bus 100. The code memory 43 stores the image data encoded by the encoder 41.

Other components having the same operations as those in FIG. 3 are designated by the same reference numerals as those in FIG. 3, and detailed description thereof will be omitted.

The operation of the image information filing apparatus of this embodiment is such that the image data stored in the image data file 15 is encoded as compared with the image information filing apparatus of the second embodiment shown in FIG. The only difference is that the CPU 40 determines whether or not to store image data during registration.

First, the operation at the time of registration will be described.
Now, it is assumed that code data of image information to be registered is given via a floppy disk. This floppy disk is set in the FDD 12.

In this state, when the user uses the keyboard 11 to instruct registration of image information, the CPU 40 causes the F
The DD 12 is driven, and the code data, which is the content thereof, is read from the set floppy disk.

When the reading of the code data is completed, the clock 3
The time 3 is read by the CPU 40 and temporarily stored.

Thereafter, the code data read from the floppy disk is input to the image generator 17, and the corresponding image data is generated by the image generator 17 and stored in the image memory 18.

The image data stored in the image memory 18 is displayed on the display 19.

When the user confirms the contents of the displayed image information and instructs the registration of the image information using the keyboard 11, the CPU 40 drives the FDD 12 again,
The same code data as before is read again from the floppy disk and stored in the code data file 14. Hereinafter, for convenience of description, the accommodation address on the code data file 14 in which this code data is stored is represented by A4.

When the image generator 17 has finished generating the image data from the code data,
The time of the timepiece 33 is read again by the CPU 40, and the time required to generate the image data from the code data is calculated as the difference between the time of the time previously read from the timepiece 33 and temporarily stored.

After that, the image data stored in the image memory 18 is run-length coded by the encoder 41, and the coded image data is stored in the code memory 43.

Subsequently, the encoded image data is read from the code memory 43, decoded by the decoder 42, returned to the original state, and stored in the image memory 18.

The time of the clock 33 is set to the CPU at the start and end of the decoding of the image data by the decoder 42.
The time required for decoding is calculated as the difference between the two times read by 40.

Furthermore, the time required for this decoding is compared with the time required for generating image data from the previously calculated code data, and if the time required for decoding is shorter, The CPU 40 determines that the code data and the image data should be stored in association with each other, the content of the code memory 43 is stored in the image data file 15, and the storage address on the image data file 15 stores the code data. It is stored in the database 16 in association with the address A4. On the other hand, if the time required for decoding is longer or both are the same, the CPU 40 determines that the image data corresponding to the code data should not be stored, and nothing is stored in the image data file 15. Not, database 16
Stores a special value NULL indicating that there is no image data in association with the accommodating address A4 of the code data.

Thereafter, new image information is sequentially registered in the same manner. Image data file 15 when searching
The image data read from is displayed on the display 19 after being decoded by the decoder 42.
Except for this, the operation at the time of retrieval is exactly the same as that of the image information filing apparatus in FIG. 3, and therefore detailed description will be omitted.

According to the present embodiment, the image data is compressed and stored by the run length coding, so that the storage capacity required for storing the image data can be reduced and the coded image data can be decoded. Image data can be generated faster than code data. Image data is not stored for image information, only code data is stored, and coded image data is decoded faster than image data is generated from code data. For image information that can be converted, the code data and the image data are stored as a pair, so compared to the case where the image data is simply encoded and stored, the image can be read without slowing down the search speed. The storage capacity required for storing information can be reduced.

In the above description, the case where encoder 41 performs run-length encoding has been described as an example, but the encoding and decoder 42 performed by encoder 41 is performed.
Decryption is performed by MMR used in G4 fax.
Of course, another encoding algorithm such as encoding may be used.

FIG. 5 is a block diagram showing the fourth embodiment of the image information filing apparatus of the present invention.

In FIG. 5, reference numeral 50 is a CPU. Figure 3
Other components that operate in the same manner as in (1) are assigned the same numbers as in FIG. 3, and detailed description thereof is omitted.

Next, the operation will be described. First, the case of registering image information will be described.

Now, it is assumed that the code data of the image information to be registered is given via the floppy disk. This floppy disk is set in the FDD 12.

In this state, if the user uses the keyboard 11 to instruct registration of image information, the CPU 50 causes the F
The DD 12 is driven and the size of the code data on the set floppy disk is checked. Also, CPU
50, the free space of the storage medium in which the code data file 14 and the image data file 15 are provided,
That is, the size of the unused area in which new data can be stored is checked.

After that, the CPU 50 compares the free space of the storage medium with the size of the code data on the floppy disk. If the size of the code data is larger than the free space, it is stored in the image data file 15. Of the image data already stored, the one stored at the frontmost position is erased, and the accommodation address of the image data stored in the database 16 is rewritten to NULL. After this image data erasing operation, the free space of the storage medium is checked again, and the free space is larger than the size of the code data on the floppy disk, or both are in the same state, or the image data file 15 The erase operation is repeated until there is no image data in it. Even if the image data does not exist in the image data file 15, if the size of the code data on the floppy disk is larger than the free space, the display 19 indicates that the image information cannot be registered.
Is displayed and the registration process is interrupted. On the other hand, if the first available free space is larger than the size of the code data on the floppy disk, or if both are equal, or the free space is the size of the code data on the floppy disk as a result of erasing the image data. If it is greater than or equal to both, then no further erase operation is performed.

After the free space is compared with the size of the code data on the floppy disk, and the image data is erased as necessary, the CPU 50 executes the F
The DD 12 is driven, and the code data, which is the content thereof, is read from the set floppy disk.

The read code data is stored in the code data file 14. Hereinafter, for convenience of explanation, the code data file 14 in which this code data is stored
The accommodation address above is represented by A5.

The accommodating address A5 of the code data is stored in the database 16. After that, the free space of the storage medium that has been previously checked is compared with a preset threshold value, and if the free space is larger than the threshold value, the code data and the image data should be stored in association with each other. The CPU 50 determines that there is, and the FDD 1 is determined by the CPU 50.
2 is driven again and the same code data as before is read again from the floppy disk. The read code data is input to the image generator 17, and the image data generated by the image generator 17 is stored in the image data file 15. Furthermore, the accommodation address on the image data file 15 is
It is stored in the database 16 in association with the accommodation address A5 of the code data. On the other hand, when the free space is smaller than the threshold value or equal to the threshold value, it is determined that the image data corresponding to the code data should not be stored, and nothing is stored in the image data file 15. A special value NULL indicating that image data does not exist is stored in the database 16 in association with the accommodation address A5 of the code data.

Thereafter, new image information is sequentially registered in the same manner. Since the operation at the time of retrieval is exactly the same as that of the image information filing apparatus in FIG. 3, detailed description will be omitted.

According to this embodiment, the code data and the image data are stored in pairs while the free space of the storage medium is large, and the turning speed becomes slow depending on the operating speed of the image generator 17. When the free space of the storage medium becomes small, the storage capacity required to store the image information is reduced and the number of image information that can be registered is increased by storing only the code data. By effectively utilizing the capacity of, it is possible to appropriately select an increase in search speed and an increase in image information that can be stored.

When the free space becomes so small that the code data is hindered to be stored, the already stored image data is erased to secure the space for storing the code data. It is possible to further increase the number of image information that can be registered.

The present invention is not limited to the above-described embodiments, but can be implemented with various modifications without departing from the scope of the invention.

For example, in any of the embodiments, the FD
An optical disk drive may be provided instead of D, and image information to be registered may be given via the optical disk. Alternatively, the image information filing device may be connected to a word processor or computer graphics device via a network such as an optical cable so that image information can be provided via the network. Alternatively,
The function of the image information filing device may be incorporated in a word processor or computer graphics device.

When registering image information, a classification code for classifying the image information is input from the keyboard and stored in the database together with the accommodation address. At the time of retrieval, the classification code is input from the keyboard and the image information stored together with the classification code is stored. You may make it turn over and search only as a display object.

Further, a plurality of image memories are provided, and at the time of retrieval, the image data stored in one of the image memories is displayed, and while the image data is being displayed, the next image information is displayed in the CPU as code data. The image data to be displayed next may be read from a file or an image data file and created in a different image memory.

Instead of displaying the image information page by page, a plurality of image information may be displayed simultaneously by cutting out a part of the image data or thinning out the image data to reduce the size.

In the image information filing apparatuses of the second to fourth embodiments, the display order of the image information is displayed such that the image information registered at the rearmost position is displayed at the time of retrieval. You may change it.

In the image information filing devices of the first to third embodiments, the code data file and the image data file may be provided on different storage media. In this case, the image data file can be provided on a storage medium having a smaller capacity than the case where the image data of all the image information is stored in the image data file.

In the image information filing apparatus of the second and third embodiments, a temporary storage area is provided in the code data file, and the code data read from the FDD is stored in the temporary storage area before being input to the image generator. The second read of the code data from the FDD may be stored in the area and the read from the temporary storage area may be used instead. In this way, when the reading speed is faster when reading the code data from the code data file than when reading the code data from the FDD, it is possible to reduce the time required to register the image information. Further, when calculating the time required to generate the image data, the code data is read from the temporary storage area and input to the image generator, and the time required from the start of reading to the end of the generation of the image data is calculated. You may let me. In this way, should the code data and the image data be stored as a pair based on the sum of the time required to read the code data from the code data file and the time required for the image generator to generate the image data? It is possible to determine whether to store only the code data. Similarly, in the image information filing apparatus of the third embodiment, the code memory is eliminated, and instead, a temporary storage area is also provided in the image data file, and the image data encoded by the encoder is stored in the code memory. Instead of this, it may be stored in a temporary storage area provided in the image data file. In this way, since the image data file having a large capacity can eliminate the code memory without changing the capacity, the image information filing apparatus can be realized with smaller hardware. Further, in this case, the time required for decoding the encoded image data is further calculated including the time required for reading the encoded image data from the temporary storage area provided in the image data file. You may let me.

Further, the function of erasing image data is removed from the fourth embodiment, and if the size of the code data on the floppy disk is larger than the free space of the storage medium, the registration process is immediately interrupted. You may

[0106]

As described above with reference to various examples, according to the present invention, only code data representing image information is stored or image data generated from the code data is paired with the code data. Since it can be specified for each image information whether or not to be stored, it consumes a lot of storage capacity that occurs when unconditionally storing both code data and image data for all image information.
The excellent effect that the problem that the number of image information that can be stored is reduced can be obtained.

[Brief description of drawings]

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

FIG. 2 is an explanatory diagram showing code data and image data stored in the first embodiment.

FIG. 3 is a configuration diagram of a second embodiment of the present invention.

FIG. 4 is a configuration diagram of a third embodiment of the present invention.

FIG. 5 is a configuration diagram of a fourth embodiment of the present invention.

[Explanation of symbols]

 10 CPU 11 Keyboard 12 FDD 13 Changeover Switch 14 Code Data File 15 Image Data File 16 Database 17 Image Generator 18 Image Memory 19 Display 30 CPU 33 Clock 40 CPU 41 Encoder 42 Decoder 43 Code Memory 50 CPU 100 Data Bus

Claims (8)

[Claims] 1. A designation unit for designating whether or not to store image data, a storage unit for storing code data for generating image information, and a storage unit for storing image data generated from this code data based on the designation by the designation unit. Means and corresponding image data for the code data stored in the storage means, the image data is read and displayed, and for the code data in which the corresponding image data is not stored in the storage means. Image information characterized by comprising display means for reading the code data to generate corresponding image data and displaying the image data, and searching code data corresponding to the image data from the image data displayed on the display means. Filing equipment. 2. The display means displays the image information represented by the code data in which the corresponding image data is stored in the storage means, from the image information represented by the code data in which the corresponding image data is not stored in the storage means. The image information filing device according to claim 1, wherein the image information filing device is displayed with priority. 3. An image generation time measuring means for measuring a time required for generating the image data from the code data, wherein the designating means stores the image data based on a measurement value of the image generation time measuring means. The image information filing apparatus according to claim 1, wherein whether or not to do so is designated. 4. A coding means for coding image data, a decoding means for decoding the coded image data, and a decoding time measurement for measuring the time required for decoding the coded image data. And means for storing,
The encoded image data is stored, and the designating means designates whether or not to store the image data based on the measurement value of the image generation time measuring means and the measurement value of the decoding time measuring means. The image information filing device according to claim 3. 5. A free capacity measuring means for measuring the size of an unused area existing in the storage means, wherein the designating means should store the image data based on the measurement value of the free capacity measuring means. The image information filing apparatus according to claim 1, wherein 6. An erasing means for erasing the image data stored in the storing means.
The described image information filing device. 7. The storage means has image data generation means for generating image data from code data, and means for storing the code data and storing the image data generated by the image data generation means based on the designation of the designation means. The image information filing apparatus according to claim 1, wherein 8. The storage means has an image data generating means for generating image data from the code data based on the designation of the designating means, and a means for storing the image data generated by the image data generating means together with storing the code data. The image information filing apparatus according to claim 1, wherein