概括
这项研究引入了光子芯片,用于神经网络中更快的图像处理. 它使用并行操作实现了四倍的边缘提取速度,提高了识别精度.
科学领域:
- 光子学 是一个光子学.
- 光子学 光子学
- 光学计算是指光学计算的应用.
背景情况:
- 卷积神经网络 (CNN) 对于图像识别至关重要.
- 对于CNN,特别是卷积操作,需要高效的硬件.
- 光子计算为高速,低功耗计算提供了潜力.
研究的目的:
- 开发光子复杂化架构,用于CNN中的平行边缘提取.
- 使用光学来提高图像处理的速度和准确性.
- 展示一种用于加速光子卷积运算的新方法.
主要方法:
- 基于数组的3x3十字形微环共振器 (MRR) 光子复杂化架构的实验建立.
- 使用MRR阵列执行并行边缘提取操作.
- 在像CIFAR-10这样的图像数据集上评估可计算性,能源效率和准确性.
主要成果:
- 通过同时提取四个特征地图,实现了高达四倍的卷积计算速度.
- 在48.6mW的能源成本下,证明了0.742 TOPS的最大可计算性.
- 在CIFAR-10数据集中,使用平行边缘提取操作员的图像识别精度提高了6.2% (达到78.7%).
结论:
- 拟议的MRR阵列架构能够实现高度可扩展和高效的并行边缘提取.
- 这项工作提出了一种新的方法,可以显著提高CNN的光子计算速度.
- 与通用运营商相比,该系统在图像识别任务中表现出更高的性能.
相关概念视频
Convolution Properties II
199
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
199
Convolution Properties I
150
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
150
Convolution: Math, Graphics, and Discrete Signals
257
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
257
Gradient and Del Operator
2.6K
In mathematics and physics, the gradient and del operator are fundamental concepts used to describe the behavior of functions and fields in space. The gradient is a mathematical operator that gives both the magnitude and direction of the maximum spatial rate of change. Consider a person standing on a mountain. The slope of the mountain at any given point is not defined unless it is quantified in a particular direction. For this reason, a "directional derivative" is defined, which is a vector...
2.6K
Vector Operations
1.3K
Vectors are physical quantities that have both magnitude and direction. The vector operations include addition, subtraction, and scalar multiplication.
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
A vector multiplied by a scalar value is called scalar multiplication. The result obtained is a new vector with a different magnitude. If the scalar is positive, the direction of the vector remains the same, but if it is negative, the direction of the vector is reversed. For example, the product of the mass and velocity yields the momentum.
1.3K
Fast Fourier Transform
324
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
324


