Bob 2.0 implementation of ISV training (U and D subspaces)
Algorithms have at least one input and one output. All algorithm endpoints are organized in groups. Groups are used by the platform to indicate which inputs and outputs are synchronized together. The first group is automatically synchronized with the channel defined by the block in which the algorithm is deployed.
Parameters allow users to change the configuration of an algorithm when scheduling an experiment
The code for this algorithm in Python
The ruler at 80 columns indicate suggested POSIX line breaks (for readability).
The editor will automatically enlarge to accomodate the entirety of your input
Use keyboard shortcuts for search/replace and faster editing. For example, use Ctrl-F (PC) or Cmd-F (Mac) to search through this box
For a Gaussian Mixture Models (GMM) mean supervector space, computes the within-class variability subspace (U subspace) described in [McCool2013]:
This algorithm relies on the Bob library.
The inputs are:
The outputs are subspace_u and subspace_d for the session and the client offset respectivelly.
This table shows the number of times this algorithm has been successfully run using the given environment. Note this does not provide sufficient information to evaluate if the algorithm will run when submitted to different conditions.