Low-light image enhancement method and mine image enhancement method

Abstract

The application discloses a kind of micro-light image enhancement methods, including obtaining target micro-light image;Based on gamma correction, RTV correction and histogram matching scheme, the structure diagram and texture diagram of target micro-light image are calculated;According to the structure diagram and texture diagram obtained, based on Retinex model and structure / texture guide scheme, the brightness diagram and reflection diagram of target micro-light image are calculated;The obtained brightness diagram is adjusted and adaptively corrected;Based on RTV correction scheme, the enhanced image of target micro-light image is calculated to complete the image enhancement of target micro-light image.The application also discloses a kind of mine image enhancement method comprising the micro-light image enhancement method.The application not only realizes the enhancement of micro-light image and mine image, but also has higher reliability, better accuracy and better enhancement effect.

Description

Technical Field

[0001] This invention belongs to the field of image processing, specifically designing a low-light image enhancement method and a mine image enhancement method. Background Technology

[0002] Low-light images generally refer to images taken in environments with low lighting conditions. Common examples include mine images and surveillance images taken at night. Due to the poor lighting conditions during capture, low-light images generally have poor clarity and resolution. Therefore, image enhancement for low-light images is of great importance.

[0003] Noise and color distortion have always been major challenges in low-light image enhancement. Existing low-light image enhancement schemes are generally based on the Retinex model; these schemes typically perform denoising directly on the reflectance image. However, noise in the reflectance image is often excessively amplified, making the denoising process difficult. Therefore, existing low-light image enhancement schemes often suffer from poor reliability, low accuracy, and poor results.

[0004] Mine images are a typical type of low-light image. Existing image enhancement schemes for mine images also suffer from drawbacks such as poor reliability, low accuracy, and poor results. Summary of the Invention

[0005] One of the objectives of this invention is to provide a low-light image enhancement method that is highly reliable, accurate, and effective.

[0006] The second objective of this invention is to provide a mine image enhancement method that includes the aforementioned low-light image enhancement method.

[0007] The low-light image enhancement method provided by this invention includes the following steps:

[0008] S1. Acquire a low-light image of the target;

[0009] S2. Based on gamma correction, RTV correction and histogram matching scheme, the structure map and texture map of the target low-light image are calculated;

[0010] S3. Based on the structure map and texture map obtained in step S2, calculate the brightness map and reflectance map of the target low-light image using the Retinex model and the structure / texture guidance scheme;

[0011] S4. Adjust and adaptively correct the brightness map obtained in step S3;

[0012] S5. Based on the results obtained in step S4, and using the RTV correction scheme, calculate the enhanced image of the target low-light image to complete the image enhancement of the target low-light image.

[0013] Step S2, which uses a scheme based on gamma correction, RTV correction, and histogram matching to calculate the structure map and texture map of the target low-light image, specifically includes the following steps:

[0014] For the target low-light image obtained in step S1 Preliminary enhancement was performed using gamma correction to obtain a preliminary enhanced image. for ,in This is the gamma correction process;

[0015] For the obtained preliminary enhanced image The image structure was extracted using the RTV correction scheme to obtain the structural map of the target low-light image. for ,in This refers to the RTV correction process.

[0016] For the obtained preliminary enhanced image The histogram matching scheme and CBM3D algorithm were used sequentially to process the image, resulting in a denoised texture map of the target low-light image. for ,in This describes the histogram matching process. This describes the CBM3D algorithm processing procedure.

[0017] Step S3, which involves calculating the brightness and reflectance maps of the target low-light image based on the structure and texture maps obtained in step S2, using the Retinex model and a structure / texture-guided scheme, includes the following steps:

[0018] Based on the structure map and texture map obtained in step S2, the following optimization model is constructed:

[0019]

[0020] In the formula The brightness map of the target low-light image; The reflectance map of the target in low-light conditions; This refers to element-wise matrix multiplication. Noise map of the target low-light image; For the target low-light image; These are the smoothness weight values; Let Frobenius norm be the matrix. These are the parameters of the structure diagram, and , It is a first-order differential operator. This is a set minimum number to prevent the gradient from being zero; To constrain weight values; For texture map parameters, and ; This is the noise weight value;

