Table 1 Dynamic routing algorithm

Initialize parameter \(b_{i|j}^{0} = 0\)

for r from 1 to T do

\(c_{i|j}^{r} = softmax\left( {b_{i|j}^{r - 1} } \right)\)

\(s_{j}^{r} = \mathop \sum \limits_{i} c_{i|j}^{r} \widehat{{u_{i|j} }}\)

\(d_{j}^{r} = Squash\left( {s_{j}^{r} } \right) = \frac{{\parallel s_{j} \parallel^{2} }}{{1 + \parallel s_{j} \parallel }}\frac{{s_{j} }}{{\parallel s_{j} \parallel^{2} }}\)

\(b_{i|j}^{r} = b_{i|j}^{r - 1} + d_{j}^{r} u_{i|j}\)

return \(d_{{\text{j}}}^{{\text{T}}}\)