Dynamically variable machine readable binary code and method for reading and producing thereof
First Claim
1. A method for determining the size and density of a dynamically variable machine optically readable code having a perimeter and a plurality of data elements in a two dimensional array representing coded information within the perimeter, the code being made of optically distinguishable light areas and dark areas, the perimeter having a first side and a second side that intersect at a first corner, the first and second sides being formed of a solid line and having first and second lengths respectively, the code further including a density pattern corresponding to the density of the data elements contained in the code, comprising:
- scanning a visual field containing a code with an optical scanning device and forming a bit map corresponding to the scanned visual field;
locating in the bit map the first and second sides of the code perimeter and the first corner;
determining the lengths of the first and second sides and calculating therefrom the code size; and
locating in the bit map the density pattern and determining the density of data elements in the code.
7 Assignments
0 Petitions
Accused Products
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.
55 Citations
34 Claims
-
1. A method for determining the size and density of a dynamically variable machine optically readable code having a perimeter and a plurality of data elements in a two dimensional array representing coded information within the perimeter, the code being made of optically distinguishable light areas and dark areas, the perimeter having a first side and a second side that intersect at a first corner, the first and second sides being formed of a solid line and having first and second lengths respectively, the code further including a density pattern corresponding to the density of the data elements contained in the code, comprising:
-
scanning a visual field containing a code with an optical scanning device and forming a bit map corresponding to the scanned visual field; locating in the bit map the first and second sides of the code perimeter and the first corner; determining the lengths of the first and second sides and calculating therefrom the code size; and locating in the bit map the density pattern and determining the density of data elements in the code. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. A method for producing a dynamically variable machine optically readable code having a perimeter and a plurality of data elements representing coded data within the perimeter, said code including a density pattern corresponding to the density of the data contained in the matrix, comprising:
-
providing data to be encoded in the code; determining a first number of data elements required to represent the encoded provided data; determining the size of the code to be formed to include said first number of data elements; calculating a first perimeter side length and a second perimeter side length, the first and second lengths corresponding to the determined code size; calculating the density of the determined first number of data elements in the determined code size and providing a first pattern of data elements representing the calculated density; encoding the data to be encoded and forming the first number of data elements; and producing a readable code as a two-dimensional array of said first number of data elements having a perimeter including the determined first and second perimeter sides as solid lines having the first and second perimeter lengths respectively and intersecting at a first corner, and the first data element pattern. - View Dependent Claims (25, 26, 27, 28, 29, 30, 31, 32, 33, 34)
-
Specification