JP4424004B2 - Graph display method, graph display program, and storage medium storing graph display program - Google Patents

Description

  The present invention relates to a graph display method for allocating monochrome patterns to a plurality of areas included in a graph when a material in which a plurality of statistical values are indicated by a pie chart or a bar graph is converted into monochrome and displayed. is there.

  Among various applications used on information equipment, spreadsheet software and the like have a function for automatically generating a pie chart or a bar chart simply by inputting a numerical value into a table. The plurality of areas included in these graphs are mainly applications that have a mechanism that automatically assigns colors that can be easily distinguished from adjacent areas. However, when such a graph with colored areas is printed in monochrome, it is difficult to identify the areas in the graph because the luminance is similar even though the original colors are different. There was a problem.

  In order to solve this problem, in Patent Document 1, when converting an image of a color document to a black and white image, the number of types of colors used in the input document is measured, and the level of the monochrome image to be output is measured. A color-luminance table is provided so as to be equal to the key number and the number of colors used in the input document. By using this table, the luminance corresponding to the color of the input document is acquired and converted into a monochrome pattern corresponding to the luminance. Furthermore, it has a function to make a combination of colors that are not used in adjacent portions the same luminance, and a function to describe edge information indicating a boundary line when the luminance of adjacent monochrome patterns is similar. This makes it easy to identify adjacent colors when converting a color original image into a black and white image.

Further, Patent Document 2 includes a color arrangement parameter in which a plurality of predetermined colors are registered in order. The plurality of colors registered in the color scheme parameters are registered in an order that allows them to be easily distinguished from the colors in the order, and means for extracting a graph area from the input document, and the color scheme parameters Describes a mechanism for assigning different colors to each area of the graph by using means for assigning the colors shown in the order corresponding to the order of the areas, and for facilitating identification from adjacent areas. Yes.
JP 11-339034 A Japanese Patent Laid-Open No. 7-220101

  In recent years, in color schemes for homepages such as color graphs and printed materials, color usage called color barrier-free and taking into account color blind people is being used. That is, an attempt is made to easily identify a region using several types of easily distinguishable colors without using many types of colors. Of course, due to this consideration, the same color may be assigned to different areas in the graph.

  For example, a graph as shown in FIG. 3 using only orange, blue, and white is given as an example. Actually, the number of colors may be a little larger, but in order to make the problem of the present invention easier to understand, here the number of colors is extremely reduced to three. In an actual color graph, the assigned color is assumed to be painted in each area of the graph. However, in (1) and (2) of FIG. The name of the color that is actually painted is written in letters. Further, in (1) and (2) of FIG. 3, information indicating values for the same property is included in each graph, and by expressing a plurality of graphs, the values of the values for the same property are represented. The graph is intended to allow easy comparison of changes. For example, assume that the change in sales volume for the same product 10 years ago and now is displayed by month.

  What is displayed may be a graph comparing the monthly sales of the same company, a comparison graph with the past showing the monthly production of the same fruits and vegetables, or the monthly imports of the same company Even a graph comparing the export volume with the past, the number of students enrolled at the same school, the number of suspended students, the number of expelled students, etc., may be shown by month. Of course, multiple areas in a single graph are not limited by month, but may be classified by year, by day, by minute, or by product type. It may be divided.

  In this way, information indicating values for those having the same property is included in each graph, and by expressing a plurality of graphs, changes in values for those having the same property can be easily compared If it is good.

  It is assumed that the value of February shown in the second area of (2) in FIG. 3 and the value of March shown in the third area are 0%. Thus, there are occasions when the value shown in the graph becomes zero and the range of the region disappears.

  When the graphs of (1) and (2) in FIG. 3 are printed in monochrome, the results shown in (1) and (2) of FIG. In FIG. 4 (2) as a result, it has been found that it is very difficult to distinguish the first area from the fourth area. The first area and the fourth area, which are originally the same color, are adjacent to each other, and different monochrome patterns are not assigned. It turns out that the boundary becomes difficult to understand.

  Similarly, when (1) and (2) in FIG. 3 are printed after monochrome conversion using the mechanism of Patent Document 2, (1) and (2) in FIG. 5 are obtained. Since the patterns are assigned in the order of the areas, it was found that the monochrome patterns of the areas showing the same element (in this case, the month name) in both graphs differed between (1) in FIG. 5 and (2) in FIG. . Specifically, the monochrome pattern assigned to the April region, the May region, and the June region of (1) in FIG. 5 is compared with the April pattern of (2) in FIG. Unlike the monochrome patterns in the area, the May area, and the June area, it was difficult to compare the two graphs.

