基于隐写术的图像置乱算法

基于置乱技术在隐写术中的作用,一种新的置乱方法被提出,此方法置乱的对象是频域嵌入法中的小波系数.将图论中的笛卡儿积引入了进来,通过图论的方法来阐述置乱的过程.从系数应放置的位置入手,计算出可嵌入系数应放置的位置,对照该位置进行可嵌入系数的搬移来达到可嵌入系数的均匀分布.从理论和实验两方面对置乱效果进行验证,证明了此算法可以达到隐写术中均匀置乱的要求.     

Analysis and improvement of the quantum Arnold image scrambling

We investigate the quantum Arnold image scrambling proposed by Jiang et al. (Quantum Inf Process 13(5):1223–1236, 2014). It is aimed to realize Arnold and Fibonacci image scrambling in quantum computer. However, the algorithm does not perceive the particularities of “mod \(2^{n}\) ,” multiply by 2, and subtraction in binary arithmetic. In this paper, a possible simplified version is presented based on 3 theorems and a corollary which represent the particularities of binary arithmetic. The theoretical analysis indicates that the network complexity is dropped from 140n \(\sim \) 168n to 28n \(\sim \) 56n and the unitarity of circuits is not destroyed.     

The quantum realization of Arnold and Fibonacci image scrambling

The quantum Fourier transform, the quantum wavelet transform, etc., have been shown to be a powerful tool in developing quantum algorithms. However, in classical computing, there is another kind of transforms, image scrambling, which are as useful as Fourier transform, wavelet transform, etc. The main aim of image scrambling, which is generally used as the preprocessing or postprocessing in the confidentiality storage and transmission, and image information hiding, was to transform a meaningful image into a meaningless or disordered image in order to enhance the image security. In classical image processing, Arnold and Fibonacci image scrambling are often used. In order to realize these two image scrambling in quantum computers, this paper proposes the scrambling quantum circuits based on the flexible representation for quantum images. The circuits take advantage of the plain adder and adder modulo $N$ to factor the classical transformations into basic unitary operators such as Control-NOT gates and Toffoli gates. Theoretical analysis indicates that the network complexity grows linearly with the size of the number to be operated.     

分形Hilbert曲线混合Gray码的图像加密算法研究

基于Hilbert曲线与Gray码,提出两种针对任意矩形彩色图像的加密算法,其一是对图像像素点的空域置乱,其二是对像素点的24位R、G、B分量的空域置乱,解密过程即加密过程的逆。实验证明,提出的算法具有更高的执行效率,并能更好地降低像素之间的相关性,尤其是后一种算法,具有非常高的图像置乱度。     

一种基于含水印量子图像的自适应量子隐写算法

利用NEQR量子图像表示法,提出了一种能在含水印量子载体图像中实现隐蔽通信的量子隐写算法。新算法借助水印通常拥有很好的稳健性和其特有的自恢复系统,对秘密信息的稳健性进行了多重强化。相比于之前的量子隐写算法,新算法不仅强化了秘密信息自身的稳健性,而且通过量子线路的设计提高了其嵌入和提取的可执行性和执行效率。经实验仿真结果和性能分析验证,新算法在保留原有隐蔽性和安全性基础上,进一步提高了秘密信息的稳健性和嵌入率。     

A novel quantum image steganography algorithm based on exploiting modification direction

Multimedia Tools and Applications - Quantum image steganography is the art and science of hiding secret information into quantum carrier images. This paper proposes a novel quantum image...     

发送方可否认图像隐写

