CN109977686B - Image encryption method and image processing equipment based on composite chaotic system - Google Patents

Image encryption method and image processing equipment based on composite chaotic system Download PDF

Info

Publication number
CN109977686B
CN109977686B CN201910257477.0A CN201910257477A CN109977686B CN 109977686 B CN109977686 B CN 109977686B CN 201910257477 A CN201910257477 A CN 201910257477A CN 109977686 B CN109977686 B CN 109977686B
Authority
CN
China
Prior art keywords
image
composite
chaotic system
plaintext
block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910257477.0A
Other languages
Chinese (zh)
Other versions
CN109977686A (en
Inventor
孙希延
刘冬梅
纪元法
蓝如师
罗笑南
严素清
付文涛
李有明
赵松克
符强
王守华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guilin University of Electronic Technology
Original Assignee
Guilin University of Electronic Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guilin University of Electronic Technology filed Critical Guilin University of Electronic Technology
Priority to CN201910257477.0A priority Critical patent/CN109977686B/en
Publication of CN109977686A publication Critical patent/CN109977686A/en
Application granted granted Critical
Publication of CN109977686B publication Critical patent/CN109977686B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/602Providing cryptographic facilities or services
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/0021Image watermarking
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/50Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

The invention is applicable to the field of image encryption and provides an image encryption method and image processing equipment based on a composite chaotic system. The method comprises the following steps: using the Sine mapping, the Tent mapping and the Logistic mapping as seed mapping, and expanding the chaotic range by utilizing cascade operation and nonlinear combination to generate a composite chaotic system; the method comprises the steps of utilizing a composite chaotic system to generate a chaotic sequence to pre-encrypt a plaintext image to generate a pre-encrypted image; and acquiring a reference image, combining the pre-encrypted image and the reference image, and generating a visually meaningful ciphertext image by using a Discrete Wavelet Transform (DWT) algorithm. The method has wider chaos range and more complex chaos behaviors, and improves the encryption performance; and because the ciphertext image which is meaningful visually is generated, the attack probability is reduced, the chosen plaintext attack and the exhaustive attack can be resisted, and the encryption performance is better.

Description

Image encryption method and image processing equipment based on composite chaotic system
Technical Field
The invention belongs to the field of image encryption, and particularly relates to an image encryption method and image processing equipment based on a composite chaotic system.
Background
The chaos-based image encryption technology is a technology for designing an encryption algorithm by using the basic characteristics of a chaos sequence and the characteristics of a digital image so as to improve the encryption safety and the operation efficiency. Because the digital images contain core confidential and sensitive information, such as military images, medical images and the like, reliable, fast and robust encryption algorithms are needed to ensure the safety and effectiveness in the transmission process. Chaos is a phenomenon that random-like behavior can occur without adding any random factors, namely, inherent randomness exists and extremely sensitive dependence on initial values exists.
The Chinese patent application with the application publication number of CN103971317A and the invention name of 'an image encryption method based on fractional order chaotic mapping' discloses an image encryption method based on fractional order chaotic mapping, wherein a mathematical model of the method is established on the basis of fractional order discrete Logistic mapping, and image information is scrambled by utilizing a fractional order discrete chaotic signal to achieve the effect of image encryption. However, the chaos range of the scheme is narrow, and the chaos behavior is not good. As shown in fig. 3 of the specification of the chinese patent application, only the plaintext image is encrypted, and the formed ciphertext image is an image having a pattern, which is very easy to be found by an attacker and has a high possibility of being attacked.
Disclosure of Invention
The invention aims to provide an image encryption method based on a composite chaotic system, a computer readable storage medium and an image processing device, and aims to solve the problems that the chaotic range of the image encryption method based on fractional order chaotic mapping is narrow, the chaotic behavior is poor, and a formed ciphertext image is an image with a pattern, is easy to be found by an attacker and has high possibility of being attacked.
In a first aspect, the present invention provides an image encryption method based on a composite chaotic system, the method comprising:
using the Sine mapping, the Tent mapping and the Logistic mapping as seed mapping, and expanding the chaotic range by utilizing cascade operation and nonlinear combination to generate a composite chaotic system;
the method comprises the steps of utilizing a composite chaotic system to generate a chaotic sequence to pre-encrypt a plaintext image to generate a pre-encrypted image;
and acquiring a reference image, combining the pre-encrypted image and the reference image, and generating a visually meaningful ciphertext image by using a Discrete Wavelet Transform (DWT) algorithm.
In a second aspect, the present invention provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the steps of the composite chaotic system-based image encryption method as described above.
In a third aspect, the present invention provides an image processing apparatus comprising:
one or more processors;
a memory; and
one or more computer programs, the processor and the memory being connected by a bus, wherein the one or more computer programs are stored in the memory and configured to be executed by the one or more processors, the processor implementing the steps of the composite chaotic system based image encryption method as described above when executing the computer programs.
In the invention, sine mapping, tent mapping and Logistic mapping are used as seed mapping, and a chaotic range is expanded by utilizing cascade operation and nonlinear combination to generate a composite chaotic system; the method comprises the steps of utilizing a composite chaotic system to generate a chaotic sequence to pre-encrypt a plaintext image to generate a pre-encrypted image; and a visually meaningful ciphertext image is generated by utilizing a Discrete Wavelet Transform (DWT) algorithm. Therefore, the method has wider chaos range and more complex chaos behaviors, and improves the encryption performance; and because the ciphertext image which is meaningful visually is generated, the attack probability is reduced, chosen plaintext attack and exhaustive attack can be resisted, and the encryption performance is better. In addition, because the discrete wavelet transform DWT algorithm is utilized, the following advantages are provided: (1) Ensuring that the watermark cannot be eliminated under JPEG2000 lossy compression; (2) In order to improve the robustness of the watermark, the human visual system is not very sensitive to the changes of the image edge and texture part, but is very sensitive to the changes of the image smooth area. Meanwhile, since the discrete wavelet transform can well limit the edge and texture parts to its detail descendants (such as HL, LH, HH, the coefficients of the detail sub-bands often represent the edge parts of the image), embedding the watermark therein can achieve good visual effect; (3) the watermark may be embedded directly in the compressed domain; (4) The discrete wavelet transform can greatly reduce or remove the correlation among different extracted features by selecting a proper filter, and can be quickly realized.
Drawings
Fig. 1 is a flowchart of an image encryption method based on a composite chaotic system according to an embodiment of the present invention.
Fig. 2 is a structural diagram of a composite chaotic system according to a first embodiment of the present invention.
FIG. 3 is an LE index and bifurcation diagram of the SL-T composite chaotic system.
Fig. 4 is a schematic diagram of the different types of DCT coefficients in an 8 x 8 sized DCT block.
Fig. 5 is a block diagram of the structure of an image encryption algorithm.
Fig. 6 is a block diagram of the structure of discrete wavelet transform.
Fig. 7 is a schematic diagram of an encryption process.
Fig. 8 is a block diagram of a specific structure of an image processing apparatus according to a third embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more clearly apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
In order to illustrate the technical means of the present invention, the following description is given by way of specific examples.
The first embodiment is as follows:
referring to fig. 1, an image encryption method based on a composite chaotic system according to an embodiment of the present invention includes the following steps:
s101, using the Sine mapping, the Tent mapping and the Logistic mapping as seed mapping, and expanding the chaos range by utilizing cascade operation and nonlinear combination to generate a composite chaos system.
In the first embodiment of the present invention, the nonlinear combination specifically includes addition and modulo operation.
The structure of the composite chaotic system is shown in figure 2. The definition formula of the composite chaotic system is as follows:
x n+1 =F(G(x n )+H(x n ))mod1 (1)
where F (x), G (x), and H (x) are three seed maps. In the first embodiment of the present invention, a Sine map, a Tent map, and a Logistic map are selected as seed maps, and x is n Is the iteration value, x n+1 Is the output of a complex chaotic system, and mod operation is to ensure that the output is limited to 0,1]. The complex chaotic system enhances the complexity of the structure, can be more random and is beneficial to cascade combination and nonlinear operation.
The composite chaotic system interacts three seed mappings through two operations simultaneously, and a plurality of new chaotic mappings can be generated. S, T and L are used for representing Sine mapping, tent mapping and Logistic mapping respectively, and due to the fact that multiple composite chaotic systems are generated by seed mapping, chaotic ranges and chaotic behaviors of all the composite chaotic systems are verified one by one, and the composite chaotic system with the widest chaotic range is obtained and is an LS-T composite chaotic system. The LE value and the bifurcation graph of the LS-T composite chaotic system are shown in figure 3, and it can be seen from the graph that the LE value of the LS-T system is positive in the ranges of u e (0.08, 0.23), u e (0.33, 0.49) and u e (0.51, 1), and the LS-T composite chaotic system has a wider chaotic range and better chaotic behavior.
The LS-T composite chaotic system has the definition formula as follows:
x n+1 =4usin(πx n )((1-usin(πx n ))+(1-u)sin(πx n ))mod1 (2)
the LS-T composite chaotic system has better chaotic behavior and wider chaotic range and is better applied to an image encryption algorithm.
S102, the compound chaotic system is used for generating a chaotic sequence to pre-encrypt the plaintext image to generate a pre-encrypted image.
In the first embodiment of the present invention, S102 may specifically include the following steps:
s1021, extracting a significant area in the plaintext image by using a selective encryption algorithm;
s1022, the composite chaotic system is used for generating chaotic sequences to pre-encrypt the salient regions of the plaintext images, and pre-encrypted images are generated.
The S1021 specifically may include the following steps:
s10211, detecting a significant region of the plaintext image.
The method specifically comprises the following steps:
extracting color features and brightness features, namely calculating the difference between each block and all other blocks, and directly taking corresponding brightness feature values or color feature values C of the two blocks;
extracting texture features, and solving the distance between the texture vectors by using the norm, namely the difference T.
Fig. 4 shows different types of DCT coefficients in an 8 × 8 DCT (Discrete Cosine Transform) block, where the DCT coefficients in a block include DC coefficients and AC coefficients, and the black squares are DC coefficients. Among the DCT coefficients, the DC coefficient reflects the average value of each 8 × 8 pixel block.
Assuming that the three color components of red, green and blue of the DC coefficient are r, g and b, respectively, the calculation of the luminance characteristic can be calculated using equation (3):
l=(r+g+b)/3 (3)
a new red component R, a new green component G, a new blue component B and a new yellow component Y are generated from R, G and B, and the calculation formulas are shown in formulas (4) to (7):
R=r-(g+b)/2 (4)
G=g-(r+b)/2 (5)
B=b-(r+g)/2 (6)
Y=(r+g)/2-|r-b|/2-b (7)
according to the obtained new red component R, new green component G, new blue component B and new yellow component Y, the red-green confrontation component and the yellow-blue confrontation component obtained by adopting a color dual-confrontation system are the two color characteristics which are obtained:
C rg =R-G (8)
C by =B-Y (9)
the texture information of the image block is represented by AC coefficients. All points of each component of the luminance feature are added separately to obtain the total coefficient values of the three components, i.e. the texture feature T of each DCT block:
T={t LF ,t MF ,t HF } (10)
wherein, t LF 、t MF And t HF Representing the sum of all points of the respective portions of low, intermediate and high frequencies, respectively.
S10212, selecting a Gaussian algorithm based on position coordinate Euclidean distance between pixel blocks to define weight coefficients of block differences, and combining a brightness feature difference matrix, a color feature difference matrix and a texture feature difference matrix to obtain a significant region graph S k (k =1,2,3,4) and incorporates the salient region map S using a fusion rule based on normalization k (k =1,2,3,4) results in a final saliency map S of the plaintext image based on the compressed domain.
The formula for calculating the euclidean distance is shown in formula (11), and the euclidean distance d is the position coordinate between the block i and the block j ij
Figure BDA0002014191910000061
The formula for calculating the weight coefficient is shown in formula (12), and the weight coefficient ω based on the euclidean distance between the block i and the block j is shown in formula (12) ij
Figure BDA0002014191910000062
Where σ is a parameter of the gaussian model, σ =20 may be set.
The formula for calculating the feature saliency map is shown in formula (13), and the kth feature saliency value of block i
Figure BDA0002014191910000063
Figure BDA0002014191910000064
Wherein k ∈ { I, C rg ,C by ,T};
Figure BDA0002014191910000065
The feature difference between DCT block i and block j for each feature.
Obtaining a salient region map S of brightness, color and texture features according to the formulas (11), (12) and (13) k (k=1,2,3,4)。
Combining saliency map S using normalization-based fusion rules k (k =1,2,3,4) the final saliency map S of the plaintext image based on the compressed domain is obtained:
S=∑γN(S k )+βΠN(S k ) (14)
wherein N is a normalization operation; γ and β are weight coefficients of corresponding portions in the formula, and γ = β =0.2 is set in the first embodiment of the present invention.
The S1022 specifically may include the following steps:
s10221, obtaining encryption key k e Initializing a control parameter f for a significant region of a plaintext image of size M × N 0 ,h 0 ,x 0 And u.
S10222, starting from L =1 to L, a loop is performed: the selected composite chaotic system is utilized to generate a chaotic sequence X, the replacement operation and the arrangement operation are executed, and the pixels of the salient region of the plaintext image are rearranged at the spatial position, so that the salient region of the plaintext image is changed into a meaningless chaotic image, the robustness is better, and a pre-encrypted image and a decryption password are generated.
Encryption key k e From f to f 0 ,h 0 ,x 0 And u is composed of f 0 ,h 0 And x 0 Is f n ,h n And x n Of (4) is calculated. Furthermore, the permutation process and the permutation process are repeated four times to improve the diffusion and aliasing characteristics of the pre-encrypted image. Thus, the initial value f 0 And h 0 Update L =4 times according to equation (15):
Figure BDA0002014191910000071
wherein p is in the range of [0,1]Random number of (c) 0 Denotes an initial value, x 0 Is the initial value of the chaotic sequence.
The image encryption algorithm contains two important steps: the permutation operation and the permutation operation are performed as shown in fig. 5. As can be seen from the figure, the image encryption algorithm has more control parameters, can ensure the key sensitivity of the encrypted image, and can resist various attacks, such as exhaustive attack and plaintext selection attack.
S103, acquiring a reference image, combining the pre-encrypted image and the reference image, and generating a visually meaningful ciphertext image by using a Discrete Wavelet Transform (DWT) algorithm.
Since the pre-encrypted image is an image with texture or obvious patterns, and the final objective of the first embodiment of the present invention is to generate a visually meaningful ciphertext image, the pre-encrypted image needs to be transformed by a digital watermarking algorithm. There are various digital watermarking algorithms, such as a spatial domain watermarking algorithm, a frequency domain watermarking algorithm, and the like. In the first embodiment of the present invention, a discrete wavelet transform algorithm in a frequency domain watermarking algorithm is mainly used. The discrete wavelet transform carries out multi-scale thinning on signals (functions) step by step through telescopic translation operation, finally achieves frequency subdivision at high frequency, can automatically adapt to the requirement of time-frequency signal analysis, and can focus on any details of the signals.
In the first embodiment of the present invention, S103 may specifically include the following steps:
acquiring a reference image, the reference image being a visually significant image;
the pre-encrypted image is converted into a visually meaningful ciphertext image having substantially the same size and pattern as the reference image using a Discrete-wavelet-Transform-based Content Transform (DWTCT). It is possible for the ciphertext image to be somewhat blurred compared to the reference image, but the degree of blurring can be reduced by adjusting the wavelet filter so that the ciphertext image and the reference image look identical.
The structure block diagram of the discrete wavelet transform is shown in fig. 6.
The DWTCT algorithm converts the pre-Encrypted Image P into a Visually Meaningful ciphertext Image, i.e., a visualized ciphertext Image (VMEI), having a size and pattern similar to the reference Image R. The image encryption method based on the composite chaotic system provided by the embodiment of the invention generates completely different VMEIs by using different reference images. This DWTCT is defined in equation (16). Ciphertext image E = T (P, R, K) of the same size as the reference image t )(16)
Wherein T represents DWTCT; k t Is a set of parameters for DWTCT that defines a set of wavelet filters for discrete wavelet transforms; r and E are reference and ciphertext images having the same size.
To sum up, on the premise that the size of the selected reference image is consistent with that of the plaintext image, the discrete wavelet transform can generate a better watermark effect on the pre-encrypted image, the generated ciphertext image is an image which is visually significant, that is, the ciphertext image is not different from a common image, and the purpose of protecting important information in the image is achieved, and a schematic diagram of the encryption process is shown in fig. 7. Where fig. 7 (a) is a plaintext image, fig. 7 (b) is a saliency image, fig. 7 (c) is a pre-encryption image, and fig. 7 (d) is a ciphertext image.
The second embodiment:
the second embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps of the image encryption method based on the composite chaotic system provided in the first embodiment of the present invention are implemented.
Example three:
fig. 8 is a block diagram showing a specific structure of an image processing apparatus according to a third embodiment of the present invention, and an image processing apparatus 100 includes: one or more processors 101, a memory 102, and one or more computer programs, wherein the processors 101 and the memory 102 are connected by a bus, the one or more computer programs are stored in the memory 102 and configured to be executed by the one or more processors 101, and the processor 101 implements the steps of the image encryption method based on the composite chaotic system as provided in the first embodiment of the present invention when executing the computer programs.
In the invention, sine mapping, tent mapping and Logistic mapping are used as seed mapping, and a chaotic range is expanded by utilizing cascade operation and nonlinear combination to generate a composite chaotic system; the method comprises the steps of utilizing a composite chaotic system to generate a chaotic sequence to pre-encrypt a plaintext image to generate a pre-encrypted image; and a visually meaningful ciphertext image is generated by utilizing a Discrete Wavelet Transform (DWT) algorithm. Therefore, the method has wider chaotic range and more complex chaotic behaviors, and improves the encryption performance; and because the ciphertext image which is meaningful visually is generated, the attack probability is reduced, the chosen plaintext attack and the exhaustive attack can be resisted, and the encryption performance is better. In addition, because the discrete wavelet transform DWT algorithm is utilized, the following advantages are provided: (1) Ensuring watermark will not be eliminated under JPEG2000 lossy compression; (2) In order to improve the robustness of the watermark, the human visual system is not very sensitive to the changes of the image edge and texture part, but is very sensitive to the changes of the image smooth area. Meanwhile, since the discrete wavelet transform can well limit the edge and texture portions to its detail descendants (such as High-low, HL), low-High, LH, and High-frequency subbands (High-High, HH), the coefficients of the detail subbands often represent the edge portions of the image), good visual effects can be obtained by embedding the watermark therein; (3) the watermark may be embedded directly in the compressed domain; (4) The discrete wavelet transform can greatly reduce or remove the correlation among different extracted features by selecting a proper filter, and can be quickly realized.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable storage medium, and the storage medium may include: read Only Memory (ROM), random Access Memory (RAM), magnetic or optical disks, and the like.
The above description is intended to be illustrative of the preferred embodiment of the present invention and should not be taken as limiting the invention, but rather, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.

