JPS63214068A - Area designating system - Google Patents

Abstract

PURPOSE:To limit the input area from an operator to the processing capability of hardware in the case of area designation by successively correcting the coordinates of a coordinate string inputted for area designation in accordance with positional relations to the other coordinates. CONSTITUTION:First, all set coordinates are cleared. Next, a first point P1(PX1, PY1) is inputted and a second point P2(PX2, PY2) is inputted. ¦PX2-PX1¦ and ¦PY2-PY1¦ are compared with each other, and the input point P2 is corrected to a point T2(TX2, TY2)=(PX2, PY1) because of ¦PX2-PX1¦>¦PY2-PY1¦. Similarly, a third point P3 is corrected to a point T3, and a fourth point P4 is corrected to a point T4, and a fifth point P5 is corrected to a point T5, and a sixth point P6 is corrected to a point T6. When respective corners of a desired area are completely inputted, an OK key is depressed and finally, the first point P1(PX1, PY1) is corrected to a point T1 (TX1, TY1)=(PX6, PY1) based on the last corrected point T6.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a method of specifying an area using a coordinate input device.

[Conventional technology]

Conventionally, in image processing devices such as copying machines, there has been a method of inputting area coordinates using a numeric keypad as a means of specifying an area on a document in order to realize a trimming function that extracts only an arbitrary area on the document, a masking function that erases, etc. . However, this method has problems with operability because it requires a procedure to read the coordinates using a measuring tape or the like and requires a large number of keystrokes. As a method to overcome these drawbacks, there is a method using a two-dimensional coordinate input device such as a digitizer.

[Problems to be Solved by the Invention] In a method using a two-dimensional coordinate input device such as a digitizer, a desired area can be directly designated on the document, and operability can be greatly improved. However, in this method, the degree of freedom in specifying the area exceeds the processing capacity of the hardware.
For example, there is a problem in that an area with a shape that cannot be trimmed is specified.

〔the purpose〕

In view of the above-mentioned drawbacks, the present invention aims to provide an area specification method that can limit the input area by an operator within the processing capacity of the hardware when specifying an area using a two-dimensional coordinate device such as a digitizer. .

〔Example〕

An embodiment of the present invention will be described in detail below with reference to the drawings.

FIGS. 1-2 are external views of a copying apparatus to which the present invention can be applied. The document reading unit 101 has a document table glass (not shown), a 2:1 optical system consisting of an illumination lamp and a mirror, a lens, a COD, etc. The optical system performs sub-scanning, photoelectrically converts the document image, and outputs it as an electrical signal. do. The printing unit 102 is a so-called laser printer, which receives an electrical signal from the reading unit 101, scans the photoreceptor with a modulated laser beam, and prints using an electrophotographic method. The reading unit 101 includes an operation unit 103, a coordinate input device 104 that also serves as a document holder, and a coordinate input pen 105. Figure 1-1 shows coordinate input device 1.
04 seen from above. 106 is an effective coordinate input surface, 107 is a reference point for placing the original 114 on the input surface, 108 is an area specification key for inputting an area specification, and 109 is a clear key for canceling a series of input coordinates. , 110 is the OK primary key 1 that ends the input of area specification.
11 is a trimming mode selection key for outputting only the specified area; 112 is a masking mode selection key for erasing only the specified area; and 113 is an image separation mode selection key for outputting the inside of the specified area with different processing from the outside.

Examples of these operations will be explained.

As shown in the figure, the operator places the original 114 against the reference point 107, enters the area specification mode using the key 108, and uses the input ben 1051 to rotate clockwise or After inputting in a counterclockwise direction, press the OK main key 10 to complete the input. After that, the processing content to be performed on the specified area is specified in 111, 11.
2,113 keys.

FIG. 3 shows a schematic block diagram of the copying apparatus of this embodiment.

302 is an image reading unit. The image reading unit 302 is a CCD
, a signal amplification circuit, an A/D conversion circuit, and a shading correction circuit, and the corrected signal is input to the image processing unit 303 .

