JPS58142468A - Pattern processor - Google Patents

Abstract

PURPOSE:To decrease the number of processed data greatly and to shorten picture processing time by comparing change-point addresses in its increasing order, separating them into predetermined concatenated picture element states and making a decision, and performing logical processing according to the decision result. CONSTITUTION:Address data on change points on both adjacent scanning lines are compared in increasing order by a state decision device 8 and according to the comparison results and initial state of the comparison, they are separated into plural predetermined concatenated picture element states. On the basis of the result of the separation and decision, their running states are assigned to a storage device under the control of a controller 10. Further, the change-point address data of the scanning lines and the contents of the device 10 are processed by arithmetic device 18, 20-22, etc. According to the output of said arithmetic processing, the contents of the device 10 are updated and also held in a storage device 12 until next scanning line data is processed. Thus, the number of processed data is decreased greatly and the picture processing time is shortened.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a graphic processing device that performs logical operations on image data expressed by change point address data (pixel coordinates) and performs arithmetic processing on the image graphics.

For example, in order to make a facsimile machine intelligent, it is necessary to detect the connection state of pixel data between each scanning line and recognize symbols, figures, etc. written on a document.

In order to calculate the area or circumscribed rectangle of an image figure for image data read by a conventional reading device and binarized with white level pixels as IO and black level pixels as Ill, first, arithmetic processing is performed for each pixel. A method has been used in which the image is divided into connected areas of black level (or white level iv) pixels, and the number of black level pixels in each area is counted.

However, in such conventional image processing, each pixel is a processing unit, so the amount of image data to be processed increases.
As a result, there was a drawback that the processing time was increased. Therefore,
In order to reduce the number of image data to be processed, M pixels in one scanning line are sequentially numbered from 0 to (M-1) to indicate the point at which the pixel level changes from white to black or from black to white. It is conceivable to represent the image content using a pixel number (pixel address) (variation point address representation).

The present invention provides a graphic processing device that can greatly reduce the amount of data to be processed and shorten the processing time by performing arithmetic processing on image data represented by change point addresses as described above.

First, image data is processed in units of scanning lines and in the order of scanning line numbers. That is, image data A to be scanned and inputted is shown as shown in FIG. 1, assuming the number of change points M, and the pixel address values between these change points M are taken in ascending order (allJ<a(1+1)). are arranged in Note that, due to the need for internal processing, the change point address data of scanning line A is MXI
(2M), M! 2 (2MX1) 2 data are added.

In addition, in order to know the connected area of pixels spanning adjacent scanning lines, 1')l of the scanning line A currently being processed.
! Image data B of scanning line iI is required. If the number of change points in this case is J, each change point address data is b1j)(j-1,2...) as shown in FIG.
. . J], as in the case of scanning line A, MXI and MX2 are added to the end of the data string.

An embodiment of the present invention will be described below with reference to FIGS.

In FIG. 8, (1) is the scanning line AL' which is scanned and inputted.
) change point address data a for l scans $117~a1
This storage device 1 (1) stores
As the processing progresses, the stored data is sequentially shifted and output to register 2 (2) and register 1 (3), and is processed. When the processing of one scanning line is completed, the stored data (changing point address data) is transferred to the storage device 2 (5) by the transfer device 1 (4). Note that during this transfer, transfer device 1 (4) transfers the contents of storage device 2 (5) to MXI.

I'll just use MX2. The storage device 2 (6) stores change point address data of the scanning line B before the scanning line A currently being processed. Similar to the case of storage device 1 (1), as processing progresses in this storage device 2 (5), the stored data is shifted (outputted) to register 4 (6) and then to register 8 (7). , register 2 (2), register 1 (3), and the change point address data in register 1 (3) are compared in size by the determiner <8), and separated into 6 predetermined connected pixel states Wl-W8 and Bl-B8. be done. This Wl-W8. When the six states of Bl-B8 are represented by the original white and black binary signals, the result is as shown in FIG.

That is, Wl indicates a state where only A has one black lamp, and W and B have one black lamp only. A state in which black runs connected by we, A, and B are detected is shown. Bl-B8 is a black and white inverted version of the wt-ws state, and the same numbers indicate correspondence. As is clear from FIG. 4, the wt-ws state is the initial state of both foot scan lines (both foot scan lines are white Vbefi/), or
According to the previous data, Wl.

W2. It is necessary to be in the B8 state. Similarly, in Bl-B8, W8. B
l.

It needs to be B2.

In relation to the determination of a connected region, although it is not strictly accurate, conceptually Wl indicates that a new connected region has been detected, Wti indicates that a connected region is missing, and W8
indicates that the connected region continues. Also, B
l indicates that the connected region is dividing, Bl, 2
Two concatenations, indicating that the regions are connected.

