Scanning system of the optical readably label for information decoding

A method of outputting information through optical spreading of a data - coded polygon, preferably hexagonal, data mesh, providing optically accurate digital bitrates providing the optical characteristics of information - coded polygons, decoding this optical copy and reproducing the decoded bitstream.

The implementation system of the encoding and decoding process is described.

i

The present invention relates to an improved optically readable label and its reading system, namely, an improved optically readable label affixed to or printed on a substrate for writing information within a two-dimensional grid of data consisting of a set of polygons arranged in a defined geometric structure containing at least two different optical characteristics.

Goods, miscellaneous components, letters, packages, containers, and many other items that are transported or transported, often require identifying information as to their origin, airplane flight number, destination, name, price, product quantity, and so on. Occasionally, reading coded information printed on labels affixed to those products enables you to automate the reading of the digits characterizing the products and their inventory or cash register operation. In other cases, using such encoded labels, automated mail, baggage, etc. may be possible. tracking, sorting, as well as providing necessary information about raw materials and consumables in production. Typically, this type of product is labeled with bar codes, one of which is the Universal Product Code. Many other string encoding systems are known.

Typically, commercial string encoding systems have the disadvantage associated with the constant requirement to increase data density by encoding an increasing amount of information on a potentially smaller label. Attempts to reduce the label itself, as well as the distance between the individual strings in the various strings encoding systems to increase data density, did not solve the problem: optical readers with relatively high bar code reading resolution equal to five and less than five millimeters between adjacent strings become economically unviable due to low label element tolerances as well as relatively sophisticated optical equipment capable of reading binary bar code in such dimensions , greatly complicates the production process. In order to adapt to the increasing amount of data, labels with barcodes should be made large in size and not suitable for attachment to small products. Another important factor is that paper labels become very expensive. A small label is cheaper than a large label; this price becomes an important factor in the case of large volumes of labels.

Alternatives to barcodes are:

circular shapes using radially spaced wedge-coded elements, such as U.S. Pat. 3553438, or concentric black and white binary coded rings as in U.S. Pat. 3971917, no. 3916150; a grid of rows and columns of data squares or rectangles, as disclosed in U.S. Pat. No. 4,286,146, microscopic spots disposed in lattices forming a regularly spaced grid, as in U.S. Pat. 4634850, and densely spaced multicolored data fields from pixels or elements as described in U.S. Pat. 4488679.

Some of the encoding systems described and other encoding systems known in the art suffer primarily from insufficient data density, as in the case of encoded round drawings and grids on rectangular and square boxes. Whether in the form of microscopic pixels or the multicolored elements discussed above, such systems require special guidance and transport means, limiting their use to highly controlled reading conditions.

Due to the size and speed of modern transport systems using conveyor belts, for example 0.9-1.0 m wide and belt speeds close to

2.5 m / sec or even packing at different heights with affixed coded information labels and the need for small, compact and inexpensive labels close to one square inch, create enormous strain on optical and decoding systems that searches for and reads coded information on labels affixed to fast moving packages and similar articles. There is a problem with the optical decompression of the detected label image. In addition, upon detection or identification of a label in a package that is contained in a conveyor system, the label image must be accurately decoded before the next operation begins, and often within a fraction of a second. These problems enabled the creation of a simple, fast, and inexpensive means of signaling the presence of a label with encoded data in the optical field of view of an optical reader comprising the entire length of the conveyor belt. This feature, combined with a high-density data cell, is described in more detail below:

Data cells having prefabricated applications are known in the art; for example, concentric geometric shapes incorporating rings, squares, triangles, hexagons and many variants thereof as described in U.S. Pat. U.S. Patent No. 3,513,320, 3603720. U.S. Pat. 3693154 and 3801775 also describe the use of symbols consisting of concentric circles as recognition and position indicators affixed to articles themselves where they are optically read. Because such systems use two different symbols necessary to identify the field data and their position, the complexity of the logical scheme that detects the aforementioned symbols is increased, and the data field data sensitivity is reduced. This causes problems with the position of the data field and the ability of the operator to restore information based on the field data when using two characters and one of them failing. The last system uses separate position and orientation tags at opposite ends of the data paths, which contain linear tags of encoded data with limited data sensitivity.

The above systems mainly utilize optical propagation with a sensor capable of generating an output video signal corresponding to a change in the brightness of the light reflected from the data cell and the position and orientation symbols. In such systems, the output video signal, after quantization, acquires a specific bitmap that can correspond to a given bit sequence. But such systems have the disadvantage of requiring two separate symbols first to familiarize themselves with the image and then to determine its orientation. Also, the need to match the optical sensor output digital signal with a given bit sequence, expressed in symbols and position and orientation, is more likely to result in erroneous readings than in the present invention: o known label detection systems provide rigid separation of the target recognition signal level. .

U.S. Pat. 3553438 shows a circular data cell having a centered recognition application consisting of a series of concentric circles. The recognition application legitimates the means, by means of an optical sensor, which detects a circular label and determines its geometric center, and thus also the geometric center of the circular data cell. This is done by a logic scheme that executes the pulse chart recognition, which has a bull eye target configuration configuration.

However, in the case of barcodes, the data cell has only limited data capacity and the system requires a second circular spreading process. Using both linear and circular spreading, a system with such a limited data rate can create undesirable system complexity due to a slight increase in data rate with conventional barcodes.

Codes designed to increase the data intensity of a data grid using many colored high density pixels are described in U.S. Pat. 4488679. Any of the systems described in U.S. Pat. 4488679 requires the use of handheld optical image analyzers that are unable to fully record and decode when the data cells move rapidly on the pack due to high speed conveyor belt transport. Similarly, high-density encoding systems using data encoding microscopic dots (described in U.S. Patent No. 6,348,50) require a special transport device to ensure that the data cells move in the right direction, not accidentally, as might have been the case with luggage conveyor belt. or in an analogous way. Thus, the coded label must be read tape after tape using a linear reader coupled to the label transport means for the purpose of decoding the exact information recorded on the label. This patent also shows that the position of the card relative to the transducer must be carefully controlled so that it can be read.

Techniques for producing strike coding systems also use multiple colors to avoid optical problems by spreading very fine strings, a stroke code that uses more of the two optical characteristics of the data code6 in the data cell, such as black, gray, and white U.S. Pat. 4443694. However, the systems described, although more advanced than the prior art bar code systems, cannot compare to the compactness of data density described in the present invention.

In view of the shortcomings of the known coding systems, the main object of the invention is to provide a new and improved compact optically readable label with a high density of information.

It is another object of the present invention to provide new improved optically readable labels that can encode about 100 well-protected alphanumeric characters per square inch of label.

It is a further object of the invention to provide new improved, high density, optical information readable labels that can be read by an optical sensor when the label is affixed to a luggage or other article transported on a high-speed conveyor system, regardless of its orientation or luggage. optically readable label, height change.

It is also an object of the invention to provide optically readable labels in combination with a decoding system so that the label can be reliably decoded when it is tilted, twisted, creased, partially rubbed or torn.

It is a further object of the invention to provide methods for locating a label moving at high speed under an optical sensor which will allow decoding of this label with a high degree of data retention.

Another object of the invention is to provide an improved encoding method for compact, enhanced, optically readable labels with high density of information by dividing the encoded information into high and low priority messages, maintaining a message hierarchy protected from error, and guaranteeing the integrity of the encoded information.

It is another object of the present invention to provide methods and encoding and decoding systems for computational, advanced, high density, and correlation capabilities that allow the reproduction of misspelled or missed high-priority encoded information by means of optically readable labels.

It is also an object of the present invention to produce inexpensive, optically readable labels by simple print media and to decode them using inexpensive logic circuits.

Other objects and advantages of the invention will become apparent from the following description of the invention.

The present invention consists of an optically readable label for memorizing data encoded in binary form having a two-dimensional data grid of a plurality of information-encoded polygons, partially enclosed within a given two-dimensional structure and having at least two different optical characteristics, and device encoding and decoding of such optically readable labels.

Optically readable labels in accordance with the present invention may have tilted two-dimensional geometric grids of polygons in which the geometric centers of such dauLT 3517 B polygons are at the vertices of intersecting axes of a given two-dimensional grid and the polygons have at least one of two different optical characteristics. The polygons of such optically readable labels may be regular or irregular polygons, and polygonal two-dimensional grids on optically readable labels may have two or more axes of evenly or unevenly spaced label.

Optically readable labels can be printed as polygons that are compacted, partially compacted, or uncompressed. The last two configurations essentially determine the spaces between the optically readable labels between adjacent polygons. Such intermediate spaces may have the same or different optical characteristics as two or more polygonal optical characteristics. Two-dimensional grids of compressed rectangles and compressed polygons having five or more sides can be used as configurations for optically readable labels in the present invention. Likewise, two-dimensional grids of regular or irregular polygons, or partially convergent or non-convergent polygons having three or more sides, when pre-arranged on the given axes of such grids, may encode and decode depending on the invention.

For the additional embodiments of the geometric polygonal lattice, the combination of the geometry of such polygonal lattice and optically readable labels consisting of such polygonal lattice combinations in accordance with the present invention may, if desired, include a recognition application consisting of a series of concentric rings for optical which they are attached to, especially in dynamic label reading systems.

In a preferred embodiment of the present invention, the data grid has a substantially square one-square-inch grid with adjacent hexagons forming rows and columns, and a centered recognition application with a geometric center defining a geometric center of the data grid.

The recognition application may be of any geometric shape having optical characteristics that allow the generation of a readily recognizable video signal transmitted by an optical sensor along a linear propagation trajectory passing through the geometric center of the recognition application. In the preferred embodiment, the recognition target is comprised of a plurality of concentric rings with contrasting reflection properties that occur in the presence of a linear, scattering, intermittent video signal. By using an analog filter as part of the detection and data decoding method, the signal generated in the optical sensor is directly compared to a target frequency, which allows for fast and accurate frequency equalization and subsequent determination of the location of the data grid attached to the substrate. The optical sensor output analog electrical signal representing the label with the encoded information is subsequently quantized and decoded. By using an analog bandpass filter, label recognition can be performed without decoding the encoded label information. Once the center of the recognition target is found, the datum grid datum can be set. If the center of the recognition target is located in the center of the label, it is possible to identify the centers of the recognition target and the data grid simultaneously. The central placement of the recognition target on the label is preferred but is not necessary in the present invention.

The optically readable data grid of the present invention may encode 100 or even hundreds and more error-protected alphanumeric characters spread over an area of ​​approximately one square inch by encoding hexagons with three reflectance characteristics in black, white, and gray. For sensors with an assigned optical resolution, the system of the invention allows for a denser compression of information than was possible with a bar code system. For example, if the high-resolution optical sensor is used in the system of the present invention, hundreds of alphanumeric characters may be encoded per square inch. Alternatively, 100 characters per square inch can be readily recognized in accordance with the present invention in a transducer with relatively low resolution.

Optically readable labels according to the present invention can be produced with variable data densities due to the use of two or more contrasting optical characteristics. At high data densities and introduction of the recognition application into the system of the present invention, it would be desirable to have a more sophisticated spreading device with additional, more laborious, decoding algorithms required for reading encoded messages as compared to a reading system using barcodes. According to the present invention, data encoding may be performed by encoding a set of binary bit sequence into a beam of adjacent hexagons, each of the hexagons having at least one of two optical characteristics, although the encoding could be performed sequentially from one hexagon to another. A digital bitstream may be generated on a computer from data entered manually or otherwise converted to a binary bitstream, or may be pre-recorded as a digital bitstream. The data to be encoded is extracted in a set of bits in a given sequence and in a geographic area of ​​the data grid to increase the number of transitions between hexagons having different optical characteristics.

In a preferred embodiment of the present invention, the messages to be encoded are divided into high and low priority messages, which are arranged separately in different geographical areas of the data grid. High-priority messages can freely repeat in low-priority areas to reduce the chance of losing high-priority messages due to spreading inaccuracies caused by dirt, cracks, bends, and other types of damage to the data grid. High-priority messages are encoded in the central part of the data grid adjacent to the recognition application in the preferred embodiment to protect messages that are more likely to occur in the peripheral areas of the data grid. The ability to correct inaccuracies is desirably entered into a data grid utilizing the large information capacity provided by the present invention, guaranteeing a high degree of data retrieval when decoding messages. The invention utilizes a mesh with high density pixels for printing labels with hexagons of various characteristics, although other printing techniques may be used without departing from the spirit of the invention. The grid with pixels is presented in such a way that after the label is printed, the optical characteristics of each hexagon are predefined so that they can be later decoded to recover the data that was asked by encoding the individual hexagons. This type of printing process is well known in the art and standard printing devices and bit mapping techniques can be used to print hexagons having the optical characteristics necessary for the present invention.

