NEQR: a novel enhanced quantum representation of digital images

Quantum computation is becoming an important and effective tool to overcome the high real-time computational requirements of classical digital image processing. In this paper, based on analysis of existing quantum image representations, a novel enhanced quantum representation (NEQR) for digital images is proposed, which improves the latest flexible representation of quantum images (FRQI). The newly proposed quantum image representation uses the basis state of a qubit sequence to store the gray-scale value of each pixel in the image for the first time, instead of the probability amplitude of a qubit, as in FRQI. Because different basis states of qubit sequence are orthogonal, different gray scales in the NEQR quantum image can be distinguished. Performance comparisons with FRQI reveal that NEQR can achieve a quadratic speedup in quantum image preparation, increase the compression ratio of quantum images by approximately 1.5X, and retrieve digital images from quantum images accurately. Meanwhile, more quantum image operations related to gray-scale information in the image can be performed conveniently based on NEQR, for example partial color operations and statistical color operations. Therefore, the proposed NEQR quantum image model is more flexible and better suited for quantum image representation than other models in the literature.     

A novel quantum representation of color digital images

In this paper, we propose a novel quantum representation of color digital images (NCQI) in quantum computer. The freshly proposed quantum image representation uses the basis state of a qubit sequence to store the RGB value of each pixel. All pixels are stored into a normalized superposition state and can be operated simultaneously. Comparison results with the latest multi-channel representation for quantum image reveal that NCQI can achieve a quadratic speedup in quantum image preparation. Meanwhile, some NCQI-based image processing operations are discussed. Analyses and comparisons demonstrate that many color operations can be executed conveniently based on NCQI. Therefore, the proposed NCQI model is more flexible and better suited to carry out color quantum image processing.     

A flexible representation of quantum images for polynomial preparation, image compression, and processing operations

A Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation for images on quantum computers in the form of a normalized state which captures information about colors and their corresponding positions in the images. A constructive polynomial preparation for the FRQI state from an initial state, an algorithm for quantum image compression (QIC), and processing operations for quantum images are combined to build the whole process for quantum image processing on FRQI. The simulation experiments on FRQI include storing, retrieving of images and a detection of a line in binary images by applying quantum Fourier transform as a processing operation. The compression ratios of QIC between groups of same color positions range from 68.75 to 90.63% on single digit images and 6.67–31.62% on the Lena image. The FRQI provides a foundation not only to express images but also to explore theoretical and practical aspects of image processing on quantum computers.     

Multi-image encryption scheme based on quantum 3D Arnold transform and scaled Zhongtang chaotic system

A quantum representation model for multiple images is firstly proposed, which could save more storage space than the existing quantum image representation models and allow quantum hardware to encrypt an arbitrary number of images simultaneously. Moreover, the definition and the quantum circuit of quantum 3D Arnold transform are given based on the proposed quantum representation model for multiple images. Furthermore, a novel quantum multi-image encryption scheme is devised by combining quantum 3D Arnold transform and quantum XOR operations with scaled Zhongtang chaotic system. Theoretically, the proposed quantum image encryption scheme could encrypt many images simultaneously. Numerical simulations and theoretical analyses demonstrate that the proposed quantum multi-image encryption scheme outperforms both its classical counterparts and the existing typical quantum image encryption algorithms in terms of security, robustness, encryption capacity and computational complexity.     

一种彩色图像的量子描述方法及应用

为了提高量子彩色图像的存储效率,提出一种新的量子彩色图像描述方法.在该方法中,像素的位置信息采用多比特量子系统的基态描述,像素的三基色灰度值信息只采用一个量子比特描述,具体描述为该量子比特的相位.利用这种描述方法,给出量子彩色图像的几种简单操作方法,包括像素三基色灰度值的改变、互换,图像位置翻转、置换,设计一种新的量子图像水印的实现方法.所提出的方法可在将来的量子计算机上执行.经典计算机上的仿真结果验证了该方法的有效性.     

Quantum representation and watermark strategy for color images based on the controlled rotation of qubits

In this paper, a novel quantum representation and watermarking scheme based on the controlled rotation of qubits are proposed. Firstly, a flexible representation for quantum color image (FRQCI) is proposed to facilitate the image processing tasks. Some basic image processing operations based on FRQCI representation are introduced. Then, a novel watermarking scheme for quantum images is presented. In our scheme, the carrier image is stored in the phase \(\theta \) of a qubit; at the same time, the watermark image is embedded into the phase \(\phi \) of a qubit, which will not affect the carrier image’s visual effect. Before being embedded into the carrier image, the watermark image is scrambled to be seemingly meaningless using quantum circuits, which further ensures the security of the watermark image. All the operations mentioned above are implemented by the controlled rotation of qubits. The experimental results on the classical computer show that the proposed watermarking scheme has better visual quality under a higher embedding capacity and outperforms the existing schemes in the literature.     

