JPH0816585A - Figure calling device - Google Patents

Abstract

PURPOSE:To easily and speedily call a figure matching an image by retrieving figure classification information corresponding to an inputted key word, and reading out and displaying figure data corresponding to the figure classification information. CONSTITUTION:When an optional character string imaging a called object is inputted on a keyboard 3 to call the figure, a CPU 1 stores this character string in an input buffer 5 as the key word for figure calling. Then the CPU 1 retrieves a figure classification memory 6 by using the character string stored in the input buffer 5 as the key word and stores the retrieval result in a retrieval result work memory 7-1 in a RAM 7, and also accesses a figure memory 8 on the basis of the contents of the memory 7-l to read the figure data out of a memory 8 and supply the data to a display control part 9, so that the data are displayed out as a selection candidate at a display part 10.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graphics calling device for calling desired graphics data from various graphics data stored in advance in a word processor or the like.

[0002]

2. Description of the Related Art Generally, when creating various guides, presentation materials and the like with a document processing device such as a word processor or a personal computer, it is persuasive and enjoyable by inserting a figure related to the content of the document into the document. We are trying to create expressive guides, etc. For this reason, various graphic data are fixedly stored in advance in the document processing apparatus, and the graphic data desired by the user is called out from the fixed graphic data. At that time, conventionally, the following method is used. I was calling a figure in. (1) A file name is given to the graphic data stored in the format of one graphic and one file, and the user selects the desired file name from the list of file names. How to call graphic data. (2) A method of actually displaying various figures as candidates and selecting a figure desired by the user from the candidates. (3) Classify various graphic data in advance, display a list of file names corresponding to the classification arbitrarily selected by the user from the classification name list, and select the desired file name from the list. A method to call the corresponding figure data by selecting it.

[0003]

However, from the standpoint of the user, it has been decided in advance what kind of figure is more effective when inserting a figure, but in the case of the above (1) With the method, it is difficult to intuitively imagine a figure only from the language of the file name, and it is necessary to call the figure many times until finding a figure that fits the image, which is a disadvantage of spending a lot of effort. was there. Further, in the above method (2), since the graphic is actually displayed as a candidate, it is possible to immediately judge whether or not the graphic is suitable for the image.
Since the screens have to be switched many times, much effort is spent in finding a figure that matches the image, as in the method (1) described above. Furthermore, in the method of (3) above, since the figures are classified, the list contents of the file names are narrowed down to some extent by selecting the classification name. Is in one category, so, for example, "There are palm trees on the beach by the beach, a yacht floats in the distance,
If the illustration "There is a cloud in the sky" is associated with the classification "summer", even if the user selects the illustration with "yacht", the classification name "summer" will be used. Unless I selected it, I couldn't call this illustration, and it wasn't always an efficient way. An object of the present invention is to simply input a desired character string from various kinds of previously stored character data by inputting a character string as an image of a character without considering the classification system of the character. It is to be able to easily and quickly call up a figure that matches the image.

[0004]

The means of the present invention are as follows. (1) The graphic storage means stores a plurality of graphic data (illustrations,
It is a graphic memory for storing symbols, marks, etc.). (2) The classification information storage means stores a plurality of character strings as graphic classification information corresponding to the respective graphic data stored in the graphic storage means. (3) The input means inputs an arbitrary character string as a keyword for calling the figure when calling the figure. (4) The search means searches the classification information storage means for graphic classification information corresponding to the keyword input from the input means. (5) The reading means reads the graphic data corresponding to the graphic classification information retrieved by the retrieval means from the graphic storage means. (6), the display means displays the graphic data read by the reading means.

[0005]

The operation of the means of the present invention is as follows. Now, when calling a figure, if a character string that imagines the figure is entered as a keyword, the figure classification information corresponding to this keyword is searched, and the figure data corresponding to this figure classification information is read out and output. To be done.
Therefore, when calling the desired figure data from the various kinds of pre-stored figure data, simply input the character string that images the figure as a keyword without paying attention to the classification system of the desired figure. Called shapes can be called easily and quickly.

[0006]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment will be described below with reference to FIGS. FIG. 1 is a block diagram of a graphic calling device. The CPU 1 is a central processing unit for controlling the overall operation of the graphic calling device according to various programs in the ROM 2, and when a graphic calling command is input from the keyboard 3 via the keyboard control unit 4, the CPU 1 stores in the ROM 2. Start the figure calling program.

