where the \(\mathbf {c}_k\)  are prototypes.
We obtain the codes by matching the features against prototypes using the Sinkhorn algorithm.
We defer the reader to [1]} for more details.
The objective function can be minimized with stochastic gradient descent methods.