Claims (6)

1. An image encryption method based on a composite chaotic system is characterized by comprising the following steps:
using Sine mapping, tent mapping and Logistic mapping as seed mapping, expanding chaos range by utilizing cascade operation and nonlinear combination, and generating a composite chaos system, wherein the composite chaos system has a definition formula as follows: x is the number of n+1 =F(G(x n )+H(x n ) Mod1, where F (x), G (x), and H (x) are three seed maps, sine, tent, and Logistic, respectively, x n Is the iteration value, x n+1 Is the output of the composite chaotic system;
extracting a significant region in a plaintext image by using a selective encryption algorithm;
generating a chaotic sequence by using a composite chaotic system to pre-encrypt a significant region of a plaintext image to generate a pre-encrypted image;
acquiring a reference image, combining the pre-encrypted image with the reference image, and generating a visually meaningful ciphertext image by using a Discrete Wavelet Transform (DWT) algorithm;
the extracting the significant region in the plaintext image by using the selective encryption algorithm specifically comprises the following steps:
detecting a salient region of a plaintext image;
selecting a Gaussian algorithm based on the Euclidean distance of position coordinates among pixel blocks to define weight coefficients of block differences, and combining a brightness characteristic, a color characteristic and a texture characteristic difference matrix to obtain a significant region graph S k (k =1,2,3,4) and incorporates the saliency region map S using a fusion rule based on normalization k (k =1,2,3,4) obtaining a final saliency map S of the plaintext image based on the compressed domain;
the pre-encrypting the significant region of the plaintext image by using the chaos sequence generated by the composite chaotic system to generate the pre-encrypted image specifically comprises the following steps:
obtaining an encryption key k e Initializing a control parameter f for a significant region of a plaintext image of size M × N 0 ,h 0 ,x 0 And u;
starting from L =1 to L, a loop is performed: and generating a chaotic sequence X by using the selected composite chaotic system, executing a replacement operation and an arrangement operation, rearranging the pixels of the significant region of the plaintext image at the spatial position, and generating a pre-encrypted image and a decryption password.
2. The method of claim 1, wherein S, T and L are used to represent a Sine map, a Tent map and a Logistic map, respectively, and the composite chaotic system is an LS-T composite chaotic system, and the LS-T composite chaotic system has a definition formula: x is the number of n+1 =4usin(πx n )((1-usin(πx n ))+(1-u)sin(πx n ))mod1。
3. The method according to claim 1, wherein said detecting a salient region of a plaintext image comprises the steps of:
extracting color features and brightness features, namely calculating the difference between each block and all other blocks, and directly taking corresponding brightness feature values or color feature values C of the two blocks;
extracting texture features, and solving the distance between the texture vectors by using a norm, namely the difference T;
the color feature extraction specifically comprises the following steps:
assuming that the three color components of red, green and blue of the DC coefficient are r, g and b, respectively, the calculation of the luminance characteristic is performed by using the formula l = (r + g + b)/3;
a new red component R, a new green component G, a new blue component B and a new yellow component Y are generated from R, G, B, and the calculation formula is as follows:
R=r-(g+b)/2;G=g-(r+b)/2;B=b-(r+g)/2;Y=(r+g)/2-|r-b|/2-b;
according to the obtained new red component R, new green component G, new blue component B and new yellow component Y, the red-green confrontation component and the yellow-blue confrontation component obtained by adopting the color dual confrontation system are the two color characteristics which are obtained: c rg =R-G;C by =B-Y;
The extraction of the textural features specifically comprises the following steps:
texture information of the image block is represented by AC coefficients; adding all the points of each component of the brightness characteristic respectively to obtain the total coefficient value of the three components, namely the texture characteristic T of each DCT block, T = { T = { (T) } LF ,t MF ,t HF }; wherein, t LF 、t MF And t HF Represents the sum of all points of the respective portions of low, intermediate and high frequencies, respectively;
the selection is based on the Gaussian algorithm of the Euclidean distance of the position coordinates between pixel blocks to define the weight coefficient of block difference, and the difference matrix of the brightness characteristic, the color characteristic and the texture characteristic is combined to obtain a significant region graph S k (k =1,2,3,4) and incorporates the saliency region map S using a fusion rule based on normalization k (k =1,2,3,4) the final saliency map S of the plaintext image based on the compressed domain is obtained by:
formula for calculating Euclidean distance as
Figure FDA0004054462570000031
Shown is the Euclidean distance d of the position coordinates between block i and block j ij
The formula for calculating the weight coefficient is as follows
Figure FDA0004054462570000032
As shown, the weight coefficient ω based on the euclidean distance between the block i and the block j ij (ii) a Wherein σ is a parameter of the gaussian model;
formula for calculating a saliency map
Figure FDA0004054462570000033
Shown is the k-th characteristic significance value of block i->
Figure FDA0004054462570000034
Wherein k ∈ { I, C rg ,C by ,T};/>
Figure FDA0004054462570000035
Finally obtaining a significant area map S of brightness, color and texture characteristics for the characteristic difference between the DCT blocks i and j of each characteristic k (k=1,2,3,4);
Combining saliency map S using normalization-based fusion rules k (k =1,2,3,4) to obtain a final saliency map S of the plaintext image based on the compressed domain, S = ∑ γ N (S) k )+βΠN(S k ) (ii) a Wherein N is a normalization operation; γ and β are weight coefficients of corresponding parts in the formula, respectively;
the encryption key k e From f 0 ,h 0 ,x 0 And u is composed of f 0 ,h 0 And x 0 Is f n ,h n And x n The initial value of (1);
the permutation and arrangement process is repeated four times with an initial value of f 0 And h 0 According to the formula
Figure FDA0004054462570000036
Update L =4 times, where p is in the range [0,1%]Random number of c 0 Denotes an initial value, x 0 Is the initial value of the chaotic sequence.
4. The method of any of claims 1 to 3, wherein the obtaining a reference image, combining the pre-encrypted image and the reference image, and generating the visually significant ciphertext image using the Discrete Wavelet Transform (DWT) algorithm specifically comprises:
acquiring a reference image, the reference image being a visually significant image;
the pre-encrypted image is converted to a visually meaningful ciphertext image having substantially the same size and pattern as the reference image using a discrete wavelet transform-based content transform.
5. A computer-readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the steps of the composite chaotic system based image encryption method according to any one of claims 1 to 4.
6. An image processing apparatus comprising:
one or more processors;
a memory; and
one or more computer programs, the processor and the memory being connected by a bus, wherein the one or more computer programs are stored in the memory and configured to be executed by the one or more processors, characterized in that the processor, when executing the computer programs, implements the steps of the composite chaotic system based image encryption method according to any one of claims 1 to 4.
CN201910257477.0A 2019-04-01 2019-04-01 Image encryption method and image processing equipment based on composite chaotic system Active CN109977686B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910257477.0A CN109977686B (en) 2019-04-01 2019-04-01 Image encryption method and image processing equipment based on composite chaotic system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910257477.0A CN109977686B (en) 2019-04-01 2019-04-01 Image encryption method and image processing equipment based on composite chaotic system

