Dynamic routing between capsules is exactly nonlinear gradient descent on the concave objective Ψ(C) = -Σ_j (||U_j C(:,j)|| - arctan ||U_j C(:,j)||), whose value decreases at every routing iteration.
CapsNet comparative performance evaluation for image classification
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Image classification has become one of the main tasks in the field of computer vision technologies. In this context, a recent algorithm called CapsNet that implements an approach based on activity vectors and dynamic routing between capsules may overcome some of the limitations of the current state of the art artificial neural networks (ANN) classifiers, such as convolutional neural networks (CNN). In this paper, we evaluated the performance of the CapsNet algorithm in comparison with three well-known classifiers (Fisher-faces, LeNet, and ResNet). We tested the classification accuracy on four datasets with a different number of instances and classes, including images of faces, traffic signs, and everyday objects. The evaluation results show that even for simple architectures, training the CapsNet algorithm requires significant computational resources and its classification performance falls below the average accuracy values of the other three classifiers. However, we argue that CapsNet seems to be a promising new technique for image classification, and further experiments using more robust computation resources and re-fined CapsNet architectures may produce better outcomes.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
The Convergence of Dynamic Routing between Capsules
Dynamic routing between capsules is exactly nonlinear gradient descent on the concave objective Ψ(C) = -Σ_j (||U_j C(:,j)|| - arctan ||U_j C(:,j)||), whose value decreases at every routing iteration.