The first invention shown in the present application inputs an image including a color graph, recognizes a plurality of graphs included in the input image, and one or a plurality of regions included in the plurality of graphs, A graph display method for converting the color graph into monochrome based on a plurality of stored monochrome patterns and displaying the monochrome graph,
Among the plurality of graphs, among the graphs to which the monochrome pattern is not assigned, the graphs that are to be assigned the monochrome pattern in the descending order of the number of areas included in the graph, Whether an unallocated area is sequentially assigned to a monochrome pattern allocation area, color information arranged in the allocated area is acquired, and the area having the acquired color information is included in another graph to which the monochrome pattern has already been allocated If an area having the same color information is included in another graph to which a monochrome pattern has already been assigned, the monochrome pattern assigned to the area having the same color information is assigned to the assigned area, and the same Areas with color information already have monochrome patterns When not included in the assigned graph, an unassigned pattern is acquired from the stored monochrome pattern and assigned to the assigned area, and the monochrome pattern is assigned to all areas included in the graph to be assigned to the monochrome pattern. When an unallocated area is acquired when a monochrome pattern is not allocated, a monochrome pattern is allocated to all the areas included in the graph that is the target of monochrome pattern allocation, and there are other graphs to which no monochrome pattern is allocated If a monochrome pattern is assigned to all of a plurality of graphs included in the input image and a monochrome pattern is assigned to each region of the plurality of graphs, a graph in which the region is painted Is displayed.

