Dynamically variable machine readable binary code and method for reading and producing thereof

• US 4,939,354 A
• Filed: 05/05/1988
• Issued: 07/03/1990
• Est. Priority Date: 05/05/1988
• Status: Expired due to Term

• Current Assignee: Siemens Energy & Automation Incorporated (Siemens AG)
• Original Assignee: Datacode International Incorporated
• Inventors: Priddy, Dennis G., Cymbalski, Robert S.
• Primary Examiner(s): Trafton, David L.
• Application Number:
  US07/190,205
• Time in Patent Office: 789 Days
• Field of Search: 235/436, 235/437, 235/456, 235/494
• US Class Current: 235/456
• CPC Class Codes: G06K 19/06037 multi-dimensional coding
• CPC Class Codes: G06K 2019/06262 with target- or other orientation-indicating feature
• CPC Class Codes: G06K 7/14 using light without selection of wavelength, e.g. sensing reflected white light G06K7/10831 - G06K7/1097 take precedence

Abstract

A machine readable binary code which is dynamically variable in size, format and density of information is provided. The binary code is formed as a matrix having a perimeter and data contained therein. The perimeter is provided with density indicia for indicating the density of data contained within the matrix. The perimeter is also provided with size indicia for indicating the size of the matrix. By utilizing the density indicia and size indicia, a scanning device is able to calculate the size and information density of the binary code.

Claims

1. A method for determining the size and density of a dynamically variable machine optically readable binary code forming a matrix having a perimeter having a first side and a second side, the first side and second side each being formed of a solid line of equal lengths and intersecting at a first corner and a third side of the perimeter and a fourth side of the perimeter, each being formed of an identical broken line pattern formed of alternating dark areas and light areas, the third side and the fourth side intersecting at a second corner corresponding to the density of data contained within the matrix comprising the steps of:

scanning the binary code with an optical scanner to convert the matrix and the surrounding area of the matrix to a sequence of electronic impulses, wherein the binary code and visual code are located in a visual field;

converting the signal of electronic impulses into a series of electronic data bits corresponding to the scanned image;

forming a bit mapped image of the matrix;

locating and determining the length of the first and second sides of the perimeter; and

determining the product of the number of light areas and dark areas of the third side and the number of light areas and dark areas of the fourth side.

2. The method for determining the size and density of a binary code of claim 1, further comprising the step of locating the corner of the intersecting first line and second line and determining the orientation of the matrix.

3. The method for determining the size and density of a binary code of claim 1, wherein the matrix contains a key visual cell and further comprising the steps of reading the key visual cell and decoding the pattern of the data contained in the matrix.

4. The method for determining the size and density of a binary code as claimed in claim 3 wherein the data contained within the matrix is formed of light areas and dark areas and further comprising the step of decoding the data contained within the matrix.

5. The method for determining the size and density of a binary code as claimed in claim 1, further comprising the step of differentiating the binary code from other images within the visual field.

6. A method for producing a dynamically variable machine optically readable binary code forming a matrix having a perimeter for indicating the density of the data contained within the matrix and the size of the matrix comprising the steps of:

converting the data to be contained within the code into binary form;

determining the number of visual cells required to represent the binary coded information within the matrix;

determining the size of the matrix to be formed;

forming a first side of the matrix perimeter as a solid dark line and a second side of the matrix perimeter as a solid dark line intersecting at a first corner said length being determined from the length of lines required to represent the area of the matrix;

calculating the square root of the number of visual cells required to represent the data contained within the binary code rounded up to a whole number;

producing a third side of the matrix perimeter formed of a broken line pattern formed of alternating dark areas and light areas so that the total number of dark areas and light areas in the third side is equal to the rounded up square root of the number of visual cells to be contained within the matrix;

producing a fourth side of the matrix perimeter formed of a broken line pattern identical to the third side;

said fourth side intersecting the third side at a second corner;

the first side, second side, third side and fourth side forming the perimeter of the matrix; and

producing the binary code as a visual cell pattern within the perimeter of the matrix.

7. The method for producing a binary code of claim 6, further comprising the steps of calculating the maximum number of possible variations necessary to display the data within the matrix and determining the minimum number of visual cells required to produce that number of variations.

8. The method for producing the binary code of claim 7 further comprising;

forming the visual cells within the perimeter of the binary code in a predetermined pattern.

9. The method for producing a binary code of claim 6 further comprising;

positioning redundant visual cells within the perimeter of the matrix about a root visual cell.

10. The method for producing a binary code of claim 6 further comprising the step of forming a distribution key containing information for decoding the predetermined pattern.