A method for detecting PDAF gain data, an electronic device and a storage medium

Abstract

The application relates to the technical field of electronic data processing, in particular to a PDAF gain data detection method, an electronic device and a storage medium. The method comprises the following steps: based on acquired gain data, acquiring two actual data row lists of the gain data, and generating a corresponding bitmap marking list based on the actual data list; based on the actual data row list and the bitmap marking list, judging whether the gain data meets a preset card control rule, and if yes, determining the gain data as valid data. Through the method provided by the application, the gain data is detected, and the technical effect of judging the validity of the gain data is realized.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of electronic data processing, and particularly relates to a PDAF gain data detection method, an electronic device and a storage medium. BACKGROUND

[0002] Currently, a camera module with a feature point (hereinafter referred to as a pd point) sensor needs to be tested for phase focusing (hereinafter referred to as PDAF) before leaving the factory, and PDAF testing through a high-pass platform is the mainstream practice in the industry. The data generated by the high-pass PDAF includes gain data (i.e., gain map) and center control data (hereinafter referred to as DCC), the gain data is used to reflect the performance of the feature point to determine whether the sensor has defects, and the DCC is used for phase focusing. However, there is no method for detecting the effectiveness of the gain data. SUMMARY

[0003] The present application provides a PDAF gain data detection method, which solves the technical problem that there is no method for detecting the effectiveness of the gain data.

[0004] In a first aspect, the present application provides a PDAF gain data detection method, a PDAF gain data detection method, the method comprises,

[0005] Based on the obtained gain data, two actual data row lists of the gain data are obtained, and a corresponding bitmap marking table is generated based on the actual data list;

[0006] Based on the actual data row list and the bitmap marking list, it is judged whether the gain data meets a preset control rule, and if so, the gain data is determined as valid data.

[0007] Further, based on the obtained gain data, the two actual data row lists of the gain data include:

[0008] Based on the arrangement position of the actual data in the gain data in the detection tool, two actual data sets are obtained;

[0009] The actual data sets are arranged in a manner of a rows*b columns to generate the actual data row list;

[0010] Wherein, a and b are integers; and the product of a and b is equal to the number of actual data in the actual data set.

[0011] Further, the generation of the corresponding bitmap marking table based on the actual data list includes:

[0012] According to the row value and the column value of the position of each actual data in the actual data row list, a bitmap marking table is generated.

[0013] Further, the card control rules include:

[0014] It is determined whether the difference between the maximum values in the two actual data row lists is less than a preset maximum difference threshold value.

[0015] If not, the gain data is determined as invalid data.

[0016] Further, the card control rules further include:

[0017] It is determined whether the row values of the maximum values in each actual data row list are all equal to a preset row standard value, and whether the column values of the maximum values are all equal to a preset column standard value.

[0018] If not, the gain data is determined as invalid data.

[0019] Further, the card control rules further include:

[0020] It is determined whether the row values and the column values of the minimum values in each actual data row list correspond to fall within a preset value range.

[0021] And whether the average value between the row values of the minimum values of the two actual data row lists corresponds to fall within a preset value range.

[0022] And whether the average value between the column values of the minimum values of the two actual data row lists corresponds to fall within a preset value range.

[0023] If not, the gain data is determined as invalid data.

[0024] Further, the card control rules further include:

[0025] In the actual data row list, it is determined whether the size of the actual data in the alternate rows and columns is increasing along the direction from the minimum value to the periphery of the actual data row list.

[0026] If not, the gain data is determined as invalid data.

[0027] Further, the card control rules further include:

[0028] The column average value of each column in the actual data row list is obtained, and in the actual data row list, it is determined whether the difference between the column average values of two adjacent columns is decreasing along the direction from the minimum value to the periphery of the bitmap table, and the difference between the column average values of the two adjacent columns is less than a preset minimum average difference threshold value.

[0029] If not, the gain data is determined as invalid data.

[0030] In a second aspect, the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method steps of any one of the first aspect when executing the program.

[0031] In a third aspect, the present application provides a computer readable storage medium, having stored thereon a computer program, which, when executed by a processor, implements the method steps of any one of the first aspect.