The second invention shown in the present application inputs an image including a color graph, recognizes a plurality of graphs included in the input image, and one or a plurality of regions included in the plurality of graphs, A graph display method for converting the color graph into monochrome based on a plurality of stored monochrome patterns and displaying the monochrome graph,
The initial value 1 is substituted into the corresponding variable indicating the region order of the region to which the monochrome pattern is to be allocated, and the region included in the graph among the graphs to which the monochrome pattern has not been allocated among the graphs to be converted to monochrome The color information arranged in the assigned area is set as a monochrome pattern allocation target graph in the descending order, the monochrome pattern unallocated area included in the acquired monochrome pattern allocation target graph is set as the monochrome pattern allocation area in order. To determine whether the area having the acquired color information is included in the order of the area indicated by the corresponding variable among other graphs to which the monochrome pattern has already been assigned, and has the same color information. If the area is When included in the order of the areas indicated by the variables, the same monochrome pattern assigned to the area having the same color information is assigned to the pattern assignment area and the same graph of the area including the area having the same color information The area order of areas having color information is substituted into the corresponding variable, and areas having the same color information are included after the area order shown in the corresponding variables of the other graphs to which the monochrome pattern has already been assigned. If not, obtain an unassigned pattern from the stored monochrome pattern and assign it to the pattern assignment area, and assign the order of the pattern assignment area of the graph including the pattern assignment area to the corresponding variable; The monochrome pattern is applied to all areas included in the graph to which the monochrome pattern is assigned. If an unallocated area is not allocated, an unallocated area is acquired, a monochrome pattern is allocated to all areas included in the graph that is the target of monochrome pattern allocation, and there are other graphs to which no monochrome pattern is allocated. In this case, an unassigned graph is obtained by substituting the initial value 1 into the corresponding variable, and when a monochrome pattern is assigned to all of the plurality of graphs included in the input image, assignment to each region of the plurality of graphs A graph in which the area is painted is displayed with the monochrome pattern.

  In the graph display method of the present application, when a plurality of color graphs are converted into monochrome simultaneously, a monochrome pattern is allocated in consideration of the number and order of regions included in the plurality of graphs and the RGB values assigned to the regions. This eliminates the case where the monochrome patterns of a plurality of areas showing the same element are different in different graphs, and even when there are a plurality of areas arranged in the same RGB value in one graph, By assigning a pattern, it becomes easy to identify those areas.

  A configuration of an embodiment of a graph display program 1 using the graph display method shown in the present invention is shown in FIG. The graph display program 1 includes a display input device 11, an application 12, a color graph display unit 13, a conversion target selection unit 14, a graph area determination unit 15, a graph information storage unit 16, a monochrome pattern allocation unit 18, a monochrome graph display unit 20, The area data storage unit 17 and the monochrome pattern data 19 are included.

  Moreover, the usage form of the graph display program 1 is shown in FIG. In the form shown in FIG. 2, an information device 21 such as a personal computer and a printing machine 22 are connected so that data communication is possible, and the application 12 and the graph display program 1 are installed on the hard disk of the information device 21. The form in which the application 12 and the graph display program 1 operate is shown.

  In addition, the connection form of the information device 21 and the printing machine 22 may be via a network such as the Internet, and may be wireless data communication. Further, the application 12 and the graph display program 1 are not installed on the hard disk of the information device 21 but are stored in a storage medium such as a CD-ROM or a DVD, and the information device 21 can store the application 12 or the graph display program 1 from the storage medium. May be read and operated.

  Details of the configuration shown in FIG. 1 will be described. The display input device 11 is a device that displays an image output by the graph display program 1 and that a user of the graph display program 1 inputs an instruction to the graph display program 1.

  The color graph display means 13 has a function of receiving image data from an application such as spreadsheet software or a drawing tool and displaying it on the display input device 11.

  The conversion target selecting means 14 is used for the user of the graph display program 1 to designate one or a plurality of graphs to be displayed after being converted into monochrome from the graph image displayed on the display input device 11 by the color graph display means 13. have.

  The graph area determination unit 15 has a function of determining a plurality of areas included in one or a plurality of graphs specified by the conversion target selection unit 14.

  The graph information storage means 16 assigns an identification number for each graph for one or a plurality of graphs determined by the graph area determination means 15, and assigns an identification number to an area included in the graph. The region identification number and the RGB values arranged in the region are associated with each other and stored in the region data storage unit 17.

  The monochrome pattern assigning means 18 has a function of assigning a monochrome pattern in the monochrome pattern data 19 to each area in the graph and storing it in the area data storage unit 17 in consideration of the area order of each graph.

  The monochrome graph display means 20 has a function of displaying the graph to which the monochrome pattern is assigned by the monochrome pattern assignment means 18 on the display input device 11 of the user.

  In the monochrome pattern data 19, various types of monochrome patterns and pattern identifiers are registered in association with each other. An example of the monochrome pattern data 19 is shown in FIG. The order of the monochrome patterns stored in the monochrome pattern data 19 is considered in advance so that patterns that are difficult to identify are not continuously stored.

  The region data storage unit 17 includes a graph identifier field that stores a graph identification number as a value, a region identification number field that stores a region identification number as a value, and an RGB value field that stores an RGB value of the original color as a value. And a monochrome pattern identification number field for storing a monochrome pattern identification number as a value. An example of the area data storage unit 17 is shown in FIG.

  In FIG. 7, RGB values are represented by 6-digit hexadecimal numbers from 0 to F. The first two digits are the luminance of the red component, the next two digits are the luminance of the green component, and the next two digits are the luminance of the blue component. Equivalent to. 00 has the lowest luminance, and FF has the highest luminance. Therefore, the color indicated by RGB value “000000” is black, and white is indicated by “FFFFFF”. In FIG. 7, blue is indicated by “0000CC”, orange is indicated by “FFBB44”, and white is indicated by “FFFFFF”.

  Next, the flow of processing of the graph display program 1 is shown with reference to FIG. Step S <b> 801 in FIG. 8 is a step in which the color graph acquisition unit 13 acquires a color graph image from the application 12. For example, an image describing eight color graphs as shown in FIG. 9 is acquired. In the actual color graph, the assigned color is assumed to be painted in each area of the graph. However, in FIG. 9, the name of the color that is actually painted is written in the text in each area. is doing.

  In step S802, the conversion target selection unit 14 displays the image acquired by the color graph acquisition unit 13 on the information terminal 11, and prompts the user of the graph display program 1 to select a graph to be converted into monochrome. The screen actually displayed on the display input device 11 is as shown in FIG. FIG. 10 shows that four graphs located on the left side from the center of the screen are selected. The graph may be selected by specifying a range surrounding several graphs by dragging and dropping the mouse, or by selecting one or a plurality of graphs by clicking each graph with the mouse.

  Step S803 is a step in which the conversion target selection unit 14 receives information about one or more graphs selected by the user of the graph display program 1 from the display input device 11 in Step S802.

  Step S804 is a step in which the graph area determination unit 15 determines an area that is considered to be a graph from the image and a plurality of areas included in the graph. The determination of the area considered to be a graph can be realized by a known technique. For example, the technique disclosed in Japanese Patent Laid-Open No. 4-142679 is used. In this way, only the area identified as the graph is acquired from the input image. Note that, when the conversion target selection unit 14 corresponding to step S802 designates only a plurality of graph images with the pointing device, the process of determining the graph area in the process of step S804 may be unnecessary.

  Next, the graph area determination means 15 acquires the coordinates where each area is arranged and the RGB value applied to each area for each of a plurality of areas included in each graph in the area of the acquired graph. To do. This processing can also be realized by a known technique. For example, techniques shown in Japanese Patent Laid-Open Nos. 4-142679 and 1-173178 are used to obtain the region coordinates. Further, in order to obtain the RGB value, a method of digitizing each intensity of the three primary color signals with a predetermined resolution for each region of pixels, which is one of known techniques, may be used.

  In step S805, as shown in FIG. 12, the graph information storage unit 16 assigns a graph identification number to each graph, assigns an area identification number to each area of each graph, and determines the type of area, the area In this step, the coordinates and the RGB values of the area are stored in the area data storage unit 17. At this time, all the values of the monochrome pattern identification symbol field of the area data storage unit 17 are in a state of no value. The coordinate value field in FIG. 12 actually stores a value indicating the coordinate value as shown in FIG. 7, but since it is not directly related to the pattern assignment processing, the coordinate value in FIG. Is not listed. The same applies to FIGS. 13, 15, 16 and 18, which will be described later.

  For example, when the four pie charts shown in FIG. 11 are input, the areas of the four graphs are determined in step S804, and all the graph information is stored in the area data storage unit 17 in step S805, FIG. As shown. In the case of FIG. 12, in the graph of FIG. 11, the upper left graph is the graph identification number 1, the upper right graph is the graph identification number 2, the lower left graph is the graph identification number 3, and the lower right graph is the graph identification number. 4 is registered in the area data storage unit 17.

  Step S806 is a step in which the monochrome pattern assigning means 18 reassigns the graph identification numbers in the order of the graph having the largest number of regions included in the graph, based on the graph information stored in the region data storage unit 17 in Step S805. For example, in the area data storage unit 17 as shown in FIG. 12, the graph identification numbers are reassigned in the order of the graph having many areas as shown in FIG. For example, the lower left graph shown in FIG. 11 has six regions, and the graph identification number is assigned as 1 because there are more regions than other graphs.

  Step S807 is a step in which the monochrome pattern assigning means 18 substitutes an initial value 1 for a variable X indicating a graph identification number of a graph that is currently a pattern assignment target.

  Step S808 is a step in which the monochrome pattern assigning means 18 substitutes an initial value 1 for the variable Y indicating the area identification number of the area currently targeted for pattern assignment.

  Step S809 is a step in which the monochrome pattern assigning means 18 substitutes an initial value 0 for a corresponding variable Z indicating the number of an area having the same RBG value as the current pattern assignment area in another graph to which the pattern has been assigned. It is.

  Step S810 is a step in which the monochrome pattern assigning means 18 assigns a pattern to the area indicated by the area identification number Y of the graph indicated by the graph identification number X. As the identifier of the pattern assigned to each area, the identification number of the assigned monochrome pattern is stored in the monochrome pattern identification number field of the area data storage unit 17. The detailed processing flow in step S810 will be described separately.

  In step S811, the monochrome pattern assignment unit 18 increments the variable Y indicating the area identification number. If Y is 1, 2 is substituted for Y in this step.

  In step S812, the monochrome pattern assigning means 18 compares the number of areas in the graph indicated by the graph identification number X with Y, and determines whether Y does not exceed the number of areas. If Y exceeds the number of areas, the process proceeds to step S813. If Y does not exceed the number of areas, the process proceeds to step S809.

  In step S813, the monochrome pattern assignment unit 18 increments X, which is a graph identification number for identifying a graph. If X is 1, 2 is substituted for X in this step.

  In step S814, the monochrome pattern assignment unit 18 compares the total number of graphs included in the area data storage unit 17 with X, and determines whether X exceeds the total number of graphs. If X exceeds the total number of graphs, the process proceeds to step S815. If X does not exceed the total number of graphs, the process proceeds to step S809.

  Step S815 is a step in which the monochrome graph display unit 20 causes the display input device 11 to display an image in which a pattern is assigned to each area of each graph using the data in the area data storage unit 17. Specifically, the color scheme of each area of each graph is obtained from the monochrome pattern data 19 using the monochrome pattern identification number stored in the area data storage unit 17, and each area is filled with the acquired monochrome pattern and displayed. The The above is the processing flow of the graph display program.

  Next, a detailed flow of processing for assigning a monochrome pattern to each area of the graph, which corresponds to step S810, will be described with reference to FIG.

  Step S1401 is a step in which the monochrome pattern assigning unit obtains an RGB value corresponding to the region identification number Y of the graph identification number X from the region data storage unit 17. For example, when the area data storage unit 17 of FIG. 12 is used, the RGB value when the graph identification number X is 1 and the area identification number Y is 1 is “0000CC”.

  Step S1402 is a step in which the monochrome pattern assigning unit determines whether or not a region having an RGB value similar to the RGB value of the region acquired in step S1401 is already in the pattern assigned graph. Whether the pattern has already been assigned can be determined by the presence or absence of a value in the monochrome pattern identification number field of the area data storage unit 17. If an area having the same RGB value is already in the monochrome pattern assigned graph, the process moves to step S1403, and if an area having the same RGB value is not already in the monochrome pattern assigned graph. The process moves to step S1409.

  In step S1403, the number of areas having the same RGB value as the RGB value of the area indicated by the area identification number Y in the graph already assigned with the monochrome pattern acquired by the monochrome pattern assigning unit in step S1402, and the graph identification number Is a step of determining whether or not the number of regions having the RGB value is the same as the number of regions in the graph in which X is X. If the number of areas is the same, the process moves to step S1410, and if not, the process moves to step S1404.

  In step S1404, the monochrome pattern allocation unit obtains the monochrome pattern in which the number of areas having an area identification number larger than the corresponding area number Z in the already allocated monochrome pattern acquired in step S1402 is the graph identification number X. Is a step of determining whether or not is equal to the number of unallocated areas. If they are equal, the process moves to step S1410, and if they are not equal, the process moves to step S1405.

  In step S1405, the user of the graph display program 1 shows how the monochrome pattern assigning means corresponds to the element of the area corresponding to the area identification number Y and the element of the area having the same RGB value to which the pattern is assigned. This is a step of sending information to be selected to the display input device 11. An example of the screen displayed on the display input device 11 is shown in FIG.

  In step S 1406, the monochrome pattern assigning unit receives information on the area selected by the user of the graph display program 1 from the display input device 11.

  Step S1407 is a step in which the monochrome pattern assigning unit acquires the area identification number of the area received in step S1406 from the area data storage unit 17 and substitutes it into the corresponding area number Z.

  Step S1408 is a step in which the monochrome pattern assigning unit obtains from the region data storage unit 17 the identification number of the monochrome pattern that has been assigned to the region received in step S1406.

  In step S1409, the monochrome pattern assigning unit obtains an unassigned monochrome pattern identification number from the top of the monochrome pattern data.

  Step S1410 assigns to the area indicated by the identification number next to the corresponding identification number Z from the areas having the same RGB value as the area indicated by the area identification number Y in the already assigned monochrome pattern graph. This is a step in which the monochrome pattern assigning means obtains the identification number of the monochrome pattern thus obtained.

  Step S1411 is a step in which the monochrome pattern assignment unit substitutes for Z the next largest identification number after the corresponding identification number Z acquired in step S1410.

  In step S1412, the monochrome pattern assignment unit acquires the monochrome pattern identification number acquired in step S1408, step S1410, or step S1409 as the value of the monochrome pattern identification number field corresponding to the area identification number Y in the area data storage unit 17. This is the step to register.

  The above is the detailed flow of the process of assigning a monochrome pattern to each area of the graph, corresponding to step S810.

  Now, the flow of displaying the four graphs shown in FIG. 11 after monochrome conversion will be described along the above steps. The following processes are all performed by the monochrome pattern assigning means 18. First, in step 806, the area data storage unit 17 to which the graph identification number is reassigned is shown in FIG.

  Next, in step S1401, “0000CC” is acquired from the region data storage unit 17 as RGB of the region having the graph identification number 1 and the region identification number 1. In the next step S1402, it is determined whether the area having the same RGB value as “0000CC” is included in the graph to which the monochrome pattern is assigned. In this case, since there is no graph to which the monochrome graph is assigned, the process proceeds to step S1409. .

  In step S1409, 1 which is the identification number of the unassigned monochrome pattern in the graph identification number 1 is acquired from the monochrome pattern data 19 as shown in FIG. In step S1412, the monochrome pattern identification number 1 acquired in step S1409 is assigned to the monochrome pattern identification number field corresponding to the graph identification number 1 and the area identification number 1. Thus, the area data storage unit 17 after the monochrome pattern of the area of the graph indicated by the graph identification number 1 is assigned is as shown in FIG. In the case of the graph indicated by the graph identification number 1, the determination process of step S1402 always moves to step S1409. As a result, the monochrome patterns registered in the monochrome pattern data 19 are displayed in order from the top. It will be assigned to the area.

  Next, the upper left graph of FIG. 11 where the graph identification number is 2 will be described. In step S1401, “0000CC” is acquired as the RGB value of the area where the graph identification number is 2 and the area identification number is 1. In step S1402, it is determined whether the graph already assigned with the pattern has the same RGB value as the acquired RGB value “0000CC”. In this case, it can also be seen from FIG. 15 that there is an area having “0000CC” as the area of the graph with the graph identification number 1, which is a graph that has already been assigned a pattern.

  Therefore, the process moves to step S1403. In step S1403, it is determined whether the number of regions having the RGB value “0000CC” is the same in the graph with the graph identification number 1 and within the graph with the graph identification number 2. In this case, since the number of both areas is 2, the process moves to step S1410.

  In step S1410, the monochrome pattern identification number assigned to the area identification number next to the corresponding identification number Z is acquired from the area having the RGB value “0000CC” at the graph identification number 1. In this case, the correspondence identification number is an initial value of 0, and in the area of the graph identification number 1, the area identification numbers that are larger than 0 and have the RGB value “0000CC” are 1 and 4. Therefore, the monochrome pattern identification number 1 assigned to the area having the area identification number 1 is acquired.

  If the corresponding identification number Z is 0 as an initial value and the identification numbers of areas having the same RGB value are 3, 5, 7, etc., 3 is acquired as the next highest number after 0. The next higher number in this case does not simply indicate an increment. In step S1411, 1 is assigned to the corresponding identification number Z, which is the next larger area identification number after the corresponding identification number Z. In step S1412, the graph of the area data storage unit 17 is displayed. The monochrome pattern identification number 1 acquired earlier is stored in the monochrome pattern identification number field corresponding to the identification number 2 and the area identification number 1.

  Next, pattern assignment of a region where the value of the graph identification number X is 2 and the value of the region identification number Y is 2 will be described. In step S1401, the RGB value of the region where the value of the graph identification number X is 2 and the value of the region identification number Y is 2 is acquired. The RGB value in this case is “0000CC”. Next, in step S1402, it is determined whether or not the area having the same RGB value as the RGB value “0000CC” acquired earlier is in the pattern assigned graph. In this case, the graph identification number assigned the pattern is assigned. Since the graph of 1 has the same RGB value, the process moves to step S1403.

  In step S1403, is the number of regions included in the graph identification number 1 and the RGB value “0000CC” equal to the number of regions included in the graph identification number 2 and the RGB value “0000CC”? Is determined. In this case, the number of regions included in the graph identification number 1 and having an RGB value of “0000CC” is two. In addition, since the number of areas included in the graph identification number 2 and the RGB value is “0000CC” is 2, the number of areas where the RGB value is “0000CC” is equal. Therefore, the process proceeds to step S1410.

  In step S1410, the monochrome pattern identification number assigned to the area identification number next to the corresponding identification number Z is acquired from the area having the RGB value “0000CC” at the graph identification number 1. In this case, the correspondence identification number is 1, and in the area of the graph identification number 1, it is found that the area identification number having an RGB value “0000CC” larger than 1 is one of four. Therefore, the monochrome pattern identification number 1 assigned to the area having the area identification number 4 is acquired.

  In the next step S1411, 4 which is the next largest identification number after the correspondence identification number Z in the region having the RGB value “0000CC” acquired earlier is assigned to the correspondence identification number Z. In step S1412, 4 which is the monochrome pattern identification number acquired in step S1410 is stored in the monochrome pattern identification number field corresponding to the graph identification number 2 and the area identification number 2 in the area data storage unit. The

  Next, pattern assignment of a region where the value of the graph identification number X is 2 and the value of the region identification number Y is 3 will be described. In step S1401, the RGB value of the region where the value of the graph identification number X is 2 and the value of the region identification number Y is 3 is acquired. The RGB value in this case is “FFFFFF”. Next, in step S1402, it is determined whether an area having the same RGB value as the RGB value “FFFFFF” acquired earlier is in the graph to which the pattern has been assigned. In this case, the graph identification number to which the pattern has been assigned. Since the graph of 1 has the same RGB value, the process moves to step S1403.

  In step S1403, is the number of regions included in the graph identification number 1 and the RGB value “FFFFFF” equal to the number of regions included in the graph identification number 2 and the RGB value “FFFFFF”? Is determined. In this case, the number of regions included in the graph identification number 1 and having an RGB value of “FFFFFF” is two. Further, since the number of areas included in the graph identification number 2 and the RGB value is “FFFFFF” is 1, the number of areas where the RGB value is “FFFFFF” is not equal. Therefore, the process proceeds to step S1404.

  In the next step S1404, first, the region data storage unit 17 calculates the number of regions having a graph identification number of 1, an area identification number equal to or higher than the corresponding identification number Z, and an RGB value of “FFFFFF”. Get from. In this case, since Z is 4, the number of areas having an area identification number of 5 or more and an RGB value of “FFFFFF” is one with an area identification number of 5.

  In addition, among the areas where the graph identification number is 2 and the monochrome pattern is not assigned, the number of areas where the RGB value is “FFFFFF” is one where the area identification number is 3. Thus, since the number of areas is equal, the process proceeds to step S1410 as the next process.

  In step S1410, among the areas obtained in step S1404, where the graph identification number is 1, the area identification number is 4 or more indicated by the correspondence identification number Z, and the RGB value is “FFFFFF”. The pattern identification number assigned to the identification number that is next to the identification number Z is acquired. In this case, among the areas where the graph identification number is 1 and the RGB value is “FFFFFF”, the next largest identification number after the corresponding identification number Z is 5, and the monochrome pattern identification number already assigned to that area is 5 Therefore, 5 is acquired as the monochrome pattern identification number.

  In the next step S1411, 5 is assigned to the corresponding identification number Z, which is the second largest identification number after the corresponding identification number Z in the region having the RGB value “FFFFFF” acquired earlier. In step S1412, the monochrome pattern identification number 5 acquired in step S1410 is stored in the monochrome pattern identification number field corresponding to the graph identification number 2 and the area identification number 3 in the area data storage unit. .

  In the same process, the pattern identification number 6 is stored as a pattern of the area in which the value of the graph identification number X is 2 and the value of the area identification number Y is 3 in the area data storage unit 17. The area data storage unit 17 at this stage is as shown in FIG.

  Next, a flow of processing for assigning a monochrome pattern to each area of the graph identification number 3 will be described. In step S1401, the RGB value of the region where the value of the graph identification number X is 3 and the value of the region identification number Y is 1 is acquired. The RGB value in this case is “0000CC”. Next, in step S1402, it is determined whether or not the area having the same RGB value as the RGB value “0000CC” acquired earlier is in the pattern assigned graph. In this case, the graph identification number assigned the pattern is assigned. Since the graph of 1 has the same RGB value, the process moves to step S1403.

  In step S1403, is the number of regions included in the graph identification number 1 and the RGB value “0000CC” equal to the number of regions included in the graph identification number 3 and the RGB value “0000CC”? Is determined. In this case, the number of regions included in the graph identification number 1 and having an RGB value of “0000CC” is two. Further, since the number of areas included in the graph identification number 3 and the RGB value is “0000CC” is 1, the number of areas where the RGB value is “0000CC” is not equal. Therefore, the process proceeds to step S1404.

  In the next step S1404, first, the area data storage unit 17 calculates the number of areas having a graph identification number of 1, an area identification number equal to or higher than the corresponding identification number Z, and an RGB value of “0000CC”. Get from. In this case, since Z is 0, which is an initial value, the number of areas where the graph identification number is 1, the area identification number is 1 or more, and the RGB value is “0000CC” is that the area identification number is 1. Two of the area identification numbers are four.

  In addition, among the areas where the graph identification number is 3 and the monochrome pattern is not assigned, the number of areas where the RGB value is “0000CC” is one with the area identification number of 1. Thus, since the number of areas having the same RGB value is not equal, the process proceeds to step S1405 as the next processing.

  In step S1405, a selection menu as shown in FIG. In FIG. 17, a graph having a graph identification number of 1 and a graph having a graph identification number of 3 are displayed, and this time, this is indicated by a region identification number 1 of the graph identification number 3 that is a monochrome pattern allocation target. The area is displayed to prompt the user to select which area of the graph indicated by the graph identification number 1. As a selection target, 2 of the area indicated by the area identification number 1 of the graph identification number 1 and the area indicated by the area identification number 4 having the same RGB value as the area indicated by the area identification number 1 of the graph identification number 3 It has become one.

  In step S1406, selection information input by the user of the graph display program is acquired from the display input device 11. For example, if the selected region is the region indicated by the region identification number 4 of the graph identification number 1 (the second region painted in blue, which corresponds to 2 in FIG. 17), in step S1407, Strong information is assigned to the correspondence identification number Z, and the area identification number 4 of the selected area is substituted. In step S1408, 4 is the area data as the monochrome pattern identification number assigned to the area identification number of the selected area. Obtained from the storage unit 17.

  Next, in step S1412, 4 which is the monochrome pattern identification number acquired in step S1406 is stored in the monochrome pattern identification number field corresponding to the graph identification number 3 and the area identification number 1 in the area data storage unit. Is done.

  The flow of the process of assigning a monochrome pattern to each area of the graph identification number 4 is performed in the same manner as the process of assigning a pattern to each area of the graph identification number 3.

  As described above, the area data storage unit 17 in the case where the monochrome pattern identification number is assigned to each area of the four graphs shown in FIG. 11 along the processing flow of FIG. 14 is as shown in FIG. As a process corresponding to step S815, the monochrome graph display means 20 uses the monochrome pattern identification number stored in the area data storage unit 17 shown in FIG. 18 and uses the monochrome pattern data 19 shown in FIG. FIG. 19 shows a graph displayed on the display input device 11.

  In addition, although the above is an embodiment for a pie chart, the same mechanism can be applied to a graph shown in a bar shape as shown in FIG. In FIG. 20, as in FIG. 9 and the like, the area is actually filled with color, but in the figure, the name of the filled color is displayed in characters in the area. FIG. 21 is an example of an embodiment using a storage medium storing the graph display program 1 shown above. It is also possible for the computer 211 to read the graph display program 1 stored in the storage medium 212 and execute the graph display program 1. The above is the embodiment of the present invention.

  As described above, the graph display program of the present invention includes monochrome pattern data in which a plurality of monochrome patterns are stored, and the number of areas, the original RGB values of the plurality of color graphs to be displayed after monochrome conversion are displayed. By performing monochrome conversion in consideration of the area order, there is an advantage that the same monochrome pattern is assigned to an area having the same RGB value before conversion even if the number of areas included in the plurality of color graphs is different. For this reason, until now, after selecting multiple graphs to be converted to monochrome and performing monochrome conversion, it was necessary to manually correct the area where the same data was allocated to different monochrome patterns. However, by using the present invention, the same pattern is automatically assigned to areas showing the same data.

  Further, even in monochrome conversion of a color graph in which colors having the same RGB values are assigned to different areas in one graph, it is easy to identify the areas by assigning different monochrome patterns in consideration of the order of the areas. . The present invention can be considered effective when a plurality of color graphs are simultaneously converted into monochrome and displayed.

