A New Quantum Gray-Scale Image Encoding Scheme

In this paper, a new quantum images encoding scheme is proposed. The proposed scheme mainly consists of four different encoding algorithms. The idea behind of the scheme is a binary key generated randomly for each pixel of the original image. Afterwards, the employed encoding algorithm is selected corresponding to the qubit pair of the generated randomized binary key. The security analysis of the proposed scheme proved its enhancement through both randomization of the generated binary image key and altering the gray-scale value of the image pixels using the qubits of randomized binary key. The simulation of the proposed scheme assures that the final encoded image could not be recognized visually. Moreover, the histogram diagram of encoded image is flatter than the original one. The Shannon entropies of the final encoded images are significantly higher than the original one, which indicates that the attacker can not gain any information about the encoded images.     

Analysis and study of the interlaced encoding pixels in Hadamard transform spectral imager based on DMD

The key innovation in Hadamard transform spectral imager (HTSI) introduced recently is the use of digital micro-mirror device (DMD) to encode spectral information. However, because the size of individual micro-mirrors does not match the detector pixel size or for other unavoidable errors in the optical design and the system assembling, an interlaced encoding phenomenon appears on some pixels of the encoded images obtained from the detector. These interlaced encoding pixels are not encoded based on Hadamard transform, so they should be processed specially in spectrum recovery. This paper analyzes the interlaced encoding phenomenon and proposes a positioning method and a decoding method for the interlaced encoding pixels on the encoded images. In our experiment, we direct a beam of laser into our HTSI and fill the entire field of view; by observing the column vector, which is made up of the gray values of a pixel on the encoded images from the detector in sequence, the interlaced encoding pixels can be distinguished easily and a coefficient is obtained simultaneously, which denotes the ratio of the area between the left part and the right part of the interlaced encoding pixel. By substituting the coefficient and the encoded gray values of the interlaced pixel into its encoding equation, we can recover the spectral elements of the interlaced pixel with ease. By comparing the spectral curve of the interlaced encoding pixels recovered by the method mentioned in this paper and the spectral curves of its two adjacent pixels, we find the decoding results are quite effective.     

Digital information encrypted in an image using binary encoding

This paper proposes a new type of encoding methods to encrypt hidden (covert) information in host images. The encrypted information can be plot, fax, word, or network data, and it must be encoded with binary codes. All the pixels in an encoded (overt) image modulated from a host image are classified into three groups. The first group of pixels is called identification codes, used to judge whether the overt image is encoded by a method proposed in this paper or not. The second group of pixels is called type codes, used to judge the encoding type. The third group of pixels is called information codes, used to decode the encoded information. Applying the proposed encoding methods is quite convenient, and host images are not needed for decoding. Decoding covert information from overt images is rather difficult for un-authorized persons, whereas it is very easy for designers or authorized persons. Therefore, the proposed methods are very useful.     

基于DMD的哈达玛变换成像光谱仪中交错编码像素点的研究

近年来在哈达玛变换成像光谱仪研究领域中最重要的技术革新在于数字微镜器件在这种光谱仪中的应用,但同时也带来了一些相应的技术问题需要克服。详细的描述和分析了由于数字微镜器件在哈达玛变换光谱仪中的应用导致的编码图像上的部分像素点出现的一种交错编码现象;这种特殊的像素点,编码过程不符合哈达玛变换,在光谱复原过程中需要特殊处理。针对这种交错编码像素点,提出了一种标识方法和解码方法。实验中,向光谱仪中导入一束激光并充满整个视场,在编码的激光图像中确定交错编码像素点的位置。然后变换编码模板上哈达玛编码码道的空间位置,采集两组针对目标的编码图像,通过观察编码图像上一个像素点的灰度值组成的列向量中非零常量与零元素的个数,可以分辨它是否是一个交错编码像素点。其中一组编码图像上交错编码像素点光谱曲线可以通过对另一组编码图像上相应位置的像素点进行哈达玛反变换得到。实线结果证明了这一方法的可行性。     

Multiple-image encryption by two-step phase-shifting interferometry and spatial multiplexing of smooth compressed signal