In accordance with the present invention, a new and improved method of recovering data encoded by polygons, in particular hexagons forming a data grid, in a grid-encoded bit is created. The encoded labels may be passed through the illuminated area and read optically by an electronic sensor controlled by an electronic circuit, or the dispensing device may be extended over the labels. An optical transducer produces an output signal, which is an analog electronic signal corresponding to the intensity of an individual region of the reflective power label recorded on a single optical element of the transducer. The analogue signal of the optical sensor is first compared to the target by a frequency corresponding to the frequency of the detected target if it is on a data grid. Once a good alignment is found, the label is recognized and the center of the recognition target is identified, which also sets the datum on the grid. The analog signal is simultaneously quantized by means of an analog-to-digital converter on a continuous basis and memorized in the intermediate Recorded digital data, a label received for further image storage, representing the entire process of decoding.

The logic diagrams transform the digital data into a hexagonal interface card with different optical characteristics.

In the preferred embodiment of the invention, this is accomplished by calculating a standard deviation of the intensity of reflection characteristics recorded by an optical sensor on each pixel and assigned to a group of pixels surrounding this first pixel. As a result, large standard deviations correspond to areas of contrasting hexagonal transition boundaries.

Digital data conversions continue, including orientation orientation and hexagonal filtering programs. The main stages of this process are:

1) Non-linear filtering of the digital image.

2) Determining the orientation of the label by first locating the three image axes (see Figure 2) and determining which axis is parallel to both sides of the label.

3) Determining the center of each hexagon and setting the gray level at each center.

4) Changing gray levels to bitstream.

5) Free adjustment of this flow error.

6) Free bitrate conversion to the given character set.

It should be noted that while the process of the present invention is described for hexagons having two or more characteristics, the process of adjusting the optical image due to label creasing, abrasion, etc., can be used for other types of labels and other polygonal lattices.

Other objects and other uses of the invention will become apparent from the detailed description of the invention. However, it should be emphasized that the detailed description of the preferred embodiments of the invention is merely an illustration and should not be construed as limiting the modifications and variations within the scope of the invention as will be apparent to those skilled in the art.

FIG. 3

FIG. 5

- A top view of a recognition target consisting of concentric circles as described in the present invention.

- Optically readable labels having adjacent hexagons for top-down encoding of data as described in the present invention.

- An optically readable label having adjacent hexagons with three optical characteristics for encoding binary data and having a cognitive application as described in the present invention is viewed from above.

- A top plan view of a hexagonal three to three lattice array in which the hexagons are arranged adjacent and which can serve as the main encoding unit in the preferred embodiment of the invention.

- A field map graphically depicting a grid of 33 rows and 30 columns that form a grid of 11 rows and 10 columns forming a hexagonal coding block as a pattern three to three cells.

According to the invention, a schematic view of a control system camera for adjusting the light of an optical sensor according to the height of the luggage.

- A detailed description of the decoding process according to the present invention.

FIG.

- Block application that shows the process of locating the recognition target.

- Structure program and data stream for encoding and decoding process.

-A step and sequence program according to the present invention.

-A top view of a set of converging regular hexagons arranged such that the geometric centers of adjacent hexagons lie on the vertices of the hexagonal grid.

-A top view of a set of tangent irregular hexagons arranged such that the geometric centers of adjacent hexagons lie on the vertices of the hexagonal grid.

-A top view of a set of partially converging polygons, which are essentially hexagonal, arranged so that the geometric centers of adjacent polygons are on the vertices of the hexagonal grid.

-A top view of a set of converging polygons essentially like hexagons arranged so that the geometric centers of adjacent polygons lie on the vertices of a hexagonal grid.

Optically readable labels having tangent polygons essentially as hexagons arranged such that geometric centers find adjacent polygons on the vertices of a hexagonal grid, and having a recognition application as provided in the present invention, a top view.

FIG. 16 - Top view of a set of tangent rectangles arranged such that the geometric centers of adjacent rectangles lie on the vertices of a hexagonal grid.

FIG. 17-Top view of a set of non-tangent rectangles that define the spaces between these rectangles such that the geometric centers of adjacent hexagons lie on the vertices of the hexagonal grid.

FIG. 18 -A top view of a set of non-tangent pentagons that define the spaces between these pentagons so that the geometric centers of the adjacent pentagons are on the vertices of the hexagonal grid.

FIG. 19-Top view of a set of tangent squares arranged in chess rows and columns such that the geometric centers of adjacent squares are on the vertices of a hexagonal grid.

FIG. 20 -The geometric vertices of a set of partially converging octagons that define the polygons as angles of a rectangular grid from above.

intermediate spaces between adjacent polygons located on the image

FIG. 21 - Top view of a set of partially converging octagons that define the spaces between polygons such that the geometric centers of the adjacent octagon are on the vertices of the hexagonal lattice.

The ability to encode information by contrasting hexagons or lattices of contrasting colors arranged in a decimal pattern with a grid sequence and grid allows the information recorded on the label to be reproduced by means of an electro - optical sensor.

Polygonal cells other than hexagons, arranged so that the geometric centers of adjacent polygons lie on the vertices of a hexagonal or other target grid, may also be used to encode information on optically readable labels. These are polygonal labels when they are centered around their respective centers on a two-dimensional geometric grid and when encoding! The assignment sequence for the various optical characteristics of the majority of such polygonal lattice assignments can be read by an electro-optical transducer and then decoded in accordance with the invention, which will be described later.

The polygonal lattices according to the present invention are information- wrapped blocks formed by a broken closed line, furthermore, these lattices are placed in a custom two-dimensional structure on an optically readable label. Label configurations using many different polygonal shapes and grid geometries such as pentagons, hexagons, octagons, rectangles, and squares can be used to practice the invention.

The adjacent polygonal lattices may be fully contacted, partially contacted, or non-contacting optically readable labels of the present invention.

Contacting polygons are polygons arranged so that the geometric centers of adjacent polygons lie on the vertices of a decisive two-dimensional grid, and the boundaries of such polygons are tangent to the boundaries of directly adjacent polygons. Partially tangent polygons are polygons arranged so that the geometric centers of adjacent polygons lie on the vertices of a decisive grid, and these polygons are separated at some point along their respective boundaries from the other polygons surrounding them, resulting in a large number of interstitial spaces scattered between the polygons . Noncontiguous polygons are discrete polygons arranged so that the geometric centers of adjacent polygons lie on the vertices of a destined two-dimensional grid, and they do not touch the boundaries of the individual polygons and polygons surrounding this polygon. In addition, polygonal lattices and decisive two-dimensional grids or lattices on which the centers of adjacent polygons are located may be irregular, have unevenly spaced axes, or have regular, evenly-spaced axes. Such two-dimensional grids have axes, regardless of the symmetry axes, if any, of polygonal lattices.

According to the present invention, the hexagons used on the label have some advantages in encoding the information on the label. These advantages are:

1. With a set optical resolution, hexagons can cluster more compactly than other polygons. For example, with the same resolution of the skiLT 3517 B, the corners of the squares are difficult to distinguish, which otherwise requires unnecessary resolution to read the squares. Circles would be the most optimal resolution, but the space between adjacent circles would be used aimlessly and the process of labeling the label would be complicated due to the need to give the spaces an optical characteristic. Hexagons allow you to perform optimum information stacking relative to circles or other polygons consisting of octagons, squares, triangles, etc. Squares and triangles create problems due to their sharp angles. Circles and octagons create problems due to the resulting unused space between adjacent circles and octagon.

2. A grid of adjacent hexagons has three axes. The use of a square and hexagonal label may result in the principal axis of the hexagon appearing at a target ratio on the label side. This arrangement of the main axis of the hexagonal mesh makes it easier to read data encoded in the hexagon in its relation to this major axis.

In this case, the label comprises a discrete member with a corresponding adhesive-facing side which is attached to the article, to the outer surface of the container or to another article on which the optically readable information of the present invention is printed.

In this case, an optically readable data grid or data grid refers to an image of tangent hexagons or lattices having two or more optical characteristics for encoding in a rotary form, due to their respective characteristics and the spatial relationship between the hexagons. The hexagons or polygons printed with the content of this reproducible information are hereinafter referred to as hexagons or polygons with encoded information, due to the manner in which the information is encoded on the label.

This image is a hexagon of contacting hexagons with a maximum number of transition limits - a hexagon for optimal reading and maximum information memorization density, called honeycomb structure.

The contrasting reflection characteristics used to print individual hexagons or data grid cells may enhance the scope of the present invention. In this case, printing is the application on a substrate of material having the specified optical properties, or the change of optical properties when thermal printing is used. Printing is also understood to mean the omission of a material having a given optical characteristic applied to a portion of the substrate when the substrate itself has a distinctive optical characteristic. For example, when printing a hexagonal color, if the base is white, only black cells should be printed, in which case the white hexagon is also a term imprint or printed within the setting range.

black or white it actually has this way, this

In this case, the term optical characteristics include light absorption, reflection and / or refraction in different environments in printed lattices. When the lattices are printed in black (high density black ink), gray (black grayscale), and white (absence of imprinting on white) as in the embodiment of the invention, it is said that the invention has three optical characteristics.

In this case, as shown in FIG. 1, a set of concentric rings or concentric rings 10 means two or more concentric rings 12, one of which is the inner region of the 15th annular zone defined by the smallest radius of the rings r.

FIG. Figure 2 shows a portion of an electro-optically readable label according to the present invention. As can be seen in FIG. 2, the label has a plurality of adjacent printed cells as hexagons forming a honeycomb structure. Each of the individual hexagons is denoted by position 20 and has 6 smooth sides 22. The inner angles of the hexagon are also equal to each after 120. In the illustrated embodiment, the hexagon has a long vertical axis y - y and a horizontal axis x - x. Hexagon dimension x - x is slightly smaller than hexagon 20 dimension y - y due to the correct hexagon geometry.

In the proposed embodiment of the invention shown in FIG. 3, which uses a label 30 having dimensions about once inches, which will be about 888 hexagons or lattices 20 (bearing in mind that in the preferred embodiment, the center of the label is occupied by a cognitive application 35 consisting of a plurality of concentric rings). These tangent hexagons 20 naturally form horizontal rows R defined by an imaginary line 31 and vertical columns C defined by an imaginary line 33. In this example, a label measuring one square inch has a total of 33 horizontal rows of R and 30 vertical columns of C hexagons 20. Each individual hexagon has a diameter of approximately 0.8 mm. In the square perimeter surrounding the cellular structure of the hexagons, due to the geometric arrangement of the hexagons conjoining, the rows R are larger than the columns C.

Using the hexagons shown in FIG. 2, it can be noted that the hexagons are arranged in chess with overlapping vertical columns, and that the hexadecimal hexagons have collinear axes y - y. The y-y axes of the arranged hexagons 20 are in a linear interface with the outside vertical side 22 of the interlaced hexagon. The y - y axes of the hexagons 20 are parallel to both vertical label boundaries 32 and 34 as shown in FIG. 3. Horizontal rows R are measured along the x - x axis. at the midpoint of the hexagon 20.

As described below, the hexagons 20 are formed by a printing process in which the hexagons 20 are printed in two or more optical gradations, such as contrast colors. These colors may be white 25, black 26, or optional, but gray 27 is preferred, as shown in FIG. 3, although other contrasting colors may be used. Only two contrast types of white 25 and black 26 can be used, as shown in FIG. 2. In the preferred embodiment of the invention, three contrasting colors are used: white 25, black 26 and gray 27 shown in FIG. 3. Specific white, black, and gray dashes are selected for optimum contrast in the presence of electro-optical identification. The gray color shall be chosen such that the optical gradations are approximately equal to those of the white and black colors used to create the label.

The label 30 shown in FIG. 30 may result from the use of a discrete label having an area of ​​one square inch in the embodiment of the invention, or if an acceptable color background (preferably white) is used, the label may be printed directly on the packaging surface without producing a separate label.

Since the presence of a background in the optical characteristic is essential and important, it is preferable to use a separate label for one of the contrasting colors, because the background color of the label is easier to control.

Aligning the hexagons printed on one label with respect to the edges of the label is important for further defining the major axis of the label, as discussed below. The label is printed such that the honeycomb forming the hexagonal axis y - y becomes parallel to the vertical edges of labels 32 and 34, as shown in FIG. 3.

When reading a hexagonal grid, for the purpose of decoding the information contained in individual hexagons, it is important to have accurate color contrast between adjacent hexagons. Further, the less optical characteristics used to encode hexagons, the simpler the scattering device and the mathematical provisioning needed to decode the hexagons. But with fewer optical gradations, the density of data on the label also decreases. In the search for a compromise between the number of decoded information that can be stored on a label and the cost of disseminating labels with most optical characteristics, it has been found desirable to print encoded hexagons with three optical characteristics, namely black, gray, and white. If the base or label has a good white background, when white hexagons can be filled with ink, you only need to actually print gray hexagons.

In the preferred embodiment of the invention, the hexagonal grid is created by printing the grid in black ink, but only every fifth grid pixel dot matrix printer in the illustrated example prints this way. This is accomplished by a semi-automation algorithm known in the art. This allows you to print with a predefined proportion of pixels that define a given gray hexagon, so when printing a black hexagon you need to print every single element of the image that determines that hexagon. A specific semiautonization algorithm used for printing labels according to the present invention is in the list of source code labeled Label, attached to microfiche, page 29, lines 39 to 48.