The image processing unit 303 once stores the image signal in a shift memory, performs image processing such as scaling, movement, trimming/masking density conversion, etc., and outputs the result to the external unit 312 as a VIDEO signal. In this embodiment, the external unit 312 is assumed to be a so-called laser printer, but it may also be a controller and memory device for an electronic file, facsimile, etc.

Image signal VID is connected to the external unit via cable 313.
In addition to EO, a serial signal line 5RAL consisting of a plurality of signal images is used to send a serial signal to control the entire system. When the external unit 312 is a laser printer, it receives a horizontal synchronizing signal BD from the printer, generates a clock for internal operation by a clock generator 304, and supplies it to the reading section 302 and processing section 303 described above.

The CPU 301 includes a ROM 305 that stores control programs and control data, and a RAM 3 that stores processing data, etc.
06, has a timer circuit 307, and the above-mentioned reading section 302
) In addition to controlling communication with the processing unit 303 and external unit 312, it also controls a fluorescent lamp driver circuit 309 for illuminating the document, a motor driver circuit 308 for driving the optical system, the operation unit 311, and the coordinate input device 310. .

FIG. 4 shows a block diagram of the coordinate input device 310.

Timing circuit 402 generates a clock using a built-in oscillator and supplies it to address counter 403 . The address counter 403 performs a counting operation while the switch built in the pen 412 is pressed down. During the counting operation, the X decoder 409 operates first and dynamically scans the pulse voltage to the X direction electrodes of the input surface 411 twice, and then the Y decoder 410 operates and sequentially applies the pulse voltage to the Y direction electrodes of the input surface 411 twice. Perform dynamic scanning. When the pen switch is turned on on the input surface 411, when the scan in the X and Y directions reaches the pen position, a voltage is induced in the pen due to capacitance coupling, a pen input signal is obtained, and the amplifier 404 is amplified by A count value is set in the X register 406 by the pen input signal of the first round of X direction scanning, and the contents of the X register 406 and the count value are compared by the comparator 405 by the pen input signal of the second scan, and if they match. If so, a match signal is output to CPU 401. Similarly, 1 for the Y direction
During the second scan, the Y register 408 is set, and during the second scan, the comparator 407 compares and if they match, a match signal is output to the CPU 401, and when two match signals are obtained, the CPU 401 The coordinate values can be taken in from each Y register and notified to the main CPU 301 by, for example, serial communication. Note that if the X register 406 and the counter value do not match, it is determined that the input is invalid. Y
The same goes for the direction.

FIG. 5 shows a circuit diagram related to the inside of the image processing unit 303, particularly the shift memory. Although the shift memories are provided for two lines, their control is common, so FIG. 5 shows only one shift memory.
The control configuration is shown below. A write address counter 904 is an address counter for writing data into the shift memory 907, and a read address counter 905 is an address counter for reading data from the shift memory 907. The address selector 906 receives a command from the CPU 301 via the I10 port 901, and the address signal of the write address counter 904 and the read address counter I10 registers 902 and 903 send preset values to the write address counter 904, read address counter, and 9o5, respectively, to the CPU 301. is a register for giving.

Both the write address counter 904 and the read address counter 905 are down counters, and the WST signal and R3T signal that command the start of counting operation are input to each of them.
LK and the read tarock RCLK from the shift memory are input.

Reference numerals 915 and 916 denote exclusive OR gates for determining the image area, and signal OF is a signal that controls them.

910 is output from the shift memory 907 and sent to the density processing section 9.
08 is an AND gate that controls the output of the image data that has become a binary signal, 917 is an AND gate that determines whether to output the aforementioned mask portion as white or black, and BB is a signal that controls it. When it is 1, white is output when it is 0.

911 is an OR gate that outputs the image output from gates 910 and 917 as VIDEO; 909 is an exclusive OR gate that controls black and white inversion of image data; IN is a signal that controls it; when it is 1, the image is as original;
Invert when . Each signal is output by the CPU 301 according to the mode specified by the operator.