Publications (2)

Publication Number Publication Date
CN109977686A CN109977686A (en) 2019-07-05
CN109977686B true CN109977686B (en) 2023-03-31

Family

ID=67082191

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910257477.0A Active CN109977686B (en) 2019-04-01 2019-04-01 Image encryption method and image processing equipment based on composite chaotic system

Country Status (1)

Country Link
CN (1) CN109977686B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110414250B (en) * 2019-07-29 2021-05-11 广东工业大学 Image encryption method and device based on discrete fractional transformation and chaotic function
CN110677236B (en) * 2019-11-01 2022-10-21 辽宁工程技术大学 OFDM encryption method based on composite chaotic system and XOR operation
CN112788195B (en) * 2019-11-11 2023-08-29 阿里巴巴集团控股有限公司 Image processing method, device and equipment
CN111093098B (en) * 2019-12-30 2022-03-18 北京电子科技学院 Logistic mapping-based chaotic encryption method
CN112800444B (en) * 2021-01-19 2022-11-15 桂林电子科技大学 Color image encryption method based on two-dimensional chaotic mapping
CN114142991A (en) * 2021-12-03 2022-03-04 山西大学 Linear regular domain voice encryption system based on cascade chaotic modulation
CN115378574B (en) * 2022-08-09 2023-12-19 徐州恒佳电子科技有限公司 Lightweight dynamic image data encryption method and system
CN117174233B (en) * 2023-11-02 2024-02-09 山东大数据医疗科技有限公司 Management platform based on health big data

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101604439A (en) * 2008-06-13 2009-12-16 西北工业大学 A kind of color image encrypting method based on multi-chaos system
CN104766264A (en) * 2015-01-22 2015-07-08 西北工业大学 Partitioning double-layer self-adaptation diffusion image encryption method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105956992A (en) * 2016-05-23 2016-09-21 温文媖 Significance area protection method based on encryption image with visual meaning

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101604439A (en) * 2008-06-13 2009-12-16 西北工业大学 A kind of color image encrypting method based on multi-chaos system
CN104766264A (en) * 2015-01-22 2015-07-08 西北工业大学 Partitioning double-layer self-adaptation diffusion image encryption method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
孙力 ; 黄正谦 ; 梁立 ; .基于复合混沌映射与连续扩散的图像加密算法.计算机工程与设计.2017,(12),全文. *
马凌 ; 侯小毛 ; 张福泉 ; 龚芝 ; .基于复合混沌系统与人工神经网络学习的图像加密算法.电子测量与仪器学报.2018,(08),全文. *
黄晓生 ; 顾景文 ; .基于复合混沌序列与小波变换的图像加密算法.计算机工程.2007,(14),全文. *