It is the figure which showed an example of the structure of a graph display program. It is the figure which showed an example of the utilization form of a graph display program. It is the figure which showed an example of the color graph. It is the figure which showed an example of the graph monochrome-converted by the well-known technique. It is the figure which showed an example of the graph monochrome-converted by the well-known technique. It is the figure which showed an example of monochrome pattern data. It is the figure which showed an example of the area | region data storage part. It is the flowchart which showed the flow of the process of the graph display program. It is the figure which showed an example of the input image containing a color graph. It is the figure which showed an example of the graph selection screen displayed on the display input device. It is the figure which showed the graph selected on the graph selection screen. It is the figure which showed an example of the data area memory | storage part immediately after identifying a graph area | region. It is the figure which showed an example of the data area memory | storage part immediately after reassigning a graph identification number. It is the flowchart which showed the flow of the process which allocates a monochrome pattern. It is the figure which showed an example which registered the monochrome pattern identification number to the data area memory | storage part. It is the figure which showed an example which registered the monochrome pattern identification number to the data area memory | storage part. It is the figure which showed an example of the graph selection screen displayed on the display input device. It is the figure which showed an example of the data area memory | storage part by which all the monochrome pattern identification numbers were registered. It is the figure which showed an example of the screen which displayed the graph by which monochrome conversion was made | formed on the display input device. It is the figure which showed an example of the color bar graph which can become the input object of a graph display program. It is the figure which showed an example of the form using the storage medium which memorize | stored the graph display program.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Graph display program 11 Display input device 12 Application 13 Color graph acquisition means 14 Conversion object selection means 15 Graph area | region determination means 16 Graph information storage means 17 Area | region data storage part 18 Monochrome pattern allocation means 19 Monochrome pattern data 20 Monochrome graph display means 21 Information equipment 22 Printing machine 211 Computer 212 Storage medium