[0021] The constructed optimization model is solved to obtain the brightness map and reflectance map of the target low-light image.

[0022] Solving the constructed optimization model includes the following steps:

[0023] For the three independent variables I, R, and N in the optimization model, an alternating optimization scheme is used to solve the problem:

[0024] First, the reflectance map R and the noise map N are treated as constants, and the brightness map I is estimated.

[0025] Then, treating the brightness map I and noise map N as constants, the reflection map R is estimated;

[0026] Finally, the brightness map I and the reflection map R are treated as constants, and the noise map N is estimated.

[0027] Repeat the above estimation process until the set conditions are met; finally, the brightness map and reflectance map of the target low-light image are obtained.

[0028] The solution process includes the following steps:

[0029] (1) Initialization: The value of the initial brightness map is the average value of the R, G, and B channels; the value of the initial reflection map is 1; the value of the initial noise map is 0.

[0030] (2) Setting This represents the brightness map in the k-th iteration. This represents the reflection graph of the k-th iteration. This represents the noise map for the k-th iteration. This represents the initial value of the brightness map calculated in the k-th iteration. This represents the initial value of the reflection map calculated in the k-th iteration;

[0031] (3) Luminance map estimation:

[0032] The optimization equation for the brightness map in the (k+1)th iteration is expressed as:

[0033]

[0034]

[0035] In the formula As a weighting factor; Indicates a channel; For target low-light image c-channel data; This represents the c-channel data of the noisy image N in the k-th iteration. This represents the c-channel data of the k-th iteration reflection image R;

[0036] The equation Vectorization: Setting As a matrix-vectorization operator, the brightness map vector i is represented as: The initial value vector of the brightness map calculated in the (k+1)th iteration Represented as Structure diagram parameter vector Represented as ;

[0037] Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained:

[0038]

[0039] In the formula Represents the L2 norm;

[0040] Taking the first derivative of the above vector calculation formula and setting it to 0, we get:

[0041]

[0042] In the formula It is the identity matrix;

[0043] Will Convert back to matrix form to obtain ;

[0044] (4) Estimation of reflectance:

[0045] The optimization equation for the reflection map in the (k+1)th iteration is expressed as:

[0046]

[0047]

[0048] In the formula As a weighting factor; The symbol for dividing corresponding elements of a matrix;

[0049] The equation Convert to vector form: Define the reflection map vector Represented as The initial value vector of the reflection map calculated in the (k+1)th iteration Represented as Texture map parameter vector Represented as ;

[0050] Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained:

[0051]

[0052] Taking the first derivative of the above vector calculation formula and setting it to 0, we get:

[0053]

[0054] Will Convert back to matrix form to obtain ;

[0055] (5) Noise map estimation:

[0056] Noise map of the (k+1)th iteration The optimization equation is expressed as:

[0057]

[0058] In the formula As a weighting factor;

[0059] Direct solution ;

[0060] Repeat steps (3) to (5) above until the set conditions are met: or Or the number of repetitions reaches the set value;

[0061] Finally, the brightness map of the target low-light image is obtained. and reflection diagram .

[0062] Step S4, which involves adjusting and adaptively correcting the brightness map obtained in step S3, specifically includes the following steps:

[0063] Brightness chart adjustment:

[0064] Brightness map After gamma transformation, and then compared with the reflection map Element-wise multiplication of the matrices yields the enhanced brightness map. ;

[0065] Luminance map adaptive correction:

[0066] target low-light image At each pixel, gamma correction is performed to obtain a gamma-corrected luminance map. ;

[0067] When performing gamma correction for each pixel, the adaptively corrected gamma correction value is calculated using the following formula:

[0068]

[0069]

[0070]

[0071]

[0072]

[0073]

[0074] In the formula To obtain a low-light image of the target coordinates Gamma correction value at the location; For target low-light image The average brightness; For target low-light image coordinates The brightness value at that location; The desired target brightness value; This is the global gamma correction value; This is the lower limit of the brightness value; This is the upper limit of the brightness value; This is the adaptively corrected gamma correction value;