Black hexagonal lattices can be formed by printing them in standard black ink. As described below, the mathematical provisioning of the decomposition analysis decoding process allows a strong distinction between black, gray and white characteristics without the need for accurate color adjustment. On the other hand, if colors other than black, gray and white are used, or if different gradations of gray are used to create four- or five-color data grids, the contrast of the ink tones must be controlled much more closely to ensure the difference in optical performance between individual colors. It should be noted that the use of black ink is the simplest and easiest option for developing a cellular mesh with three optical properties of hexagonal lattices and is the most suitable embodiment of the present invention.

Due to the fact that, in the preferred embodiment, the label is square and due to the origin of the hexagonal lattice, the cellular structure edges have incomplete hexagons 56; as shown in FIG. 3, these incomplete hexagons are not used to convey any usable information.

In a preferred embodiment of the invention, the label also has a recognition application. The recognition target 35 shown in FIG. 3, made up of many concentric rings of contrasting colors (shown as black and white). The black rings are designated 42, 46 and 48 respectively, and the white rings are designated 44, 50 and 52 respectively. The application is most conveniently placed in the geometric center of the label to minimize the risk of injury or total or partial destruction if the peripheral portion is crumpled, soiled, or damaged. Also, the size of the image buffer (described below), which is necessary for memorizing readable data from the label before the label itself is identified, is minimized when the recognition target is located in the center of the label.

The number of concentric rings used in the application may vary, but six concentric rings 42, 44, 46, 48, 50 and 52 have been found to be necessary and sufficient and their effective resolution ranges from white to black, etc.

Structure correlation technology is used to align a computational structure in which concentric rings are expected to be integral with the readable structure. When debugging occurs, the recognition target is searched as detailed below. A special filter designed and used in the most preferred embodiment of the invention can be found in the microfiche appendix, page 41, lines 51 - 52, page 42, lines 1 - 8 and page 40, lines 19 - 41 with heading C.

The recognition target can have any overall diameter smaller than the data grid, creating an area that can be 25% and most preferably equal to about 7% of the data grid area. In most cases, the recognition target is made as small as possible because the space it occupies on the label cannot be filled with coded information. Preferably, the diameters of the rings to be printed are selected such that the outer limit 52 of the outer ring 52 is about 7.45 mm. In this way, FIG. 3 area 35 of the recognition target represents about 7% of the surface area of ​​the label per square inch 30. Here, a satisfactory recognition target 35 may be printed on a label 30 per square inch without affecting the amount of information that may be encoded in the hexagonal grid surrounding the recognition application. In the case of incomplete hexagons on the outer periphery of the label 55, piecewise hexagons in contact with the outer boundary of the recognition target 56 are not used to encode the information. The width of each ring should be approximately the size of the hexagons on the side / axis x - x fig. 1 /, this allows for improved resolution. Six rings fit. This is a good number to improve the presence of rings on the minimum label area with the minimum of possible misreading due to incorrect markings on the label and other incorrect tags not on the label itself but on the conveyor belt.

The recognition target may take a shape different from concentric circles. For example, can squares, spirals, or hexagons be used to create transitions of contrasting concentric shapes because the linear shifts in the sides? The recognition application allows for regular, task-based and identifiable color transitions that can be received by an electro-optical sensor and measured by a suitable filter. It should be noted that, although a helix and a set of non-concentric circles, a close approximation of the concentric circles can be obtained depending on the dimension and radius of the helix. The target of the concentric circles is most suitable because the frequency of the signal received through the center of 30 is zero, as is the case with the intersection in different directions through the center of the concentric circles. This helps to simplify the identification center, which will be discussed below, and enables the identification of the placement of the recognition target while simultaneously searching for an analog and digital broadcast signal, although the inventive method allows alternate or sequential use of high precision two-dimensional digital search.

In this case, concentric rings are called full rings, partial rings having a semicircular shape, sectors of concentric rings from 180 degrees to 360 degrees, and concentric spirals close to concentric rings.

Because each hexagon can be encoded with three different optical characteristics, the most suitable 1585-bit variant can be encoded in each hex (log. 3). Obviously, if the teristics are used, the number of more or less three optical characters encoded in each hexagon will change accordingly. The coding algorithm is designed to obtain data densities as close as possible to the maximum and to increase the number of cell-to-cell transitions of the optical characteristic, facilitating two-dimensional coded reproduction as described below.

FIG. 4 shows a set of cells 3x3 consisting of nine hexagonal cells 60, which is the basic coding unit used in the preferred embodiment of the invention. This is a sufficient condition in coding, but not essential. Other coding blocks are possible in the present invention. As shown below, 3x3 sets of hexagonal cells 60 are mapped to encode bit information 13 if the set is exactly 9 hexagons or less than 13 bits if the set is not full due to unused hexagons. On a single square inch label, a data grid of about 888 hexagons and a Recognition Media that occupies about 7% of the label area can store 1292 bits of information.

When encoding each set, the outer, lower hexagons 62 and shown in FIG. 4, each set 60 is limited, as limited by their respective characteristics, to being different from the intermediate and tangent hexagon 66. Thus, one bit of the hexagon can be encoded in hexagons 62 and 64. This can be encoded in 13 information bits 60 thanks to encoding 11 bits in the remaining seven hexagons. Because there are more possible combinations to encode 7 hexagons than are used (for example = 2187 combinations before

2ⁿ = 2048), some combinations are moving, like, for example, all black, all gray, all white, or essentially all black, gray, or white combinations.

for hexagons 62 and 64 result from transitions

The need for contrast colors relative to the hexagon 66 warranties for the required reproduction and free normalization as described below, as well as for use in determining the horizontal alignment of the data grid as described below. When encoding sets have 7 or 8 hexagons, the '7 useful hexagons are encoded by 11 bits, and the eighth hexagon, if any, encodes with one bit. For all other subassemblies, 3 bits are encoded on each pair of hexagons and 1 bit on each remaining single hexagon, as described below.

It is clear, therefore, that the label is very efficient, easy to read, (with the aid of an appropriate dissemination device and analytical mathematical provision), a label for encoding very high density information onto a relatively inexpensive, easy to print label. As noted above, the preferred embodiment uses a hexagonal layout of 33 rows x 30 columns per labeled area, with the cognitive application accounting for about 7% of the total label surface area. In practice, 13-bit information comes from a set of 9 hexagons, so that 1.44 bits of information are allocated to the cell. This is less than the theoretical 1.585 bits for the hexagon due to the other 7 encoding features of the algorithm, since not all of the 3 structures are used and some of the least optically desirable transitions are the lattice, which is removed.

From the following considerations, it is desirable, in a preferred embodiment of the invention, to introduce a degree of tamper protection in the encoding of the label such that the actual amount reproduced on the label during decoding of information is reduced to a high degree of data integrity.

As will be apparent to one of ordinary skill in the art, an example of an embodiment of a label using hexagonal lattices is provided that is directly applicable to optically readable labels having other polygonal lattices. The described methods for printing the optical characteristics of a hexagon are equally used for printing the optical characteristics of other polygonal cells in black, white, gray (semi-auto), as well as other colors. Similar disadvantages and advantages of data density are inherent to labels printed with polygonal cells, different from hexagons, where the optical characteristics are black, white, and not necessarily gray for printing polygonal cells. As with hexagonal labels, labels printed with other coding boxes can be read by a less sophisticated dispenser, where the polygonal boxes use only two optical characteristics to encode information, namely black and white, resulting in maximum contrast.

The information and algorithm coding procedures described for labels containing hexagons are directly used for labels printed with different polygonal cells. Correspondingly, for labels containing hexagons, cells with incomplete polygons, which may appear on the edge of an optically readable label or are obtained by partial blurring by an application having a sequence of concentric circles, are not used for coding information.

The cellular structure has a grid of hexagons 310 disposed tangentially, their geometric centers 311 located on the vertices of the hexagonal grid 311A ​​or the hexagonal grid 312, as shown in FIG. 11. The regular hexagons, that is to say, hexagons having six even sides and six smooth inner angles, form hexagonal lattices which are regular and have three evenly spaced axes, Al, A2, and A3 /, arranged at 120 degrees to each other.

If the hexagons of label 320 are irregular but symmetric, for example, if the hexagons are arranged along parallel sides 321, 322, the geometric centers 325 of adjacent hexagons will form an irregular hexagonal grid 327 shown in FIG. 12th Such an irregular hexagonal grid will still have three axes / Al, A2, and A3 / corresponding to the three symmetry axes of the irregularly shaped hexagons, but the three axes will not be evenly spaced, that is, the three axes will not be spaced at 120 degrees.

While the hexagonal grid shown in FIG. 12 is irregular in its origin, whether it is a two-dimensional geometric grid or a grid with axes of a given layout. In this way, the location and intervals of the geometric centers of the hexagons on the vertices of the intersecting axes of the hexagon are also given. The hexagonal grid geometry is then used in the decoding process described below. The phase of the filtering performed with the modified digital data corresponding to the image measured by the optical sensor is adjusted according to the image of the applied geometric label so that the digital expression of the measured label can be used to accurately reproduce the primary network. The points missed in the reproduction process are also interpreted from the hexagonal grid. Skipped grid points are due to the fact that they are evenly spaced, that is, because the transitions between polygons with similar optical characteristics did not occur in the optical characteristic.

In the case of irregular hexagonal grids as described in FIG. 12, preferably the step of defining the main axis, step / 3 // e / fig. 7 a decoding process performed after the Fourier step change to identify the principal axis of the optically readable label. The main axis of the label will have polygonal geometric centers etched along this axis at intervals other than the other two axes.

Label configurations of the invention approximating a preferred embodiment having polygonal lattices as described above are possible using established polygonal lattices. FIG. Fig. 13 shows a lattice configuration using polygonal lattices 330 which are very similar to hexagons, but which are 20 edge polygons rather than hexagons. Similarly created polygons with more or less 20 sides can also be printed. Polygons 330 are partially convergent, unlike imaginary converging hexagonal lattices 331 in which they are depicted.

In the label example of FIG. 13 intermediate intervals 332 may or may not decompose with different optical characteristics from encoded polygons. Capacities have no coded information, so their presence leads to lower data densities. But if the intermediate intervals scattered between the polygons have another optical characteristic different from the adjacent polygons, more transitions between the polygonal optical characteristics and the intermediate intervals can be observed by the optical transducer and therefore a higher energy signal occurs in the conversion area during the decoding process described below. , but the overall system noise level will also increase.

Due to the fact that the labels shown in FIG. 13, the polygons are arranged in a hexagonal grid having three evenly spaced axes, the geometric centers 333 of the polygonal lattices 330 lying on the vertices of the hexagonal grid 335. Because of the symmetrical nature of the drawings, the polygon's border layout, location, and spatial orientation appear fixed and can only be adjusted in the decoding process change area with the minor modifications needed in the .default synchronization program. Minor modifications have to be done with filters,_z used for filtering altered digital data showing coordinates, range, and luminance of optical characteristics measured by an optical sensor on an illuminated label image. Such modifications will be apparent to one skilled in the art.

Fig. Label 13 is used with hexagonal polygons. Individual polygons have more than three axes of symmetry, but because of their close proximity to the hexagon, the low-power optical sensor can read them as hexagons. The geometric centers 333 of the polygons 330 are located on the vertices of three evenly spaced axes / Al, A2 and A3 / on the hexagonal grid 335.

FIG. 14 is shown relative to the polygon 330 of FIG. 3, an analogous polygonal figure 340, which may be made in full contact. These polygons may be defined by the Imaginary Hexagon 341 shown in FIG. 13, but intermediate intervals cannot be discovered between existing polygons / fig. 332. 13 /. Such a touch arrangement is desirable to simplify the decoding process, but is not optional in the practice of the invention. Polygons 340 are shown as having their respective geometric centers 342 on the vertices of the hexagonal grid 345. Again, as for polygons 330 fig. 13, polygons 340 are essentially made as hexagons, and can be considered hexagons with low optical resolution.

FIG. Fig. 15 is a depiction of a label that would be obtained if it were printed with a dot matrix printing 200 pixels per inch. 15 confirms the shape of a geometric figure that is actually printed in place of a hexagon by such a dot matrix printer due to the density of the pixels in the printer. Printers with higher pixel densities must provide a more hexagonal approximation than the polygons shown in FIG. 15th In this way, the polygons 340 of FIG. 14 and 360. 15 are by-products due to some printer limitations labels that have hexagonal lattices or are persistent in order to print · polygons as essentially as the nearest hexagons. The shape of such polygons is essentially hexagonal, which allows them to function as the equivalents of the encoding cells of the tangent hexagons.

As in FIG. In case 3, the optically readable label shown in FIG. 15, has a recognition application 370 consisting of concentric rings 371-376. Like the hexagons on the label of FIG. 3, polygons 360, substantially as hexagons in FIG. 15, arranged in rows P a and in columns C, surrounded by imaginary lines 361 and 362 as well as 363 and 364 respectively. As in the case of the hexagons of FIG. 3, the polygons of FIG. 15th have their geometric centers on a hexagonal grid defined by evenly spaced vertices Al, A2 and A3. In this way, the labels shown in FIG. 15, encoded and decoded, depending on the methods described below.