Claims (2)

Input an image including a color graph, recognize a plurality of graphs included in the input image and one or a plurality of regions included in the plurality of graphs, and based on a plurality of monochrome patterns stored in advance, A graph display method for converting the color graph into monochrome and displaying it on a computer ,
On the computer,
A) The initial value 1 is assigned to the corresponding variable indicating the order of the areas to be assigned monochrome patterns, and
B) of the graph the is a monochrome conversion target, among monochrome pattern chart unassigned, the descending order of the number of areas included in the graph, is recognized as a graph of monochrome patterns Assignee,
C) in order to be recognized as the assigned area of the monochromatic pattern an area of a monochrome pattern unassigned included in the graph to be the acquired monochrome pattern allocation target,
D) to acquire the color information color to the allocation region,
E) region with the acquired color information is already out of another graph monochrome patterns assigned, to determine whether included in the area order later shown in the corresponding variable,
F) When an area having the same color information is included after the area order indicated by the corresponding variable in another graph to which a monochrome pattern has already been assigned, the area is assigned to the area having the same color information. A monochrome pattern is assigned to the pattern assignment area,
G) of the graph including a region having the same color information, an area the order of the region having the same color information, is assigned to the corresponding variable,
H) If an area having the same color information is not included after the area order indicated by the corresponding variable in another graph to which a monochrome pattern has already been assigned, the unassigned pattern from the stored monochrome pattern Is obtained and assigned to the pattern assignment area,
Graph comprising I) the pattern assigned area, the area order of the pattern assigned area, is assigned to the corresponding variable,
J) wherein is shifted to C when the monochrome pattern in all the areas included in the monochromatic pattern assignment target is graph is not assigned,
K) When a monochrome pattern is assigned to all the areas included in the graph to which the monochrome pattern is to be assigned and there is another graph to which no monochrome pattern is assigned, the initial value 1 is assigned to the corresponding variable. Shift to B,
L) When a monochrome pattern is assigned to all of the plurality of graphs included in the input image, a graph in which the region is painted with the monochrome pattern assigned to each region of the plurality of graphs is displayed. Graph display method. A computer that reads an image including a color graph, converts the color graph included in the image into monochrome based on a plurality of monochrome patterns stored in advance, and displays the computer on a display screen.
A) Substituting an initial value of 1 into a corresponding variable indicating the area order of areas to be assigned monochrome patterns;
B) recognizing a plurality of graphs included in the input image;
C) recognizing one or more regions included in each recognized graph;
D) acquiring color information applied to one or a plurality of areas acquired in the step, and storing the color information in the area data storage unit in association with the areas;
E) selecting a graph in the descending order of the number of regions included in the graph among the plurality of graphs in which the monochrome pattern is not assigned to the region;
F) selecting a monochrome pattern unallocated area included in the selected graph in order as a monochrome pattern allocated area;
G) obtaining color information arranged in the assigned area from the area data storage unit;
H) determining whether the area having the acquired color information among the areas of other graphs to which a monochrome pattern has already been assigned is included after the area order indicated by the corresponding variable;
I) An area having the same color information is assigned to an area having the same color information when the area having the same color information is included after the area order indicated by the corresponding variable in another graph to which a monochrome pattern has already been assigned. Storing a monochrome pattern in the area data storage unit as a monochrome pattern of the assigned area;
J) Substituting the region order of the regions having the same color information into the corresponding variable;
K) When an area having the same color information is not included after the area order indicated by the corresponding variable in another graph to which a monochrome pattern has already been assigned, an unassigned pattern from the stored monochrome pattern And storing it in the area data storage unit as a monochrome pattern of the pattern allocation area;
L) Substituting the region order of the pattern allocation region of the graph including the pattern allocation region into the corresponding variable;
M) If a monochrome pattern is not assigned to all the areas included in the selected graph, the process moves to F.
N) When a monochrome pattern is assigned to all areas included in the selected graph and there are other graphs to which no monochrome pattern is assigned, the initial value 1 is assigned to the corresponding variable and the process proceeds to E. ,
O) When a monochrome pattern is assigned to all of the plurality of graphs included in the input image, the plurality of graphs in which the area is painted with the monochrome pattern of each area stored in the area data storage unit are displayed. Step,
Graph display program characterized by functioning as

Images