The ST counter 912 and the EN counter 913 are a start bit counter and an end bit counter for outputting an image only to a predetermined area, respectively.
The CPU 301 presets count data for the gate via lo.

The flip-flop 914 is set when the ST counter 912 counts up, and is reset when the EN counter 913 counts up.

For example, in the case of the OF multiplied signal 1, when the ST counter 912 counts up and the F/F 914 Q becomes 1, the gate 915
There is no output from the gate 910 and it is masked until the output of the gate becomes O and the EN counter 913 counts up.

Instead, the output of the gate 916 is l during that time, so when the BB signal is 1, the gate 917 is l, and the gate 911 outputs l, resulting in a black mask. Conversely, 0F=1. When BB=O, white masking is performed. Also, if it is 0F-0, gate 915.
Since each output of 916 becomes 1.0 during that time, BB=1
When , the area outside the trimming area is black, and when 0F=O, BB=0, the area outside the trimming area is white.

Now, this embodiment is effective when performing editing processing such as trimming and masking on a rectangle or a region that is a combination of rectangles using the above-described means.

A rectangle or a combination of rectangles is an area surrounded only by line segments parallel or perpendicular to the main and sub-scanning axes, and it is quite practical to limit the editing target to such areas. Moreover, the present invention is useful in that editing functions can be provided at low cost without using a large capacity memory.

Based on these limitations, the operator inputs coordinates discretely to surround the desired area, and makes sure that the line segments connecting these coordinates in the input order are as horizontal or perpendicular to the main and sub-scanning axes as possible. Please input as follows.

However, in reality, it is impossible to input two points connected horizontally and vertically using freehand pen input, considering the practical resolution of the coordinate input device. Correct the coordinates.

FIG. 2 shows a schematic example of the area designation method according to this embodiment.

■First, press the clear key to clear all the coordinates that have already been set.

,■Input the first point P, (PX,,PY,).

■Enter the second point P2 (PX2.PY2). At this time,
Comparing 1PX2PXIl and l PY2 PYI l, 1PX2-PX, lPY2-PYll, so input point P2 is determined as shown in the figure, T2 (TX2.TY2) = (PX
Correct to 2°PY, ).

■Input the third point p3 (PX3.PX3). At this time,
IPX3-TX21 from corrected second point T2 and third point P3
< 1PY3 - TY21, so as shown in the figure <P3
T3 (TX,, TY3) −(
PX 2 , PY 3 ).

■The fourth point P4 (PX4.PY4) is also compared with the corrected third point T3 and T4 (TX4.TY4) = (PX4.PY3)
and correct it. Similarly, ■The fifth point P5 (PX5.PY5) is T5 (TX5.TY
5) = (PX4.PX5) and ■6th point Pa (PXa, P Ya) is T6 (TX6
．． TY6) = (PX6.PY5).

■When inputting each corner of the desired area is completed, press the OK primary key.

■When the OK key is input, the first point P+(PX+*PY
I ) and corrected final point T6 = (T XS , T
From Ya ) = (P
l)=(PX6°PY, ).

By correcting and controlling the input coordinates in the above-described procedure, the area desired by the operator can be constructed of vertical line segments.

FIG. 6 shows a detailed flowchart of the above-mentioned correction process. First, a counter i on the RAM indicating the number of input coordinate points is cleared to 0 (601). If coordinates are input (602), set the X component to the area PXi, TXij on the RAM: and set the Y component to the same (PYi, TYi) (603)
.

If i = 0, that is, the first fish (604), the counter i is incremented to wait for the input of the second fish (615).
).

If i≧1 (604), the corrected coordinates of the previous point (T
i-t.

) and the current input coordinates (PXi, P
Yi)'s X.

The absolute values α and β of the difference for each Y component are determined (605).

