Small Target Detection Algorithm Based on Average Absolute Difference Maximum and Background Forecast

Detecting small targets in clutter scene and low SNR (Signal Noise Ratio) is an important and challenging problem in infrared (IR) images. In order to solve this problem, we should do works from two sides: enhancing targets and suppressing background. Firstly, in this paper, the system utilizes the average absolute difference maximum (AADM) as the dissimilarity measurement between targets and background region to enhance targets. Secondly, it uses a predictor to suppress the background clutter. Finally, our approach extracts the interested small target with segment threshold. Experimental results show that the algorithm proposed has better performance with respect to probability of detection and less computation complexity. It is an effective small infrared target detection algorithm against complex background.     

Quantum Algorithm for Variant Maximum Satisfiability

In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a POS SAT problem, we proposed a novel quantum algorithm for the maximum satisfiability (MAX-SAT), which returns the maximum number of OR terms that are satisfied for the SAT-unsatisfiable function, providing us with information on how far the given Boolean function is from the SAT satisfaction. We used Grover’s algorithm with a new block called quantum counter in the oracle circuit. The proposed circuit can be adapted for various forms of satisfiability expressions and several satisfiability-like problems. Using the quantum counter and mirrors for SAT terms reduces the need for ancilla qubits and realizes a large Toffoli gate that is then not needed. Our circuit reduces the number of ancilla qubits for the terms T of the Boolean function from T of ancilla qubits to ≈log2T+1. We analyzed and compared the quantum cost of the traditional oracle design with our design which gives a low quantum cost.     

Quantum Algorithm for Approximating Maximum Independent Sets

We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states,which generates quantum annealing in a secondary Hamiltonian.For both sparse and dense random graphs G,numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size α(G) in low polynomial time.The best classical algorithms,by contrast,produce independent sets of size about half of α(G)in polynomial time.     

Quantum Private Comparison Based on Quantum Search Algorithm

We propose two quantum private comparison protocols based on quantum search algorithm with the help of a semi-honest third party. Our protocols utilize the properties of quantum search algorithm, the unitary operations, and the single-particle measurements. The security of our protocols is discussed with respect to both the outsider attack and the participant attack. There is no information leaked about the private information and the comparison result, even the third party cannot know these information.     

Quantum Secret Sharing Based on Quantum Search Algorithm

Quantum secret sharing (QSS) and quantum search algorithm (QSA) are considered as two important but different research topics in quantum information science. This paper recognizes an important feature in the well-known Grover’s QSA and then applies it to propose a QSS protocol. In contrast to the existing QSA-based QSS protocols, the newly proposed protocol has the following two advantages: (1)?no quantum memory is required by the agents, whereas the agents in the existing QSA-based QSS protocols need long-term quantum memories to store their secret shadows; (2)?the agents can cooperate to recover the boss’s secret by using shadows in classical bits, whereas, the others have to combine their shadows in photons and perform a unitary operation on the retained photons. The proposed QSS protocol is also shown to be secure against eavesdroppers or malicious agents.     

基于像素序列形态的适应性背景重构算法

背景重构是视频图像处理领域的支撑性工作之一.针对传统的背景重构算法运算复杂、背景图像失真等不足,本文提出了一种像素序列形态适应性背景重构算法.该算法通过提取像素序列形态特征进行分类处理,不同形态适用独立的背景提取策略、背景更新时刻和背景更新策略.实验结果验证表明:该算法无需对视频场景中的背景和运动目标建立模型,可直接从一组含有运动前景的视频图像中准确地重构背景,并有效避免混合现象|背景缓慢变化和突变时,亦可快速有效地完成背景重构.     

基于像素序列形态的适应性背景重构算法

背景重构是视频图像处理领域的支撑性工作之一.针对传统的背景重构算法运算复杂、背景图像失真等不足,本文提出了一种像素序列形态适应性背景重构算法.该算法通过提取像素序列形态特征进行分类处理,不同形态适用独立的背景提取策略、背景更新时刻和背景更新策略.实验结果验证表明:该算法无需对视频场景中的背景和运动目标建立模型,可直接从...     

Quantum Search Algorithm Based on Multi-Phase

The success probability of the Grover quantum search algorithm decreases quickly when the fraction of target items exceeds 1/4, where the phase plays a significant role. Therefore, we use multiple phases to complement each other. We obtain three useful properties and an important theorem of the success probability and design a systematic solution of the optimal phases for an arbitrary number of phases. Based on these results, we finally propose a multi-phase quantum search algorithm whose success probability rises with the increase of the number of phases with just a single iteration, and it tends to be 100% when the fraction of target items is over a lower limit.     

Controlled Deterministic Secure Quantum Communication Based on Quantum Search Algorithm

