JPH056418A - Graphic processing device - Google Patents

Abstract

(57) [Abstract] [Purpose] The function drawn on a graph paper is read by an image scanner and displayed on the screen. When there is distortion in a part of the graph of the manuscript, the correct part is processed by neighborhood point processing,
It is an object of the present invention to provide a graphic processing device capable of drawing a graph having an accurate shape by plotting while correcting distortion without performing neighborhood point processing on a distorted portion. [Structure] In the graphic processing device, the image read by the image scanner 8 is displayed on the screen of the CRT 7,
By storing all the coordinates of the points that may be plotted in the candidate point coordinate storage area 3b and arbitrarily selecting whether or not to perform the neighboring point processing when the point through which the graph passes is specified by the mouse 6. It is possible to easily draw a graph having an accurate shape by designating the passing points while correcting the deviation of the coordinates, interpolating between the passing points by the spline, and drawing the graph.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a graphic processing apparatus for drawing a function graph, and more particularly to a graphic processing apparatus for drawing a function graph based on an image captured by an image scanner.

[0002]

2. Description of the Related Art Conventionally, when a graph having a complicated shape is drawn on a display screen of a graphic processing device, an image reading device such as an image scanner reads an image of an original of the graph and the read image is displayed on the screen of the display device. , The passing points are plotted, and the plotted passing points are interpolated by a method such as a spline to draw a graph.

Further, the following method is an improvement of this method. The coordinates of the points on the line of the graph are calculated from the image read before plotting the passing points and stored. When plotting the coordinates near the line of the graph at the time of point plotting, that is, when the neighborhood of the coordinates of the previously stored point is plotted, it is considered that the point on the line of the graph is plotted, and the coordinates of the specified point are plotted on the graph. This is a method of eliminating so-called misalignment during plotting by performing so-called neighboring point processing of correcting the coordinates to.

[0004]

However, when a handwritten graph is used for the original document to be read, the shape of the graph is a little distorted from the beginning, so the point plot is performed while correcting the shape of the graph based on the read image. In this case, the latter method could not be used, and the only method was careful point plotting in the former method. But,
With this method, it was necessary to carefully plot the correct shape portion of the original manuscript graph when specifying the point plot.

Further, in a graph of an original read by an image reading apparatus such as an image scanner, the color of the line of the graph may be light, faint, or the original may be dirty. Therefore, in the image obtained as a result of reading the graph, the graph is partially cut off in the middle, or extra dust is attached.

In the former method, the plotted position is liable to be slightly deviated from the image displayed on the screen, and as a result, irregularities are generated due to the deviation of the plotted points in the drawn graph.

Even if the neighborhood point processing is performed at the time of plotting as in the latter method, the neighborhood point processing itself becomes meaningless in the section where the line of the graph is broken, and the result of the neighborhood point processing becomes in the section with dust. The coordinates on the graph are not always correct, and it took time and effort to call the next candidate point until the result of the neighborhood point processing specified a point on the graph.

The present invention has been made in order to solve the above-mentioned problems, and it is possible to arbitrarily switch whether or not to perform the neighboring point processing at the time of point plotting, as necessary, thereby performing the neighboring point processing. By eliminating the irregularities of the graph due to the deviation of the plotted coordinates by performing the neighborhood point processing in the section where it can be effectively used, and by plotting the points where the neighborhood point processing cannot be used without performing the neighborhood point processing, An object of the present invention is to provide a graphic processing device capable of drawing a more accurate graph quickly.

[0009]

To achieve this object, a graphic processing apparatus of the present invention comprises an image display means for displaying an image read from an image reading device on a screen of a display device, and the image display means. Candidate point coordinate storage means for calculating and storing the coordinates of a plurality of points in the displayed image, point plotting means for designating points on the screen, and coordinates designated by the point plotting means are the candidate point coordinates. 1 of the candidate points stored in the storage means
When a point is near one of the candidate points, a designated coordinate correction means for replacing the coordinate of the designated point with the coordinate of the candidate point, and a designated coordinate correction means when the point on the screen is designated by the point plotting means Switching means for selecting whether to perform or not, interpolation means for interpolating between the designated points designated by the point plotting means and the designated coordinate correcting means, and each passing point of the graph calculated by the interpolating means And a graph drawing means for drawing a graph from the coordinates.

