This article extends the Radon transform, a classical image-processing tool for fast tomography and denoising, to the quantum computing platform. A new kind of periodic discrete Radon transform (PDRT), called the quantum periodic discrete Radon transform (QPRT), is proposed. The quantum implementation of QPRT based on the amplitude encoding method is exponentially faster than the classical PDRT. We design an efficient quantum image denoising algorithm using QPRT. The simulation results show that QPRT preserves good denoising capability as in the classical PDRT. Also, a quantum algorithm for IDRT is proposed, which can be used for fast line detection. Both the quantum extension of IDRT and the line detection algorithm can provide polynomial speedups over the classical counterparts in certain cases.
This article extends the Radon transform, a classical image-processing tool for fast tomography and denoising, to the quantum computing platform. A new kind of periodic discrete Radon transform (PDRT), called the quantum periodic discrete Radon transform (QPRT), is proposed. The quantum implementation of QPRT based on the amplitude encoding method is exponentially faster than the classical PDRT. We design an efficient quantum image denoising algorithm using QPRT. The simulation results show that QPRT preserves good denoising capability as in the classical PDRT. Also, a quantum algorithm for IDRT is proposed, which can be used for fast line detection. Both the quantum extension of IDRT and the line detection algorithm can provide polynomial speedups over the classical counterparts in certain cases.
This paper extends the Radon transform, a classical image processing tool for fast tomography and denoising, to the quantum computing platform. A new kind of periodic discrete Radon transform (PDRT), called quantum Radon transform (QRT), is proposed. The QRT has a quantum implementation that is exponentially faster than the classical Radon transform. Based on the QRT, we design an efficient quantum image denoising algorithm. The simulation results show that QRT preserves the good denoising capability as in the classical PDRT. Also, a quantum algorithm for interpolation-based discrete Radon transform (IDRT) is proposed, which can be used for fast line detection. Both the quantum extension of IDRT and the line detection algorithm can provide polynomial speedups over the classical counterparts.
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior work has provided efficient quantum implementations for the discrete Hilbert transform. This letter presents a novel construction for a quantum Hilbert transform in polylogarithmic size and logarithmic depth for a signal of length N, exponentially fewer operations than classical algorithms for the same mapping. We generalize this algorithm to create any d-dimensional Hilbert transform in depth O(dlogN). Simulations demonstrate effectiveness for tasks such as power systems control and image processing, with exact agreement with classical results.
The Radon transform constitutes the conventional tool for tomosynthesis, i.e., the composition of cross-sections of an object from its projections. It is actually a version of the Fourier Transform, which is accompanied by the appropriate digital high pass filters for correct distribution of energy among the reconstructed frequency components. The Radon transform and its inverse are employed in their 2D and 3D versions, respectively, and the whole procedure is verified by the a priori known cross-sections to be reconstructed (known fandom). Usually, 3D medical image cubes, which are to be reconstructed, require powerful computational tools since the 2D projections are of high-resolution containing millions of pixels. Although the 3D FFT is very fast, the large number of projections will result in a 3D spectrum of very large dimensions. Inverting this spectrum with the inverse 3D FFT is extremely time consuming. In this work, the implementation of the 2D Radon transform using the 2D Quantum Fourier Transform is analytically presented. Simultaneously, its inverse version is realized by means of the Quantum inverse 3D FFT. For this purpose, a review of the necessary quantum computational units is presented for the implementation of the quantum 3D FFT and simultaneously simple examples of tomosynthesis are given by means of the quantum version of the 2D Radon transform and its inverse 3D counterpart. The whole procedure of the quantum tomosynthesis is analytically described.
Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.
Quantum computing is an emerging field of technology that utilizes unique properties such as the superposition principle and quantum entanglement, potentially enabling the development of techniques that are drastically faster or even the only feasible solutions compared to classical approaches. Thus, it promises enormous gains in several domains, including the processing of n-dimensional images, such as those produced by X-ray computed tomography. However, the latter is subject to physical effects that primarily include artifacts and quantum noise. Noise, in particular, is an unavoidable issue that needs to be addressed when processing X-ray data. Therefore, this work considers the denoising of 3D volumetric data using quantum computing. An adaptation of a mathematical denoising model was transformed to be suitable for quantum implementation, and preliminary experiments demonstrated its functionality with two-dimensional images. Here, we first lift this model to be applicable to 3D images. Next, we provide an implementation in form of quantum circuits and consider issues of a practical implementation occurring specifically in 3D. The final implementation is executed on a real X-ray computed tomography dataset, showing that proper denoising can be performed on quantum devices, yet current technological limitations inhibit the application to large datasets.
In this article, a detailed survey of the quantum approach to image processing is presented. Recently, it has been established that existing quantum algorithms are applicable to image processing tasks allowing quantum informational models of classical image processing. However, efforts continue in identifying the diversity of its applicability in various image processing domains. Here, in addition to reviewing some of the critical image processing applications that quantum mechanics have targeted, such as denoising, edge detection, image storage, retrieval, and compression, this study will also highlight the complexities in transitioning from the classical to the quantum domain. This article shall establish theoretical fundamentals, analyze performance and evaluation, draw key statistical evidence to support claims, and provide recommendations based on published literature mostly during the period from 2010 to 2015.