•The quaternion discrete fractional Krawtchouk transform (QDFrKT) is proposed for the purpose of color image processing.•The implementation of QDFrKT is given from two points of view, i.e. direct ...computation and calculation with quaternion symplectic form.•The detailed mathematical derivation of QDFrKT, together with some definition and properties are provided.•Two applications with QDFrKT are investigated, including color image encryption and color image watermarking, so as to evaluate the applicability of the proposed QDFrKT method.•The promising experiment results demonstrate the effectiveness and efficiency of our proposed QDFrKT based color image encryption and watermarking techniques.
This paper extends the traditional discrete fractional Krawtchouk transform (DFrKT) with quaternion theory to quaternion discrete fractional Krawtchouk transform (QDFrKT) for the purpose of color image processing. Also, the implementation of QDFrKT is given from two points of view, i.e. direct computation and calculation with quaternion symplectic form. The detailed mathematical derivation together with definition and some properties of quaternion algebra are provided. In order to evaluate the applicability of the proposed QDFrKT method, two applications are investigated, including color image encryption and color image watermarking. For color image encryption, experiments are conducted on key sensitivity, histogram analysis, and noise attacks; while for color image watermarking, experiments are conducted on watermarking invisibility and the robustness on attacks of media filter, average filter, Gaussian filter, and geometric attacks. Moreover, with the imperfect decryption property of the encryption algorithm, a potential application of the encryption strategy for designing watermarking algorithm is discussed. The promising experiment results demonstrate the effectiveness and efficiency of our proposed QDFrKT based color image encryption and watermarking techniques.
•A color image cryptosystem based on dynamic DNA encryption and a four-wing hyperchaotic system is presented.•Dynamic DNA encoding and decoding rules for all the pixels are generated and dependent on ...the plain image.•A novel diffusion mechanism based on random numbers related to plaintext (DMRNRP) is introduced to diffuse the DNA sequences of the plain image.•The image encryption method is highly sensitive to the plain image.•Experimental results demonstrate that the proposed encryption algorithm has good security performance.
This paper presents a color image cryptosystem based on dynamic DNA encryption and chaos. The color plain image is firstly decomposed into red, green and blue components, and then a simultaneous intra-inter-component permutation mechanism dependent on the plaintext (SCPMDP) is introduced to shuffle them. Secondly, convert the recombined permutated components into a DNA matrix by a DNA encoding rule, and subsequently, different from the traditional DNA sequence operations according to the law of binary calculation, a diffusion mechanism based on random numbers related to plaintext (DMRNRP) is presented to diffuse it. Further, transform the diffused DNA matrix into a decimal one according to a DNA decoding rule, and divide it into three equal images. Finally, to enhance security of the image cryptosystem, the second confusion scheme is applied to respectively scramble images, and the color cipher image is gotten. A four-wing hyperchaotic system is used to provide pseudo-random chaotic sequences, SHA 384 hash function of the plain image and external parameters are combined to compute its initial values, and one-time-pad encryption policy makes the proposed encryption effectively resist plaintext attacks. Experimental results and security analysis demonstrate that our encryption algorithm has good performance and may resist against various typical attacks.
Nowadays, security in data transfer is of special importance. Images are of the most attractive kinds of data in the encryption domain. Color images are more attractive than the gray-level images due ...to provision of more information. In the present study, various existing color (RGB mode) image encryption schemes have been examined comprehensively based on the application domains in addition to summarizing over 50 studies in this field, most of which being published in the last year. In addition, in this study, color image encryption has been categorized into ten schemes, then the proposed schemes have been compared and their advantages and limitations have been highlighted. Moreover, a complete list of common security analysis techniques for (gray or color) image encryption has been discussed which are capable of evaluating the method potential resistance to different possible attacks. The present study has been carried out to provide detailed knowledge regarding the existing image encryption schemes in the area of the RGB images. Finally, in the current study, various open issues and research directions have been considered in order to explore the promising areas for future developments.
•Based on 2D CS and embedding technique, an efficient visually meaningful double color image encryption algorithm is introduced.•Optimized measurement matrices for 2D CS are obtained by use of ...chaotic system, kronecker product (KP) and singular value decomposition (SVD).•Feature parameters of plain images are utilized to calculate initial values of LSS and 6D hyperchaotic system, and these parameters are embedded into carrier image to avoid additional transmission and storage.•Simulation results and performances analyses demonstrate the effectiveness and security of the proposed encryption scheme.
An efficient visually meaningful double color image encryption algorithm is proposed by combining 2D compressive sensing (CS) with an embedding technique. First, two color images are measured by measurement matrices in two directions to achieve simultaneous compression and encryption, in which low-dimensional matrices generated from Logistic-Sine system (LSS) are extended with Kronecker product (KP), and the resulting high-dimensional matrices optimized by singular value decomposition (SVD) are employed as measurement matrices. Second, the compressed cipher images are confused by index sequences produced by a 6D hyperchaotic system. Finally, a visually meaningful cipher image is obtained by embedding permutated cipher images into a color carrier image. The final cipher image and plain image are of the same size, which greatly reduces the storage space and transmission bandwidth. To enhance the relationship of our algorithm with plain images and prevent vulnerability to known-plaintext and chosen-plaintext attacks, SHA 256 hash values and feature parameters of plain images are combined to generate the initial values of the LSS and 6D hyperchaotic system, and these parameters are both embedded into the carrier image to avoid additional transmission and storage. Simulation results and performance analyses demonstrate the effectiveness and security of the proposed image encryption scheme.
•A lossless and robust color image encryption algorithm is proposed based on DNA sequence operations, one-time keys and spatiotemporal chaos.•The NCA map-based CML has excellent chaotic properties ...compared with the typical CML and other chaotic systems.•The final key streams are closely related to both the secret keys and the original image.•The DNA-level merge-shuffling process, the division and DNA-level diffusion process, and the pixel-level diffusion process are designed to strengthen the security and robustness of the cryptosystem.
In this paper, we introduce a novel color image encryption algorithm based on DNA sequence operations, one-time keys and the spatiotemporal chaos. Firstly, the key streams are generated by the NCA map-based CML, where the hash function SHA-256 is used to update the system parameters and initial conditions combining with the plain-image and the secret keys. Secondly, decompose the plain-image into the red, green, blue components, and convert them randomly into three DNA matrices by the DNA encoding rules. Further, combine three DNA matrices into a new DNA matrix, and then perform the row-wise and column-wise permutations on it. Thirdly, divide the shuffled DNA matrix into three equal blocks and implement the DNA addition, subtraction and XOR operations on these DNA blocks. Finally, transform the DNA matrices into the decimal matrices separately according to the DNA decoding rules. To enhance the security of the cryptosystem, a diffusion process is further carried out by using the key streams. Thus, the resulting cipher-image is attained. Experimental results and security analysis show that the presented encryption algorithm has a good encryption effect and can resist various typical attacks.
Color Image Analysis by Quaternion-Type Moments Chen, Beijing; Shu, Huazhong; Coatrieux, Gouenou ...
Journal of mathematical imaging and vision,
01/2015, Letnik:
51, Številka:
1
Journal Article
Recenzirano
Odprti dostop
In this paper, by using the quaternion algebra, the conventional complex-type moments (CTMs) for gray-scale images are generalized to color images as quaternion-type moments (QTMs) in a holistic ...manner. We first provide a general formula of QTMs from which we derive a set of quaternion-valued QTM invariants (QTMIs) to image rotation, scale and translation transformations by eliminating the influence of transformation parameters. An efficient computation algorithm is also proposed so as to reduce computational complexity. The performance of the proposed QTMs and QTMIs are evaluated considering several application frameworks ranging from color image reconstruction, face recognition to image registration. We show they achieve better performance than CTMs and CTM invariants (CTMIs). We also discuss the choice of the unit pure quaternion influence with the help of experiments.
(
i
-
j
-
k
)
/
3
appears to be an optimal choice.
•The encryption scheme using combination of the 1D chaotic map is cracked.•The insecurity problems of the original method are overcome.•An improved image encryption method is proposed.•Our method is ...more applicable than the original one.
Recently, a color image encryption using combination of the 1D chaotic map has been proposed by Pak et al. The encryption scheme has defined the new chaotic system structure, combined two Sine maps in the permutation stage, and utilized the key-streams generated by the Sine-Sine-map to confuse the permuted image. Then, linear transformation has been employed to permute the diffused image to obtain the encrypted image. However, by using Chosen-plaintext attack, we have found that the encrypted image can be completely cracked and this scheme is not applicable to secure communications. In this paper, the defects of the original algorithm have been analyzed and a Chosen plaintext attack has been proposed to crack the scheme. In addition, we propose an improved algorithm to overcome the defects in the above original algorithm. Experimental results show that the improved scheme can not only maintain the merits of the original one, but also resist the attacks.
Image decomposition is one of the most important tasks in image processing. In this paper, we develop a novel saturation-value total variation model for color image decomposition. The approach is to ...propose a variational model containing an energy functional to derive the cartoon and texture decomposition in the saturation-value color space so that the color can be kept in the resulting cartoon component. The proposed idea is different from existing color image decomposition model where color information usually exists in both cartoon and texture components. In the variational model, saturation-value total variation is incorporated for regularizing the cartoon component of a color image, meanwhile, L1 norm is considered for modeling the texture component in the saturation-value color space. Theoretically, we develop a smooth approximation approach to study the existence of the solution of the proposed optimization problem. We formulate an effective and efficient algorithm to solve the proposed minimization problem based on the framework of alternating direction method of multipliers. Numerical examples are presented to demonstrate that the performance of the proposed model is better than that of other testing methods for several testing color images.
Moments and moment invariants have been widely used as a basic feature descriptors in image analysis, pattern recognition, and image retrieval. However, they are mainly used to deal with the binary ...or gray-scale images, which lose some significant color information. Recently, quaternion techniques were introduced to conventional image moments (including Fourier–Mellin moments, Zernike/Pseudo Zernike moments, and Bessel–Fourier moments, etc.) for describing color images, and some quaternion moment and moment invariants were developed. But, the conventional image moments usually cannot effectively capture the image information, especially the edges. Besides, the kernel computation of them involves computation of a number of factorial terms, which inevitably cause the numerical stability of these moments. Based on effective polar complex exponential transform (PCET) and algebra of quaternions, we introduced the quaternion polar complex exponential transform (QPCET) for describing color images in this paper, which can be seen as the generalization of PCET for gray-level images. It is shown that the QPCETs can be obtained from the PCET of each color channel. We derived and analyzed the rotation, scaling, and translation (RST) invariant property of QPCET. We also discussed the problem of color image retrieval using QPCET. Experimental results are provided to illustrate the efficiency of the proposed color image descriptors.
•Novel quaternion shifted-Gegenbauer moments of fractional-order are derived.•The proposed moments ignore image mapping/interpolation as required by circular moments.•Quaternion shifted-Gegenbauer ...moment invariants of fractional orders are derived.•The FrQSGMs descriptors show excellent robustness to various kinds of noise.•The FrQSGMs descriptors show high recognition ability of similar color objects under various attacks.
Orthogonal moments (OMs) are used to extract features from color images. OMs with fractional orders are better than the OMs with integer orders due to their ability to extract fine features. This paper defined novel quaternion orthogonal shifted Gegenbauer moments (FrQSGMs) of fractional orders for color image analysis and recognition. Since both shifted Gegenbauer polynomials and the input digital images are defined in the domain 0, 1 × 0, 1, the proposed FrQSGMs did not need any image mapping or image interpolation. The invariance to geometric transformations of the proposed FrQSGMs is derived by expressing these moments in geometric moment invariants of fractional order. We conduct various experiments to test the accuracy, invariance to RST, sensitivity to noise, recognition of similar color images, and computational times. The proposed descriptors outperformed the existing orthogonal moments with fractional orders.
PDF
