Table 3.

Dynamic routing algorithm.

Routing Algorithm
1: Procedure ROUTING ($u^{\wedge }{}_{j|i}$, r, I) 2:  For all capsule i in layer I and capsule j in layer (I +1): bij ← 0 3:  FOR r iterations DO 4:   for all capsule i in layer I: ci ← sotftmax(bi) 5:   for all capsule j in layer (I +1): sj ←${\displaystyle \sum _i{c}_{ij}{u}^{\wedge }{}_{j|i}}$ 6:   for all capsule j in layer (I +1): $v_j$ ← squash($s_j$) 7:   for all capsule i in layer I and capsule j in layer (I +1): $b_{ij}$ ← $b_{ij}$ + $u^{\wedge }{}_{j|i}$.$v_j$ 8:  Return $v_j$