Fast Haar Transforms for Graph Neural Networks
نویسندگان
چکیده
منابع مشابه
Information-preserving Transforms: Two Graph Metrics for Simulated Spiking Neural Networks
We are interested in self-organization and adaptation in intelligent systems that are robustly coupled with the real world. Such systems have a variety of sensory inputs that provide access to the richness, complexity, and noise of real-world signals. Specifically, the systems we design and implement are ab initio simulated spiking neural networks (SSNNs) with cellular resolution and complex ne...
متن کاملQuantum Haar Wavelet Transforms and Their Applications
Fourier transform has been shown to be a powerful tool in many area of science. However, there is another class of unitary transforms, the wavelet transforms, which are as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal and very useful for image processing and data compression. In this paper, we construct quantum algorithms for Haar w...
متن کاملApproximate fast graph Fourier transforms via multi-layer sparse approximations
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n logn) instead of O(n) arithmetic operations. Graph Signal Processing (GSP) is a recent research domain that generalizes classical signal processing tools, such as the Fourier transform, to situations where the signal domain is given by any arbitrary gr...
متن کاملFast continuous Fourier and Haar transforms of rectilinear polygons from very-large-scale integration layouts
We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts traditionally used. Not only are continuous transforms closer to the underlying continuous physical reality, but they also avoid the inherent...
متن کاملFast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Networks
سال: 2020
ISSN: 0893-6080
DOI: 10.1016/j.neunet.2020.04.028