If alternative label geometry with a square, rectangular, pentagonal, or octagonal grid or analogue structure is used, adjustment must be made in the binary process for resetting the sync. The different geometry of the decisive .net requires changes to be made to the filters used in the filtering step of the synchronization reset binary process. Filters work with altered digital data that conforms to the optical characteristics of polygons read by the sensor in the image area. Such minor adjustments to the filtration scheme can be made by a mid-range specialist. If the axes of the crucial two-dimensional grid are uneven, that is, when the grid is of irregular shape, it may be desirable to determine the major axis of the label before Fourier changes to the numerical data that characterize the optically measured image. This is because polygonal geometric centers have different spacing in the swap area.

Non-contact polygons can also be used to create an optically readable label. FIG. 16 shows a hexagonal grid of 420 frames which are disjointed and their respective geometric centers 422 are the vertices of a hexagonal grid formed by three equally spaced axes A1, A2 and A3. Obviously, the configuration of this case is based on a hexagon based on imaginary hexagons 421 arranged around polygons 420, resulting in intermediate intervals 425.

The analogous grids shown in FIG. 16, square 420 can be arranged using rectangles. FIG. 17 illustrates many rectangles 430 whose geometric centers are adjacent to the vertices of a hexagonal grid of intersecting axes Al, A2, and A3. Again, the representation of the hexagonal structure is supplemented by imaginary hexagons. 17, defined by non-contacting rectangles 430, thereby forming intermediate lines 435 between rectangles 430. FIG. 18 also shows a label formed by non-contacting pentagons 440 whose geometric centers are adjacent to the pentagonal 440 along three equally spaced axes Al, A2 and A3. The geometry of the non-contacting pentagons is further facilitated by describing the pentagons 440 with Imaginary Hexagons 441, while forming intervals 445 between the pentagons 440.

An alternative hexagonal grid may be formed when the grid axes Al, A2, and A3 are evenly spaced but do not match the symmetry axes of the polygonal shapes. Instead, the geometric centers of adjacent polygons lie on the vertices of intersecting axes. Such a device is shown in FIG. 19 having a set of tangent squares 450 and having geometric centers 451 adjacent squares arranged along axes Al, A2 and A3.

Higher-order polygons can distribute analogously on a given binary network. FIG. 20 shows a set of partially converging octagonal 460s defining most intermediate intervals 461 between octagonal 460s. The centers 462 of adjacent octagonal 460 are located on the vertices of intersecting axes Al and A2, thus forming a grid of octagonal 460 which can be used in the practice of the invention. The intermediate intervals 461 may be printed with an optical characteristic different from that used for the octagonal 460. But this is not necessary for the invention because it is the arrangement, orientation and sharpness of the optical characteristic at the center of the octagonal 460 which is , is more important in the decoding process.

In alternative octagonal examples, as in FIG. The origin of the 21 octagonal types is again apparent origin of the 472 adjacent octagonal 470s of the quadrilateral hexagonal grid along the axis Al, A2, and A3. In this case, the intermediate intervals 471 are larger and have a different geometry than the intermediate intervals 461 in FIG. 23. But it is precisely the positioning and direction of the geometrical shapes of the geometric centers along the axis Al, A2, and A3, as in the octagonal 460. 23 or octagonal 470 figs. 24th are important to the invention, not in the form of a goometric coding lattice or as arranged in contact with all coding lattices. This is to be understood by considering the decoding process described below. But, it should be clarified that the intermediate intervals 471 in the relative gland shown in FIG. 21, will increase noise, reduce sync reproducibility and data density, and will be discussed below. Intervals for Minimum Wisdom shown at positions 332 and 461. 13th and 20, respectively, are most suitable for the intervals 471 shown in FIG. 21, for the brave.

It is to be noted that although the preferred embodiment of the label is shown and described, various variations of the label are possible without departing from the scope of the invention. For example, the label does not have to be one square inch. One square inch has been wisely chosen for the label area, allowing for acceptable data densities of up to 100 alphanumeric characters · information, providing a high degree of error protection without creating a very large size label. It is desirable to have a label of one square inch to reduce the cost of paper and other printing, transportation and processing costs. Ordinary. on labels with analog-sized string code, data density was much lower. Using 4: 5 or more optical characteristics or color to highlight hexagons can accommodate much more information in a task. dimensions in hexagonal space, but this complicates the mathematical provision and the sensitivity of the dissemination system to reproduce this information. Thus, for practical reasons, a system with three optical characteristics: black, gray and white is highly desirable. Also, the dimensions of the hexagons and the recognition target can vary widely within the scope of the present invention.

Although the hexagon spin on sets in 3x3 cells is described above, other set structures can be used, or the spin can be completely removed, and the encoding algorithm can be specific to the individual hexagon structure. Also within the scope of the present invention, the relative amount of coded information for the message opposite the error correction may vary widely.

The coding process of the present invention described below is to be used for the most appropriate label variant. It is to be understood that the preferred embodiment is disclosed below, but numerous variations, combinations, and rearrangements are possible within the scope of the present invention.

The process can begin with the most appropriate sequence of data to be coded on the label. In a preferred embodiment, the label is weighted and the data is divided into; two fields encoded as a high priority message and a low priority message. However, it is necessary to clarify that the invention is not limited to two messages or priority ority levels within the given quantitative limitations.

levels. Most messages and customizers can be created based on the number of dimension labels and boxes

For example, when a label is to be weighted, on the floor, priority messages can decide on nine characters representing the postal code of the consignee's cargo, parcel or letter. Nine has nine numbers because, although most individuals and companies have five-digit zip codes, nine-digit zip codes are becoming more common. Therefore, the postal code is a very important part of the information when handling a consignment. It determines the main purpose of the cargo and allows the use of various dispersion systems and the control of the cargo so that it moves in the right direction in the car, airplane or conveyor system, etc.

Low-priority messages can have, for example, a name and a loading address, including the postal code of the consignee as well as billing information.

The reason for creating high-priority messages and low-priority messages is the need to protect a high-priority message correction error that allows you to place (encode) a high-priority message in the central part of the label, less likely to be damaged or destroyed by overuse repeating and sorting the high priority message in the low priority message so that if even a high priority message is partially destroyed, there is a good chance that the high priority message could recover from the low priority message. Due to the high priority message being placed in the center, it may only be necessary to decode the high priority message for some purposes, so that only part of the label will need to be processed, which will speed up the processing. This can happen, for example, when the cargo is on a conveyor and you only need to set a zip code to find out which of the several conveyor belts the cargo has to pass through.

Due to low priority, the message is not displayed twice on the label. But, as described below, both low-priority and high-priority messages may have different error-correction and correction codes to maximize the accuracy of both messages.

Using error protection symbols as part of the encoded information in a preferred embodiment of the invention, in combination with a properly written program and a computer, may cause the system to correct errors during the decoding process as described below. The use of error correction is well known in the art and is available to those skilled in the art.

When labeled, the operator can manually enter data into the appropriate computer terminal for connecting the printer which prints the label with the high priority message and the low priority message, respectively encoded on the hexagonal labels. It does not matter whether the high priority message and the low priority message will actually be created, but it is desirable to enable the key data for coding to be reproduced. In a preferred embodiment of the invention, the label is also printed with a centrally located recognition application having the majority of concentric rings in two alternating contrast colors, in addition the colors preferably selected for two hexagons and the most suitable black and white for maximum contrast.

The operator manually entering this data does so that a properly programmed computer encodes each outgoing message character using a field setter to create a binary bit sequence of message characters encoded in the managed computer in a high priority message and a low priority message from each relative position. for unmasking. This operation is performed by the TEXTI.Ca program, which is in the appendix, microfiche, page 1, lines 8-54, page 1, lines 1-54 and page 3, lines 1-36 and marked with position 110 in FIG. 9. A Compag Deskpro 366 computer (with a target frequency of 16 MHz and a coprocessor chip INTEL 80387) can be used.

The process may begin with the information that is already encoded in the binary bit sequence because it has, for example, been received from a memory device or otherwise generated. Therefore, the message to be encoded can exist in a form that is manually (electronically) converted to a binary bit sequence or fueled as a binary bit sequence.

As soon as the binary bit sequence is created or error-protected bit sequence at the stage discussed below, the bit sequence must be mapped according to the decisive - mapping structure for encoding the rectangular cellular structure of the present invention. FIG. Figure 5 shows a set card showing individual hexagonal cells in sets of 3x3 cells aligned to a grid or cellular structure containing 33 rows of hexagons and 30 rectangles. Each row is numbered and each column is numbered. Sequence numbers range from 1 to 33 and column numbers range from 1 to 30. It may be noted that some hexagons marked along the upper surface of the card and the right surface of the grid in the geometric center are denoted by x. This indicates that these hexagons do not have bit-coded information. This occurs because externally the x's are partial hexagons on the edge of the label, resulting in one hexagon less in each of these rows. Inner hexagons denoted by x form spaces either occupied by the recognition application or incomplete hexagons based on the perimeter of the recognition target such that these inner hexagons are not mapped to bits. All hexagons that are not marked with x are able to write down information. In a preferred embodiment, each of these spaces should be occupied by hexagons in black / B /,, white / W /, or gray / C /. As noted above, although various wrapping and mapping techniques may be used, the use of the present invention permits the use of packets for encoding specific information bits of 9 hexagons in three rows and 3 hexagons each, and as already described, preferably 13 information bits are encoded in each such packet. 9 hexagons each.

A data grid having 33 rows and 30 columns of intersecting hexagons is created and can be considered in relation to FIG. 5, a grid of 11 rows and 10 column hexagon sets, each with a converging hexagon structure of 3x3 lattice. It should be noted that each set of 3 rows of cells on a 3-column cell within a grid of 11 sets x 10 sets has a set of 7 or 8 hexagons due to the geometric placement of the hexagons and the number will change from row to row. Thus, 6 sets of 8 hexagons and 5 sets of 7 hexagons are obtained at such an arrangement. Also, the centered recognition application allows you to create additional incomplete sets. In this way, «fig. 5 shows a graphical representation of the sets used in the hexagons. The hexagons here encode bitwise information in a data grid like 33 rows of 30 triangles overlapping columns.

As shown in FIG. 4, sets of nine hexagons are encoded by the following algorithm:

Take eleven bits of information and map them in a sequence of seven hexagons marked a, c, d, e, f, and h.

Hexagons g and i use bit I to represent each so as to guarantee that each one differs from hexagonal h.

Thus, thirteen bits of information encode a complete set of 3x3 cells of nine tangent hexagons.

For partial sets of 7 or 8 usable hexagons:

Take eleven bits of information and map them in sequence from the first seven hexagons used. The eighth hexagon, if any, is used to represent a single bit.

For all other partial cells:

Map three bits of information into as many pairs of hexagons as possible. Uses any remaining unit hexagons to replace one bit.

Because seven hexagon mapping gives you more combinations than eleven bits (ie⁷ = 2187 before 2¹¹ = 2048), some hexagon combinations must be discarded. Rejected combinations become the ones with the lowest number of passes. In order to execute that Execution manual tables for mapping sets according to fig. 5. The creation and use of these reference tables can be done by a qualified software engineer. Accordingly, FIG. 9, BINHEX, LUT 132, and HEXBIN LUT 134 help tables can be found in the microfiche appendix, page 4, lines 3-52, page 5, lines 1-53 and page 6, lines 1-34 and labeled MKHEXT 13 0.

The use of this bit layout scheme allows encoding on a 1292-bit information data grid of 33 rows x 30 columns of converging hexagons.

The sequence in which the high priority information and the low priority information are spread throughout the sets card is most appropriate depending on:

1) High priority message size,

2) Low priority message size,

3) Optimal placement of the high priority message in a protected location.

Using the kit card shown in FIG. 5, as a program template for MKMAPS, the C 140 mapping memo, working with digital data contained in the memorization environment, performs the primary action of distributing information: Throughout the set card and high priority messages and low priority messages, this will be described below. The coding program is shown in the accompanying code list MKMAP.C '' 140 and can be found in the microfiche appendix on page 19, lines 3 - 53; page 20, lines 1-53, page 21 lines 1-53, and page 22 lines 1-42.

In order to reduce the possibility of error and to ensure the possibility of error correction, the preferred embodiment of the invention must have extensive error protection and correction capabilities. For example, in a preferred embodiment having 1292 bits of information that can be encoded in a hexagonal grid of one square inch having 22 rows x 30 columns of hexagons and an recognition application occupying about 7% of the label, preferably 36 bits of information are preferred 9 for the zip code plus one additional alphanumeric character, which must represent the loading code. This example should also use 120 check boxes indicating the high priority message. This is determined by the number of corrections to the required opportunity error. In the example shown in the example, the 560-bit low-priority message, that is, the 40-bit high-priority message that is turned into the low-priority message. In the example shown, 516 low priority message check bits are added to: · create security and facilitate low priority message recovery. This example illustrates a more grateful use of check bits to protect and have the ability to restore high priority messages as opposed to low priority messages. It is to be clarified that the information provided is merely an example and the high priority message may have been longer or shorter, the low priority message longer or shorter, the number of control bits higher or lower depending on the correct use of the invention.

