A method for industrial parts image segmentation under uneven illumination

Abstract

The present invention discloses an industrial part image segmentation method for uneven illumination, which includes the following steps. Step 1: Traverse all pixel points of the workpiece picture and map them into the RGB color space to obtain a three-dimensional RGB color data set C. Step 2: Simplify the three-dimensional RGB color data set C to obtain a data set C'. Step 3: Draw a plane of the ratio of R to G / R to obtain the color distribution on the plane. Step 4: Based on the three main regions existing in the plane of the ratio of R to G / R, set the conditions of a < G / R < b and c < R < d to obtain a mask region. Step 5: Cover the masked picture in Step 4 on the workpiece picture in Step 1 to obtain the color segmentation result of the part image of the workpiece picture. Advantage: The method of the present invention reduces the data complexity of the image, simplifies the color information, and can better highlight the key features in the image.

Description

Technical Field

[0001] The present invention relates to the technical field of image processing, and in particular to an industrial parts image segmentation method for uneven illumination. Background Art

[0002] In the process of industrial parts production, as industrial robots (robotic arms) are put into production in large quantities, they are mainly used in the part grasping stage. The robotic arm determines the position of the object through the visual servo system, that is, based on the relative position of the end effector and the visual sensor. Image processing is an indispensable part of machine vision. It has an important impact on the processing of subsequent algorithms and the application of actual production scenarios such as part grasping.

[0003] However, lighting is the main factor that affects image processing. In outdoor environments, the direction of sunlight is different at different times, resulting in constantly changing lighting conditions. However, considering that most industrial scenes are indoors, there is the influence of lighting, which causes industrial parts (usually metal parts) to reflect light.

[0004] In the robot positioning and grasping based on machine vision, there is a step to identify the parts in the image, so it is necessary to use image segmentation technology to extract the target parts, and then calculate the center of the target parts to achieve the robot positioning and grasping task. If the parts in the captured image have reflective phenomena, it will lead to inaccurate segmentation, thus affecting the subsequent calculation results. Summary of the invention

[0005] The technical problem to be solved by the present invention is that, in the positioning and grasping of the robot arm of the known machine vision, the reflection of the parts will lead to inaccurate segmentation, thereby affecting the subsequent calculation results. The present invention proposes a method for image segmentation of industrial parts with uneven illumination.

[0006] Technical solutions adopted:

[0007] A method for segmenting industrial parts images with uneven illumination includes the following steps:

[0008] Step 1: Use the opencv visual system combined with the python tool to traverse all the pixels of the workpiece image and map them into the RGB color space to obtain a three-dimensional RGB color data set C of all the pixels of the workpiece;

[0009] Step 2: Simplify the three-dimensional RGB color data set C in step 1 by using a cube-building method to obtain a data set C'; each side of the cube contains 3 pixels;

[0010] Step 3: Based on the dataset C' in Step 2, draw a plane of R and G / R ratio within the python tool to obtain the color distribution on the plane; wherein, the abscissa is the R value and the ordinate is the G / R ratio;

[0011] Step 4: Based on the three main regions existing in the plane of R and G / R ratio, namely: the white background region, the gray-blue part region, and the black part region; set the conditions of a < G / R < b and c < R < d, and draw a mask within the three main regions according to the set conditions to obtain the mask region; wherein, a and b are constants of the G / R ratio set, and c and d are constants of the R value set;

[0012] Step 5: Use the mask generated in Step 4 to occlude part of the region in the workpiece image in Step 1, so as to obtain the color segmentation result of the part image of the workpiece image.

[0013] For further optimization of the technical solution of the present invention, the specific method of Step 2 is to select the pixel at the center point of the cube, use it to represent the surrounding 26 pixel points, and calculate the R, G, and B values of the cube center to which each pixel point belongs by using the formula c / / 3*3 + 1, where c is the R, G, and B values of the pixel point; determine the coordinates of the center point of the cube, and eliminate duplicate results; obtain the dataset C'. The design purpose of this dependent claim is that if the original method is used to calculate the set C, the calculation time is relatively long due to the large number of points; while using this new method can greatly shorten the calculation time.

[0014] For further optimization of the technical solution of the present invention, in Step 2, the ranges of R, G, and B values are all 0 - 255; when any one of the R, G, and B values is equal to 255, in the python calculation, use the min function to limit the calculation result of the formula c / / 3*3 + 1; the formula of the min function is as follows:

[0015] min((c / / 3) * 3 + 1, 255)

[0016] Compare the calculation result with 255. If it is less than 255, use the calculation result; if it is greater than 255, then take the value of 255.

[0017] The design purpose of this dependent claim is that firstly, since the R, G, and B values cannot exceed 255, it is necessary to limit their calculation results within 255. Secondly, the calculation result will exceed 255, and this situation will only occur when there is a value equal to 255 in c. At this time, a complete 3x3x3 cube cannot be formed, and only a 3x3 plane containing 9 pixel points can be formed. By limiting the final calculation result to 255, in fact, one point at the center of the plane is used to replace the surrounding 8 points.

[0018] In a further preferred embodiment of the technical solution of the present invention, the condition for eliminating duplicate results is: those with the same calculated cube center point coordinates are eliminated, and only one is retained. Because in Python calculation, the calculation results are placed in an empty bag, and each time a result is calculated, one is placed in the bag. If the new result exists in the original bag, it will not be placed repeatedly. If it is placed repeatedly, the number of points will not be reduced, and simplifying the calculation will be meaningless.

[0019] In a further optimization of the technical solution of the present invention, a step of verifying the data set C' in step 2 is set before step 3; the specific method is: randomly select a pixel point in the three-dimensional RGB color data set C, defined as point A, and we look for a point A' in the set C', where each coordinate of A' (that is, R, G, B value) is less than or equal to 1 with each coordinate of A; if so, proceed to step 3; if not, add pixel point A to the data set C', and then proceed to step 3. This method is used to verify the calculation result of step 2 to ensure its integrity and accuracy to avoid missing points.

[0020] In a further preferred embodiment of the technical solution of the present invention, in step 3, if R=0, R=1 is taken to draw the plane. When drawing the plane of the ratio of R and G / R, in the process of processing G / R, if R=0, the result will not exist, so we can assign R=1 at this time, which not only has a small impact on the result, but also does not cause calculation problems.

[0021] In a further preferred embodiment of the technical solution of the present invention, in step 4, a color picker is used to cover the areas in the three main areas that meet the set conditions with red; the specific method is:

[0022] Step 41, first select constants a, b, c and d on the plane of R and G / R ratio to determine the mask area;

[0023] Step 42, using a color picker to select the RGB values ​​of some missing points on the plane of the R and G / R ratio, modifying the mask area, and obtaining new constants a, b, c and d;

[0024] Step 43, manually adjust the values ​​of a, b, c and d in small increments to modify the mask area;

[0025] Step 44: Repeat step 43 multiple times to obtain the optimal mask area.

[0026] The purpose of designing this weight is to obtain the best result by modifying the value in a small range multiple times, that is, to show the accuracy of the segmentation result.

[0027] In a further preferred embodiment of the technical solution of the present invention, the color picker is obtained by searching in the browser. The color picker is used to absorb the missing points, and can accurately modify the conditions and improve the accuracy.

[0028] Compared with the prior art, this method has the following technical effects:

[0029] 1. The method of the present invention reduces the data complexity of the image, simplifies the color information, and can better highlight the key features in the image.

[0030] 2. The method of the present invention has strong flexibility, adaptability and pertinence. It allows the operator to adjust according to the specific image content and target, and can adapt to different application scenarios. It can better deal with and improve the accuracy of segmentation in view of the influence of the factor of illumination on the local area. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 For the workpiece picture;

[0032] Figure 2 This is an unsimplified schematic diagram of color distribution;

[0033] Figure 3 Schematic diagram of the constructed cube;

[0034] Figure 4 This is a simplified schematic diagram of color distribution;

[0035] Figure 5 shows the color distribution on the plane drawn in the Python tool ( Figure 5a For the RG plane, Figure 5b For BR plane, Figure 5c is GB plane);

[0036] Figure 6 The color distribution diagram of R and G / R ratio on the plane drawn in Python tool;

[0037] Figure 7 The workpiece image obtained by the method of this embodiment represents the gray-blue part covering most of the part area;

[0038] Figure 8 The workpiece image obtained by the method of this embodiment represents the black portion covering most of the part area;