[0075] Using adaptively corrected gamma values, the target low-light image is processed in the R, G, and B channels. Perform adaptive brightness correction.

[0076] Step S5, which involves calculating the enhanced image of the target low-light image based on the result obtained in step S4 and the RTV correction scheme, specifically includes the following steps:

[0077] Enhanced brightness map The image structure was extracted using an RTV correction scheme to obtain the first structural image. ;

[0078] Gamma-corrected brightness map The image structure was extracted using an RTV correction scheme to obtain the second structure map. ;

[0079] The enhanced image of the target low-light image is calculated. for .

[0080] The present invention also provides a mine image enhancement method including the aforementioned low-light image enhancement method, specifically including the following steps:

[0081] A. Obtain the mine image to be enhanced;

[0082] B. Using the mine image to be enhanced as the target low-light image, the low-light image enhancement method described above is used for image enhancement;

[0083] C. Obtain the image enhancement result of the mine image to be enhanced, and complete the mine image enhancement.

[0084] The low-light image enhancement method and mine image enhancement method provided by this invention extract the structure map and texture map of the low-light image based on gamma correction, RTV correction and histogram matching scheme. Based on the Retinex model, structure / texture guidance scheme and adaptive correction scheme, it not only enhances the low-light image and mine image, but also has higher reliability, better accuracy and better enhancement effect. Attached Figure Description

[0085] Figure 1 This is a schematic diagram of the process flow for the low-light image enhancement method of the present invention.

[0086] Figure 2 This is a schematic diagram of the process flow of the mine image enhancement method of the present invention.

[0087] Figure 3 This is a schematic diagram illustrating the enhancement effect of the mine image enhancement method of the present invention. Detailed Implementation

[0088] like Figure 1 The diagram shown illustrates the process flow of the low-light image enhancement method of the present invention: This low-light image enhancement method disclosed in the present invention includes the following steps:

[0089] S1. Acquire a low-light image of the target;

[0090] S2. Based on gamma correction, RTV correction, and histogram matching schemes, the structure map and texture map of the target low-light image are calculated; specifically, the following steps are included:

[0091] For the target low-light image obtained in step S1 Because its structure and texture details are not clear enough, gamma correction is first used for preliminary enhancement to obtain a preliminary enhanced image. for ,in This is the gamma correction process;

[0092] For the obtained preliminary enhanced image The image structure was extracted using the RTV correction scheme to obtain the structural map of the target low-light image. for ,in This refers to the RTV correction process.

[0093] For texture extraction, low-light images are inevitably affected by noise, requiring denoising processing. However, the magnitude and type of noise are often unknown. To better denoise, the initial enhanced image is then processed. The histogram matching scheme and CBM3D algorithm were used sequentially to process the image, resulting in a denoised texture map of the target low-light image. for ,in This describes the histogram matching process. This refers to the CBM3D algorithm processing procedure;

[0094] S3. Based on the structure map and texture map obtained in step S2, and using the Retinex model and structure / texture-guided scheme, calculate the brightness map and reflectance map of the target low-light image; including the following steps:

[0095] Texture maps already have good enhancement and denoising effects, but they are usually somewhat smooth; therefore, the method of this invention is based on the Retinex model and the structure / texture guidance scheme for further processing.

[0096] Based on the structure map and texture map obtained in step S2, the following optimization model is constructed:

[0097]

[0098] In the formula The brightness map of the target low-light image; The reflectance map of the target in low-light conditions; This refers to element-wise matrix multiplication. Noise map of the target low-light image; For the target low-light image; These are the smoothness weight values; Let Frobenius norm be the matrix. These are the parameters of the structure diagram, and , It is a first-order differential operator. This is a set minimum number to prevent the gradient from being zero; To constrain weight values; For texture map parameters, and ; This is the noise weight value;

[0099] In the model, To ensure fidelity, the result of multiplying the decomposed brightness map and reflectance map, plus the noise map, is compared to the original. Figure 1 To; Used to constrain the smoothness of the brightness map; Used to constrain the structure graph, aiming to remove noise while preserving texture; Used to constrain noise levels;

