JP4754118B2 - Labeling apparatus and labeling method - Google Patents

Description

[0001]
  The present invention, PaintingThe present invention relates to a labeling apparatus and a labeling method for detecting a connected area of image data and labeling the connected area.
[0002]
[Prior art]
A labeling technique for performing binarization processing on a grayscale image obtained by imaging a target surface, detecting a connected region from the two-dimensional binary image data, and labeling the connected region is used in, for example, the field of electronic equipment. This method is applied to inspecting defects appearing on the surface of shadow masks, liquid crystal panels, CRT panels, plasma display panels, and the like.
[0003]
A conventional labeling method will be described with reference to the binary image in FIG. Here, the pixel value of the connected region to be recognized is “1”, and the surrounding pixel values are “0”. In FIG. 45A, scanning is performed in the X direction, and when the first pattern R is detected by the pixel value “1”, label number = 1 is assigned. If the same figure has a continuous area, the same label number is assigned.
[0004]
If it is a simple pattern as shown in FIG. 45A, labeling is easy, but in the case of the pattern S shown in FIG. 45B, the process becomes complicated. At the time of scanning the Y1 line, it is determined that there are two patterns, which are labeled as label number = 2 and label number = 3, respectively. A problem occurs at the X1 point of the Y2 line. That is, it is found that the areas labeled with label number = 2 and label number = 3 are the same area. Therefore, it is necessary to return to the beginning and perform a rescan to convert all the parts labeled with label number = 3 to label number = 2.
[0005]
Thus, re-labeling is performed, and the subsequent labeling from the point X1 of the Y2 line is executed again with the label number = 2. The first labeling is called temporary labeling. When patterns with different label numbers merge during labeling, label number = 3 is converted to label number = 2 in the above example. This conversion of temporary labeling is called label combination.
[0006]
[Problems to be solved by the invention]
In the above example, it is possible to re-label one time. However, since the actual image is generally a complex image, it is necessary to re-label several times, and the scan time for re-labeling becomes longer and faster. It becomes difficult to process. In addition, it is difficult to implement this processing with a hardware circuit of a practical scale, and it is difficult to process in real time in synchronization with an output signal of a camera that inputs an image.
[0007]
  The present invention solves the above conventional problems., PaintingAn object of the present invention is to provide a labeling apparatus and a labeling method that can perform labeling by one scan without performing rescanning for relabeling when performing labeling processing on image data.
[0008]
It is another object of the present invention to provide a labeling apparatus and a labeling method that can perform labeling processing in real time when image data is input by performing labeling by one scan. Another object of the present invention is to provide a labeling device that performs labeling processing with hardware of a practical scale due to these effects.
[0009]
  In order to achieve the above object, a labeling apparatus according to claim 1 of the present invention is a labeling apparatus that performs labeling on a connection area of image data, and means for obtaining image input data from input image data. A line buffer (line buffer 6) that holds the latest image input data for at least one line scanned before the target pixel at the current scan position, and the image input data held in the line buffer to the scan position Matrix extraction means (label update circuit 7) for extracting a pixel area of a 2 × 2 matrix including a certain target pixel, and the start, continuation, or end of a connected area is determined based on the pixel value of the extracted pixel area, and the target pixel Labeling means (label updating circuit 7) for performing labeling on the label, and the connected region labeled Comprising a label information storage memory for storing information (label storage memory 12), the said labeling means, when it is determined to continue the connection region for the target pixel, the extracted the pixel regionsnumberDifferentpluralIf there are pixels labeled with a label,The lowest numberA label is selected, and labeling is performed so that the selected label is a label to be given to all pixels in the connected region determined to be continued.
[0010]
  According to the labeling device of claim 1, by extracting the target pixel and the scanned pixels located around the target pixel from the binary image input data held in the line buffer as a pixel region of a 2 × 2 matrix. Since the relationship between the already labeled pixel in the scanned pixel and the target pixel can be determined, the start, continuation, and end of the connected region can be correctly determined from the combination of the pixel values of the pixel region. This eliminates the need for re-scanning for re-labeling, and enables labeling to a connected region of two-dimensional binary image data by a single scan.Furthermore, according to the labeling device of claim 1, since the label combination when the patterns having different label numbers merge in the middle of the labeling can be finally processed correctly, the label is reattached. No re-scanning is required, and it is possible to label connected regions of two-dimensional binary image data by one scan.
