Ternary Quantum Circuit for Color Image Representation

Author(s):  
Sanjay Chakraborty ◽  
Sudhindu Bikash Mandal ◽  
Soharab Hossain Shaikh ◽  
Lopamudra Dey
Author(s):  
Gaber Hassan ◽  
Khalid M. Hosny ◽  
R. M. Farouk ◽  
Ahmed M. Alzohairy

One of the most often used techniques to represent color images is quaternion algebra. This study introduces the quaternion Krawtchouk moments, QKrMs, as a new set of moments to represent color images. Krawtchouk moments (KrMs) represent one type of discrete moments. QKrMs use traditional Krawtchouk moments of each color channel to describe color images. This new set of moments is defined by using orthogonal polynomials called the Krawtchouk polynomials. The stability against the translation, rotation, and scaling transformations for QKrMs is discussed. The performance of the proposed QKrMs is evaluated against other discrete quaternion moments for image reconstruction capability, toughness against various types of noise, invariance to similarity transformations, color face image recognition, and CPU elapsed times.


2022 ◽  
Vol 22 (1&2) ◽  
pp. 17-37
Author(s):  
Xiao Chen ◽  
Zhihao Liu ◽  
Hanwu Chen ◽  
Liang Wang

Quantum image representation has a significant impact in quantum image processing. In this paper, a bit-plane representation for log-polar quantum images (BRLQI) is proposed, which utilizes $(n+4)$ or $(n+6)$ qubits to store and process a grayscale or RGB color image of $2^n$ pixels. Compared to a quantum log-polar image (QUALPI), the storage capacity of BRLQI improves 16 times. Moreover, several quantum operations based on BRLQI are proposed, including color information complement operation, bit-planes reversing operation, bit-planes translation operation and conditional exchange operations between bit-planes. Combining the above operations, we designed an image scrambling circuit suitable for the BRLQI model. Furthermore, comparison results of the scrambling circuits indicate that those operations based on BRLQI have a lower quantum cost than QUALPI. In addition, simulation experiments illustrate that the proposed scrambling algorithm is effective and efficient.


2013 ◽  
Vol 13 (13) ◽  
pp. 2589-2593
Author(s):  
Guangwei Wang ◽  
Xinggang Zhang ◽  
Cenggang Xiong ◽  
Yihua Lan

1996 ◽  
Author(s):  
Eugenio Martinez-Uriegas ◽  
Hewitt D. Crane ◽  
John D. Peters

2018 ◽  
Vol 16 (01) ◽  
pp. 1850005 ◽  
Author(s):  
Panchi Li ◽  
Xiande Liu

To address quantum description for color images, an improved FRQI model called FRQCI is proposed in this paper. In our model, the qubit has two-phase parameters [Formula: see text] and [Formula: see text], and the primary color R is stored in [Formula: see text], the primary colors G and B are stored in [Formula: see text]. We provide several simple image processing operators, including color change and geometric transformation. Next, we focus on an encryption algorithm, which includes two parts: position scrambling and color transformation. All operations involved in this paper are implemented by the rotation of the qubit on the Bloch sphere. The simulation results on classical computer show the effectiveness of the proposed method.


2014 ◽  
Vol 1046 ◽  
pp. 411-414
Author(s):  
Hai Sheng Li ◽  
Kai Song

In this study, an important geometric transformation, multidimensional color image scaling based on an n-qubit normal arbitrary superposition state (NASS), is put forward. In order to reduce the complexity of implementation of image scaling in a quantum system, nearest neighbor interpolation algorithm is chosen to implement image scaling up. And the corresponding quantum circuit of implementation is proposed. Finally, we discuss measurements of the part qubits of a NASS state to realize image scaling down. The paper explores theoretical and practical aspects of image processing on a quantum computer.


Sign in / Sign up

Export Citation Format

Share Document