A multiple-image encryption method based on two-step phase-shifting interferometry(PSI) and spatial multiplexing of a smooth compressed signal is proposed. In the encoding and encryption process, with the help of four index matrices to store original pixel positions, all the pixels of four secret images are firstly reordered in an ascending order; then, the four reordered images are transformed by five-order Haar wavelet transform and performed sparseness operation. After Arnold transform and pixels sampling operation, one combined image can be grouped with the aid of compressive sensing(CS)and spatial multiplexing techniques. Finally, putting the combined image at the input plane of the PSI encryption scheme,only two interferograms ciphertexts can be obtained. During the decoding and decryption, utilizing all the secret key groups and index matrices keys, all the original secret images can be successfully decrypted by a wave-front retrieval algorithm of two-step PSI, spatial de-multiplexing, inverse Arnold transform, inverse discrete wavelet transform, and pixels reordering operation.     

A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism

This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.     

A mixed scrambling operation for hiding image

A mixed scrambling operation is defined by the use of Arnold transform and Baker mapping. Following a designed sequence, the combined scrambling operation is utilized for changing the pixel position of secret image under the control of a random matrix. At the same time, the pixel value is altered by random bit shift for obtaining an encrypted image encoded in N-bit data. The operations mentioned above are employed for all pixels of original secret image. Finally an encrypted image is obtained and encoded into N-bit data being from the input image. Some numerical simulations have been achieved for checking the performance of the image hiding scheme.     

An improved fast fractal image compression using spatial texture correlation

This paper utilizes a spatial texture correlation and the intelligent classification algorithm (ICA) search strategy to speed up the encoding process and improve the bit rate for fractal image compression. Texture features is one of the most important properties for the representation of an image. Entropy and maximum entry from co-occurrence matrices are used for representing texture features in an image. For a range block, concerned domain blocks of neighbouring range blocks with similar texture features can be searched. In addition, domain blocks with similar texture features are searched in the ICA search process. Experiments show that in comparison with some typical methods, the proposed algorithm significantly speeds up the encoding process and achieves a higher compression ratio, with a slight diminution in the quality of the reconstructed image; in comparison with a spatial correlation scheme, the proposed scheme spends much less encoding time while the compression ratio and the quality of the reconstructed image are almost the same.     

Multifocus image fusion scheme using focused region detection and multiresolution

To solve the fusion problem of the multifocus images of the same scene, a novel algorithm based on focused region detection and multiresolution is proposed. In order to integrate the advantages of spatial domain-based fusion methods and transformed domain-based fusion methods, we use a technique of focused region detection and a new fusion method of multiscale transform (MST) to guide pixel combination. Firstly, the initial fused image is acquired with a novel multiresolution image fusion method. The pixels of the original images, which are similar to the corresponding initial fused image pixels, are considered to be located in the sharply focused regions. By this method, the initial focused regions can be determined, and the techniques of morphological opening and closing are employed for post-processing. Then the pixels within the focused regions in each source image are selected as the pixels of the fused image; meanwhile, the initial fused image pixels which are located at the focused border regions are retained as the pixels of the final fused image. The fused image is then obtained. The experimental results show that the proposed fusion approach is effective and performs better in fusing multi-focus images than some current methods.     

Small target detection using bilateral filter and temporal cross product in infrared images

We introduce a spatial and temporal target detection method using spatial bilateral filter (BF) and temporal cross product (TCP) of temporal pixels in infrared (IR) image sequences. At first, the TCP is presented to extract the characteristics of temporal pixels by using temporal profile in respective spatial coordinates of pixels. The TCP represents the cross product values by the gray level distance vector of a current temporal pixel and the adjacent temporal pixel, as well as the horizontal distance vector of the current temporal pixel and a temporal pixel corresponding to potential target center. The summation of TCP values of temporal pixels in spatial coordinates makes the temporal target image (TTI), which represents the temporal target information of temporal pixels in spatial coordinates. And then the proposed BF filter is used to extract the spatial target information. In order to predict background without targets, the proposed BF filter uses standard deviations obtained by an exponential mapping of the TCP value corresponding to the coordinate of a pixel processed spatially. The spatial target image (STI) is made by subtracting the predicted image from the original image. Thus, the spatial and temporal target image (STTI) is achieved by multiplying the STI and the TTI, and then targets finally are detected in STTI. In experimental result, the receiver operating characteristics (ROC) curves were computed experimentally to compare the objective performance. From the results, the proposed algorithm shows better discrimination of target and clutters and lower false alarm rates than the existing target detection methods.     