[0011]
  A labeling device according to claim 2 of the present invention is the labeling device according to claim 1,The labeling unit stores a determination result of the previous target pixel as a temporary label in a label buffer, and labels the target pixel and the temporary label based on the determination result of the target pixel.Is.
[0012]
According to the labeling device of the second aspect, only when the end of the connected area is determined, the continuation of the connected area is determined by storing the information of the labeled connected area in the label information storage memory. In the meantime, the labeling algorithm can be simplified, and the labeling process can be performed efficiently.
[0013]
The labeling device according to claim 3 of the present invention is the labeling device according to claim 1 or 2, wherein the extracted pixel region is already labeled when the labeling unit determines the start of the connected region for the target pixel. If there is a pixel, labeling is performed so that the label of the already labeled pixel is used as a label to be given to the target pixel.
[0014]
According to the labeling device of claim 3, when it is determined that the connected region starts, and there is a pixel already labeled in the extracted pixel region, the label of the already labeled pixel is set as the target pixel. By performing the labeling so as to obtain the given label, it is possible to avoid the occurrence of different labeling in the scanned connected area.
[0017]
  Claims of the invention4The labeling device according to claim 1 is from3The labeling device according to any one of the above, further comprising an empty label memory for storing usable labels including empty labels as empty labels for labeling by the labeling means.
[0018]
  Claim4According to the described labeling apparatus, the labeling can be efficiently processed by managing the labels that can be used for labeling, including the labels that are discontinued due to the coupling of the labels.
[0023]
  Claims of the invention5The labeling device according to claim 1 is from4In the labeling device according to any one of, PaintingFor a target pixel P (i, j) at coordinates i, j that increase in the two-dimensional scan direction of image data, a pixel region of a 2 × 2 matrix is represented by pixels P (i, j), P (i−1, j), P (i, j-1), and P (i-1, j-1).
[0024]
  Claim5According to the labeling apparatus described, by defining the pixel area of the 2 × 2 matrix to be extracted with respect to the target pixel as described above, the positioning of the target pixel in the continuous area can be determined with a simple algorithm. The start, continuation, and end of the connected area can be easily determined from the combination of pixel values in the pixel area, and re-scanning for re-labeling is not required, and a two-dimensional binary image can be obtained by a single scan. Labeling can be performed on the linked area of data.
[0025]
  A labeling method according to a sixth aspect of the present invention is a labeling method for labeling a connection region of image data, wherein all pixels of the image data are sequentially scanned as target pixels, and coordinates are increased in the scanning direction. For the target pixel P (i, j) at i, j, the pixels P (i, j), P (i-1, j), P (i, j-1), P (i-1, j-1) When the target pixel is labeled by extracting a pixel area of a 2 × 2 matrix composed of the pixel area and determining the start, continuation, or end of the connected area based on the pixel value of the extracted pixel area, When the continuation of the connected area is determined for the pixel, the extracted pixel areanumberDifferentpluralIf there are pixels labeled with a label,Smallest numberSelect a label and move the selected label forwardRecordThe labeling is performed so that the label is given to all the pixels in the connected area for which continuation is determined. In the labeling method according to claim 7 of the present invention, the determination result of the previous target pixel is stored as a temporary label in a label buffer, and the target pixel and the temporary label are stored based on the determination result of the target pixel. Labeling is performed.
[0026]
  Claim6According to the described labeling method, a 2 × 2 matrix pixel area including the target pixel defined above is extracted while scanning the two-dimensional binary image input data, so that labeling is already performed on the pixel area. Since the relationship between the selected pixel and the target pixel can be determined with a simple algorithm, the start, continuation, and end of the connected region can be easily and correctly determined from the combination of the pixel values of this pixel region. Re-scanning for re-attaching is not required, and labeling can be performed on a connected region of two-dimensional binary image data by one scan.
[0027]
  Claims of the invention8The labeling method according to claim6 or 7In the described labeling method, when it is determined that the connected region starts for the target pixel, and there is a pixel that is already labeled in the extracted pixel region, the label that gives the target pixel the label of the already labeled pixel The labeling is performed as follows.
[0028]
  Claim8According to the described labeling method, when it is determined that the connected region starts, and there is a pixel that is already labeled in the extracted pixel region, the label that gives the target pixel the label of the already labeled pixel By performing labeling in such a manner, it is possible to avoid different labeling from occurring in the scanned connected area.