Now register 1 (3) contains all), register 2 (2)
a(1+t) in register 8(7), 'blj) in register 8(7),
When the value b(j+1) is stored in register 4 (6), the necessary and sufficient conditions for separation into the above six states are shown in FIG. There are 4 connections and 8 connections as connection conditions, but the necessary and sufficient conditions are different accordingly. The state represents an initial state in which scans @p, , and B are both at the white level.

The determiner (8) detects the above six states and the end of the scanning line data, and sends the signal 2 to other processing devices such as the controller (9). Then, the controller (9) detects the end of the processing of the area calculation bottle, generates a clock to each register according to the state, and prepares to process the next data. Clock generation is as shown in FIG. sA indicates A, advance the data by one, sB
indicates that the data of B is advanced by one.

By the way, in order to calculate the area of a pixel connected region, a tape μ is required to store intermediate results up to the scanning line being processed. The storage device (3) αQ is for this purpose, and its configuration is as shown in FIG. 7, with each area corresponding to each connected area. And C0NT
is for control, (RIC8) = 1 indicates that the calculation of the connected region has been completed and the area has been determined, and (ATC) = 1 indicates that the area has been assigned to the connected region and the area has been calculated. is being calculated. Further, S is for inserting the calculation output, that is, the area.

If it is in the Wl state, it is necessary to allocate a new area, so use the area detector aυ to calculate (RIIJ)-0
゜(AOT) = Search for an empty area of O, output the area position, and output the (AC!) of that area.
T) -1.

By the way, for each run, it is necessary to remember the pointer representing the area used by the memory bag @80G, and put the pointer to the data in the storage device 2 (5) in the storage device 5 (2). Then, the pointer of the run currently being processed is placed in register 6 (to).

Register a4 is register 2 (23, register 8 (1
) is for the pointer to the phun.

The data in register 6 α field and register 7 B4 are changed when the data in register table registers l to 4 is changed.
′, the clock and switch (
2) A switching signal to `` is output, the register is set, and the data in the register is written to the storage device 40φ.

Then, it is indicated by register 6 (to) and 7a4. The contents of the storage device 8 Qtl area are rewritten.

The movement of this pointer is as follows. When in the Wl state, a signal is sent to register 7α◆ through the switch (to).
The detection results of the area detector (b) are written in.

Further, the contents of the register 7α♦ are stored in the storage device 4a. In the W2 state, the next data in the storage device 5(2) is stored in the register 6. In the W8 state, the next data in the storage device 5(2) is stored in the register 6.
Then, it is further transferred to the register 7 and then to the storage device 4. In the B1 state, the value of the register 7 is input to the storage device 6α, and in the B2 state, the value of the register 7 is input to the storage device 6(
Input the next pointer of 2) into register 6(2).

Note that the read data in the storage device 16!1 is unnecessary and is therefore discarded. In addition, the storage device 4
(to) is reset after the data is transferred by the transfer device 2Qη. When the pointer is input to the register 6.7 and the area to be processed is determined, the processing shown in FIG. 8 is performed by the arithmetic unit IQS.

Furthermore, in the case of penalty sushi, the same value as the pointer represented by the register 6 is stored in the arithmetic unit 4@ in the storage device 4Q.
It is checked whether it exists in the storage device 5 (6), and if it does not exist, it indicates the end of the connected area, so the area indicated by the pointer of the register (6) is set to (REEI)-1.

In the B2 state, the comparator 611 selects register 6 (to).
, check the data value of register 7α, and if the values are the same, it has been processed as the same connected area, so there is no need to add further processing, and if the pointers are different, it will be processed as different connected areas. So I need to put it together. In this case, the result indicated by the pointer in register 60J is 81. The result indicated by the pointer of register 7α◆ is 82
Then, the arithmetic unit R2 calculates Sl+82 and writes it to the area indicated by the pointer of register 7 QtJ, or
When this process is completed, 1. The arithmetic device 5 (to) and the storage device 4 (m.

6), search for the same value as the value in register 6 (11), and rewrite it to the value in register 7α→.

In this way, after entering all the scanline data,
The area of the surface figure is written in the area where (FjES) = 1 in the storage device 8 (1G).

In the above embodiment, the case where the area of the connected pixel area is calculated has been explained, but as shown in FIG. The data of the subtracter (c) is rewritten to the output 1 of the subtracter (c), and the tape configuration of the storage device 8αQ and the arithmetic processing of the arithmetic unit 1 (g) are as shown in FIGS. 1θ and 11, respectively. By making the following changes, the circumscribed rectangle (address coordinate point) of the connected pixel area can be found.

That is, the data in register 6(2) is YMINI,
XMAX1$YMZNI, Vdistav 04 data, XMI) i2. XMAX2゜YMIM2.
Then, these data are converted to min (YM
INI, XMIN2), maw (XMAXI,
XMAXtri)win (YMINI, XMI
N2) is weighed and written in the area indicated by register 704.

