Computes the ISV session offset

This algorithm is a legacy one. The API has changed since its implementation. New versions and forks will need to be updated.
This algorithm is splittable

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.

Group: probes

Endpoint Name Data Format Nature
statistics tutorial/gmm_statistics/1 Input
isv_offset system/array_1d_floats/1 Output

Group: train

Endpoint Name Data Format Nature
ubm tutorial/gmm/1 Input
isvbase tpereira/isvbase/1 Input

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

Given a feature vector, a GMM and a U subspace, computes the session offset (xi, j).

Specific details can be found in [McCool2013].

This algorithm relies on the `Bob <http://www.idiap.ch/software/bob/>`_ library.

The inputs are:

The output, isv_offset, is the latent variable xi, j ( Eq. (29) in [McCool2013]) that corresponds to the session offset.

[McCool2013](1, 2) McCool, Christopher, et al. "Session variability modelling for face authentication." IET biometrics 2.3 (2013): 117-129.

Docutils System Messages

System Message: ERROR/3 (<string>, line 5); backlink

Unknown target name: "bob &lt;http://www.idiap.ch/software/bob/&gt;".

System Message: ERROR/3 (<string>, line 9); backlink

Unknown target name: "gmm statistics &lt;https://www.beat-eu.org/platform/algorithms/tpereira/gmm_statistics/3/&gt;".

Experiments

Updated Name Databases/Protocols Analyzers
pkorshunov/pkorshunov/isv-asv-pad-fusion-complete/1/asv_isv-pad_lbp_hist_ratios_lr-fusion_lr-pa_aligned avspoof/2@physicalaccess_verification,avspoof/2@physicalaccess_verify_train,avspoof/2@physicalaccess_verification_spoof,avspoof/2@physicalaccess_verify_train_spoof,avspoof/2@physicalaccess_antispoofing pkorshunov/spoof-score-fusion-roc_hist/1
pkorshunov/pkorshunov/isv-asv-pad-fusion-complete/1/asv_isv-pad_gmm-fusion_lr-pa avspoof/2@physicalaccess_verification,avspoof/2@physicalaccess_verify_train,avspoof/2@physicalaccess_verification_spoof,avspoof/2@physicalaccess_verify_train_spoof,avspoof/2@physicalaccess_antispoofing pkorshunov/spoof-score-fusion-roc_hist/1
pkorshunov/pkorshunov/isv-speaker-verification-spoof/1/isv-speaker-verification-spoof-pa avspoof/2@physicalaccess_verification_spoof,avspoof/2@physicalaccess_verification pkorshunov/eerhter_postperf_iso_spoof/1
pkorshunov/pkorshunov/isv-speaker-verification/1/isv-speaker-verification-licit avspoof/2@physicalaccess_verification pkorshunov/eerhter_postperf_iso/1

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.

Terms of Service | Contact Information | BEAT platform version 1.5.0b0 | © Idiap Research Institute - 2013-2019