The system code takes on a specific message sequence and adds a different error checking sequence and message sequence. The non-systemic code takes the sequence of the specific message and enters the error checking sequence with the message sequence so that the message is no longer different but is clearly reproducible. The use of systematic or non-systemic coding for error protection is within the scope of the present invention. The following is the system code.

It has already been shown that the step of inserting error-detection symbols consists of systematic and / or non-systematic coding.

Various systematic linear cyclic codes for protection against error are known in the art, such as BCH codes, Rido - Solomon codes, Heming codes. In a preferred embodiment of the invention, the Rido-Solomon codes are separately enabled for storing high and low priority messages. Rido - Solomon codes are very effective and most useful when checking for multi-character errors. Rido-Solomon codes are well known and need to be explained that this is the preferred option, although other codes with error correction may be used in the invention. Reed - Solomon and other coding systems are described, for example, in Theory and Practice of Error Control Codes, by Richard E. Blachut and Edison Wales, 1983, pages 174 - 175.

The following are examples of Rido - Solomon code information. Specific characteristics of Rido - Solomon code:

m = number of bits in each character, n = number of characters in a block - 2⁶-l, k = number of message characters, (number of message bits = k), t = correction power in number of characters = (n - k): 2

The multi-digit zip code and single digit alphanumeric character for subsequent recognition purposes require 36 bits without error protection, as described below. Rido - Solomon code with these parameters was selected for high priority message.

m = 66 - bit characters, n = 2⁶ - 1 = 63 t = 10 so k = n - 2t = 43

Due to the fact that only six 6-bee characters are needed

- for bit message, the remaining characters / 43-6 / are redundant characters that are meant between encoders and decoders and do not need to be labeled. In this way, the total number of bits required by the label for high priority message is / 63 - 37 / x 6 or 156 bits.

This encoding scheme will be able to correct errors up to a maximum of 60 (10x6) bits, representing up to 38.5% of the bits used. Due to the large number of available superfluous characters, the high ability of Rido - Solomon coding to detect errors makes it absolutely impossible to read high - priority messages incorrectly.

The low priority message was encoded in a Rido - Solomon code with error protection with other parameters, namely m = 8/8 - bit characters, n - 2⁸ - 1 = 255

<td></td><td>t = X =</td><td>36 n -</td><td>2t =</td><td> 183</td><td></td>

<td>Because of</td><td>the</td><td>that</td><td>is</td><td>1292 coding</td><td>bits on the label</td>

<td colspan="2">by agreement</td><td>with</td><td>this</td><td colspan="2">for example, the total number of bits</td>

<td> 1336</td><td>bits</td><td colspan="2"> (1292 -</td><td>156 bits high</td><td>priority message</td>

Shimo and check bits) are low priority message for coding and check bits. That way, the remaining 904 bits / 255x8-1136 / are to be understood as excess bits. This allows for 560 bits / 183x8-904 for informational content of low priority message and 576 check bits.

For a more reliable restoration of the high priority message, it is also in the low priority message. Anti-Errors The Rido-Solomon code used for low-priority messaging allows for additional 86 6-bit numeric-alphabetic character encoding and has a maximum error correction power of about 25.4%.

Using the Rido - Solomon error code provides general information from the 1292 bits on the illustrative label below:

high priority information bits 120 check high priority bits 560 low priority information bits (activating 40 high priority message bits connected to low priority messages)

576 low priority check bits.

A sequence of data bits combining respective information save check bits for individual hexagons in the assembly card of FIG. 5

It should be noted that many different distribution schemes can be used, bearing in mind that important criteria to be established are:

1) Safe positioning of high priority message near recognition target (if displayed on data grid)

2) Creating a structure within reasonable limits for repeated assembly reading.

The specific error coding program used in the example is in the microfiche appendix titled EPPCO EC on page 15, lines 1-52 and page 16, lines 1-50.

Rido - Solomon coding requires the execution of a vector code message propagation from a generator matrix. Matrix multiplication is performed using Galua field arithmetic. The addition of any two field elements is obtained by performing or action between component elements. Multiplication is obtained by logarithmic field Galua field. The logarithms and antilogarithms are obtained using reference tables consisting of the first polynomials, especially for high priority messages: 1 + x6; and low priority messages: 1 + χ² + χ³ + χ⁴ + x⁸. As shown in FIG. 9, the GF.C 126 utility provides compilation tables for Galua field arithmetic. The GF.C utility can be found in the microfiche appendix on page 8, lines 1-53, and page 9, lines 1-32. Help tables are created and stored in the GF./ 127 file during encoding and decoding. The generic polynomial q / x / determines Rido for Solomon's code by the following equation:

q / x / = / x + a // x + a²/.../xa^2t/ where a base element of the Galua field.

The generator matrix for Rido - Solomon Code is formed by the long division of each row of the generator matrix. Each row of the generator matrix is ​​given by the relation - i the residue after the long division by dividing x by q / x /.

Calculations of the generic polynomial q / x / as well as the geometric matrices of the high and low priority messages are performed by the utility MKRSL V. C 125, which is in the microfiche appendix on page 10, lines 1 to 52, page 11, lines 1 to 53, page 12, lines 1 to 54 on page 13, lines 1 to 52, page 14, lines 1 to 4. Reference tables of generator matrices are created and stored in file R S. LUT 128.

In a preferred embodiment of the invention, the labels containing the hexagons are printed with standard equipment, which is always available and inexpensive. A 300 x 300 dots per inch inch print device produces good results when printing tri-color (black, white, gray) labels with 888 hexagons and a center-based recognition application. This resolution is matched by the Laser Jet 11 Series from Hjulet - Pakkard and comes with a 0.5 megabyte of memory and a resolution of 300 dots per inch. Elements Image Network

300 The x 300, which has a density of 90,000 pixels per square inch, can produce about 90 pixels into a hexagon in a preferred embodiment. Each pixel is assigned a value of 0 or 1, which corresponds to a black or white pixel. This printing device is used to print a two-color grid of black or white hexagons. It can also be used to print a tri-color grid of black, white, and gray hexagons, provided that the grayscale algorithm for creating gray hexagons is used, as described above.

As depicted in FIG. 9, a help table PEGIONS.LUT 141 was created by means of the program MKMAPC.C 140 from 34 rows and 30 columns, which is analogous to that shown in FIG. 5, but which is only adapted for black or white selection markings, recognition ring. Individual hexagons are coded as black, white, or gray, or as unused. Separate Reference Table ΗΕΧ MAP. A written subroutine of the MKMAPS.C program is created in LUT 142, which assigns dependencies to specific regions of each of the 300 x 300 pixels on the pixel grid. LUT 141, which is about 90 pixels on hexagons. The pixels in the orientation rings are coded in either black or white. Recognition target rings are printed first, due to the generation of a hexagonal structure in the row of each area, and then areas of the rings partially or completely covered by rings are considered to be inoperable

NS.LUT 141. The previous MKMAPS.C program and subroutines can be found in the attached source list in the microfiche appendix, pages 19 - 22.

generating lawsuits

The encoded bit sequence, which protects against errors, is mapped according to the most suitable sequence into a prefabricated 11x10 hexagon. As shown in FIG. 9, the sequence is queried for the ordered help table ORDER.LUT 151, generated by an auxiliary written program called ORDER.C 150, which is in the microfiche appendix, page 26, lines 1-47, and page 27, lines 1-3. The program PRLABEL.C 160 written on the microfiche attachment on page 17, lines 1-54 and 18, lines 1-39 is used to assign values ​​0, 1 and 2 to areas printed on the label, and the area with value 3 leaves unchanged. Grayscale levels are assigned to each of the 3x3 cells in the hexagon set in conjunction with the recorded program CELL CODE.C 170, which can be found in the microfiche appendix on page 23,. lines 1 to 53 on page 24, lines 1 to 53, page 25, lines 1 to 43.

Priority is given to a high priority message in the area of ​​proximity to the memorization target, where it will be less affected by label degradation, settles into this. utility program. As a result, the LABEL.C 180 program is used to create bits suitable for input to a laser print device. LABEL.C 180 can be found in the microfiche supplement, page 28, lines 1-53, page 25, lines 1-52, page 30, lines 1-36.

It should be noted that the use of black, gray and white allows for a simple label printing procedure, all that is required is black ink, using a standard semi-automation algorithm well known in the art. If other color combinations are used (which is possible), the need to print in other colors poses a fundamental problem when compared to the tricolor black - gray - white version or the bi - color black - white version.

In this way, when each of the printer pixels is given a black or white size, the labels can be printed to create an encoded format as shown in FIG. 3, where some hexagons are white, some are gray and some are black, and where the recognition target area - the most appropriate black and white concentric rings - is in the geometric center of the label.

After describing how the data is written on the label and how it is printed, it is also necessary to describe the interpretation of the label or the decoding process. It should be noted that it is desirable to perform the interpretation function at high speed, in a fraction of a second, in order to increase the efficiency of cargo handling (or other processing or label reading).

There are two main paths that can be used in the process of reading a label to receive an image. The label can be read at relatively low speeds using a manual statistical dispenser with a fixed focal point. Alternatively, it is very convenient to use an electro-optical sensor with a servo-controlled focusing mechanism, which allows the dynamic dispersion of fast moving variable dimensions and height - the load, so the work is very fast. The decoding process and the device described below have been demonstrated by the use of a fixed focal unit. The process having the basic capabilities described herein with respect to a static scattering device with a fixed focal point can be applied to a dynamic scattering system with defined optical system modifications, as described below. For high-speed handling, it is desirable to have a high-speed dispersion mechanism that allows labels to be read at a linear speed of 2.5 m. per second or more and passing under a fixed reading device. In this way, the image processing function consists of the following steps. FIG. Figure 7 is a schematic diagram of the steps of the decoding process.

I. Label Lighting

When a packing, parcel or letter passes through a high-speed conveyor, the area for illumination appears large enough because the dimensions of the packing for a conveyor can be large and variable. For example, load handling systems have an unusual 1m conveyor and packages ranging from a few inches to a meter (and similar in height). Therefore, a one-square-inch label can be placed anywhere on the conveyor. it is possible that the packages will also be angled with respect to the axis of movement of the conveyor belt. Packages, packages, letters, or similar items may be of various heights, and dispersion labels may appear, for example, above the conveyor at a distance of one inch or less on one side, or up to 90 cm or more of the maximum amount of in height, on the other.

For the purpose of illuminating labels in accordance with the present invention, particularly with respect to a wide range of package widths, heights, and labeling angles, it is desirable to utilize a high-intensity light source that or the visible and used visible light spectrum may vary. Light measurement technique usually consists of measuring light reflected from a black, white, or gray labeled hexagon.

The light source must produce enough light reflected to the light sensor (for example, a device with a charge connection, described below) so that the light sensor can reliably distinguish the optical characteristics of hexagons for measurement between black, gray and white or any other shade. Dynamic scattering system can use a LED grid to create a 10 bmt / cm illumination level on the label illumination area at the label level · The LEDs can be in a volumetric non-focal lens grid or in a linear grid using cylindrical focusing lenses. The laser light source transmitted through the respective optical system constituting the linear illumination source may be used in the present invention.

Selection of light source and source properties for the application being considered within the skill of the art. It is important to note that the label you are looking for can have a maximum area of ​​only one square inch at a height of 90 cm on a 1m wide band moving at 2.5m / s. It is very important to illuminate the labels so that those labels can be sufficiently identified and discovered.

In the case of a static transducer with a fixed focus, which is used in this example, the illumination level of 2 MW / cm proved to be sufficient for the practice of the invention. This was done by a luminescent light source.

2. Optical Measurement of Reflected Label Image

The second step in the decoding part of the tuning part is the optical measurement of the illuminated part by an electrically controlled sensor. The hardware light sensor used in this example uses a high quality industrial color television camera, Model WV-CD 130, by Panasonic Industrial Company Van, for a static diffuser system with a fixed focal point

Panasonic Ve j, Secokus, New Jersey 07094, Connected to a Television Lens by Turning on a 5mm Extension Tube with 50mm Focal Lens, 1.3 Luminous Power, DO Industries, Ink (Japan), 317 Ist Cestnat Strit, Ist Rochester, New York 1445 and the NAVITRON ™ brand. The camera is connected to an invention coverage plate designated DT-2803-60 by Deita transleišen Ink., 100 Lok Draiv, Malboro, Masajiets 0175 2.

Optical measurement can include an overview of the entire label, using the above-described camera-type spatial sensor and the scope plate of the invention, or alternatively, a linear grid sensor having a device with a chip chip in which a second measurement of label dispersion is performed by packaging (and label). movement. A Tomson CSFTNX 31510 SD3 Charging Device Chip is suitable for this purpose, Item 4096 A high-speed linear imaging device with a charge communication device provided by Tompson CSF, Divižin Tjūbs Elektronics, Clica Voter BP 305 92102 Bulon-Bijankur Seating, France.