The keyboard 3 is capable of inputting various commands such as a command to call a figure and also character string data such as hiragana and katakana. When the figure is called, the keyboard 3 is used.
When an arbitrary character string that images a call target is input from, the CPU 1 stores this character string in the input buffer 5 as a keyword for graphic call. in this case,
When a kana-kanji conversion command is issued to the input kana character string from the keyboard 3, the converted kanji-mixed character string is stored in the input buffer 5. Here, the CPU 1 searches the figure classification information memory 6 by using the character string stored in the input buffer 5 as a keyword, stores the search result in the search result work memory 7-1 in the RAM 7, and also searches the search result work memory 7 Based on the content of -1, the graphic memory 8 is accessed, the corresponding graphic data is read from the graphic memory 8, given to the display control unit 9, and displayed on the display unit 10 as a selection candidate.

FIG. 2 exemplifies a part of the graphic data (including illustrations, symbols, marks, etc.) fixedly stored in advance in the graphic memory 8. One graphic data is one graphic data.
It is stored in a file format, and each graphic data has a file name “fig001”, “fig002”, “fig”.
003 ”... Is associated. Here, the graphic data with the file name “fig001” is a camping tent, the graphic data with the file name “fig002” is a knife for leisure, and the graphic data with the file name “fig003” is an illustration graphic representing a cooler box.
Also, the graphic data with the file name "fig050" is "There are palm trees on the beach on the sandy beach, a yacht floats in the distance,
It is an illustration figure like "There are clouds in the sky."

FIG. 3 concretely shows a part of the contents of the graphic classification information memory 6, and a plurality of character strings are stored as graphic classification information for each file name of each graphic data. There is. Here, in addition to the general name, common name, abbreviation or purpose of the graphic of the graphic, the graphic classification information is, in addition to the general name, abbreviation or use of the graphic, when the graphic is composed of a plurality of constituent elements, the It represents a kanji notation or a kana notation of a name, and one figure is associated with a plurality of figure classification information. For example, the file name "fig
As the figure classification information corresponding to the figure of "002", the general name is shown as "knife" in kana notation, "knife" in kanji notation, "camp", "outdoors", and "leisure" showing usage. "... is fixedly stored in the figure classification information memory 6.

FIG. 4 shows the structure of the search result work memory 7-1 in the RAM 7, where the CPU 1 is the keyboard 3
When any character string from is input as a keyword,
The figure classification information memory 6 is searched based on this keyword. At this time, if the figure classification information matching the keyword is stored in the figure classification information memory 6, the file name corresponding to the figure classification information is read out. And writes it in the search result work memory 7-1. Here, in the present embodiment, as shown in FIG. 8, up to three types of keywords can be input to the input buffer 5, and the search result work memory 7-1 is divided into three areas corresponding to these three types of keywords. The file name retrieved based on the first keyword is stored in the keyword No (1) area,
The file name searched for based on the second keyword is stored in the area corresponding to the keyword No (2), and the file name searched for based on the last keyword is stored in the area corresponding to the keyword No (3). Is stored.

The operation of this embodiment will be described below with reference to the flow charts shown in FIGS. 5 to 7 are flowcharts showing the operations executed according to the graphic call program started when the graphic call command is input from the keyboard 3. Now, for example, when creating a guide or the like, it is assumed that a figure related to the content of the document is inserted into the document. In this case, in order to selectively call out desired figure data from various kinds of figure data fixedly stored in the figure memory 8 in advance, the user must specify a language or name suitable for the image of the desired figure. The character string is input as a keyword from the keyboard 3.

Here, the CPU 1 is in a state of waiting for a keyword input from the keyboard 3, and when a keyword is input from the keyboard 3, it is taken in and displayed and output, and a keyword input process of storing this keyword in the input buffer 5 is performed. If the kana-kanji conversion is designated in this case (step S1), the input kana character string is converted to kana-kanji and the conversion result is stored in the input buffer 5. Then, it is checked whether the keyword input end is designated (step S2). Here, when inputting two or more types of character strings as keywords, the process returns to the keyword input process (step S1), but at that time, a comma is input to separate the character strings, and then the next character string is input. input.

After inputting a character string that images a figure in this way as a keyword for calling a figure and then instructing the end of input, the CPU 1 first specifies the top file name in the figure classification information memory 6 (step S
3) Specify the first keyword in the input buffer 5 (step S4). Then, the designated keyword and each figure classification information corresponding to the designated file name are sequentially compared (step S5), and whether the figure classification information matching the keyword exists in the figure classification information memory 6 in association with the designated file name. Is checked (step S6). Here, if there is no character string that matches the specified keyword in each figure classification information corresponding to the specified file name, there is another input keyword in the input buffer 5 as a condition (step S10). , Specify the next keyword (step S1
1) From then on, similarly, the designated keyword and each figure classification information corresponding to the designated file name are sequentially compared (step S5). Now, as shown in FIG. 8 (A), the input buffer 5
It is assumed that the character string "tent" is entered as a keyword. In this case, since this character string is included in the figure classification information corresponding to the first file name "fig001" in the figure classification information memory 6, the process proceeds to step S7 and the corresponding file name is searched for in the work memory. File name storage processing for storing in 7-1 is performed.

