Name
Title | ||
|---|---|---|
A Faster Algorithm for Reducing the Computational Complexity of Convolutional Neural Networks. |
Abstract | ||
|---|---|---|
Convolutional neural networks have achieved remarkable improvements in image and video recognition but incur a heavy computational burden. To reduce the computational complexity of a convolutional neural network, this paper proposes an algorithm based on the Winograd minimal filtering algorithm and Strassen algorithm. Theoretical assessments of the proposed algorithm show that it can dramatically reduce computational complexity. Furthermore, the Visual Geometry Group (VGG) network is employed to evaluate the algorithm in practice. The results show that the proposed algorithm can provide the optimal performance by combining the savings of these two algorithms. It saves 75% of the runtime compared with the conventional algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.3390/a11100159 | ALGORITHMS |
Keywords | Field | DocType |
convolutional neural network,Winograd,minimal filtering,Strassen,fast,complexity | Convolutional neural network,Algorithm,Filter (signal processing),Strassen algorithm,Mathematics,Computational complexity theory | Journal |
Volume | Issue | Citations |
11 | 10 | 4 |
PageRank | References | Authors |
0.40 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yulin Zhao | 1 | 7 | 1.79 |
| Donghui Wang | 2 | 24 | 4.25 |
| Leiou Wang | 3 | 5 | 5.55 |
| Peng Liu | 4 | 1701 | 171.49 |