Analysis of phase encoding for optical encryption

A phase encoded image is encrypted using the double random phase encoding technique, (DRPE). The effects of using a variable dynamic range of phase distribution during phase encoding (pre-encryption) are examined. We begin by phase encoding the input image using the full phase range, from −π to π. We perform numerically perfect encryption and we then introduce errors into the decrypting phase-keys in the form of a pseudo-random distribution (position and phase) of incorrect pixels values. By quantifying the resulting error in the attempted decryptions, for increasing amounts of error in the decrypting phase-keys, we examine the effects of reducing the phase range to, +/− (π − Δ). In this way we attempt to improve the phase encoding procedure for use with the DRPE technique. When the pixel values calculated, during an attempted decryption, fall outside the phase range used to phase encode the assigned input image, we examine different methods of redistributing the value of that pixel to an assigned value within the allowed phase range. The effects of the phase quantisation used in the keys are also examined.     

基于像素置乱技术的多重双随机相位加密法

提出一种基于像素置乱技术的多重双随机相位加密法,对该加密法中像素置乱操作的原理进行了阐述,并且提出在光学上实现像素置乱操作和解置乱操作的途径.在计算机上模拟实现了该加密法,并且得到很好的加密解密结果.仿真结果证实仅用部分加密图像来解密也能够得到原图像,并且得到随着待解密的加密图像像素的增加,解密图像的信号能量、噪声以及信噪比的变化曲线.最后分析比较了该加密法与双随机相位加密法,得到该加密法与双随机相位加密法相比具有更高的保密性,而且解密图像的信噪比也不会因为引入像素置乱操作而降低.     

拉普拉斯约束低秩表示的高光谱图像异常检测

伴随高光谱图像的广泛使用,高光谱图像技术得到长足的发展,其中高光谱图像异常检测技术越发受到重视。为了解决传统高光谱图像异常检测技术的实用性和检测效果不佳的问题,提出一种新颖的低秩表示检测算法。对于高光谱图像,大部分背景像元均可以被少量主要的背景像元组合近似地表示,且它们的表示系数将会位于低秩的空间中。在剩下无法被主要背景像元表示的稀疏部分中存在着异常像元,则可以被检测算法提取出来。在低秩表示中,背景像元字典的构建将会影响高光谱图像中背景像元的表示。如直接从现有高光谱图像中提取背景像元构建字典,会导致异常像元对背景像元字典的污染。而利用待检测高光谱图像观测数据和由光谱组成原理可合成的潜在未观测数据来构建背景像元字典,提取出背景像元的主要特征,有利于更好地分离出稀疏异常像元的信息。并且高光谱图像数据存在高维几何结构特点,通过引入拉普拉斯矩阵来约束空间中局部相似的像元对于待检测像元的表示作用,获得更接近于真实的表示系数。实验结果分别在仿真数据和真实数据上验证,与传统方法相比,提出的方法通过有效地突出异常像元提高了检出率和抑制了背景像元,降低了误检率。     

A novel chaotic image encryption algorithm using block scrambling and dynamic index based diffusion

In this paper, we propose a novel chaotic image encryption algorithm which involves a block image scrambling scheme and a new dynamic index based diffusion scheme. Firstly, the original image is divided into two equal blocks by vertical or horizontal directions. Then, we use the chaos matrix to construct X coordinate, Y coordinate and swapping control tables. By searching the X coordinate and Y coordinate tables, the swapping position of the processing pixel is located. The swapping control table is used to control the swapping of the pixel in the current block or the other block. Finally, the dynamic index scheme is applied to the diffusing of the scrambled image. The simulation results and performance analysis show that the proposed algorithm has an excellent safety performance with only one round.     

Robust image encryption by combined use of integral imaging and pixel scrambling techniques

A robust image encryption method by using the integral imaging and pixel scrambling (PS) techniques is proposed. In this method, pixels of the cover image are scrambled with the PS technique and elemental images for this scrambled image are picked up through a lenslet array. Subsequently, an encrypted image is obtained by scrambling these picked-up elemental images. Since this encrypted image has the hologram-like property of data redundancy resulted from the integral imaging scheme, while it can as well be decoded by multiple keys such as the orders of pixel scrambling and the pickup conditions of the elemental images, its security against the various attacks could be dramatically improved. Good experimental results also confirm that the proposed method could provide more enhanced robustness against data loss and Gaussian noises compared to the conventional methods.     