The operator compares the magnitudes of α and β based on the premise that the line segment connecting each point is input so as to be as horizontal and perpendicular to the axis as possible (606). If α<β, the operator is Y
It is determined that an attempt was made to input coordinates parallel to the axis, and the Y coordinate PYi of the point of interest Pi is adopted as TYi,
The X coordinate PXi is canceled and the previous X coordinate T
i-+ is adopted as TXi (608). On the contrary, α〉β
If so, it is determined that the operator has input the coordinates parallel to the X axis, and the X coordinate PXi of the point of interest Pi is set as T.
Xi, cancel the Y coordinate PYi, and use the previous Y coordinate TYi-1 as TYi (60
7). The input point Pi is corrected to Ti by the corrections of 607° and 608, and after the line molecule 1-1T i becomes parallel to the X-axis or Y-axis, the next line molecule i-+Ti and the previous line molecule i Check whether -2T i -1 are orthogonal. If i = 1, only one line segment will be generated, so the counter i is incremented by 1 to wait for the input of the third point (6
09.610.615).

If i≧2, then TXi-z=TXi, that is, whether the two line segments of interest are on the same line segment parallel to the Y axis (612) or TYi-z=TYi, that is, the two line segments of interest are on the same line segment parallel to the Y axis. It is checked whether or not they are on the same line segment parallel to (611), and if No, the counter i is incremented by 1 to wait for the next input (615). If YES, in order to combine these two line segments into one line segment, the sum vector Tl-2TI-1+m=1 is replaced with Ti-2T+-1 (613, 614).

In other words, cancel the previous input Ti-+ and change Ti to Ti
-1, waits for Ti input again, does not increment counter i, and waits for the next coordinate. After incrementing the counter i to wait for a new input, the line molecule i −2T i− generated by the latest input point Ti−+
+ indicates all line molecules input so far. T1. T1T2
...T i -3 It is checked how many times it intersects with I-2 (616). The detailed flow will be described later.

If the result of intersection detection is that there is no intersection at all, the next coordinate input is waited (617, 602). If it intersects more than once, Ti
-+ is invalid input and counter i is set to 1 to wait for re-input.
Decrement (617→619). If it intersects only once, at least one closed region has been generated, so press the OK key manually or point T i-+ to finish specifying the region.
Waiting for clear key human power to cancel. If there is a clear key available, the counter i is decremented by 1 and waits for re-input (618→619).

If you have the OK key, proceed to the end point processing described later (62
4).

When there is no coordinate input in step 602, if there is a clear key input, the counter i is decremented by 1 in order to cancel the latest input point T i -1 and wait for re-input (
623). OK key If there is human power (624), the process proceeds to the end point process described later (624). When the area is determined as a result of end point processing, the process ends, and if it is not determined, the process waits for coordinate input or clear key input again.

FIG. 7 shows a control flow of intersection detection, which will be explained below. First, a counter k on the RAM indicating the number of intersections is cleared to 0 (701). When i<4, at most only four points, that is, only three sides have been input, so the detection process ends. When i is 5, i-4 is set in counter j on the RAM for cross checking (703). Then, the points T i-1, T i
−2, T j , T j−+ coordinates to calculate the value A
,B.

Find C and D (704.705.706.707).

The following function F is used to calculate the value.

F (Tm, Tn) = -1: 0 when TXm = TXn or TYm = TYn: TXm < TXn and TYm
< When TYn 1: TXm<TXn and TYm>TYn
2: When TXm>TXn and TYm>TYn 3: T
The number of hours F where Xm>TXn and TYm<TYn is assigned a value by classifying the positional relationship between the two points Tm and Tn into five cases, and is illustrated in FIG. That is, two points Tm,
Vector Tm generated from Tn, takes the value “-1” when Tn is parallel to the X-axis or Y-axis, “0” when it goes up to the right, “bi” when it goes up to the left, and “2” when it goes down to the left. is a function that outputs "3" when the curve is downward to the right.

If even one of the values A, B, C, and D is "-1", the sides T1-2Ti-+ and the sides r4r may touch but do not intersect, so update j ( 708→709
).

# If Ill is not present, the value is A as shown in 711 to 718 below.

B, C, D have values “0”, “1”, “2”, “ in that order.
3″.

Check whether the values are rotated in ascending or descending order. FIG. 9 shows an example in which the determination in step 711 is YES.