[0010]

The graphic processing apparatus of the present invention having the above-mentioned configuration is
The image display means displays the image captured by the image reading device on the screen of the display device. The candidate point coordinate storage means calculates and stores the coordinates of a plurality of points in the image displayed by the image display means. The point plotting means designates a point through which the graph passes while observing the image displayed on the screen of the display device by the image displaying means. The switching means switches whether the designated coordinate correction means is operated or not. The designated coordinate correction means is one of the candidate points stored in the candidate point coordinate storage means when the designated coordinate correction means is operated by the switching means, and the coordinates of the point designated by the point plotting means are one of the candidate points. Replaces the coordinates of the specified point with the coordinates of the candidate point when it is near. The interpolating means interpolates between the designated points designated by the point plotting means and the designated coordinate correcting means. The graph drawing means draws a graph from the coordinates of each passing point of the graph calculated by the interpolation means.

[0011]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

FIG. 2 is a block diagram showing the hardware configuration of an embodiment embodying the present invention.

As shown in FIG. 1, a central processing unit (CPU) 1 that controls the entire apparatus has a read-only storage device (ROM) that stores predetermined programs and data.
2, a readable / writable storage device (RAM) 3 for temporarily storing programs and various data, an auxiliary storage device (hard disk) 4 for storing programs and the like of the graphic processing device, a start key and "Yes"" A key input device (keyboard) 5 having keys such as "No", a mouse 6 for designating points on the screen, a display device (CR for displaying a graph)
T) 7, image scanner 8 for reading graph originals
Are connected respectively.

As is well known, the CPU 1 executes the processing while decoding the data code read from the ROM 2 or the hard disk 4 into the RAM 3. Further, the RAM 3 is provided with a program area 3a, a candidate point coordinate storage area 3b, a passing point coordinate storage area 3c, and other work area 3d and a stack area 3e which are generally necessary for executing a program. Is provided with a start key 5a, a "yes" key 5b, and a "no" key 5c.

Next, FIGS. 3 to 7 are flow charts showing the operation of the present embodiment, and the operation of the apparatus of the present embodiment will be systematically described below with reference to this flow chart.

In step 1 (hereinafter abbreviated as S1; the same applies to the following steps), the operator sets the original document of the graph to be drawn on the scanner and presses the start key 5a on the CRT 7. Message is displayed on the screen (see FIG. 8). Next, the system waits for key input and waits until the start key 5a is pressed (S2, S3: N
O). When the start key 5a is pressed (S3: YES), C
The PU 1 sends a command to the image scanner 8 to read a document (S4), and receives the image data read by the image scanner 8 (S5). In S6, the CPU 1 temporarily displays the received image data from the upper left corner of the screen of the CRT 7. The scanned data is black and white 2
Value data. In addition, since the graph original is usually written in black on white paper, the black part is the data 1 (O
N), the white part is read as data 0 (OFF).

In S7, the CPU 1 displays a message to specify the display position of the image data being displayed with the mouse 6, and waits for the left button 6a of the mouse 6 to be pressed (S7).
8, S9: NO). If you move mouse 6 here, mouse 6
The mouse cursor corresponding to the movement of moves on the screen.
When the mouse cursor is moved to an appropriate position and the left button 6a of the mouse 6 is pressed, the position confirmation code is output from the mouse 6. When the position confirmation code is output (S9: YE
S), the CPU 1 erases the previously displayed image data, reads the position of the mouse cursor, and redisplays the image data from that position (S10).

In step S11, the CPU 1 displays a message for prompting the user to decide whether to fix the display position of the image data or to specify it again at the bottom of the screen of the CRT 7, as shown in FIG. In S12 and S13, the CPU 1 waits for a key input of either "Yes" or "No". "Yes" here
If any key other than "No" is pressed, the process returns to S12 (S13: NO), and if any of the "Yes" and "No" keys is pressed, the process proceeds to S14 (S13: YES).
In S14, the CPU 1 proceeds to S15 if the input key is "yes" (S14: YES), returns to S7 if "no" (S14: NO), and again designates the display position of the image data.

When the image display position is determined in S7 to S14, the CPU 1 picks up ON dots in the image data received in S5 at an appropriate interval, for example, every other dot, counts the number, and stores it in the RAM3. A candidate point coordinate storage area 3b having a required size is secured (S15).

In S16, the CPU 1 picks up ON dots in the image data received in S5 at appropriate intervals, and stores the coordinates of the picked up dots in the candidate point coordinate storage area 3b.

In S17, the CPU 1 displays a message for plotting the passing points of the graph with the mouse (see FIG. 10). In S18, the mouse input is waited. S1
When the left button 6a of the mouse is pressed in step 9 (S19: Y
ES) proceeds to S20, and if the left mouse button 6a has not been pressed, returns to S18. In S20, the CPU 1 determines whether the input code is the end code. When the entered code is the end code (S20: YE
S), the designation of the coordinates of the passing point is ended, and the process proceeds to S36. If it is not the end code (S20: NO), the process proceeds to S21.
When the code input in S21 is the position confirmation code (S21: YES), the process proceeds to S24.

When the input code is not the position confirmation code (S21: NO), the process proceeds to S22. If the code input in S22 is the neighbor point process switching code (S22: YES), the process proceeds to S23. If it is not the neighbor point process switching code (S22: NO), the process returns to S18 and waits for the next input. (See Figure 10). RAM in S23
The neighborhood point processing flag provided in the work area 3d of No. 3 is inverted. The value of this flag is 0 (OFF) or 1 (O
N) takes any of the values, and when the value is 1 (ON), it means that the neighborhood point processing is performed.

At S24, the CPU 1 causes the work area 3 of the RAM 3 to operate.
It is determined whether or not to perform the near point processing by referring to the near point processing flag provided in d. If this neighborhood point processing flag is ON (S24: YES), the process branches to S25, where OF
In the case of F (S24: NO), the process branches to S34.

In step S25, the CPU 1 searches for candidate points in the vicinity of the points plotted in steps S17 to S24 among the points (hereinafter referred to as candidate points) in which the dots in the image data stored in steps S16 are ON. .. In S26, the CPU 1 branches depending on whether there is a candidate point near the plotted point. If there is at least one candidate point in the vicinity of the plotted points (S26: YES), go to S27, if not (S2
6: NO) branches to S34.

FIG. 11 is an enlarged view of the vicinity of the plotted points. In FIG. 11, points A to E are candidate points near the plotted points, and F is a mouse cursor indicating the plotted points. CPU1 in S27
Displays the candidate point (here, point C) closest to the plotted point among the candidate points in the vicinity of the plotted point with a marker of x. In S28, the CPU 1 sets the plot input point to S
A message asking the operator whether to replace the candidate point (neighboring point) indicated by the mark X in 27 is displayed (see FIG. 12). In S29, CPU1 is "Yes"
Wait for "No" input.