In dynamic systems in which the labeled cargo moves on a conveyor, it is desirable to have a long optical path between the recognizable labels and the light source. The first purpose of creating a long optical path is to reduce or increase the apparent change in dimension of the label as measured by a remote light sensor. For example, if the optical path is, for example, 1 m by 20 cm, the visible size of the label on the conveyor belt will be very different from the size of the labels at 90 cm. distance above the conveyor belt. If an optical path of six meters is used, the apparent dimensions of the same labels will be the same. This makes it possible to fill the entire or virtually entire area of ​​the light sensor irrespective of height with the measuring range 3517 B, which allows for high image dissipation power. If a spatial sensor is used instead of a linear sensor, the same principle applies. This can be accomplished by the long optical path shown in FIG. 6th

A height sensor is required to focus on labels of varying heights. An ultrasonic transducer may be used or the beam sequence may be interrupted as a transducer. Any of these systems may be utilized and may actuate a suitable adjustable focusing mechanism with closed or open loops for optical measuring elements (such as lenses or transducer) dependent upon each other on the continuous base shown in FIG. 6, position measurement and adjustment.

FIG. Fig. 6 is a schematic view of the focusing system and adjusting the position of the light sensor of the camera operating according to the invention according to the height of the load being checked. FIG. 6 shows a lens 196, a coil drive, a height sensor and a feedback loop suitable for the invention. FIG. The height sensor 206 may be an ultrasonic height sensor or a beam of light interrupted by each load moving on the conveyor. The height sensor output signal is fed to a microprocessor element 204 that engages a coil actuator 202 that moves the coil 200 on which is mounted a device 198 with a spindle position connection or other suitable light sensor. The sensor 208 measures the position of the coil 200 and its output to the microprocessor element 204 completes the measurement and control circuit for the position of the feedback coil 200.

The transducer shall measure the reflected light reflected from the illuminated label and shall also produce an analogue signal corresponding to the brightness of the characteristics of the reflective label recorded by the individual pixels of the electro-optical transducer.

A suitable light source, as described above, may be placed on a conveyor on a stationary surface and include an area extending across the entire width of the conveyor with light of optimum quality. The light reflected from the label may shift according to the reflector sequence and then be measured by an electro-optical sensor.

The goal of a curved optical path is to create a compact, and therefore solid, system.

Outputs the analog sensor video signal. An analog electrical signal is used in conjunction with an analog bandpass filter to locate a recognition application on a data grid. The analog signal is then inverted into a digital signal using a simple analog-to-digital converter embedded in the image capture board described below or other known means. Instead of an analog bandpass filter, a digital filtering scheme can be constructed to identify the recognition target and compare the digital data representing it to the quantized output of the analog to digital converter, which will be described below.

An example of a spatial transducer having a device with a charge connection with a plurality of detectors used according to the invention is a color television camera of the type Panasonic WV CB 130 described above. An analog output of the transducer output was provided on a DT-280 3-60 data capture video capture board of the type described above, which has a 6-bit monochromatic analog-to-digital video conversion for quantization and further processing of the 3517B. The recorded output of a suitable subroutine, arranged with the aid of a suitable subroutine, was stored on the memory device as an exact replica of the image recorded by an optical sensor.

3. Reflected image processing

The most important part of the invention is the processing of an optically measured image to re-create and orient the configuration and color (optical characteristics) of the primary label to each hexagon. This is accomplished by the following steps, after which the known structure by which the label was originally encoded and bit-mapped can be used to decode the information contained in the label.

a) Finding the center of the target

Prior to use, the above-described camcorder with charge communication device and image volume plates shown in FIG. 10, a minimization program for skipping the DTWIT.C 250 image-volume board to a known ready position and loading the output departmental tables was skipped, followed by DTL IVE.C 255, which inserts the video-volume board into live mode. DTGRAB.C then controls the workload of the image volume board based on the 'quantization of vision' in the image memory into 250 rows and 256 columns, and the samples are memorized as 6-bit sizes aligned to the right in bytes. The aforementioned programs can be found in the microfiche appendix in column 31, lines 1-53, page 32, lines 1-39, page 33, lines 1-22 and 34, lines 1-19. Auxiliary programs DTSAVE.C and DTLOAD.C allow you to transfer the screen image to and from the storage device. Source code lists for the given programs can be found in the microfiche supplement on page 35, lines 12 - 33, 36, lines 13 - 33, respectively.

A standard analogue bandpass filter may be used to initialize the label image to identify the characteristics of two or more concentric rings of the recognition target. Both characteristics are best represented by black and white because the highest energy signal is the highest contrast. In order to find a fixed transition structure from black to white and again to black and 1.1, it is desirable that linear scattering through the recognition application and the passage through the center of the application produces a homogeneous frequency response regardless of the label orientation. In this way, the target rings are optimally composed of contrasting concentric rings. The output of the transducer is then doubled and selected in two directions of detection. In one direction, all the energy in the output signal is detected, and the other energy is measured in the ring frequency. When comparing the output signals, the energy in the ring detector is the closest to the energy in the full energy detector when tile measurement is made with the center of the recognition target. The center of the recognition target is found at this closest approximation, source code lists attributed to the creation and filtering process of the digital tape filter can be found in the microfiche attachment, file name FEND.C, pages 39-43. But in the dynamics of the preferred embodiment of the invention in the first filtration step, an analog bandpass filter or, in addition, a selective bandpass filter, although a digital filter, is preferred.

It should be noted that the step of searching for the identification media labeled as DTLOAD.C in FIG. 10, shown as optional in FIG. 7, due to the fact that the hand scattering device can be used in the method of the invention, and in this case the operator can precisely position the scattering device in order to guarantee correct alignment of the sensor. This is obviously much slower than using an automatic sensor, and using an automatic sensor is best if you are working at high speed. If the automatic sensor (rather than the manual) is used at work, finding the target is a necessary step in the process.

As an alternative to the analog filter described above, a digital bandpass filter using the Parks-Maclenon algorithm can be constructed, accompanied by a mathematical provision Mathematical provision of digital filter constructions by IBM PC Teilo and Stauraitis, Marsel Dekter, Ink., New York, 1987.

One-dimensional digital bandpass filter is used in connection with the invention for filtering a normalized digital bit sequence, which is described below with the aid of the following filtering subroutine. The band to be filtered is the expected frequency of the ring. The one-dimensional digital bandpass filter was designed for a sampling rate of 400 pixels per inch and a length of 125 pixels (or 0.3125 inches), and was designed to work on the basis of the printed ring recognition target dimension as shown in FIG. 3. The frequency was 300/16 linear pairs per inch, with the normalized frequency output (where 400 pairs of lines per inch = 1 / B 300/16 x 400 or 0.046875. Filter with band '5% below this frequency and 15% above , was selected because label distortions typically result in image shrinkage and hence increased frequency, retention bands were made from 15% below the frequency down to 0 and 25% above the ring frequency to 0.5 (the Nyquist limit). The filter coefficients were stored in the file IMPULSE.LUT 275, fig. 10, for further operations the first 62 coefficients are distinguished because the filter is symmetric. FIG. 8 shows a block diagram of the program. Further references can be made to the source code lists included in the microfiche attachments, filename FIND.C 280, starting on page 39.

A filter of 25 pixels in length was made due to the selection of a bandpass filter at output intervals corresponding to the measured horizontal gain. For example, if horizontal image enhancement is 80 pixels per inch, every fifth filter selection will be used (400/80 = 5 pixels). For incomplete stages, linear interpolation of the selections in the adjacent filter is used.

A second two-dimensional filter 25 on 15 pixels was also used. The sample sizes for this two-dimensional filter are based on the Euclidean distance of each point from the filter center, which has been scaled accordingly for horizontal and vertical gain. It then uses linear interpolation for incomplete sampling intervals.

The output of the specified one-dimensional filter was squared and then compared to a recursive low-pass first order filter providing an exponential window of the expired process. When the smoothing filter output exceeds a specified threshold, it does not necessarily use a two-dimensional filtering step to confirm the existence of the target and determine its exact location, this is discussed below. In the first part of the two-dimensional filtering, I used a small-size 10-pixel-to-10-pixel filter, because of the computational economy. This filter emits a rectangular area around a layout defined by a one-dimensional filter. If the maximum two-dimensional correlation exceeds a given threshold, then the final stage of two-dimensional filtering with full filter 25 x 25 pixels was used for a small square window around the maximum. If the best result of this filter exceeds the set limit, the center is detected. If none of the limits were exceeded, the program temporarily unloaded the smoothing filter and returned to one-dimensional dispersion. If the one-dimensional propagation ended without the detection of the existence of the recognition target, the program exited with a return error. For any other filtering process used in the illustrative example, it is necessary to refer to the source code lists in the microfiche appendix, lines 39-42.

b) Normalization of the measured image

The brightness of the reflected light recorded by the optical sensor used in the process may vary due to light variations, print density, paper reflectance, camera sensitivity, and other reasons, including label damage such as bends, folding, etc. Not necessary but desirable light reflectance , measured by the sensor and transmitted to the memory, the phase can be normalized by a standard procedure. Using the state-of-the-art technology, the normalization program NORM.C 270 is depicted in FIG. 10, was used to analyze the brightness levels reflected from the label light reflected by the pixel blocks in the scatter unit to discover the maximum and minimum of the reflected light intensities recorded on the data grid. The ordered digital output of the specified scanner and the combination with the image-size plate from memory were stored on a computer for further processing by a written normalization program.

Using the equation y = x + b, where the minimum brightness placed on the x position would give y = 0 and the maximum brightness on the x position would give y = 63, the brightness values ​​recorded for each light-reflecting pixel were adjusted as follows: so that the blackest color and whiter color in the captured image are maintained as standards, and other reflections of black, white and gray are raised to these standards. In this way, the normalization step facilitates the processing of the measured image. Normalization is accomplished using the recorded program NORM.C, which can be found in the microfiche appendix on page 37, lines 10 - 52 and 38, lines 1-11. It should be noted that perfect normalization procedures known in the art will be employed.

c) Image Calculation

For subsequent calculations, the reflected image of the reflected label is recalculated to produce an image with uniform horizontal and vertical gain. Again, this is not a necessary step, but it does facilitate the quick and accurate act of posting encoded information that has been performed in a picture-smooth horizontal and rendering. to make it vertical

To render a screen resolution of, for example, 150 pixels per inch, this is shown by the focus of the exemplary invention.

in static with fixed

The conversion action is performed by subtracting small address rows and columns to 1/150 inch based on known horizontal and vertical gain. Each point in the new solid-state converted image is then distinguished in the corresponding set of points in the replicated memory. For point size approximations, small addresses use binary interpolation. Due to the conversion, the center of the label is placed in a known memory position. The re-calculated image is memorized for further use in the search phase. Used in all subsequent steps of the process to recalculate the label image centLT 3517 B is in a known position on the grid, but it should be noted that this does not indicate the orientation of the label, which may be asymmetric with respect to the transducer. The conversion operation is controlled by the recorded gramme, which is listed in the microfiche on page 42, lines 14 to 52, and 43, lines 1-4.

d) Two-dimensional synchronous reset

The following set of process steps is called two-dimensional synchronous reset. The steps are performed with the aid of a suitable program and subroutine called CIOCK.C 290, shown in FIG. 10 and contained in the microfiche appendix on pages 44 - 51. This operation is performed in two measurements on the converted image to accurately determine the position of the hexagon on the primary data grid. The purpose of synchronous resetting is to locate sampling points and correct defects in the crease, twist, or deflection label, as the label cannot be completely flat. This is an important part of the process and is not defined by six-corner coding labels. This operation is also applicable to other encoded label decoding processes consisting of regular 2D grid squares, triangles, etc.

One-dimensional synchronous reset is a common concept well understood in signal processing. Two-dimensional synchronous reset is a continuation of this process and will be understood by some skilled practitioner. It is to be understood that the term synchronous restoration is not misleading for the expert and therefore does not belong to synchronization.

⁶⁵

(i) Edge reinforcement and non-linear machining

The first step of synchronous reconstruction can be accomplished by various non-linear mapping operations known in the art for rotating signal components to a given synchronization frequency, which are output from an optical sensor in the image quantum output and the image volume board. The purpose of nonlinear mapping is to (preferably) capture the normalized and recalculated image that exists at this point during the process and form a two-dimensional non-linear card that enhances transitions between adjacent contrasting hexagons. In a preferred embodiment of the invention, this is done by standard error mapping. This step can also be performed by means of image differentiation kernel filtering, some filtering means being known in the art.

Laplace or Sobel type cores, and then determine the absolute size or square the results. These procedures can be found in Digital Image Processing, Raphael I, Gonsales, and Paul Vintz, Eds. Edison Weird, 1977