[0032] The one or more technical solutions in the embodiments of the present application have at least the following technical effects or advantages:

[0033] In the embodiments of the present application, based on the acquired gain data, two actual data row lists of the gain data are acquired, and a corresponding bitmap marking table is generated based on the actual data list; based on the actual data row list and the bitmap marking list, a card control rule is set by analyzing the rule satisfied by qualified gain data, and the gain data satisfying the card control rule is determined as valid data by judging whether the gain data satisfies the preset card control rule. Through the method provided by the present application, the gain data is detected, and the technical effect of judging the validity of the gain data is realized. BRIEF DESCRIPTION OF DRAWINGS

[0034] Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The accompanying drawings are included to provide a description of the preferred embodiments and are not intended to limit the scope of the application. Moreover, the same reference numerals in different figures represent the same or similar components.

[0035] In the drawings:

[0036] Figure 1 A step flow diagram in the embodiments of the present application is shown;

[0037] Figure 2 An electronic structure device schematic diagram in the embodiments of the present application is shown. DETAILED DESCRIPTION

[0038] Exemplary embodiments of the present disclosure will be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments of the present disclosure are shown. It is to be understood that the present disclosure can be embodied in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the present disclosure to those skilled in the art.

[0039] Embodiment one

[0040] The embodiment of the present application provides a PDAF gain data detection method, which solves the technical problem that there is no method for detecting the validity of gain data.

[0041] To solve the above technical problems, as shown in Figure 1 The technical scheme of the embodiment of the present application is as follows:

[0042] S1, based on the obtained gain data, two actual data row lists of the gain data are obtained, and a corresponding bitmap marking table is generated based on the actual data list;

[0043] S2, based on the actual data row list and the bitmap marking list, it is judged whether the gain data meets a preset control rule, and if so, the gain data is determined as valid data.

[0044] In order to better understand the above technical scheme, the above technical scheme will be described in detail in combination with the drawings of the specification and the specific embodiments.

[0045] First of all, the term "and / or" appearing in this paper is only a description of the association relationship between the associated objects, which means that there may be three kinds of relationships, for example, A and / or B, which can represent the following three cases: A exists alone, A and B exist together, and B exists alone. In addition, the character " / " in this paper generally represents an "or" relationship between the front and rear associated objects.

[0046] The embodiment provides a PDAF gain data detection method as shown in Figure 1 The method comprises steps S1-S2.

[0047] Firstly, step S1 is performed, based on the obtained gain data, the actual data row list in the gain data is obtained, and a corresponding bitmap marking table is generated based on the actual data list, which comprises the following steps:

[0048] S11, based on the arrangement position of the actual data in the gain data in the detection tool, two actual data sets are obtained;

[0049] Specifically, the detection tool used in the method is a high-pass tool. The high-pass tool generates 890 bytes of gain data from an original raw image, including 6 bytes of fixed information (version number, width and height of data column) and 884 bytes of calibration data. Then the high-pass tool combines the 884 bytes of calibration data according to high and low bits to generate 442 bytes of actual data. The 442 bytes of actual data are arranged in two columns in the high-pass tool. The actual data arranged in the left column is set as a first actual data set, and the actual data arranged in the right column is set as a second actual data set. Each of the first actual data set and the second actual data set contains 221 actual data. As shown in Table 1 below, part of the actual data sets are shown.

[0050] Table 1

[0051]

[0052] S12, arranging the actual data set in a manner of a rows*b columns to generate an actual data row list.

[0053] Wherein a and b are integers, and the product of a and b is equal to the number of actual data in the actual data set.

[0054] Specifically, the number of actual data in the first actual data set and the second actual data set in the embodiment is 221. Therefore, a=17 and b=13 are taken, and the first actual data set and the second actual data set are arranged in a manner of 17 rows*13 columns respectively to generate a first actual data row list as shown in Table 2 and a second actual data row list as shown in Table 3.

[0055] Table 2

[0056]

[0057] Table 3

[0058]

[0059] S13, generating a bitmap mark list according to the row value and the column value of the position of each actual data in the actual data row list.