[0031]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a labeling apparatus according to an embodiment of the present invention.
[0032]
In FIG. 1, 1 is a camera clock obtained from a camera that inputs image data, 2 is a timing generation circuit that generates a pixel output signal and various timing signals in the labeling apparatus in synchronization with the camera clock 1, and 3 is a pixel output signal 4 is a label table for holding various label information during labeling processing, and 5 is binary image data obtained by binarizing image data input by the raster scan method. An input 6 is a line buffer for holding the latest binary image input data for at least one line input before the current input.
[0033]
Further, in FIG. 1, reference numeral 7 denotes a pixel area of a 2 × 2 matrix extracted from the current binary image input data 5 and the data held in the line buffer 6, determines the start or continuation or end of the connected area, and the target pixel 8 is a label ID generating circuit for generating a label to be given to the target pixel, 9 is a label initializing circuit for initializing the label at the start of the connected region, and 10 is used including a label for which the use is stopped FIFO format empty label memory (empty label FIFO) that stores possible labels as empty labels, 11 is a label buffer that temporarily holds labeling information of the connected area being processed, and 12 is information on the labeled connected area It is a label storage memory for storing.
[0034]
The operation of the labeling apparatus configured as described above will be described in detail below with reference to FIGS. In FIG. 2 to FIG. 44, pixels to be recognized as connected regions are represented by being filled. For example, the pixel value of the filled pixel is “1”, and the pixel value of the unfilled pixel is “0”.
[0035]
2 and 3 show an algorithm for determining the start, continuation, or end of a connected region from the pixel values of the pixel region of the 2 × 2 matrix extracted by the labeling apparatus and labeling the target pixel. It is a figure which shows a response | compatibility with a pixel value and processing operation.
[0036]
2 and 3, for the target pixel P (i, j) at the vertical coordinate i and the horizontal coordinate j that increase in the two-dimensional scan direction, the pixel P (i) that constitutes the extracted 2 × 2 matrix pixel region. −1, j−1), P (i, j−1), P (i−1, j), and P (i, j) are represented by MTX1, MTX2, MTX3, and MTX4, respectively.
[0037]
When both MTX1 and MTX2 are “0” and MTX3 or MTX4 is “1”, the start of the connected area is determined and the label is initialized. If MTX3 is “0”, it is a new connected area, so the label ID is “New”, and if MTX3 is “1”, this is the case when there are already labeled pixels, so that label (previous run label) is This is a label ID.
[0038]
When both MTX3 and MTX4 are “0” and MTX1 or MTX2 is “1”, the end of the connected area is determined, the previous connected area information is labeled, and the label is written to the label storage memory. I do.
[0039]
When all four pixels in the pixel area are “0”, this indicates that there is no connected area. When the combination of the four pixels in the pixel area does not correspond to any of the three cases described above, the continuation of the connected area is determined, and processing according to the pixel value of each pixel area is performed.
[0040]
Next, the operation of the labeling apparatus will be described in detail with a specific image example. FIG. 4 is an example of an image to be processed, and FIGS. 5 to 44 are diagrams for explaining a labeling processing operation for the image of FIG. Each figure shows the state of the label buffer, label storage memory, and empty label FIFO in each processing result.
[0041]
In the following description, the arrangement of MTX1, MTX2, MTX3, and MTX4 is abbreviated as MTX. That is, MTX = (MTX1, MTX2, MTX3, MTX4), and the value is represented by “xxxx” (x is 1 or 0).
[0042]
In FIG. 5, since MTX is “0000” for the first input, no operation is performed. In FIG. 6, since MTX is “0001”, it is determined that the connected area starts, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0043]
In FIG. 7, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 1, which is the first empty label, is obtained from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 1 in the label storage memory.
[0044]
In FIG. 8, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0045]
In FIG. 9, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 2, which is the first empty label, is obtained from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 2 in the label storage memory. Thereafter, since the state where MTX is “0000” continues, the description of that portion is omitted.
[0046]
In FIG. 10, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0047]
In FIG. 11, since MTX is “0101”, it is determined that the connected region is continued, and “1” is added to the area of the label buffer to be updated. Thereafter, since the state where MTX is “0101” continues, the addition and update of the area of the label buffer is continued.
[0048]
In FIG. 12, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 3, which is the first empty label, is acquired from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 3 in the label storage memory.
[0049]
In FIG. 13, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0050]
In FIG. 14, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 4, which is the first empty label, is obtained from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 4 in the label storage memory.
[0051]
In FIG. 15, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0052]
In FIG. 16, since MTX is “0101”, it is determined that the connected region is continued, and “1” is added to the area of the label buffer to be updated. Thereafter, the state where MTX is “0101” continues until FIG.
[0053]
In FIG. 18, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 5, which is the first empty label, is obtained from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 5 in the label storage memory.
[0054]
In FIG. 19, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0055]
In FIG. 20, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written into the label storage memory. At this time, since the label ID of the label buffer is New, label ID = 6, which is the first empty label, is obtained from the empty label FIFO, and the contents of the label buffer are written at the position of label ID = 6 in the label storage memory.
[0056]
In FIG. 21, since MTX is “0001”, it is determined that the connected area is started, and in order to start recording a new label, the label ID of the label buffer is set to New and the label area is set to “1”.
[0057]
In FIG. 22, since MTX is “0111”, it is determined that the connected region is continued, and it can be seen that MTX3 is a pixel already labeled with label ID = 1, so that label ID = 1 is set as New. As the label ID of the label buffer instead of the label area, the label area of label ID = 1 recorded in the label storage memory is added to the label area of the label buffer, and “1” is added to “3”.
[0058]
In FIG. 23, since MTX is “1101”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “4”.
[0059]
In FIG. 24, since MTX is “0110”, it is determined that the connected region is continued, and it can be seen that MTX3 is a pixel already labeled with label ID = 2. Here, since there are a plurality of labeled pixels with label ID = 1 and label ID = 2 in MTX, here, the smaller label ID = 1 is selected as a preset rule. The area of label ID = 2 recorded in the label storage memory is added to the area of label ID = 1 of the label buffer to obtain “5”. Since MTX4 is “0”, there is no addition for the target pixel. Since the use of the label ID = 2 is stopped, the empty flag of the label ID = 2 in the label storage memory is set to 1, and the label ID = 2 is added to the empty label FIFO.
[0060]
In FIG. 25, since MTX is “1001”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “6”.
[0061]
In FIG. 26, since MTX is “0101”, it is determined that the connected region is continued, and 1 is added to the label buffer area to obtain “7”. Also in FIG. 27, since MTX is “0101”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “8”.
[0062]
In FIG. 28, since MTX is “0100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written at the position of label ID = 1 in the label storage memory.
[0063]
In FIG. 29, since MTX is “0010”, it is determined that the connected region starts, and it can be seen that MTX3 is a pixel already labeled with label ID = 3. Is written, and label ID = 3 and its area “5” are written into the label buffer. Since MTX4 is “0”, there is no addition for the target pixel.
[0064]
In FIG. 30, since MTX is “1011”, it is determined that the connected region is continued, and 1 is added to the label buffer area to obtain “6”.
[0065]
In FIG. 31, since MTX is “1110”, it is determined that the connected region is continued. However, since MTX4 is “0”, there is no addition for the target pixel, and the process proceeds without doing anything. In FIG. 32 and FIG. 33, since MTX is “1010”, it is determined that the connected region is continued. However, since MTX4 is “0”, there is no addition for the target pixel, and the process proceeds without doing anything. .
[0066]
In FIG. 34, since MTX is “1001”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “7”.
[0067]
In FIG. 35, since MTX is “0110”, it is determined that the connected region is continued, and it is understood that MTX3 is a pixel already labeled with label ID = 4. Here, since there are a plurality of labeled pixels with label ID = 3 and label ID = 4 in MTX, the smaller label ID = 3 is selected as a preset rule, and the label is stored. The area of label ID = 4 recorded in the memory is added to the area of label ID = 3 of the label buffer to obtain “8”. Since MTX4 is “0”, there is no addition for the target pixel. Since the use of label ID = 4 is stopped, the empty flag of label ID = 4 in the label storage memory is set to 1, and label ID = 4 is added to the empty label FIFO.
[0068]
In FIG. 36, since MTX is “1000” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written at the position of label ID = 3 in the label storage memory.
[0069]
In FIG. 37, since MTX is “0011”, it is determined that the connected region is started, and it can be seen that MTX3 is a pixel already labeled with label ID = 5. 5 is read, label ID = 5 and its area “5” are written to the label buffer, and “1” is added to the area to obtain “6”.
[0070]
In FIG. 38, since MTX is “1111”, it is determined that the connected region is continued, and 1 is added to the label buffer area to obtain “7”. Also in FIG. 39, since MTX is “1111”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “8”.
[0071]
In FIG. 40, since MTX is “1110”, it is determined that the connected region is continued. However, since MTX4 is “0”, there is no addition for the target pixel, and the process proceeds without doing anything.
[0072]
In FIG. 41, since MTX is “1011”, it is determined that the connected region is continued, and 1 is added to the area of the label buffer to obtain “9”. In FIG. 42, since MTX is “1101”, it is determined that the connected region is continued, and 1 is added to the label buffer area to obtain “10”.
[0073]
In FIG. 43, since MTX is “0111”, it is determined that the connected region is continued, and it can be seen that MTX3 is a pixel already labeled with label ID = 6. Here, since there are a plurality of labeled pixels with label ID = 5 and label ID = 6 in MTX, the smaller label ID = 5 is selected as a preset rule, and the label is stored. The area of label ID = 6 recorded in the memory is added to the area of label ID = 5 of the label buffer to obtain “11”. Further, “1” is added to the area to obtain “12”. Further, since the use of label ID = 6 is stopped, the empty flag of label ID = 6 in the label storage memory is set to 1, and label ID = 6 is added to the empty label FIFO.
[0074]
In FIG. 44, since MTX is “1100” and the label is interrupted, it is determined that the connected area is completed, and the contents of the label buffer are written at the position of label ID = 5 in the label storage memory.
[0075]
As described above, from the binary image input data obtained by binarizing the image data sequentially input by the raster scan method, the target pixel and the scanned pixels positioned around the target pixel are converted into the pixel region MTX of 2 × 2 matrix. As a result, it is possible to correctly determine the start, continuation, and end of the connected region from the pixel value of the pixel region MTX, and label the connected region of the two-dimensional binary image data by one scan. It can be carried out.
[0076]
  As explained above, according to the present invention,, PaintingWhen the image data is labeled, it is input sequentially.PaintingBy extracting the target pixel and scanned pixels located around the target pixel from the image input data as a pixel area of a 2 × 2 matrix, and determining the start, continuation, and end of the connected area from the pixel value, the label Therefore, it is possible to provide a labeling apparatus and a labeling method for performing a labeling process that can perform labeling by one scan without requiring re-scanning for re-attaching.