Also Published As

Publication number Publication date
CN109977686A (en) 2019-07-05

Similar Documents

Publication Publication Date Title
CN109977686B (en) Image encryption method and image processing equipment based on composite chaotic system
Mahto et al. A survey of color image watermarking: State-of-the-art and research directions
Acharya et al. A secure and high capacity image steganography technique
Keshavarzian et al. ROI based robust and secure image watermarking using DWT and Arnold map
Kumar et al. DWT based color image watermarking using maximum entropy
Giri et al. A robust color image watermarking scheme using discrete wavelet transformation
Roy et al. A perception based color image adaptive watermarking scheme in YCbCr space
Singh et al. A secure and robust block based DWT-SVD image watermarking approach
Saturwar et al. Secure visual secret sharing scheme for color images using visual cryptography and digital watermarking
Kumar et al. Feature based steganalysis using wavelet decomposition and magnitude statistics
Asmara et al. Comparison of discrete cosine transforms (DCT), discrete Fourier transforms (DFT), and discrete wavelet transforms (DWT) in digital image watermarking
Thakur et al. Secure video steganography based on discrete wavelet transform and arnold transform
Zhang et al. Robust image watermarking algorithm based on QWT and QSVD using 2D Chebyshev-Logistic map
Thanikaiselvan et al. High security image steganography using IWT and graph theory
Elbasi Enhancing the robustness of watermarked medical images using heuristic search algorithm
Susanto et al. A robust non-blind image watermarking method using 2-level HWT-DCT
Abodena et al. Hybrid technique for robust image watermarking using discrete time fourier transform
Hajjaji et al. Combining DWT/KLT for secure transfer of color images
Goswami et al. Hybrid DCT-DWT Digital Image Steganography
Kejgir et al. Robust multichannel colour image watermarking using lifting wavelet transform with singular value decomposition
Mohammed et al. A new robust binary image embedding algorithm in discrete wavelet domain
Patsariya et al. A new block based non-blind hybrid color image watermarking approach using lifting scheme and chaotic encryption based on arnold cat map
Prajwalasimha et al. Digital image watermarking based onSine hyperbolic transformation
Kekre et al. Robust watermarking scheme using column DCT wavelet transform under various attacks
Kurniawan et al. Hiding secret data by using modulo function in quad difference expansion

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant