FIELD OF THE INVENTION
The present invention relates to an image processing method, particularly to an image labeling method.
BACKGROUND OF THE INVENTION
The image labeling technology can separate different object regions and give each object region a unique labeled value. In static or dynamic image object detection, the object regions (or image data) must be identified and formed an object pixel matrix. Next, the image labeling technology is used to discriminate different object regions with different labels, and then can be analyzed and compared. The image labeling technology can apply to security monitor systems, theft-proof monitor systems, dynamic image surveillance systems, traffic flow statistic systems, etc.
The conventional image labeling technologies are usually implemented by a label window, which sequentially scans the array elements of an object pixel matrix to find out the image data. The image labeling technology then labels the image data in a window operation. In order to make adjacent array elements with image data have an identical labeled value, the conventional image labeling technology has to perform scanning many times and undertake complicated calculations to update the adjacent data-containing array elements into an identical labeled value. For high-resolution images, the processing of the conventional image labeling technologies is too slow to meet update requirements.
SUMMARY OF THE INVENTION
The primary objective of the present invention is to provide an image labeling method to accelerate an image processing speed.
To achieve the abovementioned objective, the present invention proposes a multi-point image labeling method for labeling an object pixel matrix, whereby the object pixel matrix contains image data and the adjacent array elements with image data have an identical labeled value. The method of the present invention comprises steps of: 1) providing a multi-point label window and an label-equivalence window, 2) performing a labeling process and a label-equivalence information processing process, 3) performing an equivalent-substitution processing process to temporary labeled values to generate a label-equivalence substitution information according to the label-equivalence information, 4) performing an image labeled value substitution process according to the label-equivalence substitution information to replace the temporary labeled value to obtain an image labeled value.
The multi-point label window has at least three inclined-arranged label points. The label-equivalence window is used to generate label-equivalence information. The multi-point label window scan the data-containing array elements of an object pixel matrix to assign temporary labeled values to be stored in a register according to the non-zero temporary labeled values of adjacent labeled array elements. When all of the temporary labeled values in the adjacent array element are zero, a new temporary labeled value is designated and labeled. When at least one non-zero temporary labeled value is in the adjacent array element, the non-zero temporary labeled value is selected at the first priority according to a clockwise priority rule. On the other hand, the label-equivalence window associates two different temporary labeled values that are connected by the image data in the adjacent array element to generate label-equivalence information.
According to the label-equivalence information, an equivalent-substitution processing process is performed to the temporary labeled values to generate label-equivalence substitution information of the associated temporary labeled values. The temporary labeled values are then replaced to obtain image labeled values according to the label-equivalence substitution information.
As the multi-point label window of the present invention has at least three inclined-arranged label points, it can generate multiple temporary labeled values by multi-point labeling in each window operation. The label-equivalence information is used to integrate associated temporary labeled values, and the final image labeled values are finished by the image labeled value substitution process. Therefore, the present invention can accelerate the labeling process.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram schematically showing architecture according to the present invention;
FIG. 2 is a diagram schematically showing a multi-point label window according to the present invention;
FIG. 3A is a diagram schematically showing a label-equivalence window according to the present invention;
FIG. 3B is another diagram schematically showing the label-equivalence window according to the present invention;
FIG. 4A is a diagram schematically showing an unlabeled object pixel matrix;
FIG. 4B is a diagram schematically showing an object pixel matrix being labeled according to the present invention;
FIG. 4C is a diagram schematically showing an object pixel matrix having been labeled according to the present invention;
FIG. 5 is a diagram showing label-equivalence information according to the present invention;
FIG. 6A is a diagram schematically showing an equivalent-substitution processing process according to the present invention;
FIGS. 6B-6D are diagrams schematically showing the processes of an intra-row substitution processing process according to the present invention;
FIG. 7 is another diagram schematically showing an equivalent-substitution processing process according to the present invention;
FIGS. 8A-8F are diagrams schematically showing the processes of an inter-row substitution processing process according to the present invention; and
FIG. 9 is a diagram schematically showing a substitution for temporary labeled values according to the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Below, the embodiments are described in detail to demonstrate the technical contents of the present invention. However, it should be noted that the embodiments are only to exemplify the present invention but not to limit the scope of the present invention.
Refer to FIG. 1. The architecture of the present invention comprises a labeling process 10, a label-equivalence information processing process 20, a register 30, an equivalent-substitution processing process 40, and an image labeled value substitution process 50. Refer to FIG. 2, FIG. 3A and FIG. 3B. The present invention provides a multi-point label window 11 which has at least three (three is preferred) inclined-arranged label points 111. The present invention also provides a label-equivalence window 12 at the same time. In the label-equivalence information processing process 20, the label-equivalence window 12 is used to generate label-equivalence information 121, as shown in FIG. 5.
Refer to FIGS. 4A-4C and FIG. 5. The method of the present invention is used to label an object pixel matrix 60. The object pixel matrix 60 has a plurality of image data 61 and adjacent array elements 601 with the image data 61 are labeled to have an identical image labeled value 62, as shown in FIG. 9. In the labeling process 10, the three label points 111 simultaneously scan the array elements 601 containing image data 61 of the object pixel matrix 60 to assign temporary labeled values 63 to be stored in the register 30 according to the non-zero temporary labeled value 63 of adjacent array elements 601. When all of the temporary labeled values 63 in the adjacent array element 601 are zero, a new temporary labeled value 63 (may be a natural number) is designated and labeled. When at least one temporary labeled value 63 is in the adjacent array element 601, the temporary labeled value 63 is selected at the first priority according to a clockwise priority rule. The abovementioned processes are shown in FIGS. 4A-4C, and three array elements 601 are labeled simultaneously. As shown in FIG. 4A, the first label point 111 (the rightmost one) has an array element 601 containing image data 61 without any adjacent temporary labeled value 63. Thus, a new temporary labeled value 63—“1” is given. As shown in FIG. 4B, the label point 111 has two array elements 601 containing image data 61. The first (rightmost) label point 111 has two adjacent array elements 601 with temporary labeled values 63 and thus selects “3” as the temporary labeled value 63 according to the clockwise priority rule. “4” is given to the third (leftmost) label point 111 as the temporary labeled value 63. As shown in FIG. 4C, the label points 111 have all three array elements 601 containing image data 61. The first (rightmost) label point 111 has only one adjacent temporary labeled values 63 and thus uses “6” as the temporary labeled value 63. The second (middle) label point 111 has two adjacent temporary labeled values 63 “5” and “6” and thus selects “5” as the temporary labeled value 63. The third (leftmost) label point 111 uses “5” as the temporary labeled value 63.
When the adjacent array elements 601 which have different temporary labeled values 63 are connected by the image data 61 and satisfy the form of the label-equivalence window 12. Then, the label-equivalence window 12 associates the two different temporary labeled values 63 that are connected in the adjacent array elements 601 to generate label-equivalence information 121 and records the label point 111 used by the label-equivalence information 121. In FIG. 5, 1-6 are the serial numbers, and LE1-LE3 are respectively label-equivalence information 121 of three label points 111.
Refer to FIGS. 6A-6D, FIG. 7, FIGS. 8A-8F, and FIG. 9. The method of the present invention performs an equivalent-substitution processing process 40 on the temporary labeled values 63 according to the label-equivalence information 121. The equivalent-substitution processing process 40 is divided into an intra-row substitution processing process 41 and an inter-row substitution processing process 42. The equivalent-substitution processing process 40 generates label-equivalence substitution information 631 of the associated temporary labeled values 63.
Firstly, the equivalent-substitution processing process 40 generates an initial matrix 632 according to the number of the temporary labeled values 63 and the number of the label points 111 of the multi-point label window 11. Each row of the initial matrix 632 respectively represents one label point 111, which are separately designated by A1-A3. Each column of the initial matrix 632 respectively represents the temporary labeled value 63, which are separately designated by 0-7, wherein 0 denotes none image data. Next, as shown in FIG. 6A, the intra-row substitution processing process 41 examines the rows one by one to find out the associated temporary labeled values 63 according to the label-equivalence information 121 and then replaces the greater associated temporary labeled values 63 with a smaller associated temporary labeled value 63 to generate an intermediary matrix 633. The details of the intra-row substitution processing process 41 are further shown in FIGS. 6B-6D. In FIG. 6B, A1 receives a piece of label-equivalence information 121—(1, 3) and finds the associated temporary label values “1” and “3” in column 1 and column 3, respectively. The smaller temporary labeled value “1” is used to replace the greater temporary labeled value “3”. In FIG. 6C, A2 receives a piece of label-equivalence information 121—(2, 6) and thus let the temporary labeled value “2” replaces the temporary labeled value “6”. Next, A2 also receives a piece of label-equivalence information 121—(5, 7) and thus let the temporary labeled value “5” replaces the temporary labeled value “7”. In the following, A2 receives a piece of label-equivalence information 121—(5, 6) and thus let the temporary labeled value “2” replaces the temporary labeled value “5” because the temporary labeled value in column 6 has been substituted by “2”. In FIG. 6D, A3 receives a piece of label-equivalence information 121—(3, 4) and thus let the temporary labeled value “3” replaces the temporary labeled value “4”. A3 also receives a piece of label-equivalence information 121—(5, 6) and thus let the temporary labeled value “5” replaces the temporary labeled value “6”.
Refer to FIG. 7. The inter-row substitution processing process 42 examines the intermediary matrix 633 column by column to find out the minimum value among the associated temporary labeled values 63. The minimum value is used to get the value at the corresponding column to replace the greater value in the same row. The details of the inter-row substitution processing process 42 are further shown in FIGS. 8A-8F. In FIG. 8B, A1 is found to have a minimum value of “1” in column 3. Thus, the value of column 1 in A2/A3 is used to replace the labels having the same value as column 3 in A2/A3. Therefore, “1” replaces “3” in A2 and A3. In FIG. 8C, A3 is found to have a minimum value of “1” in column 4. Thus, the value of column 1 in A1/A2 is used to replace the labels having the same value as column 4 in A1/A2. Therefore, “1” replaces “4” in A1 and A2. In FIG. 8D, A2 is found to have a minimum value of “2” in column 5. Thus, the value of column 2 in A1/A3 is used to replace the labels having the same value as column 5 in A1/A3. Therefore, “2” replaces “5” in A1 and A3. In FIG. 8E, both A2 and A3 are found to have a minimum value of “2” in column 6. Thus, the value of column 2 in A1 is used to replace the labels having the same value as column 6 in A1. Therefore, “2” replaces “6” in A1. In FIG. 8F, A2 is found to have a minimum value of “2” in column 7. Thus, the value of column 2 in A1/A3 is used to replace the labels having the same value as column 7. Therefore, “2” replaces “7” in A1 and A3. Thereby, the equivalent-substitution processing process 40 generates the label-equivalence substitution information 631.
From the label-equivalence substitution information 631, it is known that “1” should replace “3” and “4” and that “2” should replace “5”, “6” and “7”. Refer to FIG. 9. The image labeled value substitution process 50 replaces the temporary labeled values 63 according to the label-equivalence substitution information 631 to generate the resultant image labeled values 62.
In conclusion, the method of the present invention adopts a multi-point label window 11 having at least three inclined-arranged label points 111 to generate multiple temporary labeled values 63 by multi-point labeling in each window operation. The label-equivalence information 121 is used to integrate associated temporary labeled values 63, and the final image labeled values 62 are finished by the image labeled value substitution process 50. Therefore, the present invention can accelerate the labeling process.
Patent Application
20110110591
