Hybrid classical-quantum image processing via polar Walsh basis functions

• URL: http://arxiv.org/abs/2403.16044v1
• Date: Sun, 24 Mar 2024 07:06:48 GMT
• Title: Hybrid classical-quantum image processing via polar Walsh basis functions
• Authors: Mohit Rohida, Alok Shukla, Prakash Vedula,
• Abstract summary: We propose a novel hybrid classical-quantum approach for image processing based on polar Walsh basis functions. We present an algorithm for the removal of the circular banding noise (including Airy pattern noise) and the azimuthal banding noise.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a novel hybrid classical-quantum approach for image processing based on polar Walsh basis functions. Using this approach, we present an algorithm for the removal of the circular banding noise (including Airy pattern noise) and the azimuthal banding noise. This approach is based on a formulation of Walsh basis functions in polar coordinates for image representations. This approach also builds upon an earlier work on a hybrid classical-quantum algorithm for Walsh-Hadamard transforms. We provide two kinds of polar representations using uniform area measure and uniform radial measure. Effective smoothening and interpolating techniques are devised relevant to the transformations between Cartesian and polar coordinates, mitigating the challenges posed by the non-injectivity of the transformation in the context of digital images. The hybrid classical-quantum approach presented here involves an algorithm for Walsh-Hadamard transforms, which has a lower computational complexity of $\mathcal{O}(N)$ compared to the well-known classical Fast Walsh-Hadamard Transform, which has a computational complexity of $\mathcal{O}(N \log_2 N)$. We demonstrated the applicability of our approach through computational examples involving the removal of the circular banding noise (including Airy pattern noise) and the azimuthal banding noise.

Related papers

• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Combinatorial Amplitude Patterns via Nested Quantum Affine Transformations [0.24578723416255746]
  This paper introduces a robust and scalable framework for implementing nested affine transformations in quantum circuits.<n>The proposed method systematically applies sequential affine transformations while preserving state normalization.<n>The utility of the framework is exemplified through two key applications: financial risk assessment, and discrete signal processing.
  arXiv  Detail & Related papers  (2024-12-12T20:35:56Z)
• Variational approach to photonic quantum circuits via the parameter shift rule [0.0]
  We derive a formulation of the parameter shift rule for reconfigurable optical linear circuits based on the Boson Sampling paradigm. We also present similar rules for the computations of integrals over the variational parameters. We employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable 6-mode universal integrated interferometer.
  arXiv  Detail & Related papers  (2024-10-09T15:06:17Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities [91.46841922915418]
  We present a unified approach for the theoretical analysis of first-order variation methods. Our approach covers both non-linear gradient and strongly Monte Carlo problems. We provide bounds that match the oracle strongly in the case of convex method optimization problems.
  arXiv  Detail & Related papers  (2023-05-25T11:11:31Z)
• Poisson-Gaussian Holographic Phase Retrieval with Score-based Image Prior [19.231581775644617]
  We propose a new algorithm called "AWFS" that uses the accelerated Wirtinger flow (AWF) with a score function as generative prior. We calculate the gradient of the log-likelihood function for PR and determine the Lipschitz constant. We provide theoretical analysis that establishes a critical-point convergence guarantee for the proposed algorithm.
  arXiv  Detail & Related papers  (2023-05-12T18:08:47Z)
• Tensor Factorization via Transformed Tensor-Tensor Product for Image Alignment [3.0969191504482243]
  We study the problem of a batch of linearly correlated image alignment, where the observed images are deformed by some unknown domain transformations. By stacking these images as the frontal slices of a third-order tensor, we propose to explore the low-rankness of the underlying tensor.
  arXiv  Detail & Related papers  (2022-12-12T05:52:26Z)
• A hybrid classical-quantum algorithm for digital image processing [0.0]
  multidimensional Walsh-Hadamard transforms are obtained using quantum Hadamard gates. A hybrid classical-quantum approach for evaluation of Walsh-Hadamard transforms and its applications to quantum image processing are proposed.
  arXiv  Detail & Related papers  (2022-08-20T16:05:38Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• An application of the splitting-up method for the computation of a neural network representation for the solution for the filtering equations [68.8204255655161]
  Filtering equations play a central role in many real-life applications, including numerical weather prediction, finance and engineering. One of the classical approaches to approximate the solution of the filtering equations is to use a PDE inspired method, called the splitting-up method. We combine this method with a neural network representation to produce an approximation of the unnormalised conditional distribution of the signal process.
  arXiv  Detail & Related papers  (2022-01-10T11:01:36Z)
• A hybrid classical-quantum algorithm for solution of nonlinear ordinary differential equations [0.0]
  A hybrid classical-quantum approach for the solution of nonlinear ordinary differential equations is proposed. The computation of the Walsh-Hadamard transform of arbitrary vectors is central to this hybrid approach.
  arXiv  Detail & Related papers  (2021-11-30T13:14:08Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.