Volume 33, Issue 15 e5281
SPECIAL ISSUE PAPER

Fast dynamic routing based on weighted kernel density estimation

Suofei Zhang

Corresponding Author

Suofei Zhang

School of Internet of Things, Nanjing University of Post and Telecommunication, Nanjing, China

Suofei Zhang, School of Internet of Things, Nanjing University of Post and Telecommunication, Nanjing 210003, China.

Email: [email protected]

Search for more papers by this author
Wei Zhao

Wei Zhao

Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Beijing, China

Search for more papers by this author
Xiaofu Wu

Xiaofu Wu

School of Internet of Things, Nanjing University of Post and Telecommunication, Nanjing, China

Search for more papers by this author
Quan Zhou

Quan Zhou

School of Internet of Things, Nanjing University of Post and Telecommunication, Nanjing, China

Search for more papers by this author
First published: 11 April 2019
Citations: 5

Summary

Capsules as well as dynamic routing between them are most recently proposed structures for deep neural networks. A capsule groups data into vectors or matrices as poses rather than conventional scalars to represent specific properties of target instance. Based on pose, a capsule should be attached to a probability (often denoted as activation) for its presence. The dynamic routing helps capsule network achieve more generalization capacity with fewer model parameters. However, the bottleneck, which prevents widespread applications of capsule, is the expense of computation during routing. To address this problem, we generalize existing routing methods within the framework of weighted kernel density estimation, proposing two fast routing methods with different optimization strategies. Our methods prompt the time efficiency of routing by nearly 40% with negligible performance degradation. By stacking a hybrid of convolutional layers and capsule layers, we construct a network architecture to handle inputs at a resolution of 64 × 64 pixels. The proposed models achieve a parallel performance with other leading methods in multiple benchmarks.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.