A robust color image watermarking using local invariant significant bitplane histogram

Desynchronization attacks that cause displacement between embedding and detection are usually difficult for watermark to survive. It is a challenging work to design a robust image watermarking scheme against desynchronization attacks, especially for color images. In this paper, we propose a robust color image watermarking approach based on local invariant significant bitplane histogram. The novelty of the proposed approach includes: 1) A fast and effective color image feature points detector is constructed, in which probability density and color invariance model are used; 2) The fully affine invariant local feature regions are built based on probability density Hessian matrix; and 3) The invariant significant bitplane histograms are introduced to embed digital watermark. The extensive experimental works are carried out on a color image set collected from Internet, and the preliminary results show that the proposed watermarking approach can survive numerous kinds of distortions, including common image processing operations and desynchronization attacks.     

新的基于稀疏表示单张彩色超分辨率算法

传统的基于学习的超分辨率算法普遍采用样本库来训练字典对,训练时间长且对样本库依赖较大。针对传统算法的不足,提出一种新的单张彩色图像超分辨率算法。该方法基于稀疏编码超分辨率模型,利用图像自相似性和冗余特性,并结合图像金字塔结构,采用低分辨率图像本身来训练高、低分辨率图像块的字典对。同时,针对彩色图像,该算法采用一种基于稀疏表示的彩色图像存储技术,将彩色图像的三通道值组合成一个向量进行图像稀疏处理,以更好地维持原始图像细节信息。实验结果表明,与传统的超分辨率算法相比,该算法不但有更好的视觉效果和更高的峰值信噪比(PSNR),而且计算速度快。     

A novel quantum representation for log-polar images

The power of quantum mechanics has been extensively exploited to meet the high computational requirement of classical image processing. However, existing quantum image models can only represent the images sampled in Cartesian coordinates. In this paper, quantum log-polar image (QUALPI), a novel quantum image representation is proposed for the storage and processing of images sampled in log-polar coordinates. In QUALPI, all the pixels of a QUALPI are stored in a normalized superposition and can be operated on simultaneously. A QUALPI can be constructed from a classical image via a preparation whose complexity is approximately linear in the image size. Some common geometric transformations, such as symmetry transformation, rotation, etc., can be performed conveniently with QUALPI. Based on these geometric transformations, a fast rotation-invariant quantum image registration algorithm is designed for log-polar images. Performance comparison with classical brute-force image registration method reveals that our quantum algorithm can achieve a quartic speedup.     

Fusion of infrared and visible images using neutrosophic fuzzy sets

Fusion of infrared and visible image is a technology which combines information from two different sensors for the same scene. It also gives extremely effective information complementation, which is widely used for the monitoring systems and military fields. Due to limited field depth in an imaging device, visible images can’t identify some targets that may not be apparent due to poor lighting conditions or because that the background color is similar to the target. To deal with this problem, a simple and efficient image fusion approach of infrared and visible images is proposed to extract target’s details from infrared images and enhance the vision in order to improve the performance of monitoring systems. This method depends on maximum and minimum operations in neutrosophic fuzzy sets. Firstly, the image is transformed from its spatial domain to the neutrosophic domain which is described by three membership sets: truth membership, indeterminacy membership, and falsity membership. The indeterminacy in the input data is handled to provide a comprehensive fusion result. Finally, deneutrosophicised process is made which means that the membership values are retransformed into a normal image space. At the end of the study, experimental results are applied to evaluate the performance of this approach and compare it to the recent image fusion methods using several objective evaluation criteria. These experiments demonstrate that the proposed method achieves outstanding visual performance and excellent objective indicators.

     

计算机彩色模型在图像显示与分割中的应用

本文提出了基于彩色模型的灰度图像彩色显示与分割的方法,该方法将ＲＧＢ,ＨＳＶ和ＧＬＨＳ这几个彩色模型用于图像彩色合成显示并首次用于灰度图像分割中,彩色合成利用图产强方法并考虑到人眼对彩色的分辨率以及视觉特性,不仅增强了图像的内容,而且给予图像合理的彩色显示,使图像易于分析并且具有好的视觉效果。     

形状的全尺度可视化表示与识别