By plotting the standard deviation, the image with undifferentiated edges is a grid - the grid is memorized in memory. A standard deviation card is then created to determine the locations of the contrasting contrast hexagons by defining standard deviations for the 3x3 sets of pixel groups (which are different from the 3x3 grid sets), for determining standard deviations of pixel brightness. Performs standard deviation calculations to determine local pixels with a fixed color (the smallest standard deviations that form the center of a hexagon or subdivision between monochrome hexagons, as opposed to groups of pixels with larger standard deviations that make the transition from one color hexagon to adjacent hexagon in contrasting color. Because adjacent hexagons often have the same color, the standard deviation card does not fully distinguish each hexagon. Due to the fact that the standard deviation mapping process does not distinguish the boundary between hexagons of the same color, these hexagons result in skipped boundaries or edges. Other aspects of the synchronous reproduction process are directed to the regeneration of these missed transitions.

In the present invention, the decoding process can be applied to any of the examples described above. Coding blocks of various geometries can easily adapt, and these coded polygonal cells can be centered on the vertices of a known decisive two-dimensional grid.

When optically read labels according to the present invention read by optical sensors of the types described herein, the specific geometry or shape of the individual coding blocks or polygonal cells is not determined by the optical sensor. Instead, the transducer simply tests the optically readable label on a known number of samples per inch and records the brightness of the reflected light corresponding to the characteristic of the particular test area depicted. These values ​​are then memorized by the recording media for further processing. In other words, the electro-optical sensor allows you to record the average luminous brightness of the specimen area after the area across the entire label surface, whether printed on the label or not. This is exactly what is meant by capturing an image with unchanged edges from the grid to the grid. To this end, the decoding process · instantly adapts to reading optically readable labels with a wide range of configurations as the centers of the spherical coding blocks are located on the spaces and directions of the two-dimensional grid.

The preferred variant of the label, which uses tangent hexagonal coding cells, results in the formation of a hexagonal cellular or hexagonal lattice, which results in a higher energy being recorded at the target test point because of the density of the hexagonal coding blocks. In temporally convergent grids, levels of polygonal coding cells or non-converging grids, with noise levels produced by the optical characteristics of the intermediate ranges, can cause a reduction in the ratio signal - noise recorded by an electro-optical sensor, which reduces the efficiency of the entire label reading system. Of course, a number of other considerations, including contamination on labels, cracks, blemishes, and wrinkling of labels, as an addition to the intervals between coding cells, if the polygonal coding cells are not in contact, may also produce additional noise and thereby reduce the reproduced signal.

In practice, it has been found that variations of the hexagonal lattice coding system, as in the case of labels, use polygons substantially in the shape of the hexagons shown in FIG. 15, can only yield a modest reduction in the total signal, and thus a slight reduction in the information sensitivity of the system. Using polygonal shapes with poor placement characteristics or meshes of partially converging or non-converging polygons and non-converging packaging can provide a weaker but at the same time useful signal for many applications. But at some point, the system ratio signal - noise due to the strongly expressed shape of the polygonal coding cells, the inefficient lattice padding, and the large ctvnuacial dials of large cells between the polygons - will drop to unacceptably low information memorization and reproduction capacities.

The acceptability of the system depends on the quality of the signal reproduced by the electro-optical sensor. By converting a measuring system, such as the number of samples per unit, the surface area of ​​the label can be enhanced by improving the reproduction of the signal recorded by the transducer, and improving information memorization and reproduction of the partially convergent and non-convergent label configurations.

Such adjustments, which make labels of less desirable configurations usable, are entirely within the capabilities of signal processing specialists.

Therefore, the process allows to extend the limits of the useful signal-to-noise ratio. Thus, polygonal lattices of regular and irregular shapes can be used as encoding units on an optically readable label according to the present invention. In addition, since the polygon center spacing and direction are known with respect to adjacent polygonal lattices, polygonal coding lattices may be on a target grid rather than a hexagonal lattice, and polygons may be tangent, partially tangent, or even non-tangent to an optically readable label.

As described below, non-linear mapping technology, namely, standard deviation mapping technology, as described in the preferred embodiment, facilitates missed transitions or edges between polygonal lattices with similar optical characteristics. In addition, one and the same feature can compensate for the loss of transitions between polygons and defeat intermediate intervals between polygons with different optical characteristics. This is a situation where label configurations consisting of partially converging and non- converging polygons are used in practice. This feature is accomplished by the subsequent fast Fourier change, filtration, and reverse fast Fourier change.

In the preferred embodiment of the invention, the use of unnecessary technology can reduce the number of calculations required to form a standard deviation card. Calculating the sum of a nine-pixel image in a 3x3 pixel block would require eight composite operations. This can be reduced by doubling the amount of each element of the image itself by changing the amount of the image itself and the image elements to the right and left of it. This would require two composition steps for the pixel. The same operation is then performed on the new image without the amount converted to the pixels directly above and below. This requires two more composition actions, making the total number of composition actions four. It can be shown that at the end of these stages each pixel is replaced by the sum of its own and its eight direct neighbors.

Standard deviation mapping is a necessary technology in creating this hexagonal card, which corresponds to the primary data grid, but only with transitions skipping between the primary hexagons of the same color. The specific standard deviation mapping technology used for the example shown can be found in the source code listings in the microfiche appendix on page 45, lines 14 - 53, page 46, lines 1-4.

(ii) Framing

The following, called framing, is a subroutine that is optional. In the practice of the invention, framing was used to reduce the brightness of the boundaries that are not bound to the outline of the hexagon. These boundaries occur at two points: the target ring and the uncontrolled image that surrounds the label. The comparative function is used to reduce the brightness of these areas. Details on how to use framing as an additional tag for quicker Fourier changes are within the purview of those skilled in the art. The framing procedure used can be found in the source code list in the microfiche appendix on page 46, lines 6 - 22.

iii) Two-dimensional fast Fourier replacement

The two-dimensional quick change of Fourier numerical values ​​corresponding to a (not necessarily) framed standard deviation card is then executed under the control of common recorded programs. During work, the computer executes a sharp Fourier change of the sharpness, transition, and transition range of the image created in the previous step for the presentation of the two-dimensional layout, contrast, and transition limits of the hexagons found in the standard deviation mapping step. In other words, a fast Fourier change is the border between hexagons when they are known for their arrangement, direction, and sharpness. In this way, the constant arrangement and directionality of the hexagonal boundaries will allow you to gain a high energy level for the corresponding points in the exchange. The brightest point will be the point 0, and in the plane of change that corresponds to the DC and image components. The six dots surrounding the center point provide the arrangement, direction, and sharpness of the bezels between the hexagons.

It is clear to one skilled in the art that for hexagons, two-dimensional presentation of contrasting polygons identified by the previous standard deviation mapping step for spacing, direction, and brightness distribution boundaries can be computed by rapid Fourier conversion of numeric data corresponding to the measured image of the label. In this way, the directionality and spacing of the polygon boundaries will result in some points in the exchange area having high energy. The number of high energy points surrounding the center point in the exchange plane at coordinates O, O will depend on the particular geometry of the polygonal coding lattice used to produce the optically readable label. As for hexagons, however, such dots surrounding a center point will represent blur, direction, and edge sharpness between polygons, or edges between polygons, and intermediate intervals if the label configuration is partially convergent or non-convergent.

Because the image is a real (and not a complex) size, the swap area is a point symmetric to the beginning of the coordinates. In this way, only half the plane of the swap area has to be calculated, which saves almost half of the machine time. Abandoning these calculations allows you to reduce the number of tests required for subsequent image filtering and fast Fourier inversion steps. The Fourier quick change program used in connection with the illustrated example of a static system with a fixed fireplace was available for the R2D77T from 87 FFT-2 ​​firmware in Maikroue, Ink., Kongston, Massachusetts.

IV) Image Filtering

The filtering process for the reconstruction of all the hexagons in the image area using altered numerical data is still required. This can be done by turning off any points in the conversion area that do not conform to the specified layout and direction hexagons identified in the standard deviation mapping step. The six noticeable points in the exchange area are due to the hexagonal cellular label design. Only three dots are realistically identified in the swap area, so the image is symmetric with respect to the beginning of the coordinates, and the second three dots can be assumed from the first three. Most preferably, the filtration is done in three steps to avoid transitions that are too widely spaced, too narrowly spaced, and / or misaligned from the standard deviation mapping step.

First, it performs high-frequency filtering by resetting all points in the circle around the beginning of the coordinate of the rotation area, but at some distance outward from the origin of the coordinates, not enough for the six points in hexagonal graphical rotation. These dots are larger than the hexagon spacing and therefore provide information related to skipped transitions in the label image. Removing missed transitions in the label image requires the removal of missed transitions in the Fourier Change area.

After that, all outside points of the radius in question are reset without the six noticeable points in the swap area. This corresponds to incorrect transitions, which are particularly close. This operation is combined with the first to form a ring of remaining points. Creating this ring is equivalent to creating a spatial bandpass filter. The inner and outer radii of the ring are determined by the apparent layout of the hexagon. Since the diameter of the hexagon is supposed to be 5 pixels in the descriptive example, and the length of the conversion to 256 pixels will be 256/5 = 51.2 pixels from the center in the changing area of ​​the hexagon. It uses a ring with an inner radius of 45 pixels and an outer radius of 80 pixels, corresponding to hexagonal diameters of 3.5 · to 5.69 pixels. The most suitable filter for high-frequency skipping was used because the deformations of the label - creasing and skewing increase the image sedimentation.

After the spatial bandpass filtering described above, there is a ring with six noticeable points, and each point has an even angular arrangement with respect to the center (point 0.0) in the exchange area. Uses the filtering direction step to complete the task in the change area by eliminating unnecessary information. Any point at a very large angular distance from the visible areas in the changeover area is converted to zero. This leads to the removal of any edges in the image area that occur in one of three directions due to the hexagonal honeycomb oblique structure.

For directional filtering, it is necessary to find the most noticeable points remaining after the spatial bandpass filtering. This point is said to be one of the noticeable area points and substitution that resemble the vertices of a hexagon. Five other noticeable points within the same radius of the center and having a multiplier arrangement of 60 degrees are also evident in the exchange. As a result, all other points with an angular distance greater than 10 degrees from any of these points are eliminated. The six edges of the ring retain. This step-by-step filtering process removes any information about the misalignment or direction of the image area. Removing this misplaced information allows you to restore a complete drawing of each hexagon in the change area.

The described filtering steps take place under controlled subroutines, which are listed in the source code lists in the microfiche on page 46, lines 26-52, 47, lines 1-52, page 48, lines 1-52, page 49, lines 1-46.

V) Fast reversible Fourier change

The considered filtration scheme used in the preferred embodiment having converging hexagons required a modification using different ordered two-dimensional grids for optically readable labels. It should also be noted that minor modifications to the filtration scheme are required by one skilled in the art to accommodate the various label configurations discussed above and depicted in the drawings.

Thinking about individual coding cells means that their respective boundaries will have corresponding angular positions and a set number of sides of the required length. It is then necessary to determine the ratio of adjacent polygons, for example, whether they are tangent, partially tangent, or non-tangent. It is also necessary to determine the geometric grid on which the geometric centers will be located. Because the default geometry of the label is decisive, a person skilled in the art will readily develop an appropriate filtering scheme for filtering energy points in the conversion area so that only the brightest points corresponding to the required layout and polygonal boundary direction work in Fourier.

With respect to fabricated working filters, it is necessary to clarify the need to produce an appropriately measured three-dimensional bandpass filter on a polygonal coding grid diameter. After that, it is desirable to make an oriented filter for filtering the energy points different from the most prominent points corresponding to the vertices of the polygonal coding cells. As a result, any information about misaligned and oriented polygonal coded cells in the image and intermediate ranges, if any, is lost.

Removing that incorrect information results in a complete image of the polygonal coding cells in the image area. After that, the digital data is now ready for backward fast Fourier change according to the process steps described below.

For a true return to the image area while restoring the drawing image of the interconnected hexagonal data grids, it is desirable to perform a two-dimensional backward fast change of the filtered data filtering area Fourier (2D - 1FH). Back-to-back exchange is done with the standard two-dimensional Fourier Backward Exchange (R2D1FT) program, which is available in package 87 of FF-2, Maikrouei, Ink., Kingston, Massachusetts. After the refreshing step, the image of each hexagon is reproduced in the image area. The centers of the hexagons play an important role in the new image. In hexagonal centers, the true meaning of the spots depends on the number of adjacent edges. A larger number of edges produces a higher energy bandwidth within the allowable frequencies and therefore points with higher values. A smaller number of edges form dots of smaller values. The value of the dots is a good measure of the confidence level with synchronous reset at any given point.

(e) Determination of main axis

The hexagonal image has been restored, but its orientation is necessary.

The hexagonal honeycomb structure of the present invention has three axes disposed at 60 degrees. The direction of these axes is determined by the sharpest point in the change region after spatial bandpass filtration. Now is the chance to see which of these three axes is the main one. This is not a necessary step. If this step is not performed, the label must be decoded three times using each of the three axes, but only one axis allows the significant message to be retrieved. The parent axis is freely selected as an axis parallel to the two edges of the label as described and depicted in FIG. 2.