[0039] Fig. 9 This is a workpiece image covering the background area obtained by the method of this embodiment. DETAILED DESCRIPTION

[0040] The technical solution of the present invention is described in detail below, but the protection scope of the present invention is not limited to the embodiments.

[0041] To make the content of the present invention more obvious and understandable, the following further describes in conjunction with the appended Figure 1-9 drawings and specific embodiments.

[0042] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention. Embodiment 1

[0043] In this embodiment, an industrial part of a flange is taken as an example for further illustration. A method for image segmentation of industrial parts with uneven illumination in this embodiment includes the following steps:

[0044] Step 1: Use the opencv vision system in combination with the python tool to traverse all pixel points of the workpiece image, and map them into the RGB color space to obtain the three-dimensional RGB color data set C of all pixel points of the workpiece;

[0045] Step 2: Simplify the data set by using the method of constructing a cube for the three-dimensional RGB color data set C in Step 1 to obtain the data set C'; each edge of the cube contains 3 pixel points;

[0046] Step 3: Based on the data set C' in Step 2, draw a plane of the R and G / R ratios in the python tool to obtain the color distribution on the plane; where the abscissa is the R value and the ordinate is the G / R ratio;

[0047] Step 4: Based on the three main regions existing in the plane of the R and G / R ratios, namely: the white background region, the gray-blue part region and the black part region; set the conditions of a < G / R < b and c < R < d, and draw a mask in the three main regions according to the set conditions to obtain the mask region; where a and b are constants of the G / R ratio, and c and d are constants of the R value;

[0048] Step 5: Use the mask generated in Step 4 to block part of the region in the workpiece image in Step 1, so as to obtain the color segmentation result of the part image of the workpiece image.

[0049] As Figure 1 shown, in Step 1, the workpiece image is obtained by horizontally placing the part on the desktop and taking a clear picture with a high-definition camera.

[0050] The opencv vision system in Step 1 is a known vision system, mainly used to solve computer vision tasks, which is known to those skilled in the art. The python tool is a known tool, which is known to those skilled in the art.

[0051] The RGB color space mentioned in step 1 is a known technology and is known to those skilled in the art. The R / G / B values ​​in the RGB color space, R, G, B represent the colors of the three channels of red, green, and blue respectively; each color channel ranges between [0,255].

[0052] Step 1 is as follows: use the opencv visual system to read the image, then use cv.split to split the image into three channels: B / G / R, read the RGB value of each pixel, and express it in the RGB coordinate system, that is, its three-dimensional color distribution map; then you will get a three-dimensional RGB color data set C of all pixels of a very large workpiece, such as Figure 2 shown.

[0053] Among them, cv.split is channel separation, which separates the 3-channel (RGB) color image into 3 single-channel pure color images in the order of (B, G, R). This is a known technology and is known to those skilled in the art.

[0054] For a three-dimensional RGB color data set C of all pixels of a very large workpiece, it is inconvenient to process such a huge data set. In the method of this embodiment, step 2 is proposed to perform simplified calculation on the three-dimensional RGB color data set C to obtain data set C'.

[0055] Specifically, the three-dimensional RGB color distribution consists of cubes with a side length of 3 pixels, such as Figure 3 As shown, the RGB in the figure is similar to the cube coordinate axes XYZ.

[0056] Select the pixel at the center of the cube and use it to represent the surrounding 26 pixels. Use the formula c / / 3*3+1 to calculate the R, G, and B values ​​of the center of the cube to which each pixel belongs, where c is the R / G / B value of the pixel. Determine the coordinates of the center of the cube and remove duplicate results. Get the data set C'. Figure 4 As shown. Figure 2 and Figure 4 It can be clearly seen that this simplified calculation has almost no effect on the color distribution.

[0057] Furthermore, the pixel at the center of the cube is selected to represent the surrounding 26 pixels, which reduces the number of points in the three-dimensional RGB color data set C by 27 times. Figure 3 As shown, the red dot is the center point of the 3x3x3 cube, which is used to represent the surrounding points.

[0058] Take the R axis as an example. For example, if the R value of the selected pixel point is in the range of 0-2, the R value of the cube center is 1; in the range of 3-5, the R value of the cube center is 4, and so on. Therefore, the R value of the cube center should be 1, 4, 7, etc. At this time, the difference of the cube center is 3

