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 |
xxxxxxxxxximport bobimport numpydef linear_machine_from_data(data): """Unmangles a bob.machine.LinearMachine from a BEAT Data object""" machine = bob.machine.LinearMachine(data.weights) machine.biases = data.biases machine.input_subtract = data.input_subtract machine.input_divide = data.input_divide return machineclass Algorithm: def __init__(self): self.machine = None self.projections = None self.current_projection = 0 def process(self, inputs, outputs): # retrieve the linear machine once if self.machine is None: inputs['subspace'].next() self.machine = linear_machine_from_data(inputs['subspace'].data) # collect all the image projections for the current template image = inputs['image'].data.value.astype('float64').flatten() projection = self.machine.forward(image) if self.projections is None: group = inputs.groupOf('id') nb_images = inputs["id"].data_index_end - inputs["id"].data_index + 1 self.projections = numpy.ndarray((nb_images, projection.shape[0]), dtype='float64') self.current_projection = 0 self.projections[self.current_projection,:] = projection self.current_projection += 1 # generate the results (when all the images of the current template have been # projected) if inputs["id"].isDataUnitDone(): outputs['projections'].write({ 'value': self.projections }) self.projections = None return TrueThe 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 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.