[0100] The constructed optimization model is solved to obtain the brightness map and reflectance map of the target low-light image;

[0101] The solution involves the following steps:

[0102] For the three independent variables I, R, and N in the optimization model, an alternating optimization scheme is used to solve the problem:

[0103] First, the reflectance map R and the noise map N are treated as constants, and the brightness map I is estimated.

[0104] Then, treating the brightness map I and noise map N as constants, the reflection map R is estimated;

[0105] Finally, the brightness map I and the reflection map R are treated as constants, and the noise map N is estimated.

[0106] Repeat the above estimation process until the set conditions are met; finally, the brightness map and reflectance map of the target low-light image are obtained.

[0107] In practice, the following steps can be taken:

[0108] (1) Initialization: The value of the initial brightness map is the average value of the R, G, and B channels; the value of the initial reflection map is 1; the value of the initial noise map is 0.

[0109] (2) Setting This represents the brightness map in the k-th iteration. This represents the reflection graph of the k-th iteration. This represents the noise map for the k-th iteration. This represents the initial value of the brightness map calculated in the k-th iteration. This represents the initial value of the reflection map calculated in the k-th iteration;

[0110] (3) Luminance map estimation:

[0111] The optimization equation for the brightness map in the (k+1)th iteration is expressed as:

[0112]

[0113]

[0114] In the formula As a weighting factor; Indicates a channel; For target low-light image c-channel data; This represents the c-channel data of the noisy image N in the k-th iteration. This represents the c-channel data of the k-th iteration reflection image R;

[0115] The equation Vectorization: Setting As a matrix-vectorization operator, the brightness map vector i is represented as: The initial value vector of the brightness map calculated in the (k+1)th iteration Represented as Structure diagram parameter vector Represented as ;

[0116] Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained:

[0117]

[0118] In the formula Represents the L2 norm;

[0119] Taking the first derivative of the above vector calculation formula and setting it to 0, we get:

[0120]

[0121] In the formula It is the identity matrix;

[0122] Will Convert back to matrix form to obtain ;

[0123] (4) Estimation of reflectance:

[0124] The optimization equation for the reflection map in the (k+1)th iteration is expressed as:

[0125]

[0126]

[0127] In the formula As a weighting factor; The symbol for dividing corresponding elements of a matrix;

[0128] The equation Convert to vector form: Define the reflection map vector Represented as The initial value vector of the reflection map calculated in the (k+1)th iteration Represented as Texture map parameter vector Represented as ;

[0129] Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained:

[0130]

[0131] Taking the first derivative of the above vector calculation formula and setting it to 0, we get:

[0132]

[0133] Will Convert back to matrix form to obtain ;

[0134] (5) Noise map estimation:

[0135] Noise map of the (k+1)th iteration The optimization equation is expressed as:

[0136]

[0137] In the formula As a weighting factor;

[0138] Direct solution ;

[0139] Repeat steps (3) to (5) above until the set conditions are met: or Or the number of repetitions reaches a set value; in specific implementation, The preferred value is 0.01, and the preferred setting for the number of repetitions is 20;

[0140] Finally, the brightness map of the target low-light image is obtained. and reflection diagram ;

[0141] S4. Adjust and adaptively correct the brightness map obtained in step S3; specifically including the following steps:

[0142] Brightness chart adjustment:

[0143] Brightness map After gamma transformation, and then compared with the reflection map Element-wise multiplication of the matrices yields the enhanced brightness map. ;

[0144] Luminance map adaptive correction:

[0145] target low-light image At each pixel, gamma correction is performed to obtain a gamma-corrected luminance map. ;

[0146] When performing gamma correction for each pixel, the adaptively corrected gamma correction value is calculated using the following formula:

[0147]

[0148]

[0149]

[0150]

[0151]

[0152]

[0153] In the formula To obtain a low-light image of the target coordinates Gamma correction value at the location; For target low-light image The average brightness; For target low-light image coordinates The brightness value at that location; The desired target brightness value; This is the global gamma correction value; This is the lower limit of the brightness value; This is the upper limit of the brightness value; This is the adaptively corrected gamma correction value;

