In order to develop and validate the quantum image processing algorithm on quantum computer, combined with quantum computing operation on IBM quantum experiment platform (IBM Q) and quantum image processing theory, a quantum image segmentation method based on IBM Q platform was designed. An improved enhanced quantum representation (IEQR) was proposed based on the existing novel enhanced quantum representation (NEQR). The quantum image segmentation circuit, which consists of the quantum bit string comparator (QBSC) and the Controlswap (Cswap) gate, is initialized according to the IEQR. Finally, quantum image segmentation of 2×2 and 4×4 size images are realized on IBM Q and local classical computer simulator. The experimental results demonstrate the feasibility and effectiveness of the algorithm and the superiority of quantum computers is validated.
In order to develop and validate the quantum image processing algorithm on quantum computer, combined with quantum computing operation on IBM quantum experiment platform (IBM Q) and quantum image processing theory, a quantum image segmentation method based on IBM Q platform was designed. An improved enhanced quantum representation (IEQR) was proposed based on the existing novel enhanced quantum representation (NEQR). The quantum image segmentation circuit, which consists of the quantum bit string comparator (QBSC) and the Controlswap (Cswap) gate, is initialized according to the IEQR. Finally, quantum image segmentation of 2×2 and 4×4 size images are realized on IBM Q and local classical computer simulator. The experimental results demonstrate the feasibility and effectiveness of the algorithm and the superiority of quantum computers is validated.
Abstract Quantum image segmentation algorithm is crucial for quantum image processing. In this paper, a dual-threshold quantum image segmentation algorithm is designed and simulated in IBM Quantum Experience (IBM Q) platform, which can segment a complex image into three parts using fewer quantum bits. In our algorithm, given a high threshold and a low threshold, grayscale values larger than the high threshold are set to the high threshold and grayscale values smaller than the low threshold are set to the low threshold, with no change for the part between the two thresholds. Then we use a low-cost quantum comparator and design a complete and scalable quantum image segmentation circuit. Analysis of the circuit cost shows that the quantum gates required for the circuit are only related to the grayscale range q and are independent of the image size. The feasibility of the algorithm and the correctness of the quantum circuit are verified by simulation in IBM Q platform, and finally the MSE, PSNR AND SSIM value of the image is analyzed to prove the effectiveness of the segmentation algorithm.
The classical image segmentation algorithm based on local adaptive threshold can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem gradually emerges. In this paper, a quantum segmentation algorithm based on local adaptive threshold for NEQR image is proposed, which can use quantum mechanism to simultaneously compute local thresholds for all pixels in a gray-scale image and quickly segment the image into a binary image. In addition, several quantum circuit units, including median calculation, quantum binarization, etc. are designed in detail, and then a complete quantum circuit is designed to segment NEQR images by using fewer qubits and quantum gates. For a [Formula: see text] image with [Formula: see text] gray-scale levels, the complexity of our algorithm can be reduced to O[Formula: see text], which is an exponential speedup compared to the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
Quantum image segmentation algorithm can use its quantum mechanism to rapidly segment the objects in a quantum image. However, the existing quantum image segmentation algorithms can only segment static objects in the image and use more quantum resource(qubit). In this paper, a novel quantum segmentation algorithm based on background-difference method for NEQR image is proposed, which can segment dynamic objects in a static scene image by using fewer qubits. In addition, an efficient and feasible quantum absolute value subtractor is designed, which is an exponential improvement over the existing quantum absolute value subtractor. Then, a complete quantum circuit is designed to segment the NEQR image. For a 2n×2n image with gray-scale range of [0,2q-1], the complexity of our algorithm is O(q), which has an exponential improvement over the classical segmentation algorithm, and the complexity will not increase as the image's size increases. The experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
Line detection is a fundamental technique in image processing. It can extract the required information, while the information that does not need attention can be ignored, thus reducing the amount of data. At the same time, line detection is also the basis of image segmentation and plays an important role in this process. In this paper, we implement a quantum algorithm based on a line detection mask for novel enhanced quantum representation (NEQR). We build a quantum algorithm for line detection in different directions and design a quantum circuit for line detection. The detailed module designed is also provided. On a classical computer, we simulate the quantum method, and the simulation results prove the feasibility of the quantum method. By analyzing the complexity of quantum line detection, we find that the computation complexity of the proposed method is improved compared to some similar edge detection algorithms.
The classical image segmentation algorithm based on grayscale morphology can effectively segment images with uneven illumination, but with the increase of the image data, the real-time problem will emerge. In order to solve this problem, a quantum image segmentation algorithm is proposed in this paper, which can use quantum mechanism to simultaneously perform morphological operations on all pixels in a grayscale image, and then quickly segment the image into a binary image. In addition, several quantum circuit units, including dilation, erosion, bottom hat transformation, top hat transformation, etc., are designed in detail, and then they are combined together to construct the complete quantum circuits for segmenting the NEQR images. For a2n×2nimage withqgrayscale levels, the complexity of our algorithm can be reduced to O(n2+q), which is an exponential speedup than the classic counterparts. Finally, the experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
Abstract With the increase in the quantity and quality of images that need to be processed, there are higher requirements for the speed of image processing. Thus, it is necessary to speed-up the image processing algorithms. In this paper, we design a quantum image edge detection algorithm based on Laplacian of Gaussian (LoG) operator, which has significant acceleration due to the quantum parallelism. Firstly, the quantum circuit of the novel enhanced quantum image representation (NEQR) model is improved to represent multiple quantum images simultaneously with lower time complexity. Secondly, the quantum subtractor and quantum comparator are optimized. Thirdly, quantum adder, quantum multiplier, quantum comparator, and quantum subtractor are adopted to design the quantum circuit of LoG operator and zero-crossing detector, which constitute the quantum edge detection algorithm. Finally, the algorithm is simulated on the IBM Quantum Experience (IBM Q) platform to verify its feasibility. Compared with the existing state-of-the-art algorithms, the proposed quantum image edge detection algorithm has significant improvement in time complexity.