If the boundaries of the square label are determined by the data on the major axis, then most of the energy in the restored hexagonal structure will be in the middle of that square.

In determining the major axis, each of the three pretends to be the principal. The following square label drawing is determined for each axis under investigation, and the total reconstruction energy of the given structure, which is internal to that square, is determined from the inverse subroutine and the digital energy output data. The right test is characterized by maximum energy. It then writes the angle of this principal axis for the initialization step and other search operations. In relation to this, it is not yet clear whether the inscribed angle is in the correct direction or 180 ° in the wrong direction. Source code lists in the microfiche attachment belonging to the main axis can be found on page 49, lines 48 - 54, 50, lines 1 - 53, 51, lines 1 - 5. It should be noted that there is no need to jointly define all three areas of the label , common to three squares, areas need not be determined.

Search

The program SEARCH.C 300 recorded in FIG. 10, combines center-altered and recorded information with recorded primary image brightness levels so that the size of each hexagonal gray level can be determined. The search is performed in such a way that the miniLT 3517 B eliminates the possibility of missing a search. The end result is getting the size level of the gray matrix of each hexagonal data grid. Source code lists in SEARCH.C can be found on pages 52-60 of the microfiche supplement. The first part of the SEARCH.C program provides four important information grids. The CVAL grid stores a measure of the quality of the reset synchronous signal for each hexagon, while the grid GVAL allows you to memorize the size of the gray level (0-63) at the center of each hexagon. The remaining grids IVAL and JVAL allow you to memorize the rows and columns of the center of each hexagon.

(i) Initialization steps

On the basis of the major axis angle determined in / e / stage and the known arrangement of hexagons (5 pixels) in the example, the expected horizontal and vertical offset from the center to the other six hexagons surrounding it can be calculated by computer.

After these calculations, the SEARCH.C program will affect the reset signal from memory and the recalculated label image, also retrieved from memory. The initialization subroutine, found in the microfiche on page 52, lines 13-14, 58, lines 1-48, page 5, lines 47-57, 57, lines 1-35, has the primary purpose of merging and condensing information from two sources, and regeneration of a data matrix that provides the size of each hexagonal gray scale.

The search initialization step is defined by a square with a border about 1/3 inch around the center of the label. Within this range, a good starting point is the point with the largest size that is in the grid reproduced by the target signal. It then determines the location of this starting point relative to the center of the label. This starting point is the point where the interrogator signal is powerful and different, as well as the point relatively close to the center of the label. The powerful distinctive signal guarantees that the search begins with the working center of the hexagons, and preferably the point, close to the center of the label, so that its absolute position can be determined without the serious influence of distortion and clutter. The measure of the quality of a dot in the synchronization reproduction structure is the size of the dot plus the size of the eight dots surrounding it. The rectangular coordinates of the starting point are changed to polar form, the polar coordinates are adjusted accordingly with respect to the previously determined angle of the principal axis, and this result changes back to the rectangular shape. These coordinates are scaled in accordance with the assumed arrangement of rows (4.5 pixels) and columns (5 pixels) on a hexagonal matrix in position 1 of Input. Sync Quality, Grayscale Levels, and Layouts That Match the Primary Hexagon, Then enters the corresponding grid CVAL, GVAL, IVAL, JVAL.

ii) Basic Search Cycle

The basic search loop determines the next location of the hexagonal centers. The cycle ends when the estimated number of hexagons is found. The order of the hexagonal centers is very important. The increased reliability of the decoding process for poor labels results from the specific technology used below.

Each iteration of the search cycle begins with the synchronization of the largest reproduction point whose neighbors were not searched for due to their stronger meanings. From this known point, the search will continue for one hexagon in each of the six directions. The effect is that the search structure is raised along the trajectory from better to worse quality of the reproduced synchronization. This way, if there is a weak area of ​​the resynchronized sync, such as in the center of the label or in the blurry area, the search algorithm bypasses it instead of scrolling through it. Bypassing these weak areas and preserving them for later, the potential for network losses is reduced. Because the losses are as bad as the wrong gray reading, this search feature of the algorithm is very powerful.

The subroutine, which is in the microfiche attachment on page 52, line 5054, page 54, lines 1-58, page 55, lines 1-55, is responsible for finding the best quality master cycle synchronization size. The subroutine passes six times for each hexagonal neighbor of the hexagon in question. First calculates the neighbor's spacing. If this neighbor is outside the label, the cyclic iteration ends. If not, the neighbor checks to see if it has already been found in the other direction. Cyclic iteration ends when a neighbor is searched because the algorithm makes previous searches more reliable than subsequent ones. If a neighbor passes this test, calculates the apparent location of the neighbor center in the synchronization reproduction structure. Performs a gradient search of the highest value synchronization signal at this location. Selects eight pixels surrounding the reset position to see if a higher sync value is found. If found when the best neighbor point has eight verified neighbors to check for even better value. This gradient reselection provides the degree of adaptation needed to read a folded or curled label. The subroutine then goes to the next neighbor or returns when all the neighbors have been checked.

As noted in step (d) above, the label image reproduced by the data exchange processes provides information to the goometric centers of the dependent polygonal coding cells. Polygons with more edges, that is, clear transitions, will have more power in the centers. The centers will be placed on a suitable two-dimensional grid with a given number of evenly or unevenly spaced axes, depending on the circumstances. Information belonging to the spatial axis relationship of the given two-dimensional grid can be used as desired at the orientation axis of the principal axis.

But it should be noted that the algorithm can be coded in such a way that the decoding process determines the true geometry of the two-dimensional grid, and from this setting follows the filtering side of the so-called label principal axis, which is the two-dimensional optically read labels described here on two sides and provides the necessary coordinates for the search subroutine.

Regardless of whether the label geometry is set in an optional step as described above or is usually incorporated into the decoding process by two-dimensional synchronization reset of the corresponding modifications, most of the label configurations described and illustrated herein can be readily adapted by one skilled in the art. It should be noted that the number of axes that center the centers of the individual coding cells of adjacent polygons and their respective orientations may be assigned to the main axis for all three hexagonal grid axes in the preferred embodiment. As a result, the principal axis of the assigned two-dimensional grid can be determined without the verification and error analysis described above in the / e / step.

In the preferred embodiment of the hexagonal grid, the information from the major axis determination step and known polygon layout can be used to calculate apparent horizontal and vertical displacements from one polygon center to the polygon centers. After these calculations and the necessary adjustments after the takeover subroutine, the takeover, by activating both the initialization phase and the takeover master cycle phase, can be performed for each specific label configuration used in this case. It should be noted that such minor adjustments to the takeover program SEARCH.C 300, which is included in the source code appendix, are within the skill of the artisan.

When the subroutine is completed, marks the location of the center so that it is not searched again. The effect is that he is singled out as a candidate whose neighbors passed the re-election. For each iteration of the cycle from 0 to 6 new candidates are added and one removed. Good tools can use a data structure that holds candidates in a queue size that allows for entry and extraction operations. One such structure is called the Priority Sequence (see Development and Analysis of Machine Algorithms; Acho, Hopkraft, and Vilman (Adison Vešli, 1974)). The linear selection algorithm is known to require n operations when nlogn operations are required in a well-organized priority queue using a balanced tree or an unbalanced structure. The transfer algorithm n can also be used, based on group sorting, provided that the magnitudes of the reproduced synchronization are scaled and reduced to a small range of integers.

g) Creating a histogram and plotting a threshold

At the end of the basic takeover cycle, the centers of all the hexagons are located, and the gray values ​​of all the hexagons that appear are fully populated. The next step is to limit the gray level of the digital sizes in the range 0-63 to discrete levels such as black, gray and white (for black, white and gray for labels). This is accomplished thanks to the created histograms of the center of the image of the label from hexagonal centers. Quantized levels can be determined by looking for gaps in the histogram. The specific subroutine used to create the histogram and find quantum levels can be found in the enclosed source code list on the microfiche appendix on page 55, lines 16 - 52, and on page 56, lines 1 - 15.

/ h / Rough Network Adjustment and Final Orientation

After distorting the discrete levels, two distortions can occur. First of all, the grid may appear off-center. This can occur if the best quality synchronization signal is positioned incorrectly at the center of the label during the initial interception phase. The second possibility is that the entire label is read effectively from top to bottom because the major axis angle has an ambiguity of 180 degrees.

The recorded subroutine on page 58, lines 1-54 and 59, in the microfiche attachment to lines 1-24, will allow you to perform the function of determining whether the label is centered. If the label is correctly positioned, the center row coordinates must pass through the center of the label. If a vertical layout error is made, the rows on the hypothetical center row are checked to see which one forms the line closest to the center of the label. If the row above and below is closer than the hypothetical center row, then it makes a corresponding upward or downward shift. If left-hand short alignment has been performed incorrectly, it adjusts the short-line shift by one position to the right. Horizontal layout errors and upside-down are checked using information entered on the label and known as coarse network information. The information is divided into sets of 3x3 hexagonal cells, this has already been described. Because the label can be, for example, with a grid of 33 rows on 30 columns, these sets form a grid of 11 on 10. The lower center hexagon of each complete set of 3x3 cells has a special property that is encoded. There is a guaranteed transfer from either side of the hexagon, which has been discussed previously in connection with FIG. 4. For example, if the lower center hexagon is black, the lower left and lower right hexagons must be either gray or white. The recorded subroutine on page 59, lines 27-52, and 60, in the microfiche appendix to lines 1-33, takes advantage of this transmission property to eliminate two final possible distortions. First a grid is created where each grid element indicates whether a transition has occurred between two horizontal adjacent hexagons. The grid is then inspected for each of the 9 hypothetical slides of the coarse grid arranged in structure 3x3 around the alleged slip O. One of these slides will show the best compatibility between real and supposed transitions, and this slip position remains. The hypothesis is then tested, with the hope that the label will be read upside down. This will happen if the angle of the main axis is actually right-to-left relative to how the label was printed, not left-to-right.

If the label has been inverted, that is, the top rows have changed positions with the bottom and the top columns with the bottom columns, then the slip results are also inverted. But there is one major change that needs to be made to correctly re-label the label. When reading short lines (length 29), the left is checked, so when the label is flipped, these labels must be checked correctly. Adjustment has been made and this is exactly the procedure that will allow the results of the slip hypothesis to be made not by simple inversion. In fact, the best slip test results will be better than other previous tests if the label was actually read upside down.

Determining whether the label has been read upside down and whether there is any slip in the absolute position can result in the encoding of the label matrix. When the picture and slip are set correctly, the image processing functions are completed and the decoding process begins.

. Decoding

The program READ is written. LABEL.C 182 shown in fig. 9, in the microfiche appendix on page 61, lines 1-52 and 62, lines 1-28, reads the file received by the receiving program and forms a bit sequence file containing 1292 bits in a preferred embodiment. The inscribed subroutine CELLDEC.C used here 183 fig. 9, on pages 63 - 66 of the microfiche appendix, for using unused hexagons and using a decoding program that is an inversion of a coding program.

The first step in the decoding process is to create a bit sequence from the hexagons information using the mapping hexagon - bit process, which is the inverse mapping bit - hexagon for the process used in the encoding operation.

The bit (information) sequence subsequently doubles the percentage to the bit sequence of the high priority message and to the bit sequence of the low priority message, or to the number of bit sequences used to encode the label.

It is then necessary to apply error correction to each bit sequence using the error encoding technology used in the label encoding process. For example, if Rido - Solomon encoding is used with error correction, the bit sequence that is created by the receiving program generates an output signal that exists in the format described above for file encoding. The correction of errors occurs in the following sequence (see: Theory and practice of error control codes described above):

1. Calculate syndromes

2. To calculate the error finder polynomial using Berlekamp - Mesi algorithm

3. Calculate the location of the error using Chen's takeover.

4. Calculate the magnitude of error using Forney algorithm.

The last step is used if the number of errors to be corrected in steps 2 and 3 is detected. Also calculates the number of detected errors. If an undetectable number of errors is detected, or if the error is in a significant part (described above), a flag is placed. The specific coding error procedure used in the example given is on pages 67-75 of the microfiche appendix and is noted in FIG. 184 of the ERRD EC.C. 9th

4. Output

When scrolling the cargo (identifying its location on the conveyor), high priority messages pointing to the postal code of the location can be used to activate the appropriate guide levers, or the conveyor to direct the cargo to the appropriate truck, airplane or freight wagon carrying the cargo in the required direction.

Although the invention may be used in a conveyor rejection system, it is obvious that it can be used in a wide range of operations information gathering, cargo processing and manufacturing, preferably reading a label on a cargo, letter, part, machine or similar device and forcing the system to manufacturing operations, such as on a labeled product. The present invention enables these operations to be performed quickly and with great precision. Speed ​​and accuracy are associated with a substantial amount of label information, and even allow you to protect a large amount of information from loss due to label breakage or other damage.

As shown in FIG. 9, the TEXTOUT.C 185 program can be used in the computer terminal for the decoded message for the periodic image. The TEXTOUT.C program can be found on pages 76 - 78 of the microfiche supplement.