block_bytecode::fast_detector_bit Struct Reference
[Compiled tree representations]

#include <faster_bytecode.h>

List of all members.

---

Detailed Description

This is a bytecode element for the bytecode-compiled detector.

The bytecode consists of a number of fixed length blocks representing a 3 way branch. Special values of of a block indicate the result that a pixel is a corner or non-corner.

Specifically, if lt == 0, then this is a leaf and gt holds the class. The root node is always stored as the first bytecode instruction.

Definition at line 48 of file faster_bytecode.h.

Public Attributes
int	offset
int	lt
int	gt
int	eq

---

Member Data Documentation

int block_bytecode::fast_detector_bit::offset

Memory offset from centre pixel to examine.

This means that the fast detector must be created for an image of a known width.

Definition at line 50 of file faster_bytecode.h.

int block_bytecode::fast_detector_bit::lt

Position in bytecode to branch to if offset pixel is much darker than the centre pixel.

If this is zero, then gt stores the result.

Definition at line 56 of file faster_bytecode.h.

int block_bytecode::fast_detector_bit::gt

Position in bytecode to branch to if offset pixel is much brighter than the centre pixel.

If lt==0 is a result block, then this stores the result, 0 for a non corner, 1 for a corner.

Definition at line 58 of file faster_bytecode.h.

int block_bytecode::fast_detector_bit::eq

Position in bytecode to branch to otherwise.

Definition at line 60 of file faster_bytecode.h.

---

The documentation for this struct was generated from the following file:

• faster_bytecode.h

---