目的 视觉目标的形状特征表示和识别是图像领域中的重要问题。在实际应用中,视角、形变、遮挡和噪声等干扰因素造成识别精度较低,且大数据场景需要算法具有较高的学习效率。针对这些问题,本文提出一种全尺度可视化形状表示方法。方法 在尺度空间的所有尺度上对形状轮廓提取形状的不变量特征,获得形状的全尺度特征。将获得的全部特征紧凑地表示为单幅彩色图像,得到形状特征的可视化表示。将表示形状特征的彩色图像输入双路卷积网络模型,完成形状分类和检索任务。结果 通过对原始形状加入旋转、遮挡和噪声等不同干扰的定性实验,验证了本文方法具有旋转和缩放不变性,以及对铰接变换、遮挡和噪声等干扰的鲁棒性。在通用数据集上进行形状分类和形状检索的定量实验,所得准确率在不同数据集上均超过对比算法。在MPEG-7数据集上精度达到99.57%,对比算法的最好结果为98.84%。在铰接和射影变换数据集上皆达到100%的识别精度,而对比算法的最好结果分别为89.75%和95%。结论 本文提出的全尺度可视化形状表示方法,通过一幅彩色图像紧凑地表达了全部形状信息。通过卷积模型既学习了轮廓点间的形状特征关系,又学习了不同尺度间的形状特征关系。本文方法在视角变化、局部遮挡、铰接变形和噪声等干扰下能保持较高的识别正确率,可应用于图像采集干扰较多以及红外或深度图像的目标识别,并适用于大数据场景下的识别任务。     

Training-free referenceless camera image blur assessment via hypercomplex singular value decomposition

Blur plays an important role in the perception of camera image quality. Generally, blur leads to attenuation of high frequency information and accordingly changes the image energy. Quaternion describes the color information as a whole. Recent researches in quaternion singular value decomposition show that the singular values and singular vectors of the quaternion can capture the distortion of color images, and thus we reasonably suppose that singular values can be utilized to evaluate the sharpness of camera images. Motivated by this, a novel training-free blind quality assessment method considering the integral color information and singular values of the distorted image is proposed to evaluate the sharpness of camera images. The blurred camera image is first converted to LAB color space and divided into blocks. Then pure quaternion is utilized to represent pixels of the blurred camera image and the energy of every block are obtained. Inspired by the human visual system appears to assess image sharpness based on the sharpest region of the image, the local sharpness normalized energy is defined as the sharpness score of the blurred camera image. Experimental results have demonstrated the effectiveness of the proposed metric compared with popular sharpness image quality metrics.

     

基于生成对抗网络的红外图像数据增强

深度学习在视觉任务中的良好表现很大程度上依赖于海量的数据和计算力的提升,但是在很多实际项目中通常难以提供足够的数据来完成任务。针对某些情况下红外图像少且难以获得的问题,提出一种基于彩色图像生成红外图像的方法来获取更多的红外图像数据。首先,用现有的彩色图像和红外图像数据构建成对的数据集;然后,基于卷积神经网络、转置卷积神经网络构建生成对抗网络（GAN）模型的生成器和鉴别器;接着,基于成对的数据集来训练GAN模型,直到生成器和鉴别器之间达到纳什平衡状态;最后,用训练好的生成器将彩色图像从彩色域变换到红外域。基于定量评估标准对实验结果进行了评估,结果表明,所提方法可以生成高质量的红外图像,并且相较于在损失函数中不加正则化项,在损失函数中加入L1和L2正则化约束后,该方法的FID分数值平均分别降低了23.95和20.89。作为一种无监督的数据增强方法,该方法也可以被应用于其他缺少数据的目标识别、目标检测、数据不平衡等视觉任务中。     

一种新颖的基于颜色信息的粒子滤波器跟踪算法

传统的基于直方图的粒子滤波器算法常常需要在准确表达颜色分布和计算效率之间做出妥协,从而影响跟踪算法的性能甚至导致跟踪算法失败.针对这一问题,文中提出一种新颖的基于颜色信息的粒子滤波器跟踪算法.该算法采用自适应剖分颜色空间的概率模型,能够用较少的子空间准确地表达目标的颜色分布.文中进一步提出一种推广的积分图像,通过在该积分图像上进行数组索引操作得到每一个子空间的像素数目、均值向量和协方差矩阵,从而能够快速地计算出颜色模型.然而在CPU上计算积分图像十分耗时,为此文中提出一种基于GPU的并行算法快速计算积分图像.该并行算法在显卡的GPU上创建3个线程网格,分别顺序执行3个Kernel函数,依次完成创建原始积分图像以及对它的行和列执行前缀求和算法的任务.同传统的基于直方图的粒子滤波器算法相比,新算法每帧平均跟踪时间显著减少,同时跟踪准确性和鲁棒性都有较大提高.     

