Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Quantum Image Morphology Processing Based on Quantum Set Operation

Ri‐Gui Zhou, Zhi-bo Chang, Ping Fan, Wei Li, Tiantian Huan

Published Nov 19, 2014• 18 citations
Publisher
DOI
10.1007/s10773-014-2402-4

Related papers

Quantum circuit design for several morphological image processing methods

Panchi Li, Tong Shi, Aiping Lu +1 more

Quantum Information Processing•Oct 26, 2019•43 citations

Quantum morphology operations based on quantum representation model

Suzhen Yuan, Xia Mao, Tian Li +3 more

Quantum Information Processing•Oct 25, 2014•26 citations

Quantum Image Edge Detection Based on Multi-Directions Gray-Scale Morphology

Wan-Xiu Li, Ri‐Gui Zhou, Han Jen Yu

International Journal of Theoretical Physics•Oct 9, 2021•7 citations

Quantum Circuit Realization of Morphological Gradient for Quantum Grayscale Image

Ping Fan, Ri‐Gui Zhou, WenWen Hu +1 more

International Journal of Theoretical Physics•Nov 16, 2018•12 citations

Improved quantum dilation and erosion operations

Suzhen Yuan, Xia Mao, Lijiang Chen +1 more

To reduce the time complexity of quantum morphology operations, two kinds of improved quantum dilation and erosion operations are proposed. Quantum parallelism is well used in the design of these operations. Consequently, the time complexity is greatly reduced compared with the previous quantum dilation and erosion operations. The neighborhood information of each pixel is needed in the process of designing quantum dilation and erosion operations. In order to get the neighborhood information, quantum position shifting transformation is utilized, which can make the neighborhood information store in a quantum image set. In this image set, the neighborhood information of pixel at location ([Formula: see text], [Formula: see text]) is stored at the same location ([Formula: see text], [Formula: see text]) of other images in the image set. All the pixels will be processed simultaneously, which is the performance of quantum parallelism. The time complexity analysis shows that these quantum operations have polynomial-time complexity which is much lower than the exponential-time complexity of the previous version.

International Journal of Quantum Information•Oct 1, 2016•15 citations

Quantum Image Processing and Its Applications

J. Jennifer Ranjani

Springer eBooks•Jan 1, 2019•0 citations
To reduce the time complexity of quantum morphology operations, two kinds of improved quantum dilation and erosion operations are proposed. Quantum parallelism is well used in the design of these operations. Consequently, the time complexity is greatly reduced compared with the previous quantum dilation and erosion operations. The neighborhood information of each pixel is needed in the process of designing quantum dilation and erosion operations. In order to get the neighborhood information, quantum position shifting transformation is utilized, which can make the neighborhood information store in a quantum image set. In this image set, the neighborhood information of pixel at location ([Formula: see text], [Formula: see text]) is stored at the same location ([Formula: see text], [Formula: see text]) of other images in the image set. All the pixels will be processed simultaneously, which is the performance of quantum parallelism. The time complexity analysis shows that these quantum operations have polynomial-time complexity which is much lower than the exponential-time complexity of the previous version.