[0060] Specifically, first, according to the row number and the column number where each actual data in the first actual data row list is located, the 221 gain actual data in the first actual data row list is marked, and the bits L[0][0], L[0][1], L[0][2]…L[0]

[16] …L[1][0]…L[1]

[16] …L

[12]

[16] , R[0][0], R[0][1], R[0][2]…R[0]

[16] …R[1][0]…R[1]

[16] …R

[12]

[16] are marked respectively, so as to obtain the first bitmap marking table shown in Table 4; then the second bitmap marking table is obtained by using the same method.

[0061] Table 4:

[0062]

[0063] Then, step S2 is executed, that is, whether the gain data satisfies the preset control rules is judged based on the actual data row list and the bitmap marking list, and if yes, the gain data is determined as valid data.

[0064] Specifically, the following steps are included:

[0065] S21, the row value and the column value corresponding to the maximum value and the minimum value in the actual data row list are obtained.

[0066] Specifically, the minimum value L_min_val and the maximum value L_max_val in the 221 actual data in the first actual data row list are found, and the row and column values L_min[x1][y1] and L_max[x3][y3] corresponding to the minimum value L_min_val and the maximum value L_max_val in the first bitmap list are obtained; the minimum value R_min_val and the maximum value R_max_val in the 221 actual data in the second actual data row list are found, and the row and column values R_min[x2][y2] and R_max[x4][y4] corresponding to the minimum value R_min_val and the maximum value R_max_val in the second bitmap list are obtained.

[0067] S22, whether the actual data satisfies the control rules is judged.

[0068] The valid gain data presents specific data characteristics in the extreme value and the whole:

[0069] The difference between the first maximum value in the first actual data row list and the second maximum value in the second actual data row list is less than a preset maximum difference threshold value; and the row value of the first maximum value and the row value of the second maximum value are equal to a preset row-column standard value; and the row value of the first minimum value and the row value of the second minimum value, the column value, and the average value of the row value and the average value of the column value are within a preset value range.

[0070] The size of the actual data in the actual data row list shows an increasing trend along the direction from the minimum value to the periphery of the actual data row list. The difference between the average value of two adjacent columns along the direction from the minimum value to the periphery of the bitmap table is decreasing, and the difference is less than a preset minimum average difference threshold value.

[0071] Therefore, the control rules are formulated according to the data characteristics of the effective gain data. When the detected actual data completely satisfies the control rules, the detected actual data is considered to be effective, otherwise, the detected actual data is considered to be invalid.

[0072] The following will be described in detail how to judge whether the actual data is effective through the control rules.

[0073] First, the extreme data characteristics in the data are controlled:

[0074] It is judged whether the difference between the first maximum value in the first actual data row list and the second maximum value in the second actual data row list is less than a preset maximum difference threshold value.

[0075] That is, abs(L_max_val-R_max_val)<max_diff_val;

[0076] The maximum difference threshold value max_diff_val is determined by collecting the factory data when the lens module is produced for the first time.

[0077] If yes, it is judged whether the row value of the first maximum value and the row value of the second maximum value are equal to a preset row-column standard value.

[0078] That is, it is judged whether x3 and x4 in L_max[x3][y3], R_max[x4][y4] are equal to 0 or 16; and whether y3 or y4 is equal to 0 or 12.

[0079] If yes, it is judged whether the row value of the first minimum value and the row value of the second minimum value, the column value, and the average value of the row value and the average value of the column value fall within a preset value range.

[0080] That is, determine whether x1 and x2 in L_mi n[x1][y1], R_mi n[x2][y2] both satisfy that x1 and x2 are greater than 3 and less than 13, and the average value of x1 and x2 is between 6 and 10, and whether y1 and y2 both satisfy that they are greater than 2 and less than 10, and the average value of y1 and y2 is between 4 and 8.

[0081] After completing the control of extreme values, the overall data features in the data are controlled.

[0082] In the actual data row list, it is determined whether the size of the actual data in alternate rows and columns increases gradually along a direction from the minimum value to the periphery of the actual data row list.