Below, the example in Fig. 9 is rotated clockwise by 90 degrees, and the positional relationship of the four points for cell door 12, 713, 714 is determined as YES. When the positional relationship is line-symmetrically folded back, YES is determined in step 715, and the process is then rotated counterclockwise by 90 degrees (
and 716, 717, and 718, respectively, increment the counter k by 1, and continue checking until j<O at step 710.

When j is decremented by 2 in step 709, the side Tj-1Tj when decremented by l is the side Ti-2Ti
This is because it is parallel to -1.

The end point processing flow is shown in FIG. 12 and will be explained below.

First check the counter i (1001), if i<2
In this case, since there are only two input points at most, the area is not determined (1012), and the process ends to wait for a new point power again.

If it is 123, the counter i value is decremented by 1 so that it indicates the latest input point number (1002).

Next, start point T. Vector T from to the second point T. T.

Determine the direction code DO of 100 based on FIG.
3) Similarly, the direction code D i-1 of the vector T i -+ Tr from the point T i-+ toward the latest point Ti is also determined (1004). After that, the end point processing type shown in FIG. Two direction codes Do according to the table
and Di-+ and the coordinates TX0. of point TO. T.Y. and point Ti
coordinates TXi.

Select the end point processing type from the positional relationship of the four coordinates of TYi, and perform the processing according to the processing contents listed in Table 1 (10
05).

Table 1 An example of correction based on the processing contents for each type listed in Table 1 is shown in FIG. The side Ti is determined by the start point (Sp) To and the end point (Ep) Ti newly determined by performing the processing in Table 1.
If To is generated and is perpendicular to the edge r ding T and the edge Ti−+Ti, there is no need for reprocessing, but if this is not the case, the steps 1001 and subsequent steps are performed again using the corrected To, Ti, and i. Processing is performed (1006→1001).

After securing the coordinates of each corner that can constitute a region using the above procedure, apply the above-mentioned intersection detection logic to each side to check whether the line segments formed by sequentially connecting each point from To to Ti intersect with each other. Correspond and execute (1007), if even one point intersects, it is assumed that the area is uncertain and waits again for the point power or clear key to cancel the input point manually (ioos
→1012).

In step 1009, among the points from point To to point Ti whose Y component shows the minimum value, the point Ts whose X component is the smallest is set as the area origin (1009).

Furthermore, the region origin Ts is set as To again, and the sequence of points is traced clockwise from the new To to Tl +T2.
..., renumber Ti (1010),
Confirm the area (1011) and end the area specification.

Step 1009. Processing examples of 1010 are shown in FIGS. 11-1 to 11-3.

Next, an example of editing the area determined by the above procedure will be described using FIGS. 15-1 to 15-3'%.

First, coordinates KXo are obtained by projecting the point sequence To, . . . , Ti onto the X and Y axes as shown in Fig. 15-1.

KX,,KX2. KX3. and KYo, KY,, KY2
゜KY3. seek. When the coordinate area is divided by these four coordinates, it is divided into nine zones 20 in Figure 15-1.
0,...Z22 can be defined. As can be seen from the figure, some of these nine zones actually constitute the designated area. In order to distinguish the zones that make up this designated area, each zone is redefined by its center of gravity coordinates. That is, Zij = (ZXij, ZYij).

(i=0.1,2)j=o,t,2],ZXij=(
KXi + KXi +1) /2) ZYij=
(KYj+KYj+1)/2. The following data K
Xo-KX3. KY0~KY3. Based on Zoo-Z22, it is determined whether each zone is included in the designated area as shown in FIG. 15-2.

A matrix-like MAP shown in the figure is configured in an area on the RAM. In this MAP, odd-numbered rows and odd-numbered columns correspond to zone boundaries, and elements defined in even-numbered rows and even-numbered columns correspond to the zones.

First, the point sequence T is obtained from the elements in the first column and third row corresponding to point To. , T1. ...Direction code 0 for each side in order of Ti. 1. 2. 3 is written into the corresponding element of MAP. After that, all the elements on the matrix indicating each zone are coded "0" upwards.