[0059] Assume that the R value of one pixel is 2. Through the above formula, we can calculate that the R value of the center point of the cube to which it belongs is equal to 2 / / 3*3+1=0*3+1=1, then R=1. The R value of the selected pixel point is in the range of 0-2 as mentioned above, so the R value of the center of the cube is 1.

[0060] The B-axis and G-axis are the same as the R-axis.

[0061] By calculating the R, B, and G values ​​mentioned above, we get the coordinates of the center point of the cube. Then we remove duplicate results. For example, if a point is calculated with the coordinates (1, 1, 1) and put into the data set C', and another point is also calculated with the coordinates (1, 1, 1), then the new (1, 1, 1) will not be put into the data set C' and needs to be removed. Finally, the data set C' is formed.

[0062] In the method of this embodiment, in step 2, the range of R, G, and B values ​​is 0-255; if any one of the R, G, and B values ​​is equal to 255, in the Python calculation, the min function is used to limit the calculation result of the formula c / / 3*3+1; the min function formula is as follows: min((c / / 3) * 3 + 1, 255); the calculation result is compared with 255, if it is less than 255, the calculation result is used; if it is greater than 255, the value 255 is taken.

[0063] In the method of this embodiment, a step of verifying the data set C' in step 2 is also set before step 3; the specific method is: randomly select a pixel point in the three-dimensional RGB color data set C, defined as point A, and we find out whether there is a point A' in the set C', and each coordinate of A' (that is, R, G, B value) is less than or equal to 1 with each coordinate of A; if so, go to step 3; if not, add pixel point A to the data set C', and then go to step 3. The purpose of designing the verification step is to improve its accuracy and avoid color loss.

[0064] In other words, the condition is whether there is a point in the data set C', and the distance from point A to this point is less than or equal to 1 (that is, the difference between the R, G, and B values ​​of point A and this point is less than or equal to 1). If such a point can be found in the data set C', then the data set C' at this time will not be changed; if this point cannot be found in the data set C', then the coordinates of the center of the cube to which point A belongs need to be added to the data set C'.

[0065] Furthermore, R, G, and B represent the colors of the red, green, and blue channels respectively. The range of each color channel is between [0, 255]. In the dataset C’, the centers of these cubes have been found and their RGB values are known. Now, it is to find whether there is the center of the cube to which point A belongs. For example, the RGB value of pixel point A is (1, 1, 0), and the RGB value of the center coordinates of the cube to which it belongs is (1, 1, 1). It can be seen from this that the R value and the G value are the same, and the B value differs by 1, so it can also be proved that A belongs to this cube.

[0066] In step 3 of this embodiment, further, an RG plane can be drawn within the python tool: the abscissa is the R value and the ordinate is the G value; a BR plane: the abscissa is the B value and the ordinate is the R value; a GB plane: the abscissa is the G value and the ordinate is the B value. Before the simplification of the calculation, the number of points in set C is too large. If it is necessary to observe the color distribution map of set C from various angles, it is almost impossible to achieve in real time. However, after the simplification, as the number of points decreases, we can also observe the color distribution maps from various angles in real time. At the same time, through the functions of these three plane graphs, we can also find that taking the RG plane as an example, the coordinates of the points on the R axis and the G axis differ by 3, which also proves the correctness of our simplified calculation from the side.

[0067] In the method of this embodiment, the workpiece image is segmented through the color distribution map on the plane of the ratio of R to G / R.

[0068] Within the python tool, based on the plane of the ratio of R to G / R, it is known that there are three main regions, namely: a white background region, a gray-blue part region, and a black part region.

[0069] At this time, considering a situation, if R = 0, then take R = 1. Because when using G / R, if R is equal to 0, it is equivalent to the denominator being 0 and it no longer exists.

[0070] Then, it is necessary to manually find the conditions for segmenting the three main regions, set the conditions of a < G / R < b and c < R < d. According to the set conditions, masks are drawn within the three main regions to obtain mask regions; where a and b are constants of the set G / R ratio, and c and d are constants of the set R value; a, b, c, and d are manually set ranges, specifically, the thresholds are determined through tools such as a color picker, that is, the values of a, b, c, and d are selected, and masks are drawn to cover the regions that meet the set conditions. Among them, the color picker is obtained by searching in the browser and is a known technology known to those skilled in the art.

