Quantum Image Segmentation Based on Grayscale Morphology

• URL: http://arxiv.org/abs/2311.11952v1
• Date: Mon, 2 Oct 2023 13:42:25 GMT
• Title: Quantum Image Segmentation Based on Grayscale Morphology
• Authors: Wenjie Liu, Lu Wang, Mengmeng Cui
• Abstract summary: The complexity of our algorithm can be reduced to O(n2+q), which is an exponential speedup than the classic counterparts. The experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
• Score: 7.522250793902056
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 a 2^n * 2^n image with q grayscale levels, the complexity of our algorithm can be reduced to O(n^2+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.

Related papers

• Deep learning as a tool for quantum error reduction in quantum image processing [0.0]
  We report the successful use of a generative adversarial network trained for image-to-image translation, in conjunction with Phase Unraveling error reduction method, for reducing overall error in images encoded using LPIQE. Despite the limited availability and quantum volume of quantum computers, quantum image representation is a widely researched area.
  arXiv  Detail & Related papers  (2023-11-08T10:14:50Z)
• An improved two-threshold quantum segmentation algorithm for NEQR image [6.601450061692404]
  An improved two-threshold quantum segmentation algorithm for NEQR image is proposed. For a 2(n)*2(n) image with q-scale levels, the quantum cost of our algorithm can be reduced to 60q-6.
  arXiv  Detail & Related papers  (2023-10-02T17:04:36Z)
• A quantum segmentation algorithm based on local adaptive threshold for NEQR image [7.798738743268923]
  The complexity of our algorithm can be reduced to $O(n2+q)$, which is an exponential speedup compared to the classic counterparts. The experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2023-10-02T04:01:42Z)
• A quantum moving target segmentation algorithm for grayscale video [6.601450061692404]
  A quantum moving target segmentation algorithm for grayscale video is proposed. The complexity of our algorithm can be reduced to O$(n2 + q)$. The experiment is conducted on IBM Q to show the feasibility of our algorithm in the noisy intermediate-scale quantum (NISQ) era.
  arXiv  Detail & Related papers  (2023-10-01T15:38:27Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Advance quantum image representation and compression using DCTEFRQI approach [0.5735035463793007]
  We have proposed a DCTEFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) algorithm to represent and compress gray image efficiently. The objective of this work is to represent and compress various gray image size in quantum computer using DCT(Discrete Cosine Transform) and EFRQI (Efficient Flexible Representation of Quantum Image) approach together.
  arXiv  Detail & Related papers  (2022-08-30T13:54:09Z)
• A hybrid quantum image edge detector for the NISQ era [62.997667081978825]
  We propose a hybrid method for quantum edge detection based on the idea of a quantum artificial neuron. Our method can be practically implemented on quantum computers, especially on those of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2022-03-22T22:02:09Z)
• Improved FRQI on superconducting processors and its restrictions in the NISQ era [62.997667081978825]
  We study the feasibility of the Flexible Representation of Quantum Images (FRQI) We also check experimentally what is the limit in the current noisy intermediate-scale quantum era. We propose a method for simplifying the circuits needed for the FRQI.
  arXiv  Detail & Related papers  (2021-10-29T10:42:43Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.