This algorithm generates comparison scores

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
probe_projections system/array_2d_floats/1 Input
comparison_ids system/array_1d_uint64/1 Input
probe_id system/uint64/1 Input
probe_client_id system/uint64/1 Input
scores tutorial/probe_scores/1 Output

Group: templates

Endpoint Name Data Format Nature
template_client_id system/uint64/1 Input
template_id system/uint64/1 Input
template_projections system/array_2d_floats/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

This algorithm generates comparison scores between test samples and matrix templates. Comparisons are performed using the Euclidean distance. As a score, the negation of the minimum distance between the row test (probe) vectors and the row vectors from the template matrix is returned.

The inputs are:

  • probe_projections: a two-dimensional arrays of float (64 bits)
    representing the (row) test vectors (the number of test vectors corresponds to the number of rows of the matrix)
  • comparison_ids: a list of id (as an unsigned 64 bit integers) of
    of template/models against which to compare the given probe
  • probe_id: an identifier (as an unsigned 64 bit integers) for the
    given probe
  • probe_client_id: an identifier (as an unsigned 64 bit integers) for
    the client from which this probe samples was generated.
  • template_client_id: an identifier (as an unsigned 64 bit integers) for
    the client from which this template was generated.
  • template_id: an identifier (as an unsigned 64 bit integers) for the
    given template
  • tempalate_projections: a two-dimensional arrays of float (64 bits)
    representing the template matrix

The output scores is the corresponding set of score values.

Experiments

Updated Name Databases/Protocols Analyzers
anjos/tutorial/eigenface/1/atnt-eigenfaces-75-comp-bis atnt/3@idiap tutorial/postperf_iso/1
anjos/tutorial/eigenface/1/atnt-eigenfaces-172 atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-70-comp atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-50-comp atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-45-comp atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-7-comps atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-8-comps atnt/3@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-9-comps atnt/3@idiap tutorial/postperf_iso/1
namratachede/tutorial/eigenface_with_preprocessing/1/namrataTest2 atnt/2@idiap tutorial/postperf_iso/1
omenemac/omenemac/gagatoolchainfork/1/MacsExperiment4 atnt/2@idiap tutorial/postperf_iso/1
chennu/tutorial/eigenface_with_preprocessing/1/test21 atnt/2@idiap tutorial/postperf_iso/1
soumik/tutorial/eigenface_with_preprocessing/1/Eigenface-22 atnt/2@idiap tutorial/postperf_iso/1
Vijay/tutorial/eigenface_with_preprocessing/1/Pparistest atnt/2@idiap tutorial/postperf_iso/1
mojtabaeslahi/cwhitela/cwhitela_eigenfaces_with_preprocessing/1/paristest atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface_with_preprocessing/1/paris-test atnt/2@idiap tutorial/postperf_iso/1
magedsoft/tutorial/eigenface_with_preprocessing/1/histogram_test_creteil atnt/2@idiap tutorial/postperf_iso/1
ilyaskhantmg/tutorial/eigenface/1/aint-15-comp atnt/2@idiap tutorial/postperf_iso/1
smarcel/tutorial/eigenface/1/eigenface-rr2 atnt/2@idiap tutorial/postperf_iso/1
cwhitela/cwhitela/cwhitela_eigenfaces_with_preprocessing/1/cwhitela_test atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface_with_preprocessing/1/atnt-eigenfaces-33-comp-histoeq atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-10-comp atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-9-comp atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-8-comp atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-7-comp atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-6-comp atnt/2@idiap tutorial/postperf_iso/1
tutorial/tutorial/eigenface/1/atnt-eigenfaces-5-comp atnt/2@idiap tutorial/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.3.1rc1 | © Idiap Research Institute - 2013-2019