After this process is completed, the arithmetic unit 561 stores the contents of the register 6(1) from among the contents of the storage device 4α, 6(2).
Look for the same thing as No. 1, register? (Rewrite the value of 14.

In this way, after entering all the scanline data,
The area where (RKS) = 1 of the storage device 80G contains the circumscribed rectangle of the surface figure, that is, XMIN,
The coordinate values of XMAX, YM, N, and YMAX are written.

As described above, according to the present invention, the changing point address data of adjacent scanning lines are compared in ascending order and separated and determined into 11 predetermined connected pixel states, and each scanning line is Since the state of black feces (or white feces) is processed and updated and stored sequentially, the amount of data to be processed can be significantly reduced, the processing time can be shortened, and image shapes can be easily processed. be·
(,

[Brief explanation of the drawing]

1 and 2 are data explanatory diagrams showing image data of each scanning line expressed by changing point addresses, FIG. 8 is a block diagram showing an embodiment of the present invention, and FIG. 4 is a judgment in FIG. 8. 6 is an explanatory diagram showing the necessary and sufficient conditions for determining the state in FIG. 4. FIG. Explanatory diagram, Figure 7 is a tape fiyW4 diagram showing the storage table of the storage device °8 in Figure 8, Figure 8 is an explanatory diagram showing the processing operation of the arithmetic unit l in Figure 8, and Figure 9 is this diagram. Prock diagram showing other embodiments of the invention, No. 1O
This figure is a table configuration diagram showing the storage table of the storage device 8 in FIG. 9, and FIG. 11 is an operation explanatory diagram showing the processing operation of the arithmetic unit 1 in FIG. 9. In the figure, (8)...state determiner, (9)...controller,
αq...Storage device 8, (Lη...Area detector, U
=...Storage device 5, α0...Switcher, a groan...Storage device 4, (To)...Arithmetic device 1.0...Ratio switch,
(Trans)...Arithmetic device 2.01)...Arithmetic device 8, Kan...Arithmetic device 4, (E)...Arithmetic device 6, (Foundation)...
...It is a subtracter. In the figures, the same reference numerals indicate the same or equivalent parts. Agent Makoto Kuzuno (and 1 other person) Figure 1 QCL) Ku Q (i) Figure 2 Procedural amendment (voluntary) Mr. Commissioner of the Japan Patent Office 1, Indication of the case Patent application No. 6-211069 No. 2
, Name of the invention Graphic processing device 3, Person making the amendment 6, Subject of the amendment (1) Claims 9 of the specification 9 Detailed description of the invention column 6, Contents of the amendment (1) Claims of the specification Correct the range as shown in the attached sheet. (2) The description shall be amended as follows. 7. List of attached documents (1) Documents indicating the scope of patent claims after correction One or more copies Claim 1 Convert scanned input binary image data into change point address data, and convert the change point address data. In a graphics processing device that performs arithmetic processing on image graphics using address values (pixel coordinate values), the change point address data of the adjacent defining scan lines are compared in ascending order, and the determining means for separating and determining a plurality of predetermined connected pixel states; allocation means for allocating a storage table for storing the run state according to the determination result; and change point address data for the scanning line according to the determination result and the above. The present invention further comprises a calculation means for processing the contents of the storage table and updating the contents of the storage table with the output data thereof, and a storage means for storing the contents of the storage table until the next scanning line data is processed. A graphic processing device characterized in that: (2) a graphic processing device according to claim 1, characterized in that the calculation means is formed to calculate and output the area of the connected pixel region; (3) the calculation means is 2. The graphic processing device according to claim 1, wherein the graphic processing device is configured to calculate and output the coordinate values of a circumscribed rectangle circumscribing the connected pixel area.

Claims (1)

[Scope of Claims] A graphic processing device that converts scanned input binary image data into change point address data and performs arithmetic processing on an image figure using the change point address value (pixel coordinate value), Judgment means for comparing change point address data of one scanning line in ascending order and separating and judging into a plurality of predetermined connected pixel states according to the comparison result and the initial state of comparison; Allocating means for allocating a memory tape p for storing the state, arithmetic processing the changing point address data of the scanning line and the contents of the memory table according to the above judgment result, and updating the contents of the above memory table with the output data. A graphic processing device comprising a calculation means and a storage means for storing the contents of the storage table until the next scanning line data is processed. (2) The graphic processing device according to claim 1, wherein the calculation means is formed to calculate and output the area of the connected pixel region. (3) The graphic processing device according to claim 1, wherein the calculation means is formed to calculate and output coordinate values of a circumscribed rectangle circumscribing the connected pixel area.