[0154] Using adaptively corrected gamma values, the target low-light image is processed in the R, G, and B channels. Performing adaptive brightness correction can make the average brightness of the three channels more consistent, thereby improving color distortion and enhancing the image to a suitable brightness.

[0155] During correction, when the pixel value is greater than the image mean, When the value is less than 1, gamma correction is strengthened to increase the pixel value to a higher brightness level than expected; conversely, when the pixel value is less than the image mean, the coefficient... If the value is greater than 1, the enhancement effect weakens, and the enhanced brightness value will be lower than the expected brightness value. Finally, in order to prevent excessive enhancement or excessive weakening, the present invention also introduces upper and lower limits for amplitude limiting.

[0156] S5. Based on the results obtained in step S4, and using the RTV correction scheme, calculate the enhanced image of the target low-light image to complete the image enhancement of the target low-light image; specifically, this includes the following steps:

[0157] Enhanced brightness map The image structure was extracted using an RTV correction scheme to obtain the first structural image. ;

[0158] Gamma-corrected brightness map The image structure was extracted using an RTV correction scheme to obtain the second structure map. ;

[0159] The enhanced image of the target low-light image is calculated. for .

[0160] like Figure 2 The diagram shown is a schematic flowchart of the mine image enhancement method of the present invention: The mine image enhancement method disclosed in this invention, which includes the aforementioned low-light image enhancement method, specifically includes the following steps:

[0161] A. Obtain the mine image to be enhanced;

[0162] B. Using the mine image to be enhanced as the target low-light image, the low-light image enhancement method described above is used for image enhancement;

[0163] C. Obtain the image enhancement result of the mine image to be enhanced, and complete the mine image enhancement.

[0164] like Figure 3 The diagram shows the enhancement effect of the mine image enhancement method of the present invention. Figure 3 As can be seen, the image enhancement method of the present invention can effectively enhance low-light images in a mining environment, and it has high reliability, good accuracy, and good results.

Claims

1. A low-light image enhancement method, comprising the following steps: S1. Acquire a low-light image of the target; S2. Based on gamma correction, RTV correction, and histogram matching schemes, the structure map and texture map of the target low-light image are calculated; specifically, the following steps are included: For the target low-light image obtained in step S1 Preliminary enhancement was performed using gamma correction to obtain a preliminary enhanced image. for ,in This is the gamma correction process; For the obtained preliminary enhanced image The image structure was extracted using the RTV correction scheme to obtain the structural map of the target low-light image. for ,in This refers to the RTV correction process. For the obtained preliminary enhanced image The histogram matching scheme and CBM3D algorithm were used sequentially to process the image, resulting in a denoised texture map of the target low-light image. for ,in This describes the histogram matching process. This refers to the CBM3D algorithm processing procedure; S3. Based on the structure map and texture map obtained in step S2, and using the Retinex model and structure / texture-guided scheme, calculate the brightness map and reflectance map of the target low-light image; including the following steps: Based on the structure map and texture map obtained in step S2, the following optimization model is constructed: In the formula The brightness map of the target low-light image; The reflectance map of the target in low-light image; This refers to element-wise multiplication of a matrix. Noise map of the target low-light image; For the target low-light image; These are the smoothness weight values; The Frobenius norm of the matrix; These are the parameters of the structure diagram, and , It is a first-order differential operator. This is a set minimum number to prevent the gradient from being zero; To constrain the weight values; For texture map parameters, and ; This represents the noise weighting value. The constructed optimization model is solved to obtain the brightness map and reflectance map of the target low-light image; S4. Adjust and adaptively correct the brightness map obtained in step S3; specifically including the following steps: Brightness chart adjustment: Brightness map After gamma transformation, and then compared with the reflection map Element-wise multiplication of the matrices yields the enhanced brightness map. ; Luminance map adaptive correction: target low-light image At each pixel, gamma correction is performed to obtain a gamma-corrected luminance map. ; When performing gamma correction for each pixel, the adaptively corrected gamma correction value is calculated using the following formula: In the formula To obtain a low-light image of the target coordinates Gamma correction value at the location; For target low-light image The average brightness; For target low-light image coordinates The brightness value at that location; The desired target brightness value; This is the global gamma correction value; This is the lower limit of the brightness value; This is the upper limit of the brightness value; This is the adaptively corrected gamma correction value; Using adaptively corrected gamma values, the target low-light image is processed in the R, G, and B channels. Perform adaptive brightness correction; S5. Based on the results obtained in step S4, and using the RTV correction scheme, calculate the enhanced image of the target low-light image to complete the image enhancement of the target low-light image; specifically, this includes the following steps: Enhanced brightness map The image structure was extracted using an RTV correction scheme to obtain the first structural image. ; Gamma-corrected brightness map The image structure was extracted using an RTV correction scheme to obtain the second structure map. ; The enhanced image of the target low-light image is calculated. for .