A least squares quantization table method for direct reconstruction of MR images with non-Cartesian trajectory

The direct Fourier transform method is a straightforward solution with high accuracy for reconstructing magnetic resonance (MR) images from nonuniformly sampled k-space data, given that the optimal density compensation function is selected and the underlying magnetic field is sufficiently uniform. The computation however is very time-consuming, making it impractical especially for large-size images. In this paper, the least squares quantization table (LSQT) method is proposed to accelerate the direct Fourier transform computation, similar to the recently proposed methods such as using look-up table (LUT) or equal-phase-line (EPL). With LSQT, all the image pixels are first classified into several groups where the Lloyd-Max quantization scheme is used to ensure the minimal classification error. The representative value of each group is stored in a small-size LSQT in advance to reduce the computational load. The pixels in the same group receive the same contribution, which is calculated only once for each group instead of for each pixel, resulting in the reduction of computation because the number of groups is far smaller than the number of pixels. Finally, each image pixel is mapped into the nearest group and its representative value is used to reconstruct the image. The experimental results show that the LSQT method requires far smaller memory size than the LUT method and fewer multiplication operations than the LUT and EPL methods. Moreover, the LSQT method can perform large-size reconstructions that achieve comparable or higher accuracy as compared to the EPL and gridding methods when the appropriate parameters are given. The inherent parallel structure also makes the LSQT method easily adaptable to a multiprocessor system.     

An ensemble template algorithm for extracting targets from blurred infrared images

In this paper, an ensemble template algorithm is proposed to extract targets from blurred infrared images. First, the image pixels are divided according to their gray values into three pixel sets, a target set, a background set and the third set without class label. Second, the neighborhood statistical characteristics for each pixel are calculated as its template features. Third, ensemble detectors are designed using target pixels and background pixels based on their template features, and these ensemble detectors are used to detect the third pixel set. To evaluate the performance of the proposed extraction algorithm, this paper compares the ensemble template with other extraction algorithms using blurred infrared image of hand trace. Experimental results show that the ensemble template algorithm proposed in this paper exhibits better extraction performance.     

一种基因芯片光学扫描图像倾斜校正方法研究

针对在基因芯片光学扫描时产生的图像倾斜问题,提出了一种基于像素灰度的芯片图像倾斜校正方法。结合基因芯片图像的结构特点,基于行、列方向像素灰度定义芯片图像的校正指标。在角度检测范围内,利用折半搜索方法,基于校正指标来检测芯片图像的校正角度和芯片图像的校正位置。实验结果表明,该方法能有效地检测多类基因芯片图像的倾斜角度,具有较强的鲁棒性和实用性。     

Binary encoding method to encrypt Fourier-transformed information of digital images

An encoding method is used to encrypt the Fourier-transformed information of a hidden (covert) digital image in an overt image, while the Fourier-transformed information must be encoded with binary codes. All of the pixels in an overt image are classified into five groups that are called identification, type, tracing, dimension, and information codes. Identification codes are used to judge if the overt image contains codes that belong to the proposed encoding method or not; type codes are used to judge the encoding type; tracing codes are used to judge the encoding trace; dimension codes are used to judge the size of the hidden information; and information codes are used to decode the hidden information. Applying the proposed encoding method is rather easy, and host images corresponding to overt images are not needed for decoding work. The experiment has demonstrated four types of encoding for the proposed encoding method to reconstruct covert images without any distortion or only with a little distortion.     

Double image encryption using double pixel scrambling and random phase encoding

A novel double image encryption method is proposed by utilizing double pixel scrambling technique and random fractional Fourier domain encoding. One of the two original images is encoded into the phase of a complex signal after being scrambled by one matrix, and the other original image encoded into its amplitude after being scrambled by another matrix. The complex signal is then encrypted into stationary white noise by utilizing double random phase encoding in fractional Fourier domain. By applying the correct keys with fractional orders, the random phase masks and the pixel scrambling operation, the two original images can be retrieved without cross-talk. Numerical simulations have been done to prove the validity and the security of the proposed encryption method.