[0077]
Furthermore, according to the present invention, since labeling can be performed by one scan, a series of labeling processes are performed in synchronization with pixel output signals of image data obtained from the imaging device, so that image data can be input. It becomes possible to perform labeling processing in real time. For example, by configuring pipeline type hardware, it is possible to provide a labeling apparatus that performs labeling processing in real time with hardware of a practical scale.
[Brief description of the drawings]
FIG. 1 is a block diagram showing a configuration of a labeling apparatus according to an embodiment of the present invention.
FIG. 2 is a diagram showing an algorithm for determining the start, continuation, or end of a connected region from the pixel value of the pixel region and labeling the target pixel.
FIG. 3 is a diagram showing an algorithm for determining the start, continuation, or end of a connected region from the pixel value of the pixel region and labeling the target pixel.
FIG. 4 is a diagram showing an example of an image to be processed.
FIG. 5 is a diagram illustrating a labeling processing operation for an image example.
FIG. 6 is a diagram illustrating a labeling process operation for an image example.
FIG. 7 is a diagram illustrating a labeling process operation for an image example.
FIG. 8 is a diagram illustrating a labeling process operation for an image example.
FIG. 9 is a diagram for explaining a labeling processing operation for an image example;
FIG. 10 is a diagram illustrating a labeling process operation for an image example.
FIG. 11 is a diagram for explaining a labeling processing operation for an image example;
FIG. 12 is a diagram illustrating a labeling process operation for an image example.
FIG. 13 is a diagram for explaining a labeling processing operation for an image example;
FIG. 14 is a diagram illustrating a labeling process operation for an image example.
FIG. 15 is a diagram for explaining a labeling processing operation for an image example;
FIG. 16 is a diagram illustrating a labeling process operation for an image example.
FIG. 17 is a diagram illustrating a labeling process operation for an image example.
FIG. 18 is a diagram illustrating a labeling process operation for an image example.
FIG. 19 is a diagram illustrating a labeling process operation for an image example.
FIG. 20 is a diagram illustrating a labeling process operation for an image example.
FIG. 21 is a diagram illustrating a labeling process operation for an image example.
FIG. 22 is a diagram illustrating a labeling process operation for an image example.
FIG. 23 is a diagram illustrating a labeling process operation for an image example.
FIG. 24 is a diagram for explaining a labeling processing operation for an image example;
FIG. 25 is a diagram for explaining a labeling processing operation for an image example;
FIG. 26 is a diagram illustrating a labeling process operation for an image example.
FIG. 27 is a diagram for explaining a labeling processing operation for an image example;
FIG. 28 is a diagram illustrating a labeling process operation for an image example.
FIG. 29 is a diagram illustrating a labeling process operation for an image example.
FIG. 30 is a diagram illustrating a labeling process operation for an image example.
FIG. 31 is a diagram for explaining a labeling processing operation for an image example;
FIG. 32 is a diagram illustrating a labeling process operation for an image example.
FIG. 33 is a diagram illustrating a labeling process operation for an image example.
FIG. 34 is a diagram illustrating a labeling process operation for an image example.
FIG. 35 is a diagram for explaining a labeling processing operation for an image example;
FIG. 36 is a diagram for explaining a labeling processing operation for an image example;
FIG. 37 is a diagram illustrating a labeling process operation for an image example.
FIG. 38 is a diagram illustrating a labeling process operation for an image example.
FIG. 39 is a diagram for explaining a labeling processing operation for an image example;
FIG. 40 is a diagram illustrating a labeling process operation for an image example.
FIG. 41 is a diagram illustrating a labeling process operation for an image example.
FIG. 42 is a diagram illustrating a labeling process operation for an image example.
FIG. 43 is a diagram illustrating a labeling process operation for an image example.
FIG. 44 is a diagram for explaining a labeling processing operation for an image example;
FIG. 45 is a diagram for explaining a conventional labeling method.
[Explanation of symbols]
1 Camera clock
2 Timing generation circuit
3 Area counting circuit
4 Label table
5 Binary image data input
6 Line buffer
7 Label update circuit
8 Label ID generator
9 Label initialization circuit
10 Empty label memory (empty label FIFO)
11 Label buffer
12 Label storage memory