[0083] Specifically, for the first actual data row list, the data is generally centered on the minimum value and has a trend of gradually increasing in all directions. However, not any two adjacent points necessarily satisfy this rule. Therefore, the alternate row card control method is adopted to satisfy the rule that the data increases in alternate rows and columns in the upper, lower, left, and right directions with the minimum value as the center, as shown in Table 5.

[0084] Table 5:

[0085]

[0086] Check whether the following conditions are met: horizontally, L[x1][y1] to L[0][y1] show an alternate-row increasing pattern, and L[x1][y1] to L

[16] [y1] show an alternate-row increasing pattern; vertically, L[x1][y1] to L[x1][0] show an alternate-row increasing pattern, and L[x1][y1] to L[x1]

[12] show an alternate-row increasing pattern, as shown in Table 6:

[0087] Table 6:

[0088]

[0089] Alternate line increment rule: vertical box satisfies:

[0090] L[x1][y1] <L[x1-2][y1]<L[x1-4][y1]<…<L[0][y1];

[0091] L[x1-1][y1] <L[x1-3][y1]<L[x1-5][y1]<…<L[1][y1];

[0092] L[x1][y1] <L[x1+2][y1]<L[x1+4][y1]<…<L

[16] [y1];

[0093] L[x1+1][y1] <L[x1+3][y1]<L[x1+5][y1]<…<L

[15] [y1];

[0094] And the minimum value of the column also exists in the row of incremental rules, meet the following rules:

[0095] L[m][n] to L[0][m] is in the row of incremental rules, L[m][n] to L

[16] [n] is in the row of incremental rules, as shown in Table seven: Table seven:

[0096]

[0097] And the minimum value of the column also exists in the row of incremental rules, meet the following rules:

[0098] L[m][n] to L[m][0] is in the row of incremental rules, L[m][n] to L[m]

[12] is in the row of incremental rules, as shown in Table eight: Table eight:

[0099]

[0100] For the second actual data row list, also according to the above method for judgment.

[0101] Next, the column average value of each column in the actual data row list is obtained, in the actual data row list, along with the minimum value as the center to the bitmap table periphery direction, it is judged whether the difference value of the column average value of two adjacent columns is decreasing, and the difference value of the column average value of the two adjacent columns is less than the preset minimum average difference threshold value.

[0102] Next, the column average value of each column in the actual data row list is obtained, in the actual data row list, along with the minimum value as the center to the bitmap table periphery direction, it is judged whether the difference value of the column average value of two adjacent columns is decreasing, and the difference value of the column average value of the two adjacent columns is less than the preset minimum average difference threshold value.

[0103] Table nine:

[0104]

[0105] The above problems are controlled by the following average row and column difference value algorithm, the specific algorithm is as follows:

[0106] The average value of each column in the 17 columns is calculated: recorded as Avg_row0, Avg_row1...Avg_row16, with the x1 position of the minimum value L_min[x1][y1] as the demarcation line, the difference value of the adjacent average value is calculated respectively:

[0107] Di f0=Avg_row0-Avg_row1;

[0108] Di f1=Avg_row1-Avg_row2;

[0109] …

[0110] Di f(x1-1)=Avg_row(x1-1)-Avg_rowx1;

[0111] Di f(x1) = Avg_row(x1+1) - Avg_rowx1

[0112] …

[0113] Di f15 = Avg_row16 - Avg_rowx15

[0114] Judge whether Di f0 to Di f(x1-1) satisfy the decreasing rule.

[0115] Then judge whether Di f15 to Di c(x1) are less than a preset minimum average difference threshold L_d i f_l_spec, wherein the L_d i f_l_spec is determined by collecting factory data when the lens module is produced for the first time.

[0116] That is, judge whether the following conditions are satisfied:

[0117] Di f(0) - Di f(1) > L_d i f_l_spec;

[0118] Di f(1) - Di f(2) > L_d i f_l_spec;

[0119] …

[0120] Di f(15) - Di f(14) > L_d i f_l_spec;

[0121] The same method is used to judge whether the row values satisfy the control rules.

