2014
DOI: 10.1007/s11128-014-0881-0
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Boolean image denoising

Abstract: A quantum Boolean image processing methodology is presented in this work, with special emphasis in image denoising. A new approach for internal image representation is outlined together with two new interfaces: classical to quantum and quantum to classical. The new quantum Boolean image denoising called quantum Boolean mean filter works with computational basis states (CBS), exclusively. To achieve this, we first decompose the image into its three color components, i.e., red, green and blue. Then, we get the b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
35
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 33 publications
(35 citation statements)
references
References 34 publications
0
35
0
Order By: Relevance
“…First, we need to decompose all digital images in their 3 color components (red, green, blue) [31]. Thus, we will obtain 24 bitplanes (8 bitplanes for every color) thanks to a procedure known as bit slicing [31]. We get 8 bitplanes per color, where the 7th bitplane (the closest to the observer) is It is evident, from here on, that an element in black in every bitplane is a classical bit equal to 1 and will be represented with a qubit equal to 1 , while, an element in white in every bitplane is a classical bit equal to 0 and will be represented with a qubit equal to 0 in a future Cl2Qu interface.…”
Section: Color Decomposition and Bit Slicingmentioning
confidence: 99%
See 1 more Smart Citation
“…First, we need to decompose all digital images in their 3 color components (red, green, blue) [31]. Thus, we will obtain 24 bitplanes (8 bitplanes for every color) thanks to a procedure known as bit slicing [31]. We get 8 bitplanes per color, where the 7th bitplane (the closest to the observer) is It is evident, from here on, that an element in black in every bitplane is a classical bit equal to 1 and will be represented with a qubit equal to 1 , while, an element in white in every bitplane is a classical bit equal to 0 and will be represented with a qubit equal to 0 in a future Cl2Qu interface.…”
Section: Color Decomposition and Bit Slicingmentioning
confidence: 99%
“…In fact, the definitive Cl2Qu interface is absolutely compact and henceforth it will be considered as a unified block. Finally, we will apply the Hadamard's gate to the last set of equations according to Figures 6 and 7 [24,25], thus, for b2 = 0 and b1 = 0, we will have, 00 00 0 1 0 0 0 00 01 00 0 0 0 1 0 (31) for b2 = 0 and b1 = 1, 00 00 0 1 0 0 0 00 01 00 0 0 0 0 0 0 1 1 0 10…”
Section: Interfacesmentioning
confidence: 99%
“…: this technology is presented as a viable alternative to the problem of practical implementation of algorithms for quantum image processing (QuIP) [50]. The algorithms grouped under this technology does not suffer the ravages of the quantum measurement.…”
Section: Quantum Boolean Image Processing (Quboip)mentioning
confidence: 99%
“…Definitely, the problem lies in the hostile relationship between the internal representation of the image (inside quantum machine), the outcome measurement, and the recovery of the image outside of quantum machine. Therefore, the only technique of QuIP that survives is QuBoIP [50]. This is because it works with CBS, exclusively, and the quantum measurement does not affect the value of states.…”
mentioning
confidence: 99%
“…On the other hand, a new technology allows us to avoid the problem of quantum measurement [2] [3]. However, this technology lets us work exclusively with Computational Basis States (CBS), i.e., pure and orthogonal quantum base states.…”
mentioning
confidence: 99%