TY - JOUR
T1 - Improved quantum dilation and erosion operations
AU - Yuan, Suzhen
AU - Mao, Xia
AU - Chen, Lijiang
AU - Wang, Xiaofa
N1 - Publisher Copyright:
© 2016 World Scientific Publishing Company.
PY - 2016/10/1
Y1 - 2016/10/1
N2 - 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 (j, i) is stored at the same location (j, i) 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.
AB - 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 (j, i) is stored at the same location (j, i) 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.
KW - Quantum image processing
KW - quantum erosion operation
KW - quantum parallelism
KW - time complexity
UR - https://www.scopus.com/pages/publications/84994065682
U2 - 10.1142/S0219749916500362
DO - 10.1142/S0219749916500362
M3 - 文章
AN - SCOPUS:84994065682
SN - 0219-7499
VL - 14
JO - International Journal of Quantum Information
JF - International Journal of Quantum Information
IS - 7
M1 - 1650036
ER -