目的 图像隐写是指将秘密信息隐藏到载体图像中,生成含密图像并在公共信道中传输。隐写分析旨在识别图像中是否隐藏秘密信息。不论何种隐写方案,都会在一定程度上被隐写分析识破,从而导致胁迫攻击,即攻击者找到发送方或接收方,胁迫其提交经过验证的秘密信息。为了保护秘密信息的隐蔽通信,对抗胁迫攻击的可否认方案亟待研究。在密码学领域,为了对抗胁迫攻击,已经提出了可否认加密的概念及相关方案并受到关注与研究。而在隐写领域,有研究提出可否认隐写的概念并设计了接收方可否认隐写的框架,但没有发送方可否认隐写的相关研究。对此,本文讨论发送方可否认隐写。方法 设计方案的通用框架,并构造两个方案:基于可逆网络的发送方可否认图像隐藏方案和基于可否认加密的发送方可否认图像隐写方案。在发送方可否认隐写的框架下,发送方可使用虚假的秘密信息生成与攻击者手中相同的含密图像,以欺骗攻击者,逃脱胁迫攻击,保护真实的秘密信息。结果 实验结果表明,两个方案都是可行且有效的,与原始隐写方案相比,可否认方案达到了发送方可否认功能的同时,均不会显著降低含密图像的视觉质量(峰值信噪比(peak signal-to-noise ratio,PSN...     

图像非加性隐写综述

图像非加性隐写不仅能更好地维持图像元素的分布,而且具有较高的抗检测性能.首先对图像非加性隐写方法进行了梳理,将其分为两大类:非加性失真设计和非加性隐写编码设计.进一步将非加性失真设计总结为3类:基于理论模型、基于修改原则和基于对抗检测的方法,对这些方法进行了对比.最后分析了非加性隐写面临的困难问题和未来的发展思路.     

图像置乱的相对置乱度评价方法

定义了衡量图像置乱效果的标准,拓展了衡量图像置乱效果的方法,且填补了对该方法进行系统评价的空缺.首先结合混沌理论、熵的概念及图像自身属性,定义了乱图像的标准,并给出一幅趋于这个标准的乱图像生成方法及过程;在定义与生成标准乱图像的基础上,进一步明确提出了评价图像置乱效果的相对置乱度的计算方法.对这种方法进行了全面的测试,实验结果表明,该方法具有相应的灵敏度、可用性和适应性.最后也探讨了对图像置乱效果计算方法进行评价的框架.     

一种新的数字图像置乱方法

常见的基于位置空间的数字图像置乱方法存在不能改变图像统计特性的缺陷,同时置乱过程缺乏随机性,保密性不高。针对以上问题,提出了一种新的数字图像色彩空间置乱方法。该方法基于快速数论变换,置乱速度快,变换矩阵形式不固定,逆变换矩阵求解简单,恢复图像完全无损,且通过选取合适的参数,经过一次迭代就可以达到满意的置乱效果。实验结果表明,置乱后的图像接近白噪声,提高了保密信息的迷惑性,同时还原图像易于实现,有较好的实用性。     

基于均匀置乱的图像位置置乱衡量方法

由于图像置乱分成位置和像素值置乱两类,图像置乱衡量也从这两方面进行分析。目前基于像素值的衡量效果依赖于原始图像,存在局限性;基于位置的衡量随着置乱距离的不同效果也有很大偏差,同样存在局限性。从图像位置置乱的实质出发,提出均匀置乱的概念,从偏离度和均匀度的角度对图像位置置乱效果进行衡量。通过对大量实验结果的分析得出,该衡量算法可以准确地衡量图像置乱程度,与人的视觉评价保持一致,具有可行性和有效性。     

Secret image sharing with steganography and authentication

A novel approach to secret image sharing based on a (k,n)-threshold scheme with the additional capabilities of steganography and authentication is proposed. A secret image is first processed into n shares which are then hidden in n user-selected camouflage images. It is suggested to select these camouflage images to contain well-known contents, like famous character images, well-known scene pictures, etc., to increase the steganographic effect for the security protection purpose. Furthermore, an image watermarking technique is employed to embed fragile watermark signals into the camouflage images by the use of parity-bit checking, thus providing the capability of authenticating the fidelity of each processed camouflage image, called a stego-image. During the secret image recovery process, each stego-image brought by a participant is first verified for its fidelity by checking the consistency of the parity conditions found in the image pixels. This helps to prevent the participant from incidental or intentional provision of a false or tampered stego-image. The recovery process is stopped if any abnormal stego-image is found. Otherwise, the secret image is recovered from k or more authenticated stego-images. Some effective techniques for handling large images as well as for enhancing security protection are employed, including pixelwise processing of the secret image in secret sharing, use of parts of camouflage images as share components, adoption of prime-number modular arithmetic, truncation of large image pixel values, randomization of parity check policies, etc. Consequently, the proposed scheme as a whole offers a high secure and effective mechanism for secret image sharing that is not found in existing secret image sharing methods. Good experimental results proving the feasibility of the proposed approach are also included.     

A modified DWT-based image steganography technique

The main challenges of image steganography are imperceptibility of the cover image and no recoverability of the secret data. To deal with these challenges, a modified digital image steganography technique based on Discrete Wavelet Transform (DWT) is proposed. In proposed approach, two new concepts are being proposed to minimize the distortion in the cover image. The first one i.e. secret key computation concept is proposed to make it more robust and resistive towards steganalysis. The second one, known as blocking concept, is introduced to ensure least variation in the cover image. The proposed approach is tested over ten different cover images and two secret images. Its performance is compared with the six well-known steganography techniques. The experimental results reveal that the proposed approach performs better than the existing techniques in terms of imperceptibility, security and quality measures. The six image processing attacks are also applied on the stego-image to test the robustness of the proposed approach. The effects of compression, rotation, and application of different wavelets have also been investigated on the proposed approach. The results demonstrate the robustness of the proposed approach under different image processing attacks. Both stego-image and extracted secret images possess better visual quality.     

Increasing image compression rate using steganography

The goal of image compression is to remove the redundancies for minimizing the number of bits required to represent an image while steganography works by embedding the secret data in redundancies of the image in invisibility manner. Our focus in this paper is the improvement of image compression through steganography. Even if the purposes of digital steganography and data compression are by definition contradictory, we use these techniques jointly to compress an image. Hence, two schemes exploring this idea are suggested. The first scheme combines a steganographic algorithm with the baseline DCT-based JPEG, while the second one uses this steganographic algorithm with the DWT-based JPEG. In this study data compression is performed twice. First, we take advantage of energy compaction using JPEG to reduce redundant data. Second, we embed some bit blocks within its subsequent blocks of the same image with steganography. The embedded bits not only increase file size of the compressed image, but also decrease the file size further more. Experimental results show for this promising technique to have wide potential in image coding.     

一种图像置乱的改进算法

提出了一种改进的基于混沌的图像置乱算法.该算法在对图像运用抽样技术预处理的基础上,利用Logistic映射产生的伪随机序列,对图像进行灰度值的变换和全局的块置乱.实验仿真表明,该加密算法具有良好的加密效果,能有效地抵御统计攻击和差分攻击.     

图像置乱程度的衡量方法

图像置乱变换是信息隐藏和图像加密常用的方法,如何衡量一种置乱变换的好坏,是研究的热点和难点问题。基于置乱前后位置变化的方法可以作为一个衡量的标准,但是位置变化并不能代表像素点值的改变,而且把图像作为一个整体来考虑也会产生一些偏差。为了克服这个缺点,提出了一种基于各点相关性的图像置乱程度衡量方法,主要是通过比较置乱前后每个点与其相邻点相关性的差异来进行衡量。由Matlab仿真结果表明,该方法可以很好地衡量图像置乱次数与置乱效果的关系,而且与人类的视觉具有比较好的一致性。     

An image processing-based crack detection technique for pressed panel products

Crack detection is an important step in assessing the quality of pressed panel products. This paper presents a fast and non-invasive crack detection technique which involves extracting the outline of the captured object and applying a unique edge line evaluation. This technique is robust against environmental condition changes and only require a low-cost web camera. After capturing an image immediately following the press process, a clear one-pixel edge line is extracted by applying a light control and a series of pre-image processing algorithms, including a valley-emphasis Otsu method and percolation-based shape recognition. Next, the initial detection at low resolution is applied to search for every possible crack using unique edge line and curvature evaluation. Finally, at high resolution, the windowed image of every possible crack is individually analyzed to detect existing cracks using a more specific evaluation process. All of these steps are completed within 0.5 s, thus allowing for the technique to be applied in real-time on a highly automated manufacturing line. To demonstrate the performance of the proposed technique, experiments are conducted on an aluminum plate with different patterns and the pressed panel products. The results show that the proposed technique can detect surface cracks on pressed panels with stable performance as well as high accuracy and efficiency.     

Multi-party covert communication with steganography and quantum secret sharing

In this paper, we address the “multi-party covert communication”, a stronger notion of security than standard secure multi-party communication. Multi-party covert communication guarantees that the process of it cannot be observed. We propose a scheme for steganographic communication based on a channel hidden within quantum secret sharing (QSS). According to our knowledge nobody has ever raised the scheme, providing us the motivation for this work. To an outside observer, participants will engage in a typical instance of QSS, just like the others. But when the session is over, covert multi-party communication has already been done. Further analysis shows that the amount of hidden information one can acquire is 0, even if either an outside observer guesses the covert communication is carrying on or a dishonest participant is eavesdropping.     

An improved quantum watermarking scheme using small-scale quantum circuits and color scrambling

In order to solve the problem of embedding the watermark into the quantum color image, in this paper, an improved scheme of using small-scale quantum circuits and color scrambling is proposed. Both color carrier image and color watermark image are represented using novel enhanced quantum representation. The image sizes for carrier and watermark are assumed to be \(2^{n+1}\times 2^{n+2}\) and \(2^{n}\times 2^{n}\), respectively. At first, the color of pixels in watermark image is scrambled using the controlled rotation gates, and then, the scrambled watermark with \(2^n\times 2^n\) image size and 24-qubit gray scale is expanded to an image with \(2^{n+1}\times 2^{n+2}\) image size and 3-qubit gray scale. Finally, the expanded watermark image is embedded into the carrier image by the controlled-NOT gates. The extraction of watermark is the reverse process of embedding it into carrier image, which is achieved by applying operations in the reverse order. Simulation-based experimental results show that the proposed scheme is superior to other similar algorithms in terms of three items, visual quality, scrambling effect of watermark image, and noise resistibility.