It is checked whether there is a code "B" in the downward direction, a code "2" in the left direction, and a code "3" in the right direction. When all four conditions are satisfied, the zone Zij is included in the area, and the condition If even one is missing, it is not included.

In the example of FIG. 15-2, Δ marks are included in the area, and X marks are not included in the area. In this example, matrix M
Although the AP has been described as 7×7, it is generally configured with NXM with a margin within the range allowed by the memory capacity. Further, each element may have at most 4 bits.

Zones Z 20 and Z that constitute the area as described above
to.

Z o+ , Z 11 , Z 21 , Z
15-3 is decided by the means described in Figure 5.
Edit as shown.

When the optical system moves along the sub-scanning direction Y, first, at the image tip A, the previous ST counter 912 . EN counter 9
13 are both set to 0, and the B point ST counter KXo and EN counter Kx3, which have advanced by KYo, are set, and then KY
At point D, which has advanced by 2-KY, the ST counter KX2.
Set ENN counter X3 and then KY3-KY2
ST counter at point E.

Both EN counters are set to 0 and the optical system enters the return motion. In this way, for example, it is possible to make only the inside of an area a valid image, or to make it invalid and perform mask processing.

As another embodiment, for example, in step 606 of FIG.
When correcting the coordinates from α and β, we not only simply compare the magnitudes of α and β, but also set a threshold value γ such that γ>min (α.

By correcting when the condition β) is satisfied, it becomes possible to more accurately grasp the intention of the operation. Further, if α-β is obtained in step 606 of FIG. 6, further step 6
If two or more intersections are detected in step 17, step 625
If the area is uncertain, the operator should be informed via display or audio that the input coordinates are invalid or that further coordinate input is required, etc., and corrections should be made sequentially based on the positional relationship with the previously input coordinates. By inferring the area that the operator intends, we can make sure that the operator does not have to commit to a specific input order or determine the area.
It is easy to operate and allows specification of areas within the processing capacity of the hardware.

1-2 is an external view of a copying apparatus to which the present invention can be applied, FIG. 2 is a diagram showing an example of coordinate correction, FIG. 3 is a schematic block diagram of the entire apparatus, and FIG. 4 is a block diagram of a coordinate input device. , Fig. 5 is a processing block diagram related to editing, Fig. 6 is a control flowchart for input coordinate correction, Fig. 7 is a control flowchart for intersection detection, Fig. 8 is an explanatory diagram of function F used for intersection detection, and Fig. 9 Figure 10 is a diagram showing an example of intersection, Figure 10 is a diagram showing direction codes of area sides, Figures 11-1 to 11-3 are diagrams showing examples of input point sequence rearrangement, Figure 12 is a diagram after coordinate input is completed. FIG. 13 is a diagram showing an end point processing type table; FIG. 14 is a diagram showing an example of end point processing; FIGS. 15-1 to 15-3 are diagrams showing examples of editing processing.

Applicant: Canon CJ% Type Company Agent: Giman Marushima 2 Figure q Male 10 Figure 1f 1 Yomi 1
3. The final point in Figure 75-2.

Claims (4)

[Claims] (1) In an image processing apparatus having a two-dimensional coordinate input device, means for sequentially correcting the coordinates of a coordinate string input by the coordinate input device to specify an area according to the positional relationship with other coordinates; A region specifying method comprising means for storing corrected coordinates and performing region editing processing based on the corrected and stored coordinates. (2) In claim 1, the correction means is configured such that the line segment connecting the input coordinate strings is horizontal/
An area specification method characterized by correction to make it vertical. (3) In claim 1, the correction means includes at least two of the starting point coordinates, the ending point coordinates, the direction of the vector from the starting point to the second point, and the direction of the vector from the input point one point before the ending point to the ending point. An area specification method characterized by rearranging a start point and an end point based on two pieces of information. (4) The area specifying method according to claim 1, wherein the correction means determines whether line segments connecting a series of coordinate points in sequence intersect with each other.