[0122] The same method is used to judge whether the second actual data row list satisfies the control rules.

[0123] In the implementation process, by presetting the specifications of L_d i f_l_spec and L_d i f_h_spec, the problem of data mutation can be effectively controlled. The difference between the two rows in the mutation area will be very small or negative.

[0124] Based on the obtained gain data, the two actual data row lists of the gain data are obtained, and a corresponding bitmap marking table is generated based on the actual data list. Based on the actual data row list and the bitmap marking list, a control rule is set by analyzing the rule satisfied by qualified gain data, and whether the gain data satisfies the preset control rule is judged, and the gain data satisfying the control rule is determined as valid data. Through the method provided in the application, the gain data is detected, and the technical effect of judging the validity of the gain data is realized.

[0125] Embodiment two

[0126] Based on the same inventive concept, the embodiment two of the present application provides an electronic device, as shown in the accompanying drawings, comprising a memory 304, a processor 302, and a computer program stored in the memory 304 and executable on the processor 302, wherein the processor 302 implements the steps of the above-mentioned PDAF gain data detection method when executing the program. Figure 2 As shown, it comprises a memory 304, a processor 302, and a computer program stored in the memory 304 and executable on the processor 302, wherein the processor 302 implements the steps of the above-mentioned PDAF gain data detection method when executing the program.

[0127] In the above-mentioned embodiment, the PDAF gain data detection method comprises the steps of: Figure 2 In the above-mentioned embodiment, the PDAF gain data detection method comprises the steps of: The bus architecture (represented by bus 300) can include any number of interconnected buses and bridges, the bus 300 links various circuits including one or more processors represented by processor 302 and memory represented by memory 304. The bus 300 can also link various other circuits such as peripheral devices, voltage stabilizers and power management circuits, etc., which are well known in the art, therefore, they will not be further described herein. The bus interface 306 provides an interface between the bus 300 and the receiver 301 and the transmitter 303. The receiver 301 and the transmitter 303 can be the same element, i.e. the transceiver, which provides a unit for communicating with various other devices on the transmission medium. The processor 302 is responsible for managing the bus 300 and general processing, while the memory 304 can be used to store data used by the processor 302 in performing operations.

[0128] Embodiment three

[0129] Based on the same inventive concept, the embodiment three of the present application provides a computer readable storage medium, which stores a computer program, the program is executed by a processor to implement the steps of the above-mentioned PDAF gain data detection method.

[0130] The algorithms and displays provided herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems can be used with programs in accordance with the teachings herein. The construction of such systems as well as other instrumentalities connected therewith are within the skill of those in the art. In addition, the present application is not intended to be limited to any particular programming language. It will be appreciated that there are many programming languages that can be used to implement the teachings of the present application as described herein, and any such programming language is intended to be encompassed by the present application.

[0131] In the specification provided herein, a large number of specific details are described. However, it can be understood that the embodiments of the present application can be practiced without these specific details. In some examples, well-known methods, structures and techniques are not described in detail in order not to obscure the understanding of the present specification.

[0132] Similarly, it is to be understood that the embodiments of the present application can be alternately grouped together in a single embodiment, figure, or description of embodiments thereof for the purpose of brevity and understanding in the interest of conciseness and didacticism. However, this method of disclosure is not to be interpreted as reflecting an intention that the claimed application requires more features than the claims do. Rather, as the following claims reflect, inventive aspects lie in fewer than all features of a single disclosed embodiment. Thus, the following claims are hereby expressly incorporated into this Detailed Description of the Invention, with each claim acting as a separate embodiment of the application. The following detailed description is made with reference to the accompanying drawings, of which:

[0133] Those skilled in the art will appreciate that the modules in the apparatuses of the embodiments can be adapted and placed in one or more apparatuses other than the embodiments. The modules or units or components in the embodiments can be combined into one module or unit or component, and further can be divided into more sub-modules or sub-units or sub-components. Any combination of all the features disclosed in the specification (including the accompanying claims, abstract and drawings), and any method or of the apparatuses so disclosed, can be taken, excepting that at least some of such features and / or processes are mutually exclusive, unless explicitly stated otherwise. Each feature disclosed in the specification (including the accompanying claims, abstract and drawings) can be replaced by alternative features serving the same, equivalent or similar purpose, unless explicitly stated otherwise.