A soft image representation approach by exploiting local neighborhood structure of self-organizing map (SOM)

When images are described with visual words based on vector quantization of low-level color, texture, and edge-related visual features of image regions, it is usually referred as “bag-of-visual words (BoVW)”-based presentation. Although it has proved to be effective for image representation similar to document representation in text retrieval, the hard image encoding approach based on one-to-one mapping of regions to visual words is not expressive enough to characterize the image contents with higher level semantics and prone to quantization error. Each word is considered independent of all the words in this model. However, it is found that the words are related and their similarity of occurrence in documents can reflect the underlying semantic relations between them. To consider this, a soft image representation scheme is proposed by spreading each region’s membership values through a local fuzzy membership function in a neighborhood to all the words in a codebook generated by self-organizing map (SOM). The topology preserving property of the SOM map is exploited to generate a local membership function. A systematic evaluation of retrieval results of the proposed soft representation on two different image (natural photographic and medical) collections has shown significant improvement in precision at different recall levels when compared to different low-level and “BoVW”-based feature that consider only probability of occurrence (or presence/absence) of a word.     

第一寄存器小Qubit量子计算攻击RSA研究

提出了针对RSA的小Qubit量子攻击算法设计,量子攻击的第一量子寄存器所需的Qubit数目由原先至少2L降低到L1,总体空间复杂度记为(L1,L),其中2L1≥r,r为分解所得周期。由于第一寄存器量子比特数的减少,降低了算法复杂度和成功率,且改进原算法中模幂计算,提升运算速率。改进攻击算法的量子电路的时间复杂度为T=O(2L2)。在时间复杂度和空间复杂度上都有明显的进步。改进算法的成功率降低了,但实际成功求解时间,即每次分解时间/成功率,依然低于 Shor 算法目前的主要改进算法。完成了仿真模拟实验,分别用11、10、9 Qubit成功分解119的量子电路。     

NEQR量子图像下的差分扩展可逆数据隐藏算法

量子图像安全处理是一个新兴的研究领域,而量子图像数据隐藏是量子图像安全处理技术的一种,在不损害载体的情况下可用于保护量子图像的版权和认证量子图像是否完整。目前尚缺乏对量子图像可逆数据隐藏的详细技术研究。结合差值扩展技术,本文提出了一种量子图像可逆数据隐藏算法：1）选用NEQR量子图像表示法来表示图像;2）借鉴经典的差值扩展算法,在NEQR量子图像上对量子比特进行处理,可逆嵌入数据;3）设计了信息嵌入、信息提取和载体无损恢复的量子线路图,并进行了仿真。基于经典图像的实验结果表明,本文算法是可逆的,可用于将来对量子图像的认证和保护。     

Color Image Discriminant Models and Algorithms for Face Recognition

This paper presents a basic color image discriminant (CID) model and its general version for color image recognition. The CID models seek to unify the color image representation and recognition tasks into one framework. The proposed models, therefore, involve two sets of variables: a set of color component combination coefficients for color image representation and one or multiple projection basis vectors for color image discrimination. An iterative basic CID algorithm and its general version are designed to find the optimal solution of the proposed models. The general CID (GCID) algorithm is further extended to generate three color components (such as the three color components of the RGB color images) for further improvement of the recognition performance. Experiments using the face recognition grand challenge (FRGC) database and the biometric experimentation environment (BEE) system show the effectiveness of the proposed models and algorithms. In particular, for the most challenging FRGC version 2 Experiment 4, which contains 12 776 training images, 16 028 controlled target images, and 8014 uncontrolled query images, the proposed method achieves the face verification rate (ROC III) of 78.26% at the false accept rate (FAR) of 0.1%.      

A hierarchical cellular logic for pyramid computers

Hierarchical structure occurs in biological vision systems and there is good reason to incorporate it into a model of computation for processing binary images. A mathematical formalism is presented which can describe a wide variety of operations useful in image processing and graphics. The formalism allows for two kinds of simple transformations on the values (called pyramids) of a set of cells called a hierarchical domain: the first are binary operations on boolean values, and the second are neighborhood-matching operations. The implied model of computation is more structured than previously discussed pyramidal models, and is more readily realized in parallel hardware, while it remains sufficiently rich to provide efficient solutions to a wide variety of problems. The model has a simplicity which is due to the restricted nature of the operations and the implied synchronization across the hierarchical domain. A corresponding algebraic simplicity in the logic makes possible the concise representation of many cellular-data operations.