Method and device for generating contour points, computer storage medium, and electronic device
By digitizing the target object and drawing triangle networks, finding and sorting high data points such as sources, and performing area division and fitting processing, the problem of low interpolation accuracy in the existing technology is solved, and high-precision interpolation of out-of-order non-monotonic discrete points is achieved.
Patent Information
- Application Number
- CN202111429216.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-11-29
- Publication Date
- 2025-06-06
- Estimated Expiration
- 2041-11-29
AI Technical Summary
In the prior art, when dealing with discrete points that are out of order, non-monotonic, the interpolation accuracy of the Hermite interpolation method is low.
By digitizing the target object, drawing a triangle network, finding source and contour data points, sorting and determining gradients, region division, and fitting the source and contour data points in each data point area, we obtain fitted contour data points.
Effectively improve the interpolation accuracy of disorganized and non-monotonic discrete points.
Smart Images

Figure CN114092600B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a method and device for generating contour points, a computer storage medium, and an electronic device. Background Art
[0002] In the fields of terrain mapping, precipitation, air pressure and temperature, it is generally necessary to set contour lines in order to facilitate the further display of statistical results. In the process of contour lines, it is generally necessary to interpolate the extracted contour points, so that new contour points can be simulated based on a small number of known discrete contour points to meet application requirements. However, in the prior art, the existing interpolation processing methods such as the Hermite interpolation method have low interpolation accuracy when processing disordered and non-monotonic discrete points. Summary of the invention
[0003] The embodiments of the present application provide a method and device for generating contour points, a computer storage medium, and an electronic device to overcome or alleviate the above-mentioned technical problems existing in the prior art.
[0004] The technical solution adopted in this application is:
[0005] In a first aspect, an embodiment of the present application provides a method for generating a fitting contour point, which comprises:
[0006] Digitally process the target object to obtain a set of input data points for contour drawing, and draw a triangle network on the set of input data points;
[0007] Finding required source contour data points based on a triangle network drawn on the input data set;
[0008] Sorting the found source contour data points to determine the gradients of the source contour data points;
[0009] According to the gradient, all the source contour data points are divided into regions to obtain a plurality of data point regions;
[0010] The source contour data points in each of the data point regions are fitted according to a set interpolation interval to obtain fitted contour data points.
[0011] Optionally, in an embodiment of the present application, the step of sorting the found source contour data points to determine the gradients of the source contour data points includes:
[0012] The found source contour data points are sorted in ascending order of coordinate values to obtain a source contour data point sequence, and the gradient of the source contour data points is determined.
[0013] Optionally, in an embodiment of the present application, all the source contour data points are divided into regions according to the gradient to obtain a plurality of data point regions, including:
[0014] Determining inflection points between the source contour data points according to the gradient;
[0015] According to the inflection point, all the source contour data points are divided into regions to obtain a plurality of data point regions.
[0016] Optionally, in an embodiment of the present application, performing fitting processing on the source contour data points in each of the data point regions according to a set interpolation interval to obtain fitted contour data points includes:
[0017] For each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points;
[0018] Based on the gradient value, a fitting process is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0019] Optionally, in an embodiment of the present application, performing fitting processing on the source contour data points in the data point area according to a set interpolation interval based on the gradient value to obtain fitting contour data points includes:
[0020] Calculating interpolation coefficients based on the gradient value and for the source contour data points in the data point region;
[0021] Based on the interpolation coefficients, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0022] Optionally, in an embodiment of the present application, the step of calculating the gradient value of each source contour data point in each data point region includes:
[0023] For each of the source contour data points in each of the data point regions, calculating the upward gradient value and the downward gradient value of the source contour data points adjacent to the source contour data points;
[0024] According to the upward gradient value and the downward gradient value, the gradient value of the corresponding source contour data point is calculated.
[0025] Optionally, in an embodiment of the present application, the method further includes:
[0026] According to the fitted contour data points, a first contour line is formed;
[0027] determining a boundary of the first contour line;
[0028] According to the boundary relationship between the first contour line and the input data point set, the first contour line is subjected to boundary processing to obtain a second contour line.
[0029] Optionally, in one embodiment of the present application, boundary processing is performed on the first contour line according to the boundary relationship between the first contour line and the input data point set to obtain a second contour line, including: if the boundary of the first contour line is outside the boundary between the input data point set or is on the boundary between the input data point set, then opening processing is performed on the boundary of the first contour line; if the boundary of the first contour line is within the boundary between the input data point set, then closing processing is performed on the boundary of the first contour line.
[0030] In a second aspect, an embodiment of the present application provides a device for generating a fitting contour point, which includes:
[0031] A drawing unit, used for digitally processing the target object to obtain a set of input data points for contour drawing, and drawing a triangle network on the set of input data points;
[0032] A search unit, for searching required source contour data points based on a triangle network drawn on the input data set;
[0033] A sorting unit, used for sorting the found source contour data points to determine the gradients of the source contour data points;
[0034] A region division unit, used for performing region division on all the source contour data points according to the gradient to obtain a plurality of data point regions;
[0035] The fitting unit is used to perform fitting processing on the source contour data points in each of the data point areas according to a set interpolation interval to obtain fitting contour data points.
[0036] In a third aspect, a computer storage medium is provided, on which a computer executable program is stored, and the computer executable program is executed to implement any method described in the embodiments of the present application.
[0037] In a fourth aspect, an electronic device is provided, comprising a memory and a processor, wherein the memory is used to store a computer executable program, and the processor is used to run the computer executable program to implement any method described in the embodiments of the present application.
[0038] In the technical solution of the embodiment of the present application, the target object is digitized to obtain a set of input data points for contour drawing, and a triangular network is drawn on the input data point set; based on the triangular network drawn on the input data set, the required source contour data points are found; the found source contour data points are sorted to determine the gradient of the source contour data points; according to the gradient, all the source contour data points are divided into regions to obtain a number of data point regions; the source contour data points in each of the data point regions are fitted according to the set interpolation interval to obtain fitted contour data points, thereby effectively targeting disordered and non-monotonic discrete points (i.e., source contour data points), thereby improving the accuracy of interpolation. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] Figure 1 A schematic diagram of a flow chart of a method for generating contour lines according to an embodiment of the present application;
[0040] Figure 2A A schematic diagram of a flow chart of a method for generating contour lines according to an embodiment of the present application;
[0041] Figure 2B is a schematic diagram of a shape of an exemplary input data point set;
[0042] Figure 2C A schematic diagram of a shape of another exemplary input data point set;
[0043] Figure 2D is a schematic diagram of a shape of another exemplary input data point set;
[0044] Figure 3A It is a schematic diagram of a series of equal-height data points obtained by using a linear interpolation algorithm;
[0045] Figure 3B For use Figure 1 Schematic diagram of a series of equal-height data points obtained by the method;
[0046] Figure 3C It is a schematic diagram of a series of equal-height data points obtained using the B-spline interpolation algorithm;
[0047] Figure 4A for Figure 1 The first contour line obtained by interpolation without sorting;
[0048] Figure 4B for Figure 1 The first contour obtained by the method in the middle;
[0049] Figure 5 This is a schematic diagram of the structure of a device for generating a fitted contour line according to an embodiment of the present application;
[0050] Figure 6 It is a schematic diagram of the structure of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION
[0051] In order to make the technical problems, technical solutions and advantages to be solved by the present application clearer, a detailed description will be given below with reference to the accompanying drawings and specific embodiments.
[0052] In the technical solution of the embodiment of the present application, the target object is digitized to obtain a set of input data points for contour drawing, and a triangular network is drawn on the input data point set; based on the triangular network drawn on the input data set, the required source contour data points are found; the found source contour data points are sorted to determine the gradient of the source contour data points; according to the gradient, all the source contour data points are divided into regions to obtain a number of data point regions; the source contour data points in each of the data point regions are fitted according to the set interpolation interval to obtain fitted contour data points, thereby effectively targeting disordered and non-monotonic discrete points (i.e., source contour data points), thereby improving the accuracy of interpolation.
[0053] Figure 1 Schematic diagram of a method for generating contour lines according to an embodiment of the present application; Figure 1 As shown, it includes:
[0054] S101, digitally processing the target object to obtain a set of input data points for contour drawing, and drawing a triangle network on the set of input data points;
[0055] In this embodiment, the target object is an image of terrain rendering, precipitation, air pressure and temperature. The digitization is, for example, performing a binarization process on the image.
[0056] In this embodiment, the input point set is a set of data points (also referred to as input data points) extracted from the binarized image and capable of representing the features of the target image.
[0057] In this embodiment, the purpose of drawing the triangle network is to facilitate the subsequent query of source contour data points. Here, the specific algorithm for drawing the triangle network is not particularly limited.
[0058] S102, searching for required source contour data points based on a triangle network drawn on the input data set;
[0059] In this embodiment, after the triangular network is drawn, it is equivalent to forming a plurality of (greater than or equal to 2) superimposed triangles on the input data point set. Since each triangle has three vertices and three edges, based on these characteristics of the triangle, the source contour data points can be quickly found. Some of these source contour data points may be input data points, and some may be vertices of the triangle.
[0060] S103, sorting the found source contour data points to determine the gradient of the source contour data points;
[0061] In this embodiment, the step of sorting the found source contour data points to determine the gradients of the source contour data points includes:
[0062] The found source contour data points are sorted in ascending order of coordinate values to obtain a source contour data point sequence, and the gradient of the source contour data points is determined.
[0063] Of course, in other embodiments, the order can also be sorted from large to small, which will not be described in detail here. In fact, there is no special limitation on the sorting method, as long as the gradient of the source contour data point can be determined, and the gradient of the source contour data point includes the gradient between it and two adjacent contour data points.
[0064] S104, dividing all the source contour data points into regions according to the gradient to obtain a plurality of data point regions;
[0065] In this embodiment, according to the gradient, all the source contour data points are divided into regions to obtain a plurality of data point regions, including:
[0066] S114, determining the inflection point between the source contour data points according to the gradient;
[0067] S124. According to the inflection point, all the source contour data points are divided into regions to obtain a plurality of data point regions.
[0068] Specifically, in this embodiment or other embodiments, for each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points includes:
[0069] For each of the source contour data points in each of the data point regions, calculating the upward gradient value and the downward gradient value of the source contour data points adjacent to the source contour data points;
[0070] According to the upward gradient value and the downward gradient value, the gradient value of the corresponding source contour data point is calculated.
[0071] The upward gradient value is the gradient value between the source contour data point and the source contour data point on its left, and the downward gradient value is the gradient value between the source contour data point and the source contour data point on its right.
[0072] Specifically, the average value of the upward gradient value and the downward gradient value may be used as the gradient value of the corresponding source contour data point.
[0073] It should be noted here that the gradient values of the first source contour data point and the last source contour data point can be defaulted to 0, so as to facilitate the rapid determination of the gradient values of the intermediate source contour data points between the first source contour data point and the last source contour data point.
[0074] Specifically, the gradient value of the source contour data point in the middle can be determined by referring to the following formula:
[0075]
[0076] Among them, m 0 is the gradient value of the first source contour data point, m n The gradient value of the last source contour data point, n is the total number of source contour data points, m is i is the i-th source contour data point (x i ,y i ), the i-1th source contour data point is (x i-1 ,y i-1 ), the i+1th source contour data point is (x i+1 ,y i+1 ).
[0077] S105 , performing fitting processing on the source contour data points in each of the data point regions according to a set interpolation interval to obtain fitted contour data points.
[0078] In this embodiment, the fitting process is performed on the source contour data points in each data point area according to a set interpolation interval to obtain the fitted contour data points, including:
[0079] For each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points;
[0080] Based on the gradient value, a fitting process is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0081] In this embodiment, the step of performing fitting processing on the source contour data points in the data point area according to a set interpolation interval based on the gradient value to obtain fitting contour data points includes:
[0082] Calculating interpolation coefficients based on the gradient value and for the source contour data points in the data point region;
[0083] Based on the interpolation coefficients, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0084] In this embodiment, the interpolation coefficient may be a Hermite interpolation coefficient, which is specifically calculated by the following formula:
[0085]
[0086] H(x) is the interpolation coefficient, x i ,y i is the coordinates of the source contour data points, m i is the gradient value.
[0087] Figure 2A Schematic diagram of a method for generating contour lines according to an embodiment of the present application; Figure 2A As shown, it includes:
[0088] S201, digitally processing the target object to obtain a set of input data points for contour drawing, and drawing a triangle network on the set of input data points;
[0089] In this embodiment, drawing a triangular network on the input data point set includes: drawing a Delaunay triangular network on the input data point set based on a Delaunay algorithm, thereby ensuring the accuracy and efficiency of triangular network drawing.
[0090] In this embodiment, drawing a triangular network on the input data point set includes: drawing a Delaunay triangular network on the input data point set according to the plane coordinates and height data of each input data point in the input data set, thereby ensuring that the determined triangular network has relatively accurate coordinates.
[0091] S202, searching for required source contour data points based on a triangle network drawn on the input data set;
[0092] In this embodiment, the search for the required source contour data points based on the triangle network drawn on the input data set includes: searching for the required source contour data points according to the vertex coordinates of each triangle in the triangle network and the corresponding height data, so as to ensure that the required source contour data points are quickly found. Here, the required source contour data points can be flexibly set according to the application scenario, such as source contour data points with specific height information.
[0093] S203, dividing all the source contour data points into regions according to the gradient to obtain a plurality of data point regions;
[0094] S204, performing fitting processing on the source contour data points in each of the data point regions according to a set interpolation interval to obtain fitted contour data points;
[0095] Figure 2B is a schematic diagram of a shape of an exemplary input data point set; Figure 2C A schematic diagram of a shape of another exemplary input data point set; Figure 2D FIG. 4 is another exemplary shape diagram of a set of input data points; Figure 2B As shown, the shape of the input data point set is a rectangle; Figure 2C As shown, the shape of the input data point set is fan-shaped; Figure 2D As shown, the shape of the input data point set is a circle.
[0096] Furthermore, if the shape of the input data point set is a rectangle, the interpolation algorithm used in the interpolation processing is a linear interpolation algorithm; if the shape of the input data point set is a sector, the interpolation algorithm used in the interpolation processing is a cubic-spline interpolation algorithm; if the shape of the input data point set is a circle, the interpolation algorithm used in the interpolation processing is a B-spline interpolation algorithm.
[0097] Figure 3A It is a schematic diagram of a series of equal-height data points obtained by using a linear interpolation algorithm; Figure 3B For use Figure 1 Schematic diagram of a series of equal-height data points obtained by the method; Figure 3C This is a schematic diagram of a series of equal-height data points obtained using the B-spline interpolation algorithm; as shown in 3A, Figure 3A and Figure 3B The number of iso-height data points is similar, while Figure 3C The number of iso-height data points shown is relatively small. Figure 3A The contour lines formed by the contour data points are smoother.
[0098] Figure 4A for Figure 1The first contour line obtained by interpolation without sorting, Figure 4B for Figure 1 The first contour line obtained by the method in the above figure. Figure 4A and Figure 4B From the above, we can see that the first contour line obtained by interpolation after sorting is smoother.
[0099] S205, determining the boundary of the first contour line;
[0100] In this embodiment, the boundary of the first contour line can be determined by judging the relative position relationship between the first contour data point on the first contour line and the input data point set.
[0101] S206: Perform boundary processing on the first contour line according to the boundary relationship between the first contour line and the input data point set to obtain a second contour line.
[0102] In this embodiment, according to the boundary relationship between the first contour line and the input data point set, the first contour line is subjected to boundary processing to obtain a second contour line, including: if the boundary of the first contour line is outside the boundary between the input data point sets or is on the boundary between the input data point sets, the boundary of the first contour line is subjected to opening processing; if the boundary of the first contour line is within the boundary between the input data point sets, the boundary of the first contour line is subjected to closing processing, so that a second contour line corresponding to the shape of different input data sets can be obtained through different boundary processing.
[0103] Figure 5 Schematic diagram of the structure of a device for generating a fitting contour point according to an embodiment of the present application; Figure 5 As shown, it includes:
[0104] A drawing unit 501 is used to digitally process the target object to obtain a set of input data points for contour drawing, and draw a triangle network on the set of input data points;
[0105] A search unit 502, configured to search for required source contour data points based on a triangle network drawn on the input data set;
[0106] A sorting unit 503 is used to sort the found source contour data points to determine the gradients of the source contour data points;
[0107] A region division unit 504 is used to divide all the source contour data points into regions according to the gradient to obtain a plurality of data point regions;
[0108] The fitting unit 505 is used to perform fitting processing on the source contour data points in each of the data point areas according to a set interpolation interval to obtain fitting contour data points.
[0109] Optionally, in one embodiment, the sorting unit 503 is specifically configured to:
[0110] The found source contour data points are sorted in ascending order of coordinate values to obtain a source contour data point sequence, and the gradient of the source contour data points is determined.
[0111] Optionally, in one embodiment, the area division unit 504 is specifically used to:
[0112] Determining inflection points between the source contour data points according to the gradient;
[0113] According to the inflection point, all the source contour data points are divided into regions to obtain a plurality of data point regions.
[0114] Optionally, in one embodiment, the fitting unit 505 is specifically used for:
[0115] For each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points;
[0116] Based on the gradient value, a fitting process is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0117] Optionally, in one embodiment, the fitting unit 505 is specifically used for:
[0118] Calculating interpolation coefficients based on the gradient value and for the source contour data points in the data point region;
[0119] Based on the interpolation coefficients, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
[0120] Optionally, in one embodiment, the fitting unit 505 is specifically used for:
[0121] For each of the source contour data points in each of the data point regions, calculating the upward gradient value and the downward gradient value of the source contour data points adjacent to the source contour data points;
[0122] According to the upward gradient value and the downward gradient value, the gradient value of the corresponding source contour data point is calculated.
[0123] Optionally, in one embodiment, the device further includes: a boundary processing unit, configured to:
[0124] According to the fitted contour data points, a first contour line is formed;
[0125] determining a boundary of the first contour line;
[0126] According to the boundary relationship between the first contour line and the input data point set, the first contour line is subjected to boundary processing to obtain a second contour line.
[0127] Optionally, in one embodiment, if the boundary of the first contour line is outside the boundary between the input data point sets or on the boundary between the input data point sets, the boundary of the first contour line is opened; if the boundary of the first contour line is within the boundary between the input data point sets, the boundary of the first contour line is closed.
[0128] The embodiments of the present application also provide a computer storage medium, on which a computer executable program is stored, and the computer executable program is executed to implement any method described in the embodiments of the present application.
[0129] Figure 6 Schematic diagram of the structure of the electronic device of the present application embodiment; Figure 6 As shown, the electronic device includes a memory 601 and a processor 602, the memory is used to store a computer executable program, and the processor is used to run the computer executable program to implement any method described in the embodiments of the present application.
[0130] The above-described embodiments are only specific implementation methods of the present application, which are used to illustrate the technical solutions of the present application, rather than to limit them. The protection scope of the present application is not limited thereto. Although the present application is described in detail with reference to the above-described embodiments, ordinary technicians in the field should understand that any technician familiar with the technical field can still modify the technical solutions recorded in the above-described embodiments within the technical scope disclosed in the present application, or can easily think of changes, or make equivalent replacements for some of the technical features therein; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application, and should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims
1. A method for generating fitting contour points, It is characterized in that include: Digitally process the target object to obtain a set of input data points for contour drawing, and draw a triangle network on the set of input data points; Finding required source contour data points based on a triangle network drawn on the input data set; Sorting the found source contour data points to determine the gradients of the source contour data points; According to the gradient, all the source contour data points are divided into regions to obtain a plurality of data point regions; Performing fitting processing on the source contour data points in each of the data point regions according to a set interpolation interval to obtain fitting contour data points; The step of performing fitting processing on the source contour data points in each data point area according to a set interpolation interval to obtain fitting contour data points includes: For each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points; Based on the gradient value, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points; Wherein, based on the gradient value, performing fitting processing on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points, including: Calculating interpolation coefficients based on the gradient value and for the source contour data points in the data point region; Based on the interpolation coefficients, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
2. The method according to claim 1, It is characterized in that The step of sorting the found source contour data points to determine the gradients of the source contour data points includes: The found source contour data points are sorted in ascending order of coordinate values to obtain a source contour data point sequence, and the gradient of the source contour data points is determined.
3. The method according to claim 1, It is characterized in that According to the gradient, all the source contour data points are divided into regions to obtain a plurality of data point regions, including: Determining inflection points between the source contour data points according to the gradient; According to the inflection point, all the source contour data points are divided into regions to obtain a plurality of data point regions.
4. The method according to claim 1, It is characterized in that The step of calculating the gradient value of each source contour data point in each data point region comprises: For each of the source contour data points in each of the data point regions, calculating the upward gradient value and the downward gradient value of the source contour data points adjacent to the source contour data points; According to the upward gradient value and the downward gradient value, the gradient value of the corresponding source contour data point is calculated.
5. The method according to any one of claims 1 to 4, It is characterized in that The method further comprises: According to the fitted contour data points, a first contour line is formed; determining a boundary of the first contour line; According to the boundary relationship between the first contour line and the input data point set, the first contour line is subjected to boundary processing to obtain a second contour line.
6. The method according to claim 5, It is characterized in that According to the boundary relationship between the first contour line and the input data point set, the first contour line is subjected to boundary processing to obtain a second contour line, including: if the boundary of the first contour line is outside the boundary between the input data point sets or is on the boundary between the input data point sets, the boundary of the first contour line is subjected to opening processing; if the boundary of the first contour line is within the boundary between the input data point sets, the boundary of the first contour line is subjected to closing processing.
7. A device for generating fitting contour points, It is characterized in that include: A drawing unit, used for digitally processing the target object to obtain a set of input data points for contour drawing, and drawing a triangle network on the set of input data points; A search unit, for searching required source contour data points based on a triangle network drawn on the input data set; A sorting unit, used for sorting the found source contour data points to determine the gradients of the source contour data points; A region division unit, used for performing region division on all the source contour data points according to the gradient to obtain a plurality of data point regions; A fitting unit, used for performing fitting processing on the source contour data points in each of the data point areas according to a set interpolation interval to obtain fitting contour data points; The step of performing fitting processing on the source contour data points in each data point area according to a set interpolation interval to obtain fitting contour data points includes: For each of the source contour data points in the data point area, calculating the gradient value of each of the source contour data points; Based on the gradient value, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points; Wherein, based on the gradient value, performing fitting processing on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points, including: Calculating interpolation coefficients based on the gradient value and for the source contour data points in the data point region; Based on the interpolation coefficients, fitting processing is performed on the source contour data points in the data point area according to a set interpolation interval to obtain fitting contour data points.
8. A computer storage medium, It is characterized in that The computer storage medium stores a computer executable program, and the computer executable program is executed to implement any one of the methods of claims 1-6.
9. An electronic device, It is characterized in that The electronic device comprises a memory and a processor, wherein the memory is used to store a computer executable program, and the processor is used to run the computer executable program to implement any one of the methods of claims 1-6.
Citation Information
Patent Citations
Stain detection method and device for camera module
CN106791804A