Brightness analysis method, display device and electronic device
By using peak screening and clustering technologies in display development, the brightness uniformity of the display screen is analyzed, and the problems of long data processing time and poor description effect are solved, achieving more efficient R&D progress.
Patent Information
- Application Number
- CN202310506632.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-08
- Publication Date
- 2024-11-08
AI Technical Summary
During the development of the display screen, the collected luminescence intensity data is processed for a long time and the amount of data manually screened is small, making it difficult to fully describe the intensity uniformity of luminescence points, which affects the progress of R&D.
The maximum luminous intensity value is selected from the luminous intensity matrix by searching for peak values, and combined through clustering, and intensity uniformity is analyzed according to the method of branching and columns to improve the data processing speed.
It effectively improves the processing speed of luminous intensity data, can more comprehensively describe the brightness uniformity of the display screen, and reduces R&D time.
Smart Images

Figure CN118915991A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of data analysis, and in particular to a brightness analysis method, a display device and an electronic device. Background Art
[0002] At present, in the process of display screen development, the uniformity of the intensity of the light points of the display screen is analyzed by collecting the luminous intensity data of the display screen.
[0003] During the processing of the collected luminous intensity data, due to the lack of tools and long data processing time, R&D personnel need to spend more time on data processing. In addition, the amount of luminous intensity data manually screened out is small, making it difficult to fully describe the uniform intensity of the luminous points, which seriously affects the progress of research and development. Summary of the invention
[0004] The present invention provides a brightness analysis method, a display device and an electronic device, which are used to find the maximum luminous intensity value of a luminous area by finding a peak value, merge them by clustering, and analyze the intensity uniformity in a row and column manner, thereby improving the processing speed of luminous intensity data.
[0005] In a first aspect, an embodiment of the present invention provides a brightness analysis method for a display screen, comprising:
[0006] Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0007] Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix;
[0008] Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0009] According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
[0010] The brightness analysis method provided in this embodiment first selects peak values from the intensity matrix, that is, finds the maximum luminous intensity value of the luminous area by finding the peak values, and then clusters the peak values in the row direction and the column direction in the intensity matrix respectively, and merges the peak values of different rows and columns by clustering. Finally, according to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively, so as to analyze the intensity uniformity by row and column, thereby improving the processing speed of the luminous intensity data.
[0011] As an optional implementation manner, screening out peak values from the intensity matrix includes:
[0012] From each value in the intensity matrix, a value greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values.
[0013] As an optional implementation manner, screening out peak values from the intensity matrix includes:
[0014] From the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak values;
[0015] From the values in each column of the intensity matrix, select values that are greater than or equal to the values adjacent to the values above and below the values as column peaks;
[0016] The value in the intensity matrix that is simultaneously the row peak value and the column peak value is determined as the peak value.
[0017] As an optional implementation, from the values of each row of the intensity matrix, a value greater than or equal to the values adjacent to the left and right of the row is selected as the row peak value, including:
[0018] The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix;
[0019] The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
[0020] As an optional implementation manner, the determining the row peak value includes:
[0021] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0022] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the left-shift matrix and the right-shift matrix are determined as the row peak values.
[0023] As an optional implementation manner, selecting values greater than or equal to upper and lower adjacent values from the values in each column of the intensity matrix as column peaks includes:
[0024] The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix;
[0025] The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
[0026] As an optional implementation manner, the determining the column peak value includes:
[0027] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0028] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the up-shift matrix and the values at the same position in the down-shift matrix are determined as the column peak values.
[0029] As an optional implementation manner, after filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction in the intensity matrix respectively, the method further includes:
[0030] Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix;
[0031] The peak value in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peak values in the submatrix, the maximum peak value is retained, and the peak values other than the maximum peak value are used as non-peak values to obtain the peak values screened again.
[0032] As an optional implementation manner, clustering the peaks in the row direction and the column direction in the intensity matrix respectively to obtain corresponding multiple row peak sets and multiple column peak sets includes:
[0033] determining row and column coordinates of the peak in the intensity matrix;
[0034] Clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets;
[0035] According to the column coordinates of the peaks, the peaks belonging to the same column are clustered to obtain a plurality of column peak sets.
[0036] As an optional implementation manner, obtaining the corresponding multiple row peak sets and multiple column peak sets includes:
[0037] The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix;
[0038] Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category;
[0039] The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
[0040] As an optional implementation manner, clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain multiple row peak sets includes:
[0041] Determine an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determine an even-numbered column matrix according to the even-numbered columns in the intensity matrix;
[0042] The peak values in the odd-numbered column matrix and the even-numbered column matrix are retained, and non-peak values are set to zero, and the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix are determined; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix;
[0043] The odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again to obtain a row peak value set.
[0044] As an optional implementation manner, clustering the odd-numbered row distribution data and the even-numbered row distribution data respectively, and clustering the clustered odd-numbered row distribution data and the even-numbered row distribution data again to obtain a row peak value set includes:
[0045] Arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix;
[0046] The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the corresponding intensity matrix is adjacent;
[0047] The odd-row distribution data corresponding to the odd-row coordinates in the current adjacent odd-row coordinates in the odd-row distribution data that are less than or equal to the mean of the odd-row coordinates are grouped into another category, and the even-row distribution data corresponding to the even-row coordinates in the next adjacent even-row coordinates in the even-row distribution data that are greater than the mean of the even-row coordinates are grouped into another category; wherein the mean of the even-row coordinates is obtained by averaging the adjacent even-row coordinates; the row coordinate order of the current adjacent odd-row coordinates and the next adjacent even-row coordinates in the corresponding intensity matrix is adjacent;
[0048] A row peak set is determined according to the peak values contained in the row distribution data that are clustered into one category.
[0049] As an optional implementation, it also includes:
[0050] When the number of rows where the row coordinates are grouped together is less than a set value, determining the row coordinate mean of the row coordinates grouped together, and correcting the number of rows where the row coordinates are grouped together according to the row coordinate mean; and / or,
[0051] When the number of columns where the column coordinates clustered into one category are located is less than a set value, a column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
[0052] In a second aspect, an embodiment of the present invention provides a display device, including a display screen and a processor, wherein the processor is configured to execute:
[0053] Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0054] Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix;
[0055] Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0056] According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
[0057] In a third aspect, an embodiment of the present invention provides an electronic device, including a processor and a memory, wherein the memory is used to store a program executable by the processor, and the processor is used to read the program in the memory and perform the following steps:
[0058] Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0059] Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix;
[0060] Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0061] According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
[0062] In a fourth aspect, an embodiment of the present invention further provides a brightness analysis device, the device comprising:
[0063] An intensity collection module is used to collect the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0064] A peak screening module, used for screening out a peak value from the intensity matrix, wherein the peak value is a value greater than an adjacent value of the peak value among the values in the intensity matrix;
[0065] A peak clustering module, used to cluster the peaks in the row direction and the column direction in the intensity matrix respectively, to obtain a corresponding plurality of row peak sets and a corresponding plurality of column peak sets;
[0066] The brightness analysis module is used to analyze the brightness uniformity displayed by the display screen in the row direction and the column direction according to the multiple row peak value sets and the multiple column peak value sets.
[0067] In a fifth aspect, an embodiment of the present invention further provides a computer storage medium on which a computer program is stored, and when the program is executed by a processor, it is used to implement the steps of the method described in the first aspect above.
[0068] These and other aspects of the present application will be more clearly understood in the description of the following embodiments. BRIEF DESCRIPTION OF THE DRAWINGS
[0069] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0070] Figure 1 A flow chart of a brightness analysis method provided by an embodiment of the present invention;
[0071] Figure 2 A schematic diagram of determining a row peak value provided by an embodiment of the present invention;
[0072] Figure 3 A schematic diagram of determining a column peak value provided by an embodiment of the present invention;
[0073] Figure 4 A schematic diagram of screening true peak values provided by an embodiment of the present invention;
[0074] Figure 5 A schematic diagram of coordinate distribution of a column peak provided by an embodiment of the present invention;
[0075] Figure 6 A recursive flow chart of an equal-step classification method provided by an embodiment of the present invention;
[0076] Figure 7 A schematic diagram of peak point distribution provided by an embodiment of the present invention;
[0077] Figure 8 A schematic diagram of a display device provided by an embodiment of the present invention;
[0078] Fig. 9 A schematic diagram of an electronic device provided by an embodiment of the present invention;
[0079] Fig.10 A schematic diagram of a brightness analysis device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0080] In order to make the purpose, technical scheme and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0081] At present, in the process of display screen development, the uniformity of the intensity of the light points of the display screen is analyzed by collecting the luminous intensity data of the display screen. In the process of processing the luminous intensity data collected by the CCD (Charge Coupled Device) camera, due to the lack of tools and the long data processing time, the R&D personnel need to spend a lot of time on data processing, and the amount of luminous intensity data manually screened is small, which makes it difficult to fully describe the uniformity of the intensity of the light points, which seriously affects the progress of research and development and causes a waste of time.
[0082] The brightness analysis method provided in this embodiment first selects peak values from the intensity matrix, that is, finds the maximum luminous intensity value of the luminous area by finding the peak values, and then clusters the peak values in the row direction and the column direction in the intensity matrix respectively, and merges the peak values of different rows and columns by clustering. Finally, according to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively, so as to analyze the intensity uniformity by row and column, thereby improving the processing speed of the luminous intensity data.
[0083] like Figure 1 As shown, this embodiment provides a brightness analysis method, and the implementation process of the method is as follows:
[0084] Step 100: collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0085] In some embodiments, the luminous intensity of the display screen can be collected by a CCD camera. Usually, the CCD camera converts the collected luminous intensity of the display screen into an intensity matrix output, where each numerical value in the intensity matrix represents a luminous intensity value, and the position of each numerical value in the intensity matrix is not one-to-one corresponding to the pixel position in the display screen. The number of numerical values in the intensity matrix is much larger than the number of pixels contained in the display screen.
[0086] Step 101, filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than its adjacent values among the values in the intensity matrix;
[0087] In some embodiments, from each value in the intensity matrix, a value that is greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonally adjacent values.
[0088] Optionally, this embodiment selects the peak value from the intensity matrix in any of the following ways:
[0089] Method (1) filters out 4 adjacent values that are greater than itself;
[0090] In implementation, from each value in the intensity matrix, a value greater than its own upper and lower adjacent values and left and right adjacent values is selected as the peak value;
[0091] Method (2) filters out 8 adjacent values that are greater than itself;
[0092] In implementation, from each value in the intensity matrix, a value that is greater than its own upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values is screened out as the peak value.
[0093] In some embodiments, peak values may be screened out from the intensity matrix by the following steps:
[0094] Step 1) from the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak value;
[0095] In some embodiments, the row peaks are filtered out by:
[0096] The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix;
[0097] The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
[0098] In implementation, the values of the intensity matrix that are greater than or equal to the values of the same position in the left-shift matrix, and the values of the intensity matrix that are greater than the values of the same position in the right-shift matrix are taken as row peaks. By comparing the intensity matrix with the left-shift matrix, a larger value greater than or equal to the adjacent right side is selected in the intensity matrix, and by comparing the intensity matrix with the right-shift matrix, a larger value greater than the adjacent left side is selected in the intensity matrix, and a value greater than both the adjacent right side and the left side is taken as a row peak.
[0099] In some embodiments, the row peak value is determined according to the comparison result in the following manner:
[0100] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0101] A value in the threshold matrix that is simultaneously greater than a value at the same position in the left-shift matrix and a value at the same position in the right-shift matrix is determined as the row peak value.
[0102] In implementation, the threshold matrix in this embodiment includes values in the intensity matrix that are greater than or equal to the intensity threshold, and values in the intensity matrix that are less than the intensity threshold can be set as the minimum value in the intensity matrix. The threshold matrix is used to filter out valid luminous intensity values from the intensity matrix, and then search and filter out row peaks from the valid luminous intensity values in the row direction, and filter out valid luminous intensity values that are greater than both the adjacent right side and the adjacent left side by comparing with the right shift matrix and the left shift matrix as the filtered row peaks.
[0103] Optionally, for the convenience of calculation, the peak screening process can be converted into a logical operation process between logical matrices, and the row peaks are screened from each row in the intensity matrix to finally obtain a row peak matrix. Optionally, the non-peak elements in the peak matrix in this embodiment are all set to 0, and the specific screening process is as follows:
[0104] In the first stage, the left shift matrix and the right shift matrix are determined.
[0105] In implementation, the intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix;
[0106] In the second stage, the logic matrix is determined for logical judgment.
[0107] In implementation, the left peak logic matrix is determined based on the comparison results of the values at the same position in the intensity matrix and the left shift matrix; the values at the same position in the intensity matrix that are greater than or equal to the left shift matrix are set to T, and the values at the same position in the intensity matrix that are less than the left shift matrix are set to F, to obtain the left peak logic matrix. The left peak logic matrix can be understood as a truth table, which is used to indicate which values at which positions in the intensity matrix are greater than or equal to the left shift matrix.
[0108] According to the comparison result of the values at the same position in the intensity matrix and the right shift matrix, the right peak logic matrix is determined; the values at the same position in the intensity matrix that are greater than or equal to the right shift matrix are set to T, and the values at the same position in the intensity matrix that are less than the right shift matrix are set to F, to obtain the right peak logic matrix. The right peak logic matrix can be understood as a truth table, which is used to indicate which values at which positions in the intensity matrix are greater than or equal to the right shift matrix.
[0109] According to the values in the intensity matrix that are greater than or equal to the intensity threshold, the threshold logic matrix is determined; the values in the intensity matrix that are greater than or equal to the intensity threshold are set to T, and the values in the intensity matrix that are less than the intensity threshold are set to F, to obtain the threshold logic matrix. The threshold logic matrix can be understood as a truth table, which is used to indicate which positions in the intensity matrix have values greater than or equal to the intensity threshold. The intensity threshold is used to indicate the minimum value of the effective luminous intensity.
[0110] In the third stage, the left peak logic matrix, the right peak logic matrix and the threshold logic matrix are ANDed to obtain the row peak logic matrix. The value T in the row peak logic matrix indicates that the value at this position is the row peak value, and the value F indicates that the value at this position is not the row peak value. Based on the row peak logic matrix, the row peak value of each row in the intensity matrix can be determined.
[0111] like Figure 2 As shown, this embodiment provides a schematic diagram of determining a row peak value. It should be noted that: Figure 2 The intensity matrix shown in is only a simple example of this embodiment, and the data in the intensity matrix is not authentic. In implementation, the intensity matrix is shifted to the left to obtain a left-shift matrix, the intensity matrix is shifted to the right to obtain a right-shift matrix, the values at the same position in the intensity matrix and the left-shift matrix are compared to obtain a left-peak logic matrix, the values at the same position in the intensity matrix and the right-shift matrix are compared to obtain a right-peak logic matrix, the intensity matrix is compared with the intensity threshold to obtain a threshold logic matrix, and the left-peak logic matrix, the right-peak logic matrix and the threshold logic matrix are ANDed to obtain a row-peak logic matrix, and the peak points of the intensity matrix in the row direction are obtained.
[0112] The process of performing logical operations on the row peak values through the logic matrix can also be expressed by a formula. The specific calculation process of the row peak values in this embodiment is as follows:
[0113] I l =I,I l [:,0:n-1]=I[:,1:n] Formula (1);
[0114] Where I represents the intensity matrix, n represents the number of columns, and I l It means to shift the matrix left, and “=” means assignment.
[0115] I r =I,I r [:,1:n]=I[:,0:n-1] Formula (2);
[0116] Where I represents the intensity matrix, n represents the number of columns, and I r Indicates right shift of the matrix, and “=” indicates assignment.
[0117] L l =I≥I l Formula (3);
[0118] Where I represents the intensity matrix, I l Represents the left shift matrix, L l Represents a left-peaked logical matrix.
[0119] L r =I≥I r Formula (4);
[0120] Where I represents the intensity matrix, I r Represents the right shift matrix, L r Represents a right-peaked logical matrix.
[0121] L t =I≥t formula (5);
[0122] Where I represents the intensity matrix, t represents the intensity threshold, and L t represents the threshold logic matrix;
[0123] P r =L l and L r and L t Formula (6);
[0124] Among them, P r Represents the row peak logic matrix, L l represents the left-peaked logical matrix, L r represents the right-peaked logical matrix, L t Represents a threshold logical matrix.
[0125] Step 2) from the values of each column of the intensity matrix, select the values that are greater than or equal to the upper and lower adjacent values of the intensity matrix as the column peak value;
[0126] In some embodiments, the column peaks are filtered out by:
[0127] The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix;
[0128] The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
[0129] In implementation, the values of the intensity matrix that are greater than or equal to the values of the same position in the upward matrix, and the values of the intensity matrix that are greater than or equal to the values of the same position in the downward matrix are taken as column peaks. By comparing the intensity matrix with the upward matrix, a larger value greater than the adjacent lower side is selected in the intensity matrix, and by comparing the intensity matrix with the downward matrix, a larger value greater than or equal to the adjacent upper side is selected in the intensity matrix, and the values greater than or equal to both the adjacent lower side and the upper side are taken as column peaks.
[0130] In some embodiments, the column peak value is determined according to the comparison result by:
[0131] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0132] The value in the threshold matrix that is simultaneously greater than the value at the same position in the up-shift matrix and the value at the same position in the down-shift matrix is determined as the column peak value.
[0133] In implementation, the threshold matrix in this embodiment includes values in the intensity matrix that are greater than or equal to the intensity threshold, and values in the intensity matrix that are less than the intensity threshold can be set as the minimum value in the intensity matrix. The threshold matrix is used to filter out valid luminous intensity values from the intensity matrix, and then search and filter out column peaks from the valid luminous intensity values in the column direction, and filter out valid luminous intensity values that are greater than or equal to the adjacent lower side and the adjacent upper side by comparing with the up-shift matrix and the down-shift matrix as the filtered column peaks.
[0134] Optionally, for the convenience of calculation, the peak screening process can be converted into a logical operation process between logical matrices, and the column peaks are screened out from each column in the intensity matrix, and finally a column peak matrix is obtained. The specific screening process is as follows:
[0135] In the first stage, the up-shift matrix and the down-shift matrix are determined.
[0136] In implementation, the intensity matrix is respectively moved up and down to obtain a corresponding up-shift matrix and a down-shift matrix;
[0137] In the second stage, the logic matrix is determined for logical judgment.
[0138] In implementation, the upper peak logic matrix is determined according to the comparison result of the values at the same position in the intensity matrix and the upward shift matrix; the values at the same position in the intensity matrix that are greater than or equal to the upward shift matrix are set to T, and the values at the same position in the intensity matrix that are less than the upward shift matrix are set to F, to obtain the upper peak logic matrix. The upper peak logic matrix can be understood as a truth table, which is used to indicate which values at which positions in the intensity matrix are greater than or equal to the upward shift matrix.
[0139] According to the comparison result of the values at the same position in the intensity matrix and the down-shift matrix, the down-peak logic matrix is determined; the values at the same position in the intensity matrix that are greater than or equal to the down-shift matrix are set to T, and the values at the same position in the intensity matrix that are less than the down-shift matrix are set to F, to obtain the down-peak logic matrix. The down-peak logic matrix can be understood as a truth table, which is used to indicate which values at which positions in the intensity matrix are greater than or equal to the down-shift matrix.
[0140] According to the values in the intensity matrix that are greater than or equal to the intensity threshold, the threshold logic matrix is determined; the values in the intensity matrix that are greater than or equal to the intensity threshold are set to T, and the values in the intensity matrix that are less than the intensity threshold are set to F, to obtain the threshold logic matrix. The threshold logic matrix can be understood as a truth table, which is used to indicate which positions in the intensity matrix have values greater than or equal to the intensity threshold. The intensity threshold is used to indicate the minimum value of the effective luminous intensity.
[0141] In the third stage, the upper peak logic matrix, the lower peak logic matrix and the threshold logic matrix are ANDed to obtain the column peak logic matrix. The value T in the column peak logic matrix indicates that the value at this position is the column peak value, and the value F indicates that the value at this position is not the column peak value. Based on the column peak logic matrix, the column peak value of each column in the intensity matrix can be determined.
[0142] like Figure 3 As shown, this embodiment provides a schematic diagram of determining a column peak value. It should be noted that: Figure 2 The intensity matrix shown in is only a simple example of this embodiment, and the data in the intensity matrix is not authentic. In implementation, the intensity matrix is shifted up to obtain an upward matrix, the intensity matrix is shifted down to obtain a downward matrix, the values of the same position in the intensity matrix and the upward matrix are compared to obtain an upper peak logic matrix, the values of the same position in the intensity matrix and the downward matrix are compared to obtain a lower peak logic matrix, the intensity matrix is compared with the intensity threshold to obtain a threshold logic matrix, and an AND operation is performed on the upper peak logic matrix, the lower peak logic matrix and the threshold logic matrix to obtain a column peak logic matrix, and the peak points of the intensity matrix in the column direction are obtained.
[0143] The process of performing logical operations on the column peak values through the logic matrix can also be expressed by a formula. The specific calculation process of the column peak values in this embodiment is as follows:
[0144] I u =I,I u [0:m-1,:] = I[1:m,:] Formula (7);
[0145] Where I represents the intensity matrix, m represents the number of rows, and I u Indicates moving up the matrix, and “=” indicates assignment.
[0146] I d =I,I d [1:m,:]=I[ 0:m-1,:] Formula (8);
[0147] Where I represents the intensity matrix, m represents the number of rows, and I d Indicates moving down the matrix, and “=” indicates assignment.
[0148] L u =I≥I u Formula (9);
[0149] Where I represents the intensity matrix, I u represents the upward shift matrix, L u Represents the upper peak logic matrix.
[0150] L d =I≥I d Formula (10);
[0151] Where I represents the intensity matrix, I d represents the downshift matrix, L d Represents the lower peak logic matrix.
[0152] L t =I≥t formula (11);
[0153] Where I represents the intensity matrix, t represents the intensity threshold, and L t represents the threshold logic matrix;
[0154] P c =L u and L d and L t Formula (12);
[0155] Among them, P c represents the column peak logic matrix, L u represents the upper peak logic matrix, L d represents the lower peak logic matrix, L t Represents a threshold logical matrix.
[0156] Step 3) Determine the value in the intensity matrix that is both the row peak value and the column peak value as the peak value.
[0157] During implementation, the row peak logic matrix and the column peak logic matrix obtained in the above steps can be ANDed to obtain a peak logic matrix. The value T in the peak logic matrix indicates that the value of the intensity matrix at this position is the peak value, that is, according to the position of the value T in the peak logic matrix, the position of the peak in the intensity matrix is determined, thereby obtaining the peak in the intensity matrix.
[0158] In some embodiments, after filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction of the intensity matrix respectively, the following steps are further performed:
[0159] Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix;
[0160] Since the peak values of the intensity matrix are peak points in both the row and column directions, the peak points in the two-dimensional direction, i.e., the peak matrix, can be obtained by performing an "AND" operation using the row peak logic matrix and the column peak logic matrix. Since the peak points in the peak matrix may be very close to each other, it is necessary to process adjacent or similar peak points to obtain the true peak value. In implementation, a sub-matrix of a preset size can be used, with each peak value in the peak matrix as the center, and the maximum peak value can be screened within the range of the sub-matrix of the preset size to finally obtain the true peak point.
[0161] The peak value in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peak values in the submatrix, the maximum peak value is retained, and the peak values other than the maximum peak value are used as non-peak values to obtain peak values screened again. The non-peak values may be set to 0.
[0162] In implementation, the peak values can be screened again using the peak value matrix, i.e., the peak value logic matrix, such as Figure 4 As shown, the present embodiment provides a schematic diagram for screening true peaks, firstly, a row peak logic matrix and a column peak logic matrix are used to perform an AND operation to obtain a peak logic matrix, wherein a sub-matrix of a preset size is used to search with each peak in the peak logic matrix as a center point, and when multiple peaks are searched in the sub-matrix, the maximum peak is retained, and the maximum peak is still set to T, and the peaks other than the maximum peak are set to F as non-peaks, and when the search is completed, a screened peak logic matrix is obtained, and according to T in the screened peak logic matrix, the value corresponding to the intensity matrix at the T position is determined to be the true peak screened again.
[0163] In practice, the process of screening the true peak value in this embodiment can also be expressed by a formula, as shown below:
[0164] P2=P r and P c Formula (13);
[0165] Among them, P2 represents the peak logic matrix, P r represents the row peak logic matrix, P c Represents a column-peak logical matrix.
[0166] I[P2!=True]=0 Formula (14);
[0167] Formula (14) is used to indicate that the luminous intensity value of the non-peak point corresponding to the F position in the peak logic matrix is assigned to 0. Among them, T (True) in the peak logic matrix represented by P2 represents true and also represents the peak point. I represents the intensity matrix.
[0168] PL i =(x i ,y i ) formula (15);
[0169] where x i ,y i Satisfies P2[x i ,y i ]==T;PL i An array of pairs representing positions in the matrix. i Used to record the horizontal and vertical coordinate indices of all logical values of True(T) in the peak matrix.
[0170] P 2i = I[x i -dist:x i +dist,y i -dist:y i +dist] formula (16);
[0171] where x i =PL i [0],y i =PL i [1]; dist represents the half length of the submatrix required to screen the true peak, I represents the intensity matrix, P 2i Represents the submatrix corresponding to the i-th peak in the peak matrix.
[0172] PR i = max (P2 i ) formula (17);
[0173] Among them, PRi Indicates the maximum peak value contained in the submatrix corresponding to the i-th peak.
[0174] I[x i -dist:x i +dist,y i -dist:y i +dist]=0 Formula (18);
[0175] I[x i ,y i ]= PR i Formula (19);
[0176] PF=where(I!=0) formula (20);
[0177] Among them, PF represents the coordinates of the peak point finally screened in the intensity matrix; PF represents the position information (coordinates) of the real peak in the intensity matrix obtained by screening the peak logic matrix.
[0178] like Figure 5 As shown, this embodiment provides a schematic diagram of the coordinate distribution of a column peak value. Since in the process of analyzing the luminous uniformity, it is necessary to clearly know the index of the row and column where the peak value is located, it is necessary to identify the row and column where the luminous point is located. Figure 5 The main characteristics of the column coordinate distribution are given. As the number of luminous points increases, in the collected luminous intensity data, when the rows and columns are basically parallel to the axis, the column index has obvious clustering characteristics. It should be noted that the data in the coordinate distribution diagram of the column peak does not represent the real data, but is only an example. The coordinate distribution of the row peak and the coordinate distribution of the column peak both have clustering characteristics.
[0179] Step 102: clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0180] Step 103: Analyze the brightness uniformity displayed by the display screen in the row direction and the column direction respectively according to the multiple row peak value sets and the multiple column peak value sets.
[0181] In some embodiments, the present embodiment performs clustering in the column direction and the row direction in the following manner:
[0182] Determine the row coordinates and column coordinates of the peak in the intensity matrix; cluster the peaks belonging to the same row according to the row coordinates of the peak to obtain multiple row peak sets; cluster the peaks belonging to the same column according to the column coordinates of the peak to obtain multiple column peak sets.
[0183] In some embodiments, this embodiment specifically performs clustering in the column direction and the row direction in the following manner:
[0184] determining row and column coordinates of the peak in the intensity matrix;
[0185] The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix;
[0186] Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category;
[0187] The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
[0188] Optionally, in this embodiment, the row distribution data and the column distribution data can be clustered separately by using an equal step size classification method. The idea of the equal step size classification method is briefly described below:
[0189] In implementation, for example Figure 5 As an example, we cluster the columns by using the matrix of the first peak point. The matrix is labeled 0. Assuming the step size is 2, the matrix of the next peak point is labeled 1, which is contained in the region of [0, 0+2]. Therefore, 1 and 0 are classified into one category. At this time, the category range becomes [0, 1+2], that is, [0, 3]. The matrix of the peak point after 1 is labeled 6, and 6 is not in the range of [0, 3]. Therefore, 6 is assigned to the second category area [6, 6+2]. By analogy, the matrix labels of the peak points can be classified in one operation. Figure 5 The cluster within the dashed box contains the peak points whose matrix numbers are [23, 24, 25]. The main problem to be solved by equal-step classification is how to correctly assign the peak points to the correct row and column numbers. Figure 5 As shown in the figure, based on the distribution of the matrix labels of the peak points in the column direction, equal step size classification is to classify Figure 5 The column labels in are clustered, that is, 0 and 1 can be classified into one category; 6, 7, and 8 can be classified into one category; 13 and 14 can be classified into one category; and 23, 24, and 25 can be classified into one category.
[0190] The recursive process of the equal-step classification method is as follows Figure 6 As shown, input data ClassData (storing the array of the current belonging class), Odata (array of original data), Dist (fixed step size 2). Among them, the coordinate information contained in the row peak set or column peak set in this embodiment is used as Odata, ClassData is used as the initial class, and the IsClassify function is used as a recursive function to cluster the peaks in the row peak set or column peak set. When the data in Odata exists in data i n If the distance from any data in ClassData is less than Dist, then data i n Append to ClassData and delete i in Odata n , and further use IsClassify to operate ClassData, Odata, Dist; otherwise, it ends. An additional loop layer is added to classify all Odata. And the indexes belonging to the same category are assigned to the same column value (the nearest integer of the mean is used, then sorted, and the column number to which the integer belongs is named).
[0191] In some embodiments, this embodiment also provides any one or more of the following clustering methods:
[0192] Method 1) Cluster the row distribution data in the following way:
[0193] The row distribution data corresponding to the row coordinates greater than the row coordinate mean in the current adjacent row coordinates are clustered into one category, and the row distribution data corresponding to the row coordinates less than or equal to the row coordinate mean in the previous adjacent row coordinates are clustered into one category; the row distribution data corresponding to the row coordinates less than or equal to the row coordinate mean are clustered into another category, and the row distribution data corresponding to the row coordinates greater than the row coordinate mean in the next adjacent row coordinates are clustered into another category; the row coordinate mean is obtained by averaging the adjacent row coordinates.
[0194] Method 2) Cluster the column distribution data in the following way:
[0195] The column distribution data corresponding to the column coordinates in the current adjacent column coordinates that are greater than the column coordinate mean are clustered into one category, and the column distribution data corresponding to the column coordinates in the previous adjacent column coordinates that are less than or equal to the column coordinate mean are clustered into one category; the column distribution data corresponding to the column coordinates that are less than or equal to the column coordinate mean are clustered into another category, and the column distribution data corresponding to the column coordinates in the next adjacent column coordinates that are greater than the column coordinate mean are clustered into another category; the column coordinate mean is obtained by averaging the adjacent column coordinates.
[0196] In practice, in order to avoid the two most adjacent rows being classified into the same category during the clustering process, rows with values greater than the mean are marked as integer rows with the mean plus one, and rows with values less than the mean are marked as integer rows with the mean minus one.
[0197] In some embodiments, this embodiment can also be implemented through the following steps when clustering row peaks:
[0198] Step 1) determining an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determining an even-numbered column matrix according to the even-numbered columns in the intensity matrix;
[0199] Step 2) retaining the peak values in the odd-numbered column matrix and the even-numbered column matrix, setting the non-peak values to zero, and determining the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix, and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix;
[0200] Step 3) clustering the odd-numbered row distribution data and the even-numbered row distribution data respectively, and clustering the clustered odd-numbered row distribution data and the even-numbered row distribution data again to obtain a row peak value set.
[0201] Optionally, when the arrangement density of the peak points in the row direction is much higher than that in the column direction due to special design, it is difficult to distinguish the two most adjacent rows of luminous points using the equal step size classification method, and it is even easy to make the four adjacent rows of luminous points indistinguishable. Therefore, the peak data can be split into two categories, odd and even columns, that is, the peak matrix can be split into odd column matrix and even column matrix; then, the peak points in the row direction are clustered for the odd column matrix and the even column matrix respectively; finally, the clustering results of the odd column matrix and the even column matrix are combined to determine the final row peak clustering results. Figure 7 As shown, this embodiment provides a peak point distribution schematic diagram, wherein "1" represents a peak point (luminous point). Since the peak points distributed in adjacent rows are difficult to distinguish, they can be split into odd columns and even columns, and then the peak points in the row direction are clustered separately.
[0202] In some embodiments, the odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again by the following steps:
[0203] Step 3a) arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix;
[0204] Step 3b) The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; and the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the respective corresponding intensity matrices is adjacent;
[0205] Step 3c) The odd row distribution data corresponding to the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data that are less than or equal to the mean of the odd row coordinates are grouped into another category, and the even row distribution data corresponding to the even row coordinates in the next adjacent even row coordinates in the even row distribution data that are greater than the mean of the even row coordinates are grouped into another category; wherein the mean of the even row coordinates is obtained by averaging the adjacent even row coordinates; and the row coordinate order of the current adjacent odd row coordinates and the next adjacent even row coordinates in their respective corresponding intensity matrices is adjacent.
[0206] Step 3d) Determine a row peak value set based on the peak values included in the row distribution data that are clustered into one category. Optionally, the row peak value set and the column peak value set in this embodiment both include position information, i.e., coordinate information and peak value information. For example, the row peak value set includes the row coordinates and the peak values corresponding to the row coordinates, and the column peak value set includes the column coordinates and the peak values corresponding to the column coordinates.
[0207] In some embodiments, this embodiment also provides any one or more of the following correction methods:
[0208] Method a) when the number of rows where the row coordinates clustered into one category are located is less than a set value, determining the row coordinate mean of the row coordinates clustered into one category, and correcting the number of rows where the row coordinates are located according to the row coordinate mean;
[0209] Mode b) When the number of columns where the column coordinates clustered into one category are located is less than a set value, the column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
[0210] In implementation, when the range to be classified is smaller than a set value, the integer rows assigned as the mean are classified into one row.
[0211] Based on the same inventive concept, an embodiment of the present invention further provides a display device. Since the display device is the display device in the method in the embodiment of the present invention, and the principle of solving the problem by the display device is similar to that of the method, the implementation of the display device can refer to the implementation of the method, and the repeated parts will not be repeated.
[0212] like Figure 8As shown, the display device includes a display screen 800 and a processor 801, and the processor 801 is configured to execute:
[0213] Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0214] Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix;
[0215] Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0216] According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
[0217] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0218] From each value in the intensity matrix, a value greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values.
[0219] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0220] From the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak values;
[0221] From the values in each column of the intensity matrix, select values that are greater than or equal to the values adjacent to the values above and below the values as column peaks;
[0222] The value in the intensity matrix that is simultaneously the row peak value and the column peak value is determined as the peak value.
[0223] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0224] The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix;
[0225] The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
[0226] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0227] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0228] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the left-shift matrix and the right-shift matrix are determined as the row peak values.
[0229] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0230] The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix;
[0231] The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
[0232] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0233] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0234] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the up-shift matrix and the values at the same position in the down-shift matrix are determined as the column peak values.
[0235] As an optional implementation manner, after filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction in the intensity matrix respectively, the processor 801 is further configured to execute:
[0236] Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix;
[0237] The peak value in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peak values in the submatrix, the maximum peak value is retained, and the peak values other than the maximum peak value are used as non-peak values to obtain the peak values screened again.
[0238] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0239] determining row and column coordinates of the peak in the intensity matrix;
[0240] Clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets;
[0241] According to the column coordinates of the peaks, the peaks belonging to the same column are clustered to obtain a plurality of column peak sets.
[0242] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0243] The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix;
[0244] Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category;
[0245] The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
[0246] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0247] Determine an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determine an even-numbered column matrix according to the even-numbered columns in the intensity matrix;
[0248] The peak values in the odd-numbered column matrix and the even-numbered column matrix are retained, and non-peak values are set to zero, and the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix are determined; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix;
[0249] The odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again to obtain a row peak value set.
[0250] As an optional implementation manner, the processor 801 is specifically configured to execute:
[0251] Arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix;
[0252] The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the corresponding intensity matrix is adjacent;
[0253] The odd-row distribution data corresponding to the odd-row coordinates in the current adjacent odd-row coordinates in the odd-row distribution data that are less than or equal to the mean of the odd-row coordinates are grouped into another category, and the even-row distribution data corresponding to the even-row coordinates in the next adjacent even-row coordinates in the even-row distribution data that are greater than the mean of the even-row coordinates are grouped into another category; wherein the mean of the even-row coordinates is obtained by averaging the adjacent even-row coordinates; the row coordinate order of the current adjacent odd-row coordinates and the next adjacent even-row coordinates in the corresponding intensity matrix is adjacent;
[0254] A row peak set is determined according to the peak values contained in the row distribution data that are clustered into one category.
[0255] As an optional implementation manner, the processor 801 is further configured to execute:
[0256] When the number of rows where the row coordinates are grouped together is less than a set value, determining the row coordinate mean of the row coordinates grouped together, and correcting the number of rows where the row coordinates are grouped together according to the row coordinate mean; and / or,
[0257] When the number of columns where the column coordinates clustered into one category are located is less than a set value, a column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
[0258] Based on the same inventive concept, an embodiment of the present invention further provides an electronic device. Since the electronic device is the electronic device in the method in the embodiment of the present invention, and the principle of solving the problem by the electronic device is similar to that of the method, the implementation of the electronic device can refer to the implementation of the method, and the repeated parts will not be repeated.
[0259] like Fig. 9 As shown, the electronic device includes a processor 900 and a memory 901, wherein the memory 901 is used to store a program executable by the processor 900, and the processor 900 is used to read the program in the memory 901 and perform the following steps:
[0260] Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0261] Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix;
[0262] Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets;
[0263] According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
[0264] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0265] From each value in the intensity matrix, a value greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values.
[0266] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0267] From the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak values;
[0268] From the values in each column of the intensity matrix, select values that are greater than or equal to the values adjacent to the values above and below the values as column peaks;
[0269] The value in the intensity matrix that is simultaneously the row peak value and the column peak value is determined as the peak value.
[0270] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0271] The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix;
[0272] The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
[0273] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0274] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0275] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the left-shift matrix and the right-shift matrix are determined as the row peak values.
[0276] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0277] The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix;
[0278] The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
[0279] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0280] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0281] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the up-shift matrix and the values at the same position in the down-shift matrix are determined as the column peak values.
[0282] As an optional implementation manner, after filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction in the intensity matrix respectively, the processor 900 is further configured to execute:
[0283] Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix;
[0284] The peak value in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peak values in the submatrix, the maximum peak value is retained, and the peak values other than the maximum peak value are used as non-peak values to obtain the peak values screened again.
[0285] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0286] determining row and column coordinates of the peak in the intensity matrix;
[0287] Clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets;
[0288] According to the column coordinates of the peaks, the peaks belonging to the same column are clustered to obtain a plurality of column peak sets.
[0289] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0290] The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix;
[0291] Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category;
[0292] The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
[0293] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0294] Determine an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determine an even-numbered column matrix according to the even-numbered columns in the intensity matrix;
[0295] The peak values in the odd-numbered column matrix and the even-numbered column matrix are retained, and non-peak values are set to zero, and the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix are determined; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix;
[0296] The odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again to obtain a row peak value set.
[0297] As an optional implementation manner, the processor 900 is specifically configured to execute:
[0298] Arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix;
[0299] The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the corresponding intensity matrix is adjacent;
[0300] The odd-row distribution data corresponding to the odd-row coordinates in the current adjacent odd-row coordinates in the odd-row distribution data that are less than or equal to the mean of the odd-row coordinates are grouped into another category, and the even-row distribution data corresponding to the even-row coordinates in the next adjacent even-row coordinates in the even-row distribution data that are greater than the mean of the even-row coordinates are grouped into another category; wherein the mean of the even-row coordinates is obtained by averaging the adjacent even-row coordinates; the row coordinate order of the current adjacent odd-row coordinates and the next adjacent even-row coordinates in the corresponding intensity matrix is adjacent;
[0301] A row peak set is determined according to the peak values contained in the row distribution data that are clustered into one category.
[0302] As an optional implementation manner, the processor 900 is further configured to execute:
[0303] When the number of rows where the row coordinates are grouped together is less than a set value, determining the row coordinate mean of the row coordinates grouped together, and correcting the number of rows where the row coordinates are grouped together according to the row coordinate mean; and / or,
[0304] When the number of columns where the column coordinates clustered into one category are located is less than a set value, a column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
[0305] Based on the same inventive concept, an embodiment of the present invention further provides a brightness analysis device. Since the device is the device in the method in the embodiment of the present invention, and the principle of solving the problem by the device is similar to that of the method, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be repeated.
[0306] like Fig.10 As shown, the device comprises:
[0307] The intensity collection module 1000 is used to collect the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen;
[0308] A peak screening module 1001 is used to screen out a peak value from the intensity matrix, wherein the peak value is a value greater than its adjacent values among the values in the intensity matrix;
[0309] A peak clustering module 1002 is used to cluster the peaks in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak sets and a corresponding plurality of column peak sets;
[0310] The brightness analysis module 1003 is used to analyze the brightness uniformity displayed by the display screen in the row direction and the column direction according to the multiple row peak value sets and the multiple column peak value sets.
[0311] As an optional implementation, the peak screening module 1001 is specifically used for:
[0312] From each value in the intensity matrix, a value greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values.
[0313] As an optional implementation, the peak screening module 1001 is specifically used for:
[0314] From the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak values;
[0315] From the values in each column of the intensity matrix, select values that are greater than or equal to the values adjacent to the values above and below the values as column peaks;
[0316] The value in the intensity matrix that is simultaneously the row peak value and the column peak value is determined as the peak value.
[0317] As an optional implementation, the peak screening module 1001 is specifically used for:
[0318] The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix;
[0319] The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
[0320] As an optional implementation, the peak screening module 1001 is specifically used for:
[0321] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0322] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the left-shift matrix and the right-shift matrix are determined as the row peak values.
[0323] As an optional implementation, the peak screening module 1001 is specifically used for:
[0324] The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix;
[0325] The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
[0326] As an optional implementation, the peak screening module 1001 is specifically used for:
[0327] Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold;
[0328] The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the up-shift matrix and the values at the same position in the down-shift matrix are determined as the column peak values.
[0329] As an optional implementation manner, after filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction in the intensity matrix respectively, a re-screening module is further included for:
[0330] Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix;
[0331] The peak value in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peak values in the submatrix, the maximum peak value is retained, and the peak values other than the maximum peak value are used as non-peak values to obtain the peak values screened again.
[0332] As an optional implementation, the peak clustering module 1002 is specifically used for:
[0333] determining row and column coordinates of the peak in the intensity matrix;
[0334] Clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets;
[0335] According to the column coordinates of the peaks, the peaks belonging to the same column are clustered to obtain a plurality of column peak sets.
[0336] As an optional implementation, the peak clustering module 1002 is specifically used for:
[0337] The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix;
[0338] Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category;
[0339] The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
[0340] As an optional implementation, the peak clustering module 1002 is specifically used for:
[0341] Determine an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determine an even-numbered column matrix according to the even-numbered columns in the intensity matrix;
[0342] The peak values in the odd-numbered column matrix and the even-numbered column matrix are retained, and non-peak values are set to zero, and the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix are determined; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix;
[0343] The odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again to obtain a row peak value set.
[0344] As an optional implementation, the peak clustering module 1002 is specifically used for:
[0345] Arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix;
[0346] The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the corresponding intensity matrix is adjacent;
[0347] The odd-row distribution data corresponding to the odd-row coordinates in the current adjacent odd-row coordinates in the odd-row distribution data that are less than or equal to the mean of the odd-row coordinates are grouped into another category, and the even-row distribution data corresponding to the even-row coordinates in the next adjacent even-row coordinates in the even-row distribution data that are greater than the mean of the even-row coordinates are grouped into another category; wherein the mean of the even-row coordinates is obtained by averaging the adjacent even-row coordinates; the row coordinate order of the current adjacent odd-row coordinates and the next adjacent even-row coordinates in the corresponding intensity matrix is adjacent;
[0348] A row peak set is determined according to the peak values contained in the row distribution data that are clustered into one category.
[0349] As an optional implementation, a correction module is further included for:
[0350] When the number of rows where the row coordinates are grouped together is less than a set value, determining the row coordinate mean of the row coordinates grouped together, and correcting the number of rows where the row coordinates are grouped together according to the row coordinate mean; and / or,
[0351] When the number of columns where the column coordinates clustered into one category are located is less than a set value, a column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
[0352] Based on the same inventive concept, an embodiment of the present disclosure provides a computer storage medium, the computer storage medium comprising: a computer program code, when the computer program code is executed on a computer, the computer executes any brightness analysis method as discussed above. Since the principle of solving the problem by the above computer storage medium is similar to that of the brightness analysis method, the implementation of the above computer storage medium can refer to the implementation of the method, and the repeated parts will not be repeated.
[0353] In the specific implementation process, the computer storage medium may include: Universal Serial Bus Flash Drive (USB), mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, and other storage media that can store program codes.
[0354] Based on the same inventive concept, the embodiment of the present disclosure also provides a computer program product, which includes: computer program code, when the computer program code is run on a computer, the computer executes any brightness analysis method as discussed above. Since the principle of solving the problem by the above computer program product is similar to that of the brightness analysis method, the implementation of the above computer program product can refer to the implementation of the method, and the repeated parts will not be repeated.
[0355] The computer program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination thereof. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more conductors, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.
[0356] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) containing computer-usable program code.
[0357] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that has the functions specified in one or more boxes.
[0358] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0359] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0360] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.
Claims
1. A brightness analysis method, characterized in that: The method includes: Collecting the luminous intensity of the display screen to obtain an intensity matrix, wherein each value in the intensity matrix represents the luminous intensity value at different positions in the display screen; Filtering out a peak value from the intensity matrix, wherein the peak value is a value greater than adjacent values of the peak value among the values in the intensity matrix; Clustering the peak values in the row direction and the column direction in the intensity matrix respectively to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets; According to the multiple row peak value sets and the multiple column peak value sets, the brightness uniformity displayed by the display screen in the row direction and the column direction is analyzed respectively.
2. The method according to claim 1, characterized in that The step of screening out peak values from the intensity matrix comprises: From each value in the intensity matrix, a value greater than its adjacent value is selected as the peak value; wherein the adjacent values include at least one of upper and lower adjacent values, left and right adjacent values, and diagonal adjacent values.
3. The method according to claim 1, characterized in that The step of screening out peak values from the intensity matrix comprises: From the values of each row of the intensity matrix, select the values that are greater than or equal to the values adjacent to the left and right of the row as the row peak values; From the values in each column of the intensity matrix, select values that are greater than or equal to the values adjacent to the values above and below the values as column peaks; The value in the intensity matrix that is simultaneously the row peak value and the column peak value is determined as the peak value.
4. The method according to claim 3, characterized in that From the values of each row of the intensity matrix, the values that are greater than or equal to the values adjacent to the left and right of the row are selected as row peaks, including: The intensity matrix is respectively shifted left and right to obtain corresponding left-shifted matrix and right-shifted matrix, wherein the last column of the left-shifted matrix is obtained by padding based on the last column of the intensity matrix, and the first column of the right-shifted matrix is obtained by padding based on the first column of the intensity matrix; The row peak is determined according to a comparison result of the values at the same position in the intensity matrix and the left-shift matrix, and a comparison result of the values at the same position in the intensity matrix and the right-shift matrix.
5. The method according to claim 4, characterized in that The determining of the row peak value comprises: Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold; The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the left-shift matrix and the right-shift matrix are determined as the row peak values.
6. The method according to claim 2, characterized in that The step of selecting, from the values of each column of the intensity matrix, values that are greater than or equal to the values adjacent to the values above and below the values as column peaks includes: The intensity matrix is respectively shifted up and down to obtain a corresponding up-shift matrix and a down-shift matrix, wherein the last row of the up-shift matrix is obtained by padding based on the last row of the intensity matrix, and the first row of the down-shift matrix is obtained by padding based on the first row of the intensity matrix; The column peak is determined according to a comparison result of the values at the same position in the intensity matrix and the upward-shifted matrix, and a comparison result of the values at the same position in the intensity matrix and the downward-shifted matrix.
7. The method according to claim 6, characterized in that The determining of the column peak value comprises: Determining a threshold matrix according to values in the intensity matrix that are greater than or equal to the intensity threshold; The values in the threshold matrix that are simultaneously greater than or equal to the values at the same position in the up-shift matrix and the values at the same position in the down-shift matrix are determined as the column peak values.
8. The method according to any one of claims 1 to 7, characterized in that: After filtering out the peak values from the intensity matrix and before clustering the peak values in the row direction and the column direction of the intensity matrix respectively, the method further includes: Determine a peak matrix according to the positions of the screened peaks in the intensity matrix, wherein the peak matrix has the same size as the intensity matrix; The peak in the peak matrix is used as the center of a submatrix of a preset size. When there are multiple peaks in the submatrix, the maximum peak is retained, and the peaks other than the maximum peak are used as non-peaks to obtain peaks that are screened again.
9. The method according to claim 1, characterized in that: The clustering of the peak values in the row direction and the column direction in the intensity matrix to obtain a corresponding plurality of row peak value sets and a corresponding plurality of column peak value sets comprises: determining row and column coordinates of the peak in the intensity matrix; Clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets; According to the column coordinates of the peaks, the peaks belonging to the same column are clustered to obtain a plurality of column peak sets.
10. The method according to claim 9, characterized in that The obtaining of the corresponding multiple row peak value sets and multiple column peak value sets includes: The peak values in the intensity matrix are retained, and the non-peak values are set to zero, and the row distribution data of the row coordinates and the column distribution data of the column coordinates in the intensity matrix are determined; wherein the row distribution data represents the number of peak values corresponding to each row coordinate in the intensity matrix, and the column distribution data represents the number of peak values corresponding to each column coordinate in the intensity matrix; Arrange the row distribution data according to the row coordinate order in the intensity matrix, and if the distance between adjacent row coordinates is less than a fixed step size, cluster the row distribution data corresponding to the adjacent row coordinates into one category, and determine a row peak value set according to the peak values contained in the row distribution data clustered into one category; The column distribution data are arranged according to the column coordinate order in the intensity matrix. If the distance between adjacent column coordinates is less than a fixed step size, the column distribution data corresponding to the adjacent column coordinates are clustered into one category. The column peak value set is determined based on the peak values contained in the column distribution data clustered into one category.
11. The method according to claim 9, characterized in that The step of clustering the peaks belonging to the same row according to the row coordinates of the peaks to obtain a plurality of row peak sets includes: Determine an odd-numbered column matrix according to the odd-numbered columns in the intensity matrix, and determine an even-numbered column matrix according to the even-numbered columns in the intensity matrix; The peak values in the odd-numbered column matrix and the even-numbered column matrix are retained, and non-peak values are set to zero, and the odd-numbered row distribution data of the row coordinates in the odd-numbered column matrix and the even-numbered row distribution data of the row coordinates in the even-numbered column matrix are determined; the odd-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the odd-numbered column matrix, and the even-numbered row distribution data represents the number of peak values corresponding to each row coordinate in the even-numbered column matrix; The odd-numbered row distribution data and the even-numbered row distribution data are clustered respectively, and the clustered odd-numbered row distribution data and the even-numbered row distribution data are clustered again to obtain a row peak value set.
12. The method according to claim 11, characterized in that The clustering of the odd-numbered row distribution data and the even-numbered row distribution data respectively, and clustering the clustered odd-numbered row distribution data and the even-numbered row distribution data again to obtain a row peak value set includes: Arranging the odd-numbered row distribution data and the even-numbered row distribution data respectively according to the row coordinate order in the intensity matrix; The odd row distribution data corresponding to the odd row coordinates greater than the mean value of the odd row coordinates in the current adjacent odd row coordinates in the odd row distribution data and the even row distribution data corresponding to the even row coordinates less than or equal to the mean value of the even row coordinates in the previous adjacent even row coordinates in the even row distribution data are grouped into one category; wherein the mean value of the odd row coordinates is obtained by averaging the adjacent odd row coordinates; the row coordinate order of the current adjacent odd row coordinates and the previous adjacent even row coordinates in the corresponding intensity matrix is adjacent; The odd-row distribution data corresponding to the odd-row coordinates in the current adjacent odd-row coordinates in the odd-row distribution data that are less than or equal to the mean of the odd-row coordinates are grouped into another category, and the even-row distribution data corresponding to the even-row coordinates in the next adjacent even-row coordinates in the even-row distribution data that are greater than the mean of the even-row coordinates are grouped into another category; wherein the mean of the even-row coordinates is obtained by averaging the adjacent even-row coordinates; the row coordinate order of the current adjacent odd-row coordinates and the next adjacent even-row coordinates in the corresponding intensity matrix is adjacent; A row peak set is determined according to the peak values contained in the row distribution data that are clustered into one category.
13. The method according to any one of claims 9 to 11, characterized in that: Also includes: When the number of rows where the row coordinates are grouped together is less than a set value, determining the row coordinate mean of the row coordinates grouped together, and correcting the number of rows where the row coordinates are grouped together according to the row coordinate mean; and / or, When the number of columns where the column coordinates clustered into one category are located is less than a set value, a column coordinate mean of the column coordinates clustered into one category is determined, and the number of columns where the column coordinates are located is corrected according to the column coordinate mean.
14. A display device, characterized in that: The device comprises a display screen and a processor, wherein the processor is configured to execute the steps of any one of the methods of claims 1 to 13.
15. An electronic device, characterized in that: The electronic device comprises a processor and a memory, wherein the memory is used to store a program executable by the processor, and the processor is used to read the program in the memory and execute the steps of any one of the methods of claims 1 to 13.
16. A computer storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method according to any one of claims 1 to 13 are implemented.
