|
|
| Dictionary (const Mat &_bytesList=Mat(), int _markerSize=0, int _maxcorr=0) |
| |
| | Dictionary (const Ptr< Dictionary > &_dictionary) |
| |
| | CV_WRAP_AS (create) static Ptr< Dictionary > create(int nMarkers |
| |
| | CV_WRAP_AS (create_from) static Ptr< Dictionary > create(int nMarkers |
| |
|
bool | identify (const Mat &onlyBits, int &idx, int &rotation, double maxCorrectionRate) const |
| | Given a matrix of bits. Returns whether if marker is identified or not. It returns by reference the correct id (if any) and the correct rotation
|
| |
|
int | getDistanceToId (InputArray bits, int id, bool allRotations=true) const |
| | Returns the distance of the input bits to the specific id. If allRotations is true, the four posible bits rotation are considered
|
| |
|
CV_WRAP void | drawMarker (int id, int sidePixels, OutputArray _img, int borderBits=1) const |
| | Draw a canonical marker image
|
| |
Dictionary/Set of markers. It contains the inner codification
bytesList contains the marker codewords where
- bytesList.rows is the dictionary size
- each marker is encoded using
nbytes = ceil(markerSize*markerSize/8.)
- each row contains all 4 rotations of the marker, so its length is
4*nbytes
bytesList.ptr(i)[k*nbytes + j] is then the j-th byte of i-th marker, in its k-th rotation.