2. The low-light image enhancement method according to claim 1, characterized in that... Solving the constructed optimization model includes the following steps: For the three independent variables I, R, and N in the optimization model, an alternating optimization scheme is used to solve the problem: First, the reflectance map R and the noise map N are treated as constants, and the brightness map I is estimated. Then, treating the brightness map I and noise map N as constants, the reflection map R is estimated; Finally, the brightness map I and the reflection map R are treated as constants, and the noise map N is estimated. Repeat the above estimation process until the set conditions are met; Finally, the brightness and reflectance maps of the target low-light image are obtained.

3. The low-light image enhancement method according to claim 2, characterized in that... The solution process includes the following steps: (1) Initialization: The value of the initial brightness map is the average value of the R, G, and B channels; the value of the initial reflection map is 1; the value of the initial noise map is 0. (2) Setting This represents the brightness map in the k-th iteration. This represents the reflection graph of the k-th iteration. This represents the noise map for the k-th iteration. This represents the initial value of the brightness map calculated in the k-th iteration. This represents the initial value of the reflection map calculated in the k-th iteration; (3) Luminance map estimation: The optimization equation for the brightness map in the (k+1)th iteration is expressed as: In the formula As a weighting factor; Indicates a channel; For target low-light image c-channel data; This represents the c-channel data of the noisy image N in the k-th iteration. This represents the c-channel data of the k-th iteration reflection image R; The equation Vectorization: Setting As a matrix-vectorization operator, the brightness map vector i is represented as: The initial value vector of the brightness map calculated in the (k+1)th iteration Represented as Structure diagram parameter vector Represented as ; Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained: In the formula Represents the L2 norm; Taking the first derivative of the above vector calculation formula and setting it to 0, we get: In the formula It is the identity matrix; Will Convert back to matrix form to obtain ; (4) Estimation of reflectance: The optimization equation for the reflection map in the (k+1)th iteration is expressed as: In the formula As a weighting factor; The sign for dividing corresponding elements of a matrix; The equation Convert to vector form: Define the reflection map vector Represented as The initial value vector of the reflection map calculated in the (k+1)th iteration Represented as Texture map parameter vector Represented as ; Let D be the Toeplitz matrix obtained from the discrete gradient operator and forward difference, then there exists Define a diagonal matrix for Thus, the vector calculation formula is obtained: Taking the first derivative of the above vector calculation formula and setting it to 0, we get: Will Convert back to matrix form to obtain ; (5) Noise map estimation: Noise map of the (k+1)th iteration The optimization equation is expressed as: In the formula As a weighting factor; Direct solution ; Repeat steps (3) to (5) above until the set conditions are met: or Or the number of repetitions reaches the set value; Finally, the brightness map of the target low-light image is obtained. and reflection diagram .

4. A mine image enhancement method comprising the low-light image enhancement method according to any one of claims 1 to 3, characterized in that... Specifically, the steps include the following: A. Obtain the mine image to be enhanced; B. Using the mine image to be enhanced as the target low-light image, image enhancement is performed using the low-light image enhancement method described in any one of claims 1 to 3; C. Obtain the image enhancement result of the mine image to be enhanced, and complete the mine image enhancement.

Images