[0134] Furthermore, those skilled in the art will appreciate that the features of the various embodiments can be combined in different combinations than the combinations explicitly presented in the above description, and that the described embodiments can be combined with other embodiments apart from those described in the above description. For example, the following claims are hereby expressly incorporated into this detailed description, with each claim acting as a separate embodiment of the application.

[0135] The various component embodiments of the present application can be implemented in hardware, or as software modules running in one or more processors, or in combinations thereof. Those skilled in the art will appreciate that a microprocessor or digital signal processor (DSP) can be used in practice to implement some or all of the functionality of some or all of the components in the electronic devices according to the embodiments of the present application. The present application can also be implemented as a program (e.g., computer program and computer program product) for executing any or all of the methods described herein on a device or apparatus (e.g., computer). Such a program can be stored on a computer readable medium, or can be transmitted for play on a carrier signal. Such a carrier signal can be downloaded from an Internet website, or transmitted on a carrier signal, or in any other form.

[0136] The above is only an embodiment of the present application, and the common knowledge of the specific structure and characteristics in the scheme is not described in detail, and the ordinary skilled person in the art knows all the ordinary technical knowledge in the field of the application before the application date or the priority date, can know all the prior art in the field, and has the ability to apply the conventional experimental means before that date, and the ordinary skilled person in the art can perfect and implement the present scheme under the guidance of the present application, combined with their own ability, some typical known structures or known methods should not be an obstacle for the ordinary skilled person in the art to implement the present application. It should be pointed out that for those skilled in the art, without departing from the structure of the present application, a number of modifications and improvements can be made, which should also be considered as the protection scope of the present application, which will not affect the effect and practicality of the patent. The protection scope of the present application should be subject to the content of its claims, and the specific implementation mode and the like in the specification can be used to explain the content of the claims.

Claims

1. A method for detecting PDAF gain data, characterized in that: The method comprises, Based on the acquired gain data, two actual data row lists of the gain data are acquired, and a bitmap mark table is generated according to the row value and column value of each actual data position in the actual data row list; Based on the actual data row list and the bitmap mark table, determining whether the gain data meets a preset card control rule; If so, determining the gain data as valid data; The card control rules include: Determine whether the difference between the maximum values ​​in the two actual data row lists is less than the preset maximum difference threshold; If not, determining the gain data as invalid data; If so, determining whether the row value of the maximum value in each of the actual data row lists is equal to the preset row standard value, and whether the column value of the maximum value is equal to the preset column standard value; If not, determining the gain data as invalid data; If so, determine whether the row value and column value of the minimum value in each of the actual data row lists fall within a preset value range, and whether the average value between the row values ​​of the minimum values ​​of the two actual data row lists falls within the preset value range, and whether the average value between the column values ​​of the minimum values ​​of the two actual data row lists falls within the preset value range; If not, determining the gain data as invalid data; If so, in the actual data row list, determine whether the size of the actual data in alternate rows and columns increases in a direction from the minimum value to the periphery of the actual data row list; If not, determining the gain data as invalid data; If so, obtain the column average of each column in the actual data row list, and in the actual data row list, determine whether the difference between the column averages of two adjacent columns decreases along the direction of the bitmap mark table with the minimum value as the center, and whether the difference between the column averages of the two adjacent columns is less than a preset minimum average difference threshold; If not, the gain data is determined to be invalid data.

2. The method for detecting PDAF gain data according to claim 1, wherein: Based on the obtained gain data, two actual data row lists of the gain data are obtained, including: Acquire two actual data sets based on the arrangement positions of the actual data in the gain data in the detection tool; Arrange the actual data set in the form of a rows and b columns to generate the actual data row list; Wherein, a and b are integers; and the product of a and b is equal to the number of the actual data in the actual data set.

3. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method steps according to any one of claims 1 to 2 are implemented.

4. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method steps according to any one of claims 1 to 2 are implemented.

Images