Claims (8)

In the labeling device that labels the connected areas of image data,
Means for obtaining image input data from input image data;
A line buffer for holding the image input data for the latest at least one line scanned before the target pixel at the scan position;
Matrix extraction means for extracting a pixel region of 2 × 2 matrix including the target pixel at the scan position from the image input data held in the line buffer;
Labeling means for determining the start or continuation or end of a connected region based on the pixel value of the extracted pixel region, and for labeling the target pixel;
A label information storage memory for storing the information of the labeled connected area,
It said labeling means, when it is determined to continue the connection region for the target pixel, when there is a labeled pixel in the plurality of labels with different numbers extracted the pixel regions, the lowest numbered labels A labeling device that selects and performs labeling so that the selected label is a label that is given to all the pixels in the connected region that has been determined to continue.   The labeling means stores a determination result of the previous target pixel as a temporary label in a label buffer, and performs labeling on the target pixel and the temporary label based on the determination result of the target pixel. The labeling device according to claim 1.   When the labeling unit determines the start of a connected region for the target pixel, and there is a pixel that has already been labeled in the extracted pixel region, the label of the pixel that has already been labeled is the target The labeling apparatus according to claim 1, wherein the labeling is performed so that the label is given to the pixel.   4. An empty label memory for storing usable labels including unused labels as empty labels for labeling by the labeling means. The labeling device described.   With respect to the target pixel P (i, j) at coordinates i, j that increase in the two-dimensional scan direction of the image data, the pixel area of the 2 × 2 matrix has pixels P (i, j), P (i− 1, j), P (i, j−1), P (i−1, j−1), and the labeling device according to claim 1. A labeling method for labeling connected regions of image data, wherein all pixels of the image data are sequentially scanned as target pixels, and the target pixels P (i, j at coordinates i, j that increase in the scanning direction are scanned. ), A pixel region of a 2 × 2 matrix composed of pixels P (i, j), P (i−1, j), P (i, j−1), and P (i−1, j−1) When performing labeling on the target pixel by determining the start or continuation or end of the connected region based on the pixel value of the extracted pixel region,
When it is determined to continue the connected region for the target pixel, if there is a pixel labeled with a plurality of labels with different numbers in the extracted pixel region, the label with the smallest number is selected and the selected labeling method characterized in that to label to a label that gives the label to all the pixels of the connecting region is determined before Symbol continue was.   The determination result of the previous target pixel is stored as a temporary label in a label buffer, and the target pixel and the temporary label are labeled based on the determination result of the target pixel. Labeling method.   When it is determined that a connected area starts for the target pixel, and there is a pixel that is already labeled in the extracted pixel area, a label that gives the target pixel the label of the already labeled pixel is used. The labeling method according to claim 6 or 7, wherein labeling is performed as follows.

Images