Here, "Yes" means that the neighboring point processing is performed by substituting the coordinates of the candidate points indicated by the markers into the coordinates of the plotted points as if the coordinates of the candidate points indicated by the markers were plotted. "No" means that the point indicated by the marker is not subjected to neighborhood point processing. CPU at S30
1 judges whether there is any input of "Yes" or "No", and if there is any input (S30: YES), S
If there is no input to S31 (S30: NO), S29
Branch to. In S31, the CPU 1 determines whether the input code is "yes" or "no", and if "yes" (S
31: YES, go to S33, if “No” (S3
1: NO) branches to S32.

In S32, the CPU 1 erases the marker of the currently displayed candidate point (point C), displays the next candidate of the neighboring point with the marker, and returns to S29. The next candidate of the neighboring point is a candidate point that is closest to the point designated by plotting next to the candidate point currently displayed by the marker. In S33, the CPU 1 erases the marker displayed in S27. In S34, the CPU 1 stores the coordinates of the point input by plotting or the point corrected by the neighboring point processing in the passing point coordinate storage area 3c. In S35, the stored points are displayed with a marker of X, and the process returns to S17.

In step S36, the CPU 1 interpolates between the designated passing points with a spline based on the passing point coordinate data stored in the passing point coordinate storage area 3c in steps S17 to S35, and a smooth coordinate point string is formed. Is obtained and stored in the passing point coordinate storage area 3c. In S37, the CPU 1 draws a function graph from the data of the coordinate point sequence obtained in S33 (FIG. 13).
reference).

The present invention is not limited to the embodiments described in detail above, and various modifications can be made without departing from the spirit of the invention.

In the present embodiment, the coordinates of the candidate points are calculated and stored before the point plot designation is started, but the periphery of the coordinates plotted every time when the point plot is performed, that is, the range to be subjected to the neighboring point processing. Alternatively, only the coordinates of the candidate points may be calculated and the neighboring point processing may be performed. In this case, the processing time slightly increases, but the memory capacity required for the candidate point storage area is significantly reduced.

[0031]

As is apparent from the above description, the graphic processing apparatus of the present invention calculates and stores the coordinates of candidate points that may be plotted in advance, and the shape of the graph of the original document is correct. For the interval that seems to be, replace the points entered in the plot with candidate points in the vicinity of the points to eliminate the deviation that occurs during plotting, and
For the section where the shape of the graph of the original manuscript seems to be distorted, the points are accurately plotted by making a point plot while consciously modifying the shape of the graph without replacing it with candidate points near that point. Graphs can be drawn.

[Brief description of drawings]

FIG. 1 is a diagram corresponding to a claim of the present invention.

FIG. 2 is a block diagram showing a hardware configuration of a graphic processing device.

FIG. 3 is a flowchart showing an operation of the graphic processing device.

FIG. 4 is a flowchart showing an operation of the graphic processing device.

FIG. 5 is a flowchart showing an operation of the graphic processing device.

FIG. 6 is a flowchart showing an operation of the graphic processing device.

FIG. 7 is a flowchart showing an operation of the graphic processing device.

FIG. 8 is a diagram showing a screen when the graphic processing device is in operation.

FIG. 9 is a diagram showing a screen when the graphic processing device is operating.

FIG. 10 is a diagram showing a screen when the graphic processing device is operating.

FIG. 11 is an enlarged view of a screen when performing near point processing.

FIG. 12 is a diagram showing a screen when the graphic processing device is operating.

FIG. 13 is a diagram showing a screen when the graphic processing device is operating.

[Explanation of symbols]

1 central processing unit (CPU) (specified coordinate correction means, interpolation means, graph drawing means, switching means) 3b candidate point coordinate storage area (candidate point coordinate storage means) 6 mouse (point plotting means) 7 display device (CRT) ( Image display means)

Claims (1)

Claim: What is claimed is: 1. An image display means for displaying an image read from an image reading device on a screen of a display device,
Candidate point coordinate storage means for calculating and storing the coordinates of a plurality of points on the image displayed by the image display means, point plotting means for designating points on the screen, and coordinates designated by the point plotting means. Is in the vicinity of one of the candidate points stored in the candidate point coordinate storage means, designated coordinate correction means for replacing the coordinate of the designated point with the coordinate of the candidate point, and the point plot Interpolating between the switching means for selecting whether or not to operate the designated coordinate correction means when a point on the screen is designated by the means, and each designated point designated by the point plotting means and the designated coordinate correction means. And a graph drawing unit for drawing a graph from the coordinates of each passing point of the graph calculated by the interpolation unit. Apparatus.