Convolutional Neural Networks based on Random Kernels in the Frequency Domain

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

3

초록

Image classification in Fourier domain has been researched for many years via deep learning process, especially for spectral pooling methods and visualization. Point-wise multiplication of Fourier transformed image and kernel has solved high computational cost which is required for convolution operation through Convolutional Neural Network (CNNs) in spatial domain. However, there is still an open problem to deal with kernel method in the Fourier domain because larger images need bigger amount of computational cost by using the same size of kernel. In this work, we propose an efficient discrete Fourier transform-based CNNs using sparse random kernel. we expect the sparse random kernel contains critical low frequency and high frequency contents, but many zeros in kernel affect to the lower cost computation in the Frequency domain. The evaluation was conducted using the benchmark MNIST datasets using LeNet-5 (LeCun) which showed the possibility of this work, so we can expect that the implementation can be expanded for the future work. © 2021 IEEE.

키워드

Convolution; Deep learning; Discrete Fourier transforms; Frequency domain analysis; Learning systems; Computational costs; Fourier domains; Frequency domains; High frequency HF; Kernel methods; Learning process; Random kernels; Spatial domains; Convolutional neural networks
제목
Convolutional Neural Networks based on Random Kernels in the Frequency Domain
저자
Han, Y.; Derbel, B.; Hong, B.-W.
DOI
10.1109/ICOIN50884.2021.9333914
발행일
2021-01
유형
Conference Paper
저널명
International Conference on Information Networking
권
2021-January
페이지
671 ~ 673