Fiducial marker code



I am working on a system which will allow me to detect square fiducial
markers containing visual codes represented by binary (black or white)
squares evenly distributed on a grid on the marker in photographs
and/or video frames. Currently, I successfully identify candidate
markers and sample their area for the marker codes. I however have not
been to come up with any successful coding scheme. The problem I have
had with coding schemes I have tested is that codes may be confused
with other codes if they are rotated or mirrored or that the frequency
of false positives gets very high.

Currently I am using a 6x6 grid and thus have 36 bits to work with. I
have been trying ot come up with schemes using 6-bit CRC checksum to
avoid false positives and rotation/mirror invariant codes but with no
luck.

I would be very grateful if someone could point me in the right
direction!

Best regards
David Olsson

.



Relevant Pages

  • Re: Fiducial marker code
    ... markers and sample their area for the marker codes. ... been to come up with any successful coding scheme. ... Currently I am using a 6x6 grid and thus have 36 bits to work with. ...
    (sci.image.processing)
  • Re: Where to get the protocol code for MPPS?
    ... standard code value sets). ... Coding Scheme Designator and Coding Scheme Version (it is the ... When we publish the codes for the MESA tests, ...
    (comp.protocols.dicom)
  • Re: Where to get the protocol code for MPPS?
    ... Protocol Codes are generally specific to each site (there are no ... standard code value sets). ... Coding Scheme Designator and Coding Scheme Version (it is the ...
    (comp.protocols.dicom)