In this study, we propose a controlled deterministic secure quantum communication (CDSQC) protocol based on the idea of Grover’s quantum search algorithm (QSA). The proposed protocol has the following two advantages over the existing CDSQC protocols: (1) high qubit frequency and (2) less quantum memory. Moreover, the security analysis of the proposed protocol shows that any eavesdropper will be detected with a very high probability under both ideal and noisy quantum channel conditions.     

Fuzzy Matching Based on Gray-scale Difference for Quantum Images

Quantum image processing has recently emerged as an essential problem in practical tasks, e.g. real-time image matching. Previous studies have shown that the superposition and entanglement of quantum can greatly improve the efficiency of complex image processing. In this paper, a fuzzy quantum image matching scheme based on gray-scale difference is proposed to find out the target region in a reference image, which is very similar to the template image. Firstly, we employ the proposed enhanced quantum representation (NEQR) to store digital images. Then some certain quantum operations are used to evaluate the gray-scale difference between two quantum images by thresholding. If all of the obtained gray-scale differences are not greater than the threshold value, it indicates a successful fuzzy matching of quantum images. Theoretical analysis and experiments show that the proposed scheme performs fuzzy matching at a low cost and also enables exponentially significant speedup via quantum parallel computation.     

Quantum Computer Algorithm for Parity Determination Based on Quantum Counting

A new quantum computer algorithm is proposed for determining the parity of function f(x) by using quantum counting algorithm. The parity of function f(x) can be determined by counting exactly the number of satisfying f(x)=−1, which is equivalent to determine the number of solutions, M, to an N item search problem. The algorithm can be accomplished in time of order .     

Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations

A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen’s hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen’s hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.     

Quantum Image Encryption Algorithm Based on NASS

This paper proposes a quantum image encryption algorithm based on n-qubit normal arbitrary superposition state (NASS) by using the basic scheme of quantum transformation and random phase transformation. According to theoretical analysis and experimental simulation on MATLAB system, we find that key space is an important factor of encryption and decryption algorithm. When the secret key space is large, it is difficult for the attacker to crack the encrypted information. Based on this finding, we perform 2ⁿ +?4 times phase transformation in the encryption process. And each transformation is random, which increases the difficulty of decryption. So there are a total of 2ⁿ +?4 randomly transformed keys. In this paper, we design the implementation circuit of random phase transformation, and because the real quantum computer is not in our grasp, now we use MATLAB software to simulate grayscale image and color image encryption algorithm in classic computer, respectively. And the histogram, complexity and correlation are analyzed. Study shows that the proposed encryption algorithm is valid.     

An Encryption Scheme Based on Discrete Quantum Map and Continuous Chaotic System

International Journal of Theoretical Physics - Chaotic encryption is a growing field for competently shielding visual data. As well as quantum encryption and substitution also play a significant...     

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

A novel arbitrated quantum signature (AQS) scheme is proposed motivated by the Hamiltonian algorithm (HA) and blind quantum computation (BQC). The generation and verification of signature algorithm is designed based on HA, which enables the scheme to rely less on computational complexity. It is unnecessary to recover original messages when verifying signatures since the blind quantum computation is applied, which can improve the simplicity and operability of our scheme. It is proved that the scheme can be deployed securely, and the extended AQS has some extensive applications in E-payment system, E-government, E-business, etc.     

Random Walk Quantum Clustering Algorithm Based on Space

In the random quantum walk, which is a quantum simulation of the classical walk, data points interacted when selecting the appropriate walk strategy by taking advantage of quantum-entanglement features; thus, the results obtained when the quantum walk is used are different from those when the classical walk is adopted. A new quantum walk clustering algorithm based on space is proposed by applying the quantum walk to clustering analysis. In this algorithm, data points are viewed as walking participants, and similar data points are clustered using the walk function in the pay-off matrix according to a certain rule. The walk process is simplified by implementing a space-combining rule. The proposed algorithm is validated by a simulation test and is proved superior to existing clustering algorithms, namely, Kmeans, PCA + Kmeans, and LDA-Km. The effects of some of the parameters in the proposed algorithm on its performance are also analyzed and discussed. Specific suggestions are provided.     

基于双混沌置乱和扩频调制的彩色图像盲水印算法

提出了一种新的适应彩色图像的盲水印算法,先对宿主图像的绿色分量以8×8像素分块进行离散余弦变换(DCT)变换,用logistic映射生成两个混沌序列,然后用混沌序列置乱加密二值水印图像,并用两个互不相关的伪随机序列扩频调制水印,最后将调制好的水印嵌入到DCT变换域的中频子带系数上,进行分块DCT反变换得到水印化图像.提取水印时,通过比较两个伪随机序列和水印化图像的相关性大小来提取水印,不需要原始图像的参与,为盲提取水印算法.实验结果证明本文算法能有效地抵抗JPEG压缩、加噪、剪切等常见攻击,绿色分量嵌入水印比红色和蓝色分量嵌入水印能更好地抵抗JPEG压缩的攻击.