[0071] Further, the mask is also called a binary Mask and can also be referred to as a baffle. We modify the shape of this baffle according to the set conditions (a < G / R < b and c < R < d) and paint the area to be retained red; that is, the aforementioned three main areas are respectively set as red images.

[0072] Using a color picker, cover the areas that meet the set conditions within the three main areas with red; the specific method is as follows:

[0073] Step 41: First, select constants a, b, c, and d on the plane of R and G / R ratio to determine the mask area;

[0074] Step 42: Use a color picker to select the RGB values of some missing points on the plane of R and G / R ratio, modify the mask area, and obtain new constants a, b, c, and d;

[0075] Step 43: Manually adjust the values of a, b, c, and d slightly to modify the mask area;

[0076] Step 44: Repeat Step 43 multiple times to obtain the optimal mask area.

[0077] In Step 4 of this embodiment, manually selecting the thresholds of constants a, b, c, and d is more operable and relatively more accurate compared to automatically selecting thresholds.

[0078] In Step 4 of this embodiment, the size of the mask is the same as that of the original image. Use the mask obtained in Step 4 to locally block the workpiece image in Step 1, and finally obtain the workpiece image in Step 1. For example, Figure 7 represents covering most of the grayish-blue part in the part area, Figure 8 represents covering most of the black part in the part area, Fig. 9 represents the background area in the workpiece image.

[0079] After the segmentation is completed, it is convenient for the robot to correctly position and capture the parts next. Because the segmented image is easier to identify and analyze.

[0080] Specific application examples

[0081] We place the part on the desktop for shooting and obtain an image of 3105×2005, such as Figure 1As shown. First, use 'cv.imread' to read the image, and then convert the BGR channel to RGB format. Convert the colors of all pixels in the image to set C and remove duplicate colors. At this time, each element in set C is a unique color, and we can get 26245 elements in set C. Then use matplotlib to draw a 3D color distribution image, using the R, G, and B values ​​of the pixel as coordinates, and its color is also determined by its RGB value, as shown Figure 2 shown.

[0082] For set C, we use a cube-building method to simplify the complexity of the data set, where each small cube has a side length of 3 pixels. We use the center point of the cube to replace the surrounding 26 pixels, such as Figure 3 Here, we can use (c / / 3) * 3 + 1 to calculate the RGB value of the center point of the small cube to which each element in set C belongs. The RGB value ranges from 0 to 255, so in order to ensure the rationality of the final calculation result, we use min((c / / 3) * 3 + 1, 255) to compare the calculation result with 255. If it is less than 255, use the calculation result; if it is greater than 255, take 255.

[0083] In order to ensure the integrity of the data set, we can verify the simplified data set C'. The specific operation is to randomly select a point A in the original data set C, and check whether there is a point A' in the new data set C', and the R, G, and B values ​​of A' are less than or equal to 1 respectively with the corresponding R, G, and B values ​​of A. If this point A' exists, then no transformation will be generated for the new set C'. If this point does not exist, then the coordinates of the center of the cube to which point A belongs are added to the set C'.

[0084] Finally, we get a simplified dataset C', which has 7533 pixels. It can be clearly seen that the complexity of the data is greatly reduced. Next, we draw a three-dimensional scatter plot to visualize the distribution of dataset C' in the RGB color space, using the R, G, and B values ​​of the pixel as coordinates, and its color is also determined by its RGB value, as shown in the figure below. Figure 4 As shown in Figure 5. Comparing the two color distribution graphs, it can be found that the simplified method has almost no effect on the color distribution. Then three two-dimensional scatter plots are drawn to show the color distribution in the RG, BR and GB planes, as shown in Figure 5.

[0085] At the same time, the color distribution diagram on the plane of R and G / R ratio is drawn, such as Figure 6As shown. At this time, considering that if R = 0, then take R = 1, which not only has a small impact on the result, but also does not cause the calculation problem of a denominator of 0. Through this color distribution map, we can clearly divide the image into three main component regions: the white background region, the gray-blue part region, and the black part region. Set the conditions of a < G / R < b and c < R < d, and draw a red mask in the three main regions according to the set conditions, that is, highlight the regions that meet the specific G / R ratio and R value range.

