Quantum-Inspired Edge Detection Algorithms Implementation using New Dynamic Visual Data Representation and Short-Length Convolution Computation

As the availability of imagery data continues to swell, so do the demands on transmission, storage and processing power. Processing requirements to handle this plethora of data is quickly outpacing the utility of conventional processing techniques. Transitioning to quantum processing and algorithms that offer promising efficiencies over conventional methods can address some of these issues. However, to make this transformation possible, fundamental issues of implementing real time Quantum algorithms must be overcome for crucial processes needed for intelligent analysis applications. For example, consider edge detection tasks which require time-consuming acquisition processes and are further hindered by the complexity of the devices used thus limiting feasibility for implementation in real-time applications. Convolution is another example of an operation that is essential for signal and image processing applications, where the mathematical operations consist of an intelligent mixture of multiplication and addition that require considerable computational resources. This paper studies a new paired transform-based quantum representation and computation of one-dimensional and 2-D signals convolutions and gradients. A new visual data representation is defined to simplify convolution calculations making it feasible to parallelize convolution and gradient operations for more efficient performance. The new data representation is demonstrated on multiple illustrative examples for quantum edge detection, gradients, and convolution. Furthermore, the efficiency of the proposed approach is shown on real-world images.

[1]  Li-Hua Gong,et al.  Cryptosystem for Grid Data Based on Quantum Convolutional Neural Networks and Quantum Chaotic Map , 2021 .

[2]  Mathini Sellathurai,et al.  Reconfigurable 2, 3 and 5-point DFT processing element for SDF FFT architecture using fast cyclic convolution algorithm , 2020 .

[3]  Artyom M. Grigoryan,et al.  Resolution map in quantum computing: signal representation by periodic patterns , 2020, Quantum Inf. Process..

[4]  Sos S. Agaian,et al.  New look on quantum representation of images: Fourier transform representation , 2020, Quantum Information Processing.

[5]  Keshab K. Parhi,et al.  Fast 2D Convolution Algorithms for Convolutional Neural Networks , 2020, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  A. Prakash,et al.  Quantum Algorithms for Deep Convolutional Neural Networks , 2019, ICLR.

[7]  Yuan Luo,et al.  Quantum Image Edge Detection Algorithm , 2019, International Journal of Theoretical Physics.

[8]  Sos S. Agaian,et al.  Paired quantum Fourier transform with log2N Hadamard gates , 2019, Quantum Inf. Process..

[9]  Shahid Mumtaz,et al.  Deep Unified Model For Face Recognition Based on Convolution Neural Network and Edge Computing , 2019, IEEE Access.

[10]  Ping Fan,et al.  Quantum Circuit Realization of Morphological Gradient for Quantum Grayscale Image , 2018, International Journal of Theoretical Physics.

[11]  Jun Li,et al.  Quantum Image Processing and Its Application to Edge Detection: Theory and Experiment , 2017, 1801.01465.

[12]  Juan Carlos Garcia-Escartin,et al.  Quantum arithmetic with the quantum Fourier transform , 2014, Quantum Information Processing.

[13]  Pierre Mascarade,et al.  Quantum Image Filtering in the Frequency Domain , 2017 .

[14]  Fei Yan,et al.  A survey of quantum image representations , 2015, Quantum Information Processing.

[15]  Zhengang Jiang,et al.  Quantum Computation-Based Image Representation, Processing Operations and Their Applications , 2014, Entropy.

[16]  F. Petruccione,et al.  An introduction to quantum machine learning , 2014, Contemporary Physics.

[17]  Roman A. Solovyev,et al.  Efficient calculation of cyclic convolution by means of fast Fourier transform in a finite field , 2014, Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014).

[18]  Maria Schuld,et al.  The quest for a Quantum Neural Network , 2014, Quantum Information Processing.

[19]  Edwin R. Hancock,et al.  Graph matching using the interference of discrete-time quantum walks , 2009, Image Vis. Comput..

[20]  Roberta Piroddi,et al.  Gradient-Adaptive Normalized Convolution , 2008, IEEE Signal Processing Letters.

[21]  Rafael C. González,et al.  Digital image processing, 3rd Edition , 2008 .

[22]  N. Yoran,et al.  Efficient classical simulation of the approximate quantum Fourier transform , 2006, quant-ph/0611241.

[23]  S. Agaian,et al.  Multidimensional Discrete Unitary Transforms: Representation: Partitioning, and Algorithms , 2003 .

[24]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[25]  Sos S. Agaian,et al.  Split manageable efficient algorithm for Fourier and Hadamard transforms , 2000, IEEE Trans. Signal Process..

[26]  Sos S. Agaian,et al.  Method of fast 1-D paired transforms for computing the 2-D discrete Hadamard transform , 2000 .

[27]  Reiner Lenz,et al.  On Color Edge Detection , 2000, PICS.

[28]  William K. Pratt,et al.  Digital image processing, 2nd Edition , 1991, A Wiley-Interscience publication.

[29]  Allan O. Steinhardt,et al.  Fast algorithms for digital signal processing , 1986, Proceedings of the IEEE.

[30]  D. Dieks Communication by EPR devices , 1982 .

[31]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[32]  G. S. Robinson Edge detection by compass gradient masks , 1977 .