JPH04373073A - Image retrieval system - Google Patents

Abstract

PURPOSE:To provide the image retrieval system which can efficiently retrieve images while suppressing image data for reduced images comparatively a little. CONSTITUTION:A reference image preparation part 3 prepares a reference image as the reduced image, sets first and second areas in each reference image and prepares partial reference image data for each area. An image development part 41 develops the reference images onto a frame memory 8 while partially overlapping them each other and stores the image data in the first area of each reference image in a RAM 9 for reference image. When an operator selects one reference image by using a mouse 11, an image data reloading part 42 reads the image data in the first area of the selected reference image from the RAM 9 for reference image, writes the data in the frame memory 8 and displays the entire reference image. The image reloading part 42 saves the image data in the second area of the reference image hidden by the selected reference image into an image save memory 7.

Description

[Detailed description of the invention]

0001

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system for searching for a desired image from among a plurality of images.

0002

[Background Art] Developments in information processing technology in recent years (in particular, the spread of rewritable large-capacity optical discs, the development of communication networks,
(and improvements in the processing power of general-purpose processors such as RISC), image retrieval systems for storing, managing, and retrieving images are being put into practical use in fields that handle large amounts of images, such as printing and platemaking. be.

[0003] As an image retrieval system, for example, there is one described in Japanese Patent Laid-Open No. 2-202766. In this system, in addition to image data representing an original size image, first reduced image data representing a relatively small reduced image and second reduced image data representing a relatively large reduced image are prepared. When searching for an image, a large number of relatively small reduced images are arranged on the screen without gaps. Since the reduced images displayed in this manner are too small, if there are multiple similar images, it is difficult to accurately select a desired image. Therefore, the operator selects a reduced image and changes it to a relatively large reduced image. After confirming that the relatively large reduced image is the desired image, the operator instructs reading image data representing the original size image from the storage means.

0004

[Problems to be Solved by the Invention] In the conventional image retrieval system described above, it is necessary to prepare first and second reduced image data for a relatively small reduced image and a relatively large reduced image. There is a problem in that in addition to the image data of the images, a memory is required to store this large amount of image data. Note that if an attempt is made to search for an image using only relatively small reduced images, as described above, if there are a plurality of similar images, it will be difficult to accurately select a desired image.

On the other hand, if an attempt is made to search for images using only relatively large reduced images, fewer images can be arranged on the screen. As a result, in order to search for a desired image from among a large number of images, a screen on which reduced images are arranged must be displayed many times, resulting in a problem that the search efficiency is reduced.

The present invention has been made in order to solve the above-mentioned problems in the prior art, and provides an image that allows efficient image retrieval while keeping the amount of image data for reduced images to a relatively small amount. The purpose is to provide a search system.

[0007]

[Means for Solving the Problem] In order to solve the above-mentioned problem, an image retrieval system according to claim 1 includes an image display means for displaying an image, and an image search system for displaying an image on the image display means. By processing the original image data representing each original image with respect to each of a plurality of original images and a frame memory that stores image data, a predetermined size including at least a part of a reduced image obtained by reducing each of each original image is obtained. an image reduction means for creating reference image data representing a reference image of the image; a first area for positioning the reference image at the beginning of the reference image in a predetermined direction defined on the image display means;
a second area located at the rear end in the predetermined direction; and area dividing means for dividing the reference image data into partial reference image data for each divided area. and a reference image data storage means for storing partial reference image data of the first and second regions, respectively, for each of the plurality of reference images, and partial reference image data of the first region of the plurality of reference images. RAM for reference image data to temporarily store the data, and RAM for arbitrary image data to store arbitrary image data.
By expanding M and the reference image data in the frame memory, the plurality of reference images are arranged along the predetermined direction, and the first area and the second area of adjacent reference images are Comparing the priorities of the second area of the reference image with a relatively high priority specified in advance while overlapping each other at an overlapping part of a size that does not exceed the smaller of the first and second areas. selecting one of the plurality of reference images displayed on the image development means for developing the reference image data and the image display means so as to display the reference image with priority over a first region of the reference image having a low target; a means of selection for;
The partial reference image data of the first area of the reference image selected by the selection means is read from the reference image data RAM and written into the frame memory, and the partial reference image data of the first area of the selected reference image is read out from the reference image data RAM and written to the frame memory. Partial reference image data of a second area of the reference image that is hidden is stored in the arbitrary image data RAM, and further, partial reference image data of the second area of the selected reference image is stored in the arbitrary image data. image data rewriting means for reading partial reference image data of a second area of the selected reference image from the arbitrary image data RAM and writing it into the frame memory. . The image search system according to claim 2 also includes an image display means for displaying an image, a frame memory for storing image data of an image displayed on the image display means, and a frame memory for storing each of the plurality of original images. , an image reduction means for processing original image data representing each original image to create reference image data representing a reference image of a predetermined size including at least a part of a reduced image obtained by reducing each original image; , the reference image includes at least a first region located at the leading end in a predetermined direction defined on the image display means, and a second region located at the rear end in the predetermined direction. an area dividing means that divides the reference image data into two areas and divides the reference image data into partial reference image data for each divided area; and a part of the first and second areas for each of the plurality of reference images. a reference image data storage means for respectively storing reference image data; a reference image data RAM for temporarily storing partial reference image data for the first and second regions of the plurality of reference images;
By developing the reference image data in the frame memory, the plurality of reference images are arranged along the predetermined direction, and the first area and second area of adjacent reference images are and the second area, whichever is smaller, overlap each other with an overlapping area of a size that does not exceed the smaller of the two areas, and the second area of the reference image with a relatively high priority specified in advance is replaced by a reference image with a relatively low priority. Image development means for developing the reference image data so as to be displayed with priority over a first region of the image; and selection for selecting one of the plurality of reference images displayed on the image display means. and an image data rewriting means for reading partial reference image data of the first and second regions of the reference image selected by the selection means from the reference image data RAM and writing them into the frame memory.

[0008]

[Operation] A plurality of reference images created by the image reduction means are displayed on the image display means and used for image retrieval. The image development means develops the reference images in the frame memory in order to display a plurality of reference images, and at this time, adjacent reference images are caused to partially overlap each other according to a predetermined priority. The region dividing means divides the region into a plurality of regions including first and second regions having a size at least larger than the overlapping portion, and creates partial reference image data for each region. These partial reference image data are
The reference image data is stored in the reference image data storage means.

In the image retrieval system of the first aspect, partial reference image data of the first area is stored in a reference image data RAM. Further, a RAM for arbitrary image data is prepared for storing partial reference image data of the second area. One of the reference images displayed on the image display means by the selection means
is selected, the image data rewriting means reads the partial reference image data of the first area of the selected reference image from the reference image data RAM and writes it into the frame memory, and also writes the partial reference image data of the first area of the selected reference image into the frame memory. Second reference image
The partial reference image data of the area is stored in the RAM for arbitrary image data.
to be memorized. Furthermore, when the partial reference image data of the second area of the selected reference image is stored in the RAM for arbitrary image data, the partial reference image data of the second area of the selected reference image is stored. By reading out the arbitrary image data from the RAM and writing it into the frame memory, the entire selected reference image is displayed.

On the other hand, in the image retrieval system of claim 2,
Partial reference image data of the first and second areas are both stored in the reference image data RAM. Then, by reading partial reference image data of the first and second regions of the reference image selected by the selection means from the reference image data RAM and writing them into the frame memory, the entire selected reference image is displayed. to be done.

[0011]

[Example] A. First Embodiment FIG. 1 is a block diagram showing a first embodiment of the present invention. This image retrieval system IRS uses a magneto-optical disk 1
, a magnetic disk 2 , a reference image creation section 3 , an image data control section 4 , and a central control section 5 . The magneto-optical disk 1 is a rewritable large-capacity storage device that stores image data of a large number of original images. The magnetic disk 2 is a reference image data storage means for storing reference image data of an image that is a reduced version of the original image (hereinafter referred to as a reference image), and can read data at a higher speed than the magneto-optical disk 1. It is possible.

The image retrieval system IRS further includes a selection switch 6 and an RA for arbitrary image data in the present invention.
An image save memory 7 as M, a frame memory 8,
It also includes a RAM 9 for reference image data. The selection switch 6 is switched according to a command from the central control section 5 to selectively connect one of the image data control section 4, the image save memory 7, and the reference image RAM 9 to the frame memory 8. Note that the memories 7, 8, and 9 are composed of RAMs that can be read and written at high speed.

The frame memory 8 includes a D/A converter 81.
A color monitor 82 as an image display means is connected through the frame memory 8, and an image is displayed on the color monitor 82 according to the image data (raster data) stored in the frame memory 8. A mouse 11 is connected to the central control unit 5 via a position information acquisition unit 10, and a code input unit 12
A keyboard 13 is connected via. The selection means in this invention is realized by the position information acquisition section 10 and the mouse 11.

The reference image creation unit 3 includes a thinning rate calculation unit 31 that calculates a thinning rate when reducing original image data, and an image that creates reference image data by thinning out the original image data at the calculated thinning rate. A reduction unit 32, an area division unit 33 that divides a reference image represented by reference image data into partial reference image data for each of a plurality of areas, and an image that converts each YMCK color separated image component of the partial reference image data into a BGR component. The data conversion unit 34 is also provided.

The image data control section 4 includes an image development section 41 and an image data rewriting section 42. When an operator gives a command to display a search screen, the image development unit 41 develops the reference image data into the frame memory 8, whereby a plurality of reference images are partially overlapped with each other according to a predetermined priority. They are displayed on one screen in a matching state. When the operator selects one of the displayed reference images, the image data rewriting unit 42 rewrites the data in the frame memory 8 so that the entire selected reference image is displayed.

[0016] This image retrieval system IRS is connected to a scanner 100 that reads image data of an original image.
It is also connected to a communication network system via the node 200. The image data of the original image stored on the magneto-optical disk 1 is prepared by being read by the scanner 100 or by being supplied from another terminal of the communication network via the node 200. In this embodiment, it is assumed that the original image data has YMCK color separation components.

The reference image creation section 3 creates reference image data from the original image data. First, the thinning rate calculation unit 31
The thinning rate is calculated using the method described below. Next, after the image reduction unit 32 thins out the original image data at this thinning rate, a predetermined size (α
×β) By extracting the image data of the image part,
Obtain reference image data. Then, the region dividing unit 33 divides the reference image data into partial reference image data for each of a plurality of regions according to a predetermined division method (this will also be described later). Finally, the image data converter 34 converts the YMCK components of the partial reference image data into BGR components. Here, Y
The purpose of converting the MCK component to the BGR component is to eliminate the need for this conversion when expanding the partial reference image data to the frame memory 8, thereby allowing the reference image to be displayed on the screen at high speed. It's for a reason. The reference image data obtained in this way is stored on the magnetic disk 2.

FIG. 2 is a flowchart showing the procedure for image retrieval. In step S1, an initial search screen is displayed on the color monitor 82. At this time, the image data control unit 4
reads the reference image data stored on the magnetic disk 2 and writes it into the frame memory 8 via the selection switch 6. FIG. 3(a) is a conceptual diagram showing the search screen. On this search screen, the reference images RM are arranged in three rows, and in each row, a plurality of reference images RM are arranged in a straight line, partially overlapping each other. The size of one reference image RM is α×β, and the entire reference image at the beginning of each row is displayed. Each of the reference images other than the first image appears by a width γ. That is, the highest priority is assigned to the reference image at the beginning of each row, and the priority is specified so that it decreases toward the right side of the diagram. Such an arrangement is determined by the image data control section 4.

By arranging a plurality of reference images RM so as to partially overlap each other as shown in FIG. 3(a), compared to arranging the reference images without gaps as shown in FIG. 3(b), More relatively large reference images can be displayed. Therefore, there is an advantage that a desired image can be easily searched from among a large number of images displayed on the search screen.

FIG. 4 is an explanatory diagram showing the structure of reference image data. The three reference images RM1, RM2, RM3 are
Each region has a size of α×β, and is further divided into a first region Ra having a size of α×β1 and a second region Rb having a size of α×β2. The second region Rb in the first reference image RM1 is an area that is hidden by the reference image RM2 when the entire next reference image RM2 is displayed in the scan mode described later.

Each reference image data is divided by the area dividing section 33 into partial reference image data representing each of the first and second areas Ra and Rb. For example, the reference image data of the first reference image RM1 is divided into partial reference image data D1a of the first region Ra and partial reference image data D1b of the second region Rb. Partial reference image data D1a, D2a... of the first area Ra and the second area R
The partial reference image data D1b, D2b, etc. of b are (
As shown in a) and (b), the data are classified by separate data tables, stored in the magnetic disk 2, and managed.

[0022] When the initial search screen is displayed in step S1, the partial reference image data representing the first area Ra of each reference image to be displayed is a position indicating the position of each image on the screen. RAM 9 for reference image along with data
stored inside.

In step S2, the operator observes the reference image RM on the color monitor 82, and uses the mouse 11 or keyboard 13 to input an instruction to display the next search screen if the desired image is not found. The next search screen is a screen for displaying the remaining reference images when the reference images stored on the magnetic disk 2 cannot be displayed on one search screen. Then, in step S7, the next search screen is displayed, and the process in step S2 is performed again.

[0024] When a reference image that appears to be the desired image is found on the search screen, the operator uses the keyboard 13 to instruct to enter the scan mode (step S3). FIG. 6 is an explanatory diagram of the scan mode. In the scan mode, when the operator moves the mouse 11 while pressing a button on the mouse 11 to move the cursor CS on the screen, the entire reference image where the tip of the cursor CS is located is displayed. In FIG. 6(a), the cursor CS is 1
The case is shown in FIG. 6(b) on the th reference image RM1.
shows a case where the cursor CS is placed on the second reference image RM2.

In the scan mode, one reference image within the search screen is selected using the mouse 11, and the entire selected reference image is displayed. Specifically, when the mouse button is pressed, the position information acquisition unit 10 detects the position of the tip of the cursor CS specified by the mouse 11 at regular intervals (step S4), and When it is detected that the image has come to a different reference image position (step S5), the entire reference image is displayed (step S6). And these steps S4
~S6 is repeated.

In step S6, the partial reference image data R2a of the first region of the selected reference image RM2 is read out from the reference image RAM 9 and overwritten in the frame memory 8, and the image of this reference image data R2a is read out from the reference image RAM 9 and overwritten in the frame memory 8. The partial reference image data D1b of the second region Rb of the first reference image RM1 that is hidden by the frame memory 8 is read out from the frame memory 8, and the partial reference image data D1b of the second region Rb of the first reference image RM1 is It is temporarily stored in the save memory 7. These processes are mainly performed by the image data rewriting section 42, and during this time, the central control section 5 controls switching of the selection switch 6.

Note that the memories 7, 8, and 9 use RAMs that can be read and written at high speed, so that the processing in step S6 can be performed at high speed. In addition, the second region Rb
The partial reference image data is stored in the image save memory 7 together with the position data indicating the position of each image on the screen, so there is no need to perform address calculations again when displaying, and this allows for even faster processing. This allows for changes in image display.

If the operator inputs a key from the keyboard 13 to designate a mode change during the processing of steps S4 to S6, the process immediately moves to step S3. Then, when it is designated to end the scan mode according to the operator's instructions, step S
3 to step S8. In step S8, it is possible to choose whether to end the entire process or return to the process from step S2 onwards.

When the operator observes the entire displayed reference image and confirms that it is the desired image, the operator uses the mouse 11 and keyboard 13 to transfer the original image data of the reference image from the magneto-optical disk 1. Instructs to read. The read original image data is given to other terminal devices via the communication network.

In the first embodiment described above, three memories 7
, 8 and 9 can be used to change the reference image that is displayed in its entirety, which has the advantage that the display of the search screen can be changed quickly. Moreover, the image save memory 7 and the reference image RAM
Since the image data stored in 9 is a part of the entire reference image data, the amount of data to be handled when changing the display of the search screen is small, and the processing speed can be further improved. .

B. Reference Image Creation Method Next, a reference image creation method will be described. Figure 7 shows
FIG. 6 is an explanatory diagram showing a method by which the image reduction unit 32 obtains reference image data from original image data. (a) of the figure is the original image O
M is shown, and its size is Yp×Xp.

The reference image RM is obtained by reducing the original image OM by thinning it out and extracting an α×β area from the reduced image. Reduced image OM obtained by thinning the original image OM of Yp×Xp at a thinning rate Rs
The size of a is (Yp×Rs)×(Xp×Rs) (see FIG. 7(b)). The size of this reduced image OMa is
Ideally, it should be equal to α×β. However, since it is rare that the ratio of the length Yp in the main scanning direction and the length Xp in the sub-scanning direction of an image is α×β, an α×β area in the reduced image is extracted. However, it is preferable that the reduced image OMa is larger than or equal to the size α×β of the reference image RM and is as small as possible. Therefore, in this embodiment, as shown below, the thinning rate calculation unit 31 sets the thinning rate to an optimal value according to the size of the original image OM.

The thinning rate is determined in consideration of the following matters. Consideration 1: Make the thinning rate equal in the main scanning direction and the sub-scanning direction. This is to prevent the reduced image from being deformed. Consideration 2: Set the thinning rate to 1/N (N is an integer of 2 or more). This is to enable high-speed thinning processing.

The thinning rate Rs is determined in consideration of the above two matters so as to simultaneously satisfy the following two conditions C1 and C2. Condition C1: The following formulas (1) and (2) are satisfied. α≦(Yp×Rs)
...(1) β≦(Xp×Rs)
...(2) Condition C2: The following formula (3
) or (4). (Yp×Rs)<2α
...(3) (Xp×Rs)<2β
…(4)

Condition C1 is a condition for making the reduced image OMa larger than or equal to the size α×β of the reference image RM. Condition C2 is a condition for determining a thinning rate that makes the reduced image as small as possible while taking into consideration that the thinning rate Rs is 1/integer.

FIGS. 7(b) and 7(c) are diagrams for explaining these conditions C1 and C2. The reduced image OMa shown by the dashed line in FIG. 7(b) is expressed by the above formula (1
), (2), and (4) are satisfied. Then, from this reduced image OMa, a predetermined portion (the upper left portion in the example of FIG. 7(b)) is extracted from the reference image R.
Let it be M.

The thinning rate RS is calculated as follows, for example. First, optimal thinning rates Rsy and Rsx are calculated in accordance with the following formulas in each of the main scanning direction and the sub-scanning direction. Rsy=In(Yp/α)
...(5) Rsx=In(Xp/
β) …(6
) Here, the operator In indicates integerization (that is, processing that employs only the integer part). Then, the two thinning rates R
The smaller value of sy and Rsx is adopted as the final thinning rate Rs. The thinning rate thus obtained satisfies both conditions C1 and C2 described above.

Determine the thinning rate Rs as described above,
By creating a reduced image at this thinning rate and extracting the reference image RM from the reduced image, the area of the original image can be extracted as much as possible from the largest possible reduced image while preventing image deformation. There is an advantage that it is possible to obtain a reference image of a constant size that includes many reference images.

C. Second Embodiment FIG. 8 is a block diagram showing a second embodiment of the present invention. Compared to the image search system shown in FIG.
It differs in that it has M91 and M92.

The first reference image RAM 91 stores partial reference image data of the first area Ra of the reference image written in the frame memory 8, and stores the partial reference image data of the first area Ra of the reference image written in the frame memory 8.
Partial reference image data of the second region Rb of the reference image written in the frame memory 8 is stored in M92.

In step S6 of FIG. 2, the image data rewriting unit 42 reads partial reference image data of the first and second regions Ra and Rb of the selected reference image from the two reference image RAMs 91 and 92, respectively. , these partial reference image data are overwritten in the frame memory 8. In this way, the partial image data of the first and second areas Ra and Rb of the reference image are stored in the RAMs 91 and 92, respectively, and the partial reference image data of the selected reference image is stored in the RAM 91 and the partial image data of the selected reference image.
If the reference image is read out from 92 and used, there is an advantage that the entire selected reference image can be displayed at high speed. At this time, unlike the first embodiment, there is no need to temporarily save the partial reference image data in the frame memory 8, so the displayed image can be changed even faster than in the first embodiment.

D. Modifications Note that the present invention is not limited to the above embodiments,
It is possible to implement the present invention in various ways without departing from the spirit thereof.

(1) In the above embodiment, as shown in FIG. 4, the reference image RM is divided into two regions Ra and Rb, and partial reference image data representing each region is created. However, the reference image may be divided into two or more regions,
For example, it may be divided into three as shown in FIG. In the example of Figure 9,
It is divided into three regions Ra, Rb, and Rc, each having a length in the sub-scanning direction of β11, β12, and β13. Here, the sum of β11 and β12 in FIG. 9 is equal to β1 in FIG. 4. In the case of FIG. 9, region Ra corresponds to the first region in the present invention, and region Rc corresponds to the second region.

In the first embodiment, when the area is divided as shown in FIG. 9, partial reference image data of the area Rc hidden by the selected reference image is stored in the image save memory 7 in step S6 of FIG. At the same time, the partial reference image data of the first area Ra of the selected reference image is read out from the reference image RAM 9 and written into the frame memory 8.

On the other hand, when the area is divided as shown in FIG. 9 in the second embodiment, the partial reference image data of the area Ra is stored in the first reference image RAM 91, and the partial reference image data of the area Rc is is stored in the second reference image RAM 92.

Furthermore, each reference image may be divided as shown in FIGS. 10 and 11. In the example of FIG. 10, the two regions Rb and Rc in the example of FIG. 9 are combined into one region Rb. In the example of FIG. 11, one reference image is divided into two regions Ra and Rb of equal size. In general, the division of reference images into regions is determined by taking into consideration the overlap between adjacent reference images on the search screen. That is, in each reference image, a first area (area Ra in the case of FIG. 9) located at the beginning of a predetermined direction (direction from right to left in FIG. 3) defined on the search screen. A plurality of regions are set to include at least the following: and a second region located at the rear end in that direction (region Rc in the case of FIG. 9). In this case, the size of the overlap between the first region of a reference image and the second region of the adjacent reference image is less than or equal to the smaller of the first and second regions. Set the sizes of the first and second areas as follows. Then, the reference image data is divided into partial reference image data for each divided area.

In this way, the image data rewriting unit 42 writes the partial reference image data of the first and second regions of the selected reference image into the frame memory 8, thereby displaying the entire selected reference image. can do.

(2) In the above embodiment, the image is reduced by thinning processing, but methods other than simple thinning processing may be applied as a method for reducing the image. As a method other than simple thinning processing, for example, N1×N2
A method may be considered in which the average value of image data within a pixel area (N1 and N2 are integers) is adopted as image data representative of that pixel area.

(3) In the above embodiment, the priorities of the plurality of reference images set on the first search screen are as shown in FIG.
As shown in (a), the priority level was set such that the farther left the screen was, the higher the priority level was. However, the priorities of the plurality of reference images may be set using any other method. Further, in the above embodiment, a plurality of reference images are displayed in an overlapping manner on the left and right sides of the screen, but they may be displayed in an overlapping manner in the vertical direction of the screen.

(4) In the above embodiment, no conditions were set for the reference image displayed on the initial search screen. However, the desired search conditions and sorting
Conditions may be set in advance, and a reference image may be read out from among the reference images stored on the magnetic disk 2 according to these conditions and displayed. In this case, keywords for setting search and sorting conditions may be registered in advance in each reference image and stored on the magnetic disk 2.

[0051]

As described above, in the invention set forth in claim 1, a plurality of reference images created by the image reduction means are displayed on the image display means and used for image retrieval. The image development means develops the reference image in the frame memory in order to display a plurality of reference images, but at this time,
Adjacent reference images are caused to partially overlap each other according to a prespecified priority. The region dividing means divides the region into a plurality of regions including first and second regions having a size at least larger than the overlapping portion, and creates partial reference image data for each region. These partial reference image data are stored in the reference image data storage means. The partial reference image data of the first area is stored in the reference image data RAM. When one of the reference images displayed on the image display means is selected by the selection means, the image data rewriting means:
The partial reference image data of the first area of the selected reference image is read from the reference image data RAM and written into the frame memory, and the partial reference image data of the second area of the reference image that is partially hidden thereby is read out from the reference image data RAM and written to the frame memory. is stored in the arbitrary image data RAM. Furthermore, when the partial reference image data of the second area of the selected reference image is stored in the RAM for arbitrary image data, the partial reference image data of the second area of the selected reference image is stored. By reading out the arbitrary image data from the RAM and writing it into the frame memory, the entire selected reference image is displayed.

As described above, in the invention of claim 1, it is only necessary to use image data representing a reference image of one type of size, instead of using a plurality of reference images having different reduction ratios as in the conventional case. Furthermore, since the search screen is displayed with the reference images superimposed on each other, the reference images are not too small, and the operator can search using reference images that are large enough to easily search for the desired image. . Therefore, there is an effect that images can be searched efficiently using a relatively small amount of data.

On the other hand, in the invention of claim 2, the partial reference image data of the first and second regions are both used as R for reference image data.
Store in AM. Then, by reading partial reference image data of the first and second regions of the reference image selected by the selection means from the reference image data RAM and writing them into the frame memory, the entire selected reference image is displayed. to be done. Therefore, similarly to the invention of claim 1,
This has the effect that images can be searched efficiently with a relatively small amount of data.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of an image search system as a first embodiment of the present invention.

FIG. 2 is a flowchart showing a search procedure according to an embodiment of the present invention.

FIG. 3 is a conceptual diagram showing a search screen on which multiple reference images are displayed.

FIG. 4 is an explanatory diagram showing a method of region segmentation of a reference image.

FIG. 5 is a conceptual diagram showing a table of partial reference image data for each area.

FIG. 6 is an explanatory diagram showing how the screen display is changed in scan mode.

FIG. 7 is an explanatory diagram showing a method of creating reference image data.

FIG. 8 is a block diagram showing the configuration of an image search system as a second embodiment of the present invention.

FIG. 9 is an explanatory diagram showing another area division method for a reference image.

FIG. 10 is an explanatory diagram showing another area division method for a reference image.

FIG. 11 is an explanatory diagram showing another area division method for a reference image.

[Explanation of symbols]

2 Magnetic disk (reference image data storage means) 3
Reference image creation section 4 Image data control section 5 Central control section 6 Selection switch 7 Image save memory (RAM for arbitrary image data)
8 Frame memory 9 RAM for reference image data 11 Mouse (selection means) 13 Keyboard 31 Thinning rate calculation section 32 Image reduction section 33 Area division section 34 Image data conversion section 41 Image development section 42 Image data rewriting section 82 Color monitor (image display means)91
RAM for reference image data 92 RAM for reference image data CS Cursor (selection means) D1a Partial reference image data D1b Partial reference image data IRS Image search system OM Original image OMa Reduced image R2a Partial reference image data RM Reference image RM1 Reference image RM2 Reference Image RS Thinning rate Ra Area Rb Area

Claims (2)

[Claims] Claim 1: An image search system for searching for a desired image from among a plurality of images, comprising an image display means for displaying the image and image data of the image displayed on the image display means. By processing the frame memory and the original image data representing each original image for each of the plurality of original images, a reference image of a predetermined size including at least a part of the reduced image obtained by reducing each of the original images is created. image reduction means for creating reference image data representing the reference image; and a second area located at least two regions.
In addition to dividing the reference image data into two regions,
area dividing means for dividing into partial reference image data for each divided area; reference image data storage means for storing partial reference image data of the first and second areas, respectively, for each of the plurality of reference images; A reference image data RAM for temporarily storing partial reference image data regarding a first area of the plurality of reference images, an arbitrary image data RAM for storing arbitrary image data, and a RAM for storing the reference image data. By developing the reference images in the frame memory, the plurality of reference images are arranged along the predetermined direction, and the first area and second area of adjacent reference images are divided into the first and second areas. The second area of the reference image with a relatively high priority specified in advance is overlapped with the first area of the reference image with a relatively low priority while overlapping each other with an overlapping area of a size not exceeding the smaller area of either. an image developing means for developing the reference image data so as to display the reference image data in priority to the area; a selecting means for selecting one of the plurality of reference images displayed on the image display means; and the selecting means. The partial reference image data of the first region of the reference image selected by the means is read from the reference image data RAM and written into the frame memory, and the partial reference image data of the first region of the selected reference image is The partial reference image data of the second region of the reference image to be hidden is transferred to the arbitrary image data RA.
Further, the partial reference image data of the second area of the selected reference image is stored in the arbitrary image data RA
image data rewriting means for reading partial reference image data of a second area of the selected reference image from the arbitrary image data RAM and writing it into the frame memory when the partial reference image data is stored in the frame memory; An image search system featuring: 2. An image search system for searching for a desired image from among a plurality of images, comprising an image display means for displaying the image and image data of the image displayed on the image display means. By processing the frame memory and the original image data representing each original image for each of the plurality of original images, a reference image of a predetermined size including at least a part of the reduced image obtained by reducing each of the original images is created. image reduction means for creating reference image data representing the reference image; and a second area located at least two regions.
In addition to dividing the reference image data into two regions,
area dividing means for dividing into partial reference image data for each divided area; reference image data storage means for storing partial reference image data of the first and second areas, respectively, for each of the plurality of reference images; A RAM for reference image data that temporarily stores partial reference image data regarding the first and second regions of the plurality of reference images, and a RAM for developing the reference image data in the frame memory,
The plurality of reference images are arranged along the predetermined direction, and the first area and the second area of adjacent reference images are arranged beyond the smaller of the first and second areas. The second area of the reference image with a pre-specified relatively high priority is displayed in priority to the first area of the reference image with a relatively low priority while overlapping each other with an overlapping portion of a size that is not large. , an image development means for developing the reference image data, a selection means for selecting one of the plurality of reference images displayed on the image display means, and a first one of the reference images selected by the selection means. An image retrieval system comprising: image data rewriting means for reading partial reference image data of the first and second areas from the reference image data RAM and writing them into the frame memory.