FIG. 7 is a flow chart showing this file name storing process. First, it is checked what number of keywords the designated keyword is in the input buffer 5 (step S7-1). As a result, if it is the first keyword, the keyword is found in the search result work memory 7-1.
The corresponding file name is stored in the area corresponding to No (1) (step S7-2), and if it is the second keyword, it is stored in the area corresponding to keyword No (2) (step S7-).
3) Keyword No (3) if it is the third keyword
It is stored in the area corresponding to (step S7-4). In the example shown in FIG. 8A, only the "tent" is input to the input buffer 5, and the file name "fig001" having this character string as the figure classification information is the keyword of the figure classification information memory 6. Store in the area corresponding to No (1).

Next, in step S8 of FIG. 5, it is checked whether or not there are other keywords in the input buffer 5.
In this case, since only one type of keyword has been input, the flow advances to step S12 to check whether the designated file name is the final file name in the figure classification information memory 6. Now, since the first file name is specified,
The next file name "fig002" is designated (step S13). Then, returning to step S4, similarly, the first keyword "tent" in the input buffer 5 is similarly designated, and whether or not this character string is included in each figure classification information corresponding to the file name "fig002" Is checked (steps S5 and S6), but in this case, since the corresponding character string does not exist, the process proceeds to step S10, and it is checked whether or not there is another keyword in the input buffer 5. Now
Since only one type of keyword is input to the input buffer 5, the above operation is repeated while sequentially designating the next file name until the final file name is designated. Here, in FIG. 8A, the corresponding file name is “fig00”.
This is the case where only "1" exists, as shown in FIG.
If the character string “camp” is input as the keyword as shown in, the character string is included in the figure classification information of the file names “fig001”, “fig002” ... A plurality of file names are stored in the keyword No (1) area 7-1.

On the other hand, when a plurality of keywords are input as shown in FIGS. 8C to 8E, the above operation is repeated for each keyword. That is, assuming that the character string "landscape, summer" is input as the keyword as shown in FIG. 8C, the first keyword "landscape" is first used as the file name having the graphic classification information "fig04".
9 ”is retrieved and stored in the keyword No (1) area in the retrieval result work memory 7-1 (steps S6, S).
7). Since the presence of another keyword is detected in the next step S8, the process proceeds to step S9, the next keyword "summer" is designated, and then the process returns to step S5. In this case, since "summer" is not included in the figure classification information corresponding to the file name "fig049", this is detected in step S6 and the process proceeds to step S10, but no other keyword is input. Therefore, the next file name "fig050" is designated on condition that it is not the final file name (steps S12 and S13). Then, the process returns to step S4 again, and the first keyword “landscape” is designated.
In this case, since "scenery" is included in the figure classification information corresponding to the file name "fig050", the file name "fig050" is stored in the keyword No (1) area of the search result work memory 7-1. (Step S7).
Then, the next keyword "summer" is specified (step S9), but since this character string is also included in the figure classification information of the file name, the file name is stored in the search result work memory 7-1. (Step S7). At this time, since this keyword is the second keyword, the file name “fig050” is stored in the keyword No (2) area of the search result work memory 7-1. Thereafter, the same operation is repeated up to the final file name, so that the contents of the search result work memory 7-1 become as shown in FIG. 8 (C).

Next, FIGS. 8D and 8E show the case where three types of keywords are input. Here, the first and second keywords are the same as those in FIG. 8C, but 3
As the second keyword, “yacht” in the example of FIG. 8 (D)
When the character string “tent” in the example of FIG. 8E is input, the figure classification information matching the third keyword is the file name “f” in the case of FIG. 8D.
ig051 ”, and in the case of FIG. 8E, the file name“ fi
Since it exists in “g001”, the file name is stored in the keyword No (3) area of the search result work memory 7-1.

When the contents of the graphic classification information memory 6 have been searched up to the final file name based on the input keyword, the process proceeds to step S14 in FIG. 6 and the file name is stored in the search result work memory 7-1. Check if it is done. If no file name is stored in the search result work memory 7-1, an error message indicating that the corresponding figure does not exist is displayed (step S15), and the input buffer 5 is cleared (step S15). S25). On the other hand, if a file name is stored in the search result work memory 7-1, one keyword No.
It is checked whether the file name is stored only in the area (step S16). Here, FIG. 8 (A), (B)
If there is one type of input keyword as shown in, naturally,
Although the file name is stored only in the keyword No (1) area, even if a plurality of keywords are input, for example,
The file name may be stored only in the area of keyword No. (2) or (3). In this way, when the file name is stored in only one keyword No area, all the file names are read from the area (step S17).

