Extracts local binary patterns in local histograms and concatenate these histograms
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_3d_uint8/1 | Input |
eye_centers | system/eye_positions/1 | Input |
features | system/array_1d_floats/1 | Output |
Parameters allow users to change the configuration of an algorithm when scheduling an experiment
Name | Description | Type | Default | Range/Choices |
---|---|---|---|---|
crop-height | uint32 | 80 | ||
crop-width | uint32 | 64 | ||
right-eye-y | uint32 | 16 | ||
right-eye-x | uint32 | 15 | ||
left-eye-y | uint32 | 16 | ||
left-eye-x | uint32 | 48 | ||
block-size | uint32 | 12 | ||
block-overlap | uint32 | 11 |
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 algorithms extracts Local Binary Pattern Histogram Sequence (LBPHS) features as introduced by [Ahonen04]. First, the image is aligned accorsing to the hand-labeled eye locations. Then, uniform circular Local Binary Patterns (LBPs) [Ojala96] are extracted from the aligned image. Afterwards, the image is split into (possibly overlapping) blocks, and a local histogram of LBP features is extracted for each block. Finally, all histograms are concatenated to form the full LBPHS feature vector.
[Ojala96] |
|
[Ahonen04] |
|
Updated | Name | Databases/Protocols | Analyzers | |||
---|---|---|---|---|---|---|
tutorial/tutorial/full_lbphs/1/atnt-lbphs-para | atnt/1@idiap_test_eyepos | tutorial/eerhter_postperf/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.