Novel color correction matrix solving method and system and computer program
Through the new color correction matrix solution method, combined with the two-color correction matrix and saturation attenuation technology, the intensity of the color correction matrix is dynamically adjusted, which solves the problem of high incidence of false colors in traditional methods, and achieves better color reduction and color correction Effect.
Patent Information
- Application Number
- CN202410884168.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-03
- Publication Date
- 2024-11-12
AI Technical Summary
The traditional color correction matrix solution method has a high probability of false colors occurring in image processing, which is difficult to effectively reduce.
Using the new color correction matrix solution method, by obtaining the two-color correction matrix values α and β, combining the brightness, saturation and color tendency values of the pixels, the final color correction matrix is calculated using interpolation method and saturation attenuation technology, and dynamically adjusting the color correction The intensity of the matrix to reduce the occurrence of false color.
It improves the color reproduction of the image, significantly reduces the probability of false colors, and provides better color correction effects.
Smart Images

Figure CN118945489A_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the field of image signal processing, and in particular to a novel color correction matrix solving method. Background Art
[0002] With the rapid development of digital multimedia technology, webcams, mobile phones and other devices with cameras have been widely used in various fields of work and life. The color accuracy of the videos recorded or photos taken by the camera directly affects the user experience. Image signal processing is used to optimize the images collected by the camera to meet the requirements of human vision. It is widely used in mobile phones, security and automotive fields.
[0003] The response of the camera's RGB three components to the spectrum is usually different from the human eye's response to the spectrum. Generally, a color correction matrix (CCM) is used to correct the cross-effect and response intensity of the spectral response so that the processed output image is consistent with the human eye vision in color.
[0004] The color correction matrix is a 3x3 matrix. The traditional solution is to perform nonlinear optimization fitting on a 24-color card. When processing an image, the color correction matrix is multiplied by the RGB value of each pixel one by one to obtain the final output value of the image. Summary of the invention
[0005] The present invention provides a novel color correction matrix solution method, which applies the traditional color correction matrix, color block classification, interpolation method and saturation attenuation to calculate the final color correction matrix. After the obtained color correction matrix is used to process the image, it has better color restoration and can better reduce the probability of false color occurrence.
[0006] To achieve the above object, the embodiments of the present invention adopt the following technical solutions:
[0007] A novel color correction matrix solving method includes the following steps:
[0008] Get the dual color correction matrix values α and β;
[0009] Get the brightness, saturation and color tendency value S of the current pixel;
[0010] Based on the dual color correction matrix and the color tendency value S, obtain the color correction matrix intermediate value δ of the current pixel;
[0011] According to the brightness and saturation of the current pixel, obtain the attenuation factor F;
[0012] According to the color correction matrix intermediate value δ and the attenuation factor F, the final color correction matrix value θ of the current pixel is obtained.
[0013] According to one aspect of the present invention, the obtaining of the dual color correction matrices α and β is as follows:
[0014] The color patches on the color card are divided into three categories, including color patches with a red tendency, color patches with a blue tendency, and other color patches;
[0015] Apply the traditional color correction matrix solving method to the color patches with a red tendency to obtain the color correction matrix value α;
[0016] Apply the traditional color correction matrix solving method to the color patches with a blue tendency to obtain the color correction matrix value β.
[0017] According to one aspect of the present invention, the obtaining of the color tendency value S of the current pixel is as follows:
[0018] S = (R – B) * 1024 / (R + G + B + C) + 1024
[0019] Wherein, R, G, and B represent the rgb values of the current pixel; C is the noise compensation offset.
[0020] According to one aspect of the present invention, the obtaining of the intermediate color correction matrix value δ of the current pixel based on the dual color correction matrices and the color tendency value S is as follows:
[0021] Set the color tendency value thresholds S1 and S2, where S1 < S2;
[0022] Compare the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate color correction matrix value δ of the current pixel.
[0023] According to one aspect of the present invention, the comparing of the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate color correction matrix value δ of the current pixel is as follows:
[0024] If S < S1 < S2, then δ = α;
[0025] If S1 < S2 < S, then δ = β;
[0026] If S1 < S < S2, then according to the difference between S and S1, S2, use the linear interpolation method to obtain δ.
[0027] According to one aspect of the present invention, the obtaining of the attenuation factor F according to the brightness and saturation of the current pixel is as follows:
[0028] Obtain the color saturation Sa and brightness Y of the current pixel;
[0029] According to the mapping curve of the color saturation and the attenuation factor, find out the attenuation factor value fS;
[0030] Based on the mapping curve of brightness and attenuation factor, find out the attenuation factor value fY;
[0031] Based on fS and fY, obtain the final attenuation factor value F.
[0032] According to one aspect of the present invention, the obtaining of the color saturation Sa of the current pixel is as follows:
[0033] Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C)
[0034] Wherein, R, G, and B represent the rgb values of the current pixel; C is the noise compensation offset.
[0035] According to one aspect of the present invention, the obtaining of the brightness Y of the current pixel is as follows:
[0036] Y = 2 * R + 5 * G + B
[0037] According to one aspect of the present invention, the principle for determining the mapping curve of color saturation and attenuation factor is: when the color saturation of the current pixel is low, reduce the attenuation factor value fS.
[0038] According to one aspect of the present invention, the principle for determining the mapping curve of brightness and attenuation factor is: when the brightness value of the current pixel is too low or too high, reduce the attenuation factor value fY.
[0039] According to one aspect of the present invention, the obtaining of the final attenuation factor value F based on fS and fY is as follows:
[0040] F = (fY >= fS)? fY : fS
[0041] If fY >= fS, then F = fY;
[0042] If fY < fS, then F = fS.
[0043] According to one aspect of the present invention, the obtaining of the final color correction matrix value θ of the current pixel based on the intermediate value δ of the color correction matrix and the attenuation factor F is as follows:
[0044] θ = δ * F
[0045] A new type of color correction matrix solving system, based on the new type of color correction matrix solving method as described above, includes:
[0046] An initial matrix obtaining module, configured to obtain the dual color correction matrix values α and β;
[0047] A pixel parameter acquisition module is used to obtain the brightness, saturation and color tendency value S of the current pixel;
[0048] An intermediate matrix acquisition module, used to acquire a color correction matrix intermediate value δ of a current pixel based on the dual color correction matrix and the color tendency value S;
[0049] An attenuation factor acquisition module is used to obtain an attenuation factor F according to the brightness and saturation of the current pixel;
[0050] The final matrix acquisition module is used to obtain the final color correction matrix value θ of the current pixel according to the color correction matrix intermediate value δ and the attenuation factor F.
[0051] A computer program is provided, which realizes the steps of the novel color correction matrix solving method as described above when being executed.
[0052] Advantages of the present invention:
[0053] The invention provides a novel color correction matrix solution method, which applies the traditional color correction matrix, color block classification, interpolation method and saturation attenuation to calculate the final color correction matrix.
[0054] The technical solution of the present invention can optimize the solution method of the color correction matrix and design a dual color correction matrix mode on the one hand; on the other hand, it can dynamically adjust the intensity of the color correction matrix according to the brightness and saturation of each pixel to reduce the probability of false color.
[0055] Compared with the traditional color correction matrix solution method, the color correction matrix solved by this technical solution has better color restoration after processing the image and can better reduce the probability of false color occurrence. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in 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 work.
[0057] Figure 1 A flowchart of a novel color correction matrix solving method according to the present invention;
[0058] Figure 2 The 24-color card of the present invention;
[0059] Figure 3 Classify the color blocks described in the present invention;
[0060] Figure 4This is the debugging mapping curve diagram described in the present invention. DETAILED DESCRIPTION
[0061] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of 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.
[0062] Embodiment 1
[0063] like Figure 1 As shown, a new color correction matrix solution method includes the following steps:
[0064] S1: Obtain dual color correction matrix values α and β.
[0065] The dual color correction matrices α and β are obtained in the following manner:
[0066] Divide the color blocks on the color card into three categories, including red-leaning blocks, blue-leaning blocks, and other blocks;
[0067] Apply the traditional color correction matrix solution method to the color block with red tendency to obtain the color correction matrix value α;
[0068] The traditional color correction matrix solution method is applied to the color block with a blue tendency to obtain the color correction matrix value β.
[0069] In this embodiment, the first 18 color blocks of the 24-color card are used, such as Figure 2 As shown, different color blocks have different color tendencies according to the RGB values of each color block.
[0070] like Figure 3 As shown, the color blocks on the 18 color block color card are divided into 3 categories: red-leaning color blocks, blue-leaning color blocks and other color blocks. Among them, the color blocks marked with red circles (a total of 6) are red-leaning color blocks, the color blocks marked with white circles (a total of 5) are blue-leaning color blocks, and the remaining color blocks are intermediate color blocks.
[0071] The traditional method for solving the color correction matrix is to obtain a 3x3 color correction matrix by performing nonlinear optimization fitting on the 24 color cards.
[0072] S2: Get the brightness, saturation and color tendency value S of the current pixel.
[0073] The color saturation Sa of the current pixel is calculated as follows:
[0074] Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C)
[0075] Calculate the brightness Y of the current pixel in the following way:
[0076] Y = 2 * R + 5 * G + B
[0077] The method for obtaining the color tendency value S of the current pixel is as follows:
[0078] S = (R – B) * 1024 / (R + G + B + C) + 1024
[0079] Wherein, R, G, and B represent the rgb values of the current pixel; C is the noise compensation offset.
[0080] S3: Based on the dual-color correction matrix and the color tendency value S, obtain the intermediate value δ of the color correction matrix of the current pixel.
[0081] The method for obtaining the intermediate value δ of the color correction matrix of the current pixel based on the dual-color correction matrix and the color tendency value S is as follows:
[0082] Set the color tendency value thresholds S1 and S2, where S1 < S2;
[0083] Compare the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel.
[0084] The method for comparing the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel is as follows:
[0085] If S < S1 < S2, then δ = α;
[0086] If S1 < S2 < S, then δ = β;
[0087] If S1 < S < S2, then according to the difference between S and S1, S2, use the linear interpolation method to obtain δ.
[0088] Given the points (S1, α) and (S2, β), calculate the point (S, δ), where S1 < S < S2, α < β, and the calculation method of linear interpolation is:
[0089] δ = CCMr + (β - α) * (S - S1) / (S2 - S1)
[0090] S4: According to the brightness and saturation of the current pixel, obtain the attenuation factor F.
[0091] The method for obtaining the attenuation factor F according to the brightness and saturation of the current pixel is as follows:
[0092] Obtain the color saturation Sa and brightness Y of the current pixel;
[0093] According to the mapping curve of the color saturation and the attenuation factor, find out the attenuation factor value fS;
[0094] According to the mapping curve of the brightness and the attenuation factor, find out the attenuation factor value fY;
[0095] According to fS and fY, obtain the final attenuation factor value F.
[0096] The way to obtain the color saturation Sa of the current pixel is as follows:
[0097] Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C)
[0098] Wherein, R, G, and B represent the rgb values of the current pixel; C is the noise compensation offset.
[0099] The way to obtain the brightness Y of the current pixel is as follows:
[0100] Y = 2 * R + 5 * G + B
[0101] The principle for determining the mapping curve of the color saturation and the attenuation factor is: when the color saturation of the current pixel is low, reduce the attenuation factor value fS.
[0102] The principle for determining the mapping curve of the brightness and the attenuation factor is: when the brightness value of the current pixel is too low or too high, reduce the attenuation factor value fY.
[0103] The mapping curve is obtained by debugging according to the actual image effect, and the value ranges of fS and fY are between 0.5 and 1.5. For example: Figure 4 Shown are the mapping curves of the color saturation and the attenuation factor, and the mapping curves of the brightness and the attenuation factor obtained by debugging.
[0104] The way to obtain the final attenuation factor value F according to fS and fY is as follows:
[0105] F = (fY >= fS)? fY : fS
[0106] If fY >= fS, then F = fY;
[0107] If fY < fS, then F = fS.
[0108] The attenuation factor is actually the intensity coefficient value of the color correction matrix, and its design purpose is to reduce the degree of false colors on high - light and low - color - saturation pixels.
[0109] S5: According to the intermediate value δ of the color correction matrix and the attenuation factor F, obtain the final color correction matrix value θ of the current pixel.
[0110] The method of obtaining the final color correction matrix value θ of the current pixel according to the color correction matrix intermediate value δ and the attenuation factor F is as follows:
[0111] θ=δ*F
[0112] Finally, different pixels will get a corresponding color correction matrix through the above method. When processing images, for each pixel in the image, each RGB component will be corrected by the corresponding color correction matrix. The correction method is: multiply the RGB value of the current pixel by the color correction matrix θ to get the output value of the current pixel. The calculation formula is as follows:
[0113]
[0114] The RGB value of the current pixel is [RGB], and the output value of the current pixel is [R'G'B'].
[0115]
[0116] The beneficial effect of this embodiment is that the method designs a dual color correction matrix mode, and dynamically adjusts the intensity coefficient of the color correction matrix according to the brightness and saturation of each pixel to reduce the probability of false color. Compared with the traditional color correction matrix solution method, the color correction matrix solved by this method has better color reproduction after processing the image, and can better reduce the probability of false color.
[0117] Embodiment 2
[0118] like Figure 1 As shown, a new color correction matrix solution method includes the following steps:
[0119] S1: Obtain dual color correction matrix values α and β.
[0120] The dual color correction matrices α and β are obtained in the following manner:
[0121] Divide the color blocks on the color card into three categories, including red-leaning blocks, blue-leaning blocks, and other blocks;
[0122] Apply the traditional color correction matrix solution method to the color block with red tendency to obtain the color correction matrix value α;
[0123] The traditional color correction matrix solution method is applied to the color block with a blue tendency to obtain the color correction matrix value β.
[0124] like Figure 2 As shown, the first 18 color blocks of the 24-color card are divided into different color tendencies.
[0125] In practical applications, according to the task requirements of different color corrections, color cards with richer colors can also be used, and the color patches on the color card can be classified into categories with other color tendencies, such as green tendency, yellow tendency, etc.
[0126] The traditional method for solving the color correction matrix is: through non-linear optimization fitting of the color card, a 3x3 color correction matrix is obtained.
[0127] S2: Obtain the brightness, saturation, and color tendency value S of the current pixel.
[0128] Calculate the color saturation Sa of the current pixel in the following way:
[0129] Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C)
[0130] Calculate the brightness Y of the current pixel in the following way:
[0131] Y = 2 * R + 5 * G + B
[0132] The obtaining of the color tendency value S of the current pixel is in the following way:
[0133] S = (R – B) * 1024 / (R + G + B + C) + 1024
[0134] Wherein, R, G, and B represent the rgb values of the current pixel; C is the noise compensation offset.
[0135] In practical applications, if the categories for classifying the color tendencies of the color patches are different, the calculation formulas for brightness, saturation, and color tendency values are also correspondingly modified.
[0136] S3: Based on the dual color correction matrix and the color tendency value S, obtain the intermediate value δ of the color correction matrix of the current pixel.
[0137] The obtaining of the intermediate value δ of the color correction matrix of the current pixel based on the dual color correction matrix and the color tendency value S is in the following way:
[0138] Set color tendency value thresholds S1 and S2, where S1 < S2;
[0139] Compare the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel.
[0140] The comparison of the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel is in the following way:
[0141] If S < S1 < S2, then δ = α;
[0142] If S1 < S2 < S, then δ = β;
[0143] If S1 < S < S2, then according to the differences between S and S1, S2, use linear interpolation to obtain δ.
[0144] Given points (S1, α) and (S2, β), calculate the point (S, δ), where S1 < S < S2 and α < β. The calculation method of linear interpolation is as follows:
[0145] δ = CCMr + (β - α) * (S - S1) / (S2 - S1)
[0146] S4: Obtain the attenuation factor F according to the brightness and saturation of the current pixel.
[0147] The method of obtaining the attenuation factor F according to the brightness and saturation of the current pixel is as follows:
[0148] Obtain the color saturation Sa and brightness Y of the current pixel;
[0149] According to the mapping curve of color saturation and attenuation factor, find out the attenuation factor value fS;
[0150] According to the mapping curve of brightness and attenuation factor, find out the attenuation factor value fY;
[0151] According to fS and fY, obtain the final attenuation factor value F.
[0152] The method of obtaining the color saturation Sa of the current pixel is as follows:
[0153] Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C)
[0154] Wherein, R, G, B represent the rgb values of the current pixel; C is the noise compensation offset.
[0155] The method of obtaining the brightness Y of the current pixel is as follows:
[0156] Y = 2 * R + 5 * G + B
[0157] The principle for determining the mapping curve of color saturation and attenuation factor is: when the color saturation of the current pixel is low, reduce the attenuation factor value fS.
[0158] The principle for determining the mapping curve of brightness and attenuation factor is: when the brightness value of the current pixel is too low or too high, reduce the attenuation factor value fY.
[0159] The mapping curve is obtained through debugging according to the actual image effect. The value ranges of fS and fY are between 0.5 and 1.5. For example: Figure 4Shown are the mapping curves of color saturation and attenuation factor, and the mapping curve of brightness and attenuation factor obtained through debugging.
[0160] According to fS and fY, the final attenuation factor value F is obtained in the following way:
[0161] F = (fY >= fS)? fY : fS
[0162] If fY >= fS, then F = fY;
[0163] If fY < fS, then F = fS.
[0164] The attenuation factor is actually the intensity coefficient value of the color correction matrix, and its design purpose is to reduce the degree of false color on high - light and low - color - saturation pixels.
[0165] S5: According to the intermediate value δ of the color correction matrix and the attenuation factor F, obtain the final color correction matrix value θ of the current pixel.
[0166] According to the intermediate value δ of the color correction matrix and the attenuation factor F, the final color correction matrix value θ of the current pixel is obtained in the following way:
[0167] θ = δ * F
[0168] Finally, different pixels will all obtain a corresponding color correction matrix through the above - mentioned method. During image processing, for each pixel in the image, each RGB component will be corrected by the corresponding color correction matrix. The correction method is: multiply the rgb value of the current pixel by the color correction matrix θ to obtain the output value of the current pixel. The calculation formula is as follows:
[0169]
[0170] The rgb value of the current pixel is [R G B], and the output value of the current pixel is [R' G' B'].
[0171]
[0172] The beneficial effect of this embodiment is that: this method can adjust the color - tendency classification according to the actual situation, solve the corresponding color correction matrix, so as to adapt to different color correction requirements.
[0173] Embodiment Three
[0174] A new type of color correction matrix solving system, based on the above - mentioned new type of color correction matrix solving method, includes:
[0175] An initial matrix acquisition module, used to acquire the dual - color correction matrix values α and β;
[0176] A pixel parameter acquisition module is used to obtain the brightness, saturation and color tendency value S of the current pixel;
[0177] An intermediate matrix acquisition module, used to acquire a color correction matrix intermediate value δ of a current pixel based on the dual color correction matrix and the color tendency value S;
[0178] An attenuation factor acquisition module is used to obtain an attenuation factor F according to the brightness and saturation of the current pixel;
[0179] The final matrix acquisition module is used to obtain the final color correction matrix value θ of the current pixel according to the color correction matrix intermediate value δ and the attenuation factor F.
[0180] Embodiment 4
[0181] A computer program, when executed, implements the steps of the novel color correction matrix solving method as described in the first or second embodiment.
[0182] Embodiment 5
[0183] A readable storage medium stores a computer program as described in Example 3, and when the computer program is executed, the steps of the novel color correction matrix solution method as described in Example 1 or 2 are implemented.
[0184] The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any changes or substitutions that can be easily thought of by any technician familiar with the art within the technical scope disclosed in the present invention should be included in the protection scope of the present invention. Therefore, the protection scope of the present invention shall be based on the protection scope of the claims.
Claims
1. A novel method for solving a color correction matrix, characterized in that, it includes the following steps: Obtain the dual color correction matrix values α and β; Obtain the brightness, saturation, and color tendency value S of the current pixel; Based on the dual color correction matrix and the color tendency value S, obtain the intermediate value δ of the color correction matrix of the current pixel; According to the brightness and saturation of the current pixel, obtain the attenuation factor F; According to the intermediate value δ of the color correction matrix and the attenuation factor F, obtain the final color correction matrix value θ of the current pixel.
2. The novel method for solving a color correction matrix according to claim 1, characterized in that, the obtaining of the dual color correction matrices α and β is in the following manner: Divide the color patches on the color card into 3 categories, including color patches with a red tendency, color patches with a blue tendency, and other color patches; Apply the traditional method for solving a color correction matrix to the color patches with a red tendency to obtain the color correction matrix value α; Apply the traditional method for solving a color correction matrix to the color patches with a blue tendency to obtain the color correction matrix value β.
3. The novel method for solving a color correction matrix according to claim 1, characterized in that, the obtaining of the color tendency value S of the current pixel is in the following manner: S = (R – B) * 1024 / (R + G + B + C) + 1024 wherein, R, G, B represent the rgb values of the current pixel; C is the noise compensation offset.
4. The novel method for solving a color correction matrix according to claim 1, characterized in that, the obtaining of the intermediate value δ of the color correction matrix of the current pixel based on the dual color correction matrix and the color tendency value S is in the following manner: Set the color tendency value thresholds S1 and S2, where S1 < S2; Compare the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel.
5. The novel method for solving a color correction matrix according to claim 4, characterized in that, the comparing of the color tendency value S of the current pixel with the thresholds S1 and S2 to obtain the intermediate value δ of the color correction matrix of the current pixel is in the following manner: If S < S1 < S2, then δ = α; If S1 < S2 < S, then δ = β; If S1 < S < S2, then according to the difference between S and S1, S2, use linear interpolation to obtain δ.
6. The novel method for solving a color correction matrix according to claim 1, characterized in that, the obtaining of the attenuation factor F according to the brightness and saturation of the current pixel is in the following manner: Obtain the color saturation Sa and brightness Y of the current pixel; According to the mapping curve of the color saturation and the attenuation factor, find out the attenuation factor value fS; According to the mapping curve of the brightness and the attenuation factor, find out the attenuation factor value fY; According to fS and fY, obtain the final attenuation factor value F.
7. The novel method for solving a color correction matrix according to claim 6, characterized in that, the obtaining of the color saturation Sa of the current pixel is in the following manner: Sa = (|R – G| + |B – G| + |R – B|) * 1024 / (R + G + B + C) wherein, R, G, B represent the rgb values of the current pixel; C is the noise compensation offset.
8. The novel color correction matrix solving method according to claim 6, characterized in that, the obtaining of the brightness Y of the current pixel is in the following manner: Y = 2 * R + 5 * G + B.
9. The novel color correction matrix solving method according to claim 6, characterized in that, the principle for determining the mapping curve of the color saturation and the attenuation factor is: when the color saturation of the current pixel is low, the attenuation factor value fS is reduced.
10. The novel color correction matrix solving method according to claim 6, characterized in that, the principle for determining the mapping curve of the brightness and the attenuation factor is: when the brightness value of the current pixel is too low or too high, the attenuation factor value fY is reduced.
11. The novel color correction matrix solving method according to claim 6, characterized in that, the obtaining of the final attenuation factor value F according to fS and fY is in the following manner: F = (fY >= fS)? fY : fS If fY >= fS, then F = fY; If fY < fS, then F = fS.
12. The novel color correction matrix solving method according to claim 1, characterized in that, the obtaining of the final color correction matrix value θ of the current pixel according to the intermediate value δ of the color correction matrix and the attenuation factor F is in the following manner: θ = δ * F.
13. A novel color correction matrix solving system, characterized in that, based on the novel color correction matrix solving method according to any one of claims 1 to 12, includes: An initial matrix obtaining module, configured to obtain the dual color correction matrix values α and β; A pixel parameter obtaining module, configured to obtain the brightness, saturation and color inclination value S of the current pixel; An intermediate matrix obtaining module, configured to obtain the intermediate value δ of the color correction matrix of the current pixel based on the dual color correction matrix and the color inclination value S; An attenuation factor obtaining module, configured to obtain the attenuation factor F according to the brightness and saturation of the current pixel; A final matrix obtaining module, configured to obtain the final color correction matrix value θ of the current pixel according to the intermediate value δ of the color correction matrix and the attenuation factor F.
14. A computer program, characterized in that, when the computer program is executed, it implements the steps of the novel color correction matrix solving method according to any one of claims 1 to 12.