On the other hand, if the file names are stored in two or more keyword areas, the process proceeds to step S18, and it is checked whether or not there is a common file name among the file names stored in at least two keyword No areas. To do. Here, in the case shown in FIG.
The file names “0” and “fig051” are common, and in the case of FIG. 8D, “fig051” exists as a file name common to the three keyword No areas. Further, in the case shown in FIG. 8E, "fig050" and "f" are used as the file names common to the two keyword No areas.
ig051 ”exists. In this case, the keyword No
(3) The file name "fig001" in the area is ignored. If a file name common to at least two keyword No areas exists in this way, all common file names are read from the search result work memory 7-1 (step S19). If the file names stored in the two or more keyword No areas are different from each other and no common file name exists, step S2 is performed.
0, a message to that effect is displayed, and a keyword in the input buffer 5 is displayed in a list. When the user selects any keyword from the list, the search result work memory 7-1 corresponding to the selected keyword is displayed. Read only the file name in.

In this way, the search result work memory 7-
When the file name is read from 1, the figure memory 8 is accessed with this file name and the corresponding figure data is displayed as a candidate on the display unit 10 (step S21). Here, if the desired figure is displayed in the list screen displayed as a candidate, the user gives a selection confirmation command from the keyboard 3 to select and confirm the desired figure, and the desired figure is displayed. If it does not exist, the figure call cancellation command is input. Now, when the selection confirmation command is input, the selected figure is inserted into the document (step S23), and the contents of the search result work memory 7-1 and the input buffer 5 are cleared (step S2).
4, S25). On the other hand, when the cancel command is input, the graphic insertion processing is not performed, and the search result work memory 7-
1, clear the contents of the input buffer 5 (step S2
4, S25).

As described above, in the present embodiment, a plurality of character strings are associated with one figure as figure classification information. Therefore, when the user calls up the figure, the user may use, for example, " Enter common names such as tents, knives, common names, abbreviations, etc.,
You may enter the purpose of use, such as "camp", "outdoors", etc. If the figure consists of multiple components, you may enter the name of each component, etc. Alternatively, it may be entered in kana notation. Moreover, the number of keywords is not limited to one, and a plurality of keywords may be input. By inputting a plurality of keywords, a graphic that matches the image of the user can be quickly called. In this case, even if there is no figure common to all of the three types of inputted keywords, if a figure common to two types of keywords exists,
The figure can be called, and even if the figure common to a plurality of keywords does not exist, if the figure corresponding to any one of the keywords exists, the figure can be called. There is no need to be very conscious of how to enter the keywords.

In the above embodiment, up to three types of keywords can be entered, but more keywords may be entered. Further, although the graphic file name is stored in the graphic classification information memory 6 in the above embodiment, the address of the graphic memory 8 in which the graphic is stored may be stored.

[0023]

According to the present invention, when a desired figure data is called from among various kinds of figure data stored in advance, a character string which is an image of the figure can be created without considering the classification system of the desired figure. You can easily and quickly call up a graphic that matches the image simply by entering it as a keyword. Therefore, when inserting a graphic matching the content of the document into a document created by a word processor or the like, the work can be efficiently performed.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a graphic calling device according to an embodiment.

FIG. 2 is a diagram showing a part of a graphic memory 8.

FIG. 3 is a diagram showing the contents of a graphic classification information memory 6.

FIG. 4 is a diagram showing a configuration of a search result work memory 7-1.

FIG. 5 is a flowchart showing a part of graphic call processing.

FIG. 6 is a flowchart showing a graphic calling process following FIG.

FIG. 7 shows step S7 of FIG. 5 (search result work memory 7).
2 is a flowchart showing a process of storing a file name in -1).

FIG. 8 is a diagram showing a file name stored in the search result work memory 7-1 according to the search result when the graphic classification information memory 6 is searched based on the keyword in the input buffer 5, and the search result work memory 7 The figure which showed the file name of the target figure called based on the content of -1.

[Explanation of symbols]

 1 CPU 2 ROM 3 keyboard 4 keyboard control unit 5 input buffer 6 graphic classification information memory 7 RAM 7-1 search result work memory 8 graphic memory 9 display control unit 10 display unit

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁶ Identification code Office reference number FI technical display location 9365-5H G06F 15/62 P

Claims (1)

[Claims] 1. A graphic storage means for storing a plurality of graphic data, and a classification information storage means for respectively storing a plurality of character strings as graphic classification information corresponding to each graphic data stored in the graphic storage means. An input means for inputting an arbitrary character string as a keyword for calling a figure when calling the figure; a searching means for searching the classification information storing means for the figure classification information corresponding to the keyword input from the input means; A graphic comprising: a read means for reading graphic data corresponding to the graphic classification information retrieved by the means from the graphic storage means; and a display means for displaying the graphic data read by the read means. Calling device.