[0086] We first roughly judge the condition ranges of each region by the naked eye, that is, roughly determine the values of a, b, c, and d. For example, in the black part region, it can be roughly considered that c = 0 and d = 100, that is, the condition is 0 < R < 110. Then further refine the conditions according to the obtained rough results, that is, set the conditions as a = 0, b = 1.109, c = 0, d = 109, that is, 0 ≤ G / R ≤ 1.109, 0 ≤ R ≤ 109, as Figure 7 shown. By analogy, the conditions for the gray-blue region are 1.109 ≤ G / R ≤ 20, 60 ≤ R ≤ 140, as Figure 8 shown, and the conditions for the white background region are 140 ≤ R ≤ 210, as Fig. 9 shown. Thus, the final segmentation result can be obtained.

[0087] The above embodiments are only to illustrate the technical idea of the present invention, and the protection scope of the present invention cannot be limited thereby. Any changes made on the basis of the technical solution according to the technical idea proposed by the present invention shall fall within the protection scope of the present invention.

Claims

1. A method for segmenting industrial parts images with uneven illumination, characterized in that: It includes the following steps: Step 1: Use the opencv vision system combined with the python tool to traverse all pixel points of the workpiece image, map them into the RGB color space, and obtain the three-dimensional RGB color dataset C of all pixel points of the workpiece; Step 2: Simplify the dataset using the method of constructing a cube for the three-dimensional RGB color dataset C in Step 1 to obtain the dataset C'; each edge of the cube contains 3 pixel points; The specific method of Step 2 is to select the pixel at the center point of the cube and use it to represent the surrounding 26 pixel points. Calculate the R, G, and B values of the center of the cube to which each pixel point belongs using the formula c / / 3*3+1, where c is the R / G / B value of the pixel point; determine the coordinates of the center point of the cube and eliminate duplicate results; obtain the dataset C'; In Step 2, the ranges of the R, G, and B values are all 0-255; when any one of the R, G, and B values is equal to 255, in the python calculation, use the min function to limit the calculation result of the formula c / / 3*3+1; the min function formula is as follows: min((c / / 3) * 3 + 1, 255) Compare the calculation result with 255. If it is less than 255, use the calculation result; if it is greater than 255, then take the value 255; Step 3: Based on the dataset C' in Step 2, draw a plane of the R to G / R ratio in the python tool to obtain the color distribution on the plane; where the abscissa is the R value and the ordinate is the G / R ratio; Step 4: Based on the three main regions existing in the plane of the R to G / R ratio, namely: the white background region, the gray-blue part region, and the black part region; set the conditions a < G / R < b and c < R < d, and draw a mask in the three main regions according to the set conditions to obtain the mask region; where a and b are constants of the G / R ratio, and c and d are constants of the R value; Step 5: Use the mask generated in Step 4 to occlude part of the region in the workpiece image in Step 1, thereby obtaining the color segmentation result of the part image of the workpiece image.

2. The method according to claim 1, characterized in that: The condition for eliminating duplicate results is: eliminate those with the same calculated coordinates of the center point of the cube and keep one.

3. The method according to claim 1, characterized in that: Before Step 3, there is also a step to verify the dataset C' in Step 2; the specific method is: randomly select a pixel point in the three-dimensional RGB color dataset C and define it as point A. We look for whether there is a point A' in the set C'. Each coordinate of A' is less than or equal to 1 compared to each coordinate of A; if so, enter Step 3; If not, add the pixel point A to the dataset C' and then enter Step 3.

4. The method according to claim 1, characterized in that: In Step 3, if R = 0, then take R = 1 for plane drawing.

5. The method according to claim 1, characterized in that: In Step 4, use a color picker to cover the regions that meet the set conditions in the three main regions with red; the specific method is: Step 41: First select the constants a, b, c, and d on the plane of the R to G / R ratio to determine the mask region; Step 42: Use the color picker to select the RGB values of some missing points on the plane of the R to G / R ratio, modify the mask region, and obtain new constants a, b, c, and d; Step 43, manually adjust the values ​​of a, b, c and d in small increments to modify the mask area; Step 44: Repeat step 43 multiple times to obtain the optimal mask area.

6. The method according to claim 5, characterized in that: The color picker is obtained by searching in the browser.

Images