By continuing to browse this website, you implicitly agree with our Legal Disclaimer

Forked from tutorial/linear_machine_projection/4

This algorithm is a **sequential** one. The platform will call its *process()* method once per data incoming on its inputs.

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.

Endpoint Name | Data Format | Nature |
---|---|---|

image | system/array_2d_uint8/1 | Input |

id | system/uint64/1 | Input |

projections | system/array_2d_floats/1 | Output |

Endpoint Name | Data Format | Nature |
---|---|---|

subspace | tutorial/linear_machine/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 linearizes and accumulates images into a buffer, before applying a linear transformation (e.g. using a projection matrix computed by principal component analysis). The linear transformation relies on the Bob library.

The inputs are:

- image: an image as a two-dimensional arrays of floats (64 bits)
- id: an identifier which is used as follows: all images with the
- same identifier are accumulated into the same buffer

- subspace: a linear transformation as a collection of weights,
- biases, input subtraction and input division factors.

The output projections is a two-dimensional array of floats (64 bits), the number of rows corresponding to the number of accumulated images (with the same identifier), and the number of columns to the output dimensionality after applying the linear transformation.

Updated | Name | Databases/Protocols | Analyzers | |||
---|---|---|---|---|---|---|

amohammadi/tutorial/eigenface/1/atnt-eigenfaces-66-comp | atnt/5@idiap | tutorial/postperf_iso/1 | ||||

amohammadi/tutorial/eigenface/1/atnt-eigenfaces-67-comp | atnt/5@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 2.1.1b0 | © Idiap Research Institute - 2013-2020