Binary image processing for decoding self-clocking glyph shape codes
First Claim
1. A process for decoding a bitmap image space representation of a self-clocking glyph shape code composed of glyphs having shapes that encode digital data values, such that every distinct data value that is encoded by said code is represented by the shape of a respective glyph;
- said glyphs being selected from a set of n permissible glyph shapes, with each of said glyph shapes being preassigned to the encoding of a predetermined digital data value;
said glyphs being spatially distributed in said bitmap image space in substantial accordance with a spatial formatting rule;
said process comprising the steps oflocating at least three non-colinear reference points in said bitmap image space, said reference points having a predetermined nominal spatial relationship to each other;
determining the spatial relationship of said reference points in said bitmap image space;
calculating a skew correction factor from the spatial relationship of said reference points in said bitmap image space;
determining an X scale correction factor and a Y scale correction factor for said bitmap image space representation of said glyph code;
calibrating said spatial formatting rule in accordance with said skew and scale correction factors;
identifying an approximate center position of a first of said glyphs in said bitmap image space;
filtering said bit map image space representation of said glyph code in accordance with a finite number of shape matching discrimination filters for each of said n permissible images, thereby providing at least n filtered representations of said glyph code;
spatially sampling all of said filtered representations of said glyph code in substantial accordance with said calibrated spatial formatting rule to obtain relative filter correlated match strength values for each glyph of said glyph code as filtered by each of said filters, said sampling starting at the approximate center position of a predetermined one of said glyphs and continuing from there, approximate glyph center position-to-approximate glyph center position, in substantial accordance with said calibrated spatial formatting rulecomparing the filter correlated match strength values of each of said glyphs, glyph-by-glyph for all of said filters, to classify said glyphs by their shapes; and
assigning decoded data values to said shape classified glyphs in accordance with the data values preassigned to said glyph shapes.
4 Assignments
0 Petitions
Accused Products
Abstract
Binary image processing techniques are provided for decoding bitmap image space representations of self-clocking glyph shape codes of various types (e.g., codes presented as original or degraded images, with one or a plurality of bits encoded in each glyph, while preserving the discriminability of glyphs that encode different bit values) and for tracking the number and locations of the ambiquities (sometimes referred to herein as "errors") that are encountered during the decoding of such codes. A substantial portion of the image processing that is performed in the illustrated embodiment of this invention is carried out through the use of morphological filtering operations because of the parallelism that is offered by such operations. Moreover, the error detection that is performed in accordance with this invention may be linked to or compared against the error statistics from one or more alternative decoding process, such as the convolution filtering process that is disclosed herein, to increase the reliability of the decoding that is obtained.
-
Citations
9 Claims
-
1. A process for decoding a bitmap image space representation of a self-clocking glyph shape code composed of glyphs having shapes that encode digital data values, such that every distinct data value that is encoded by said code is represented by the shape of a respective glyph;
- said glyphs being selected from a set of n permissible glyph shapes, with each of said glyph shapes being preassigned to the encoding of a predetermined digital data value;
said glyphs being spatially distributed in said bitmap image space in substantial accordance with a spatial formatting rule;
said process comprising the steps oflocating at least three non-colinear reference points in said bitmap image space, said reference points having a predetermined nominal spatial relationship to each other; determining the spatial relationship of said reference points in said bitmap image space; calculating a skew correction factor from the spatial relationship of said reference points in said bitmap image space; determining an X scale correction factor and a Y scale correction factor for said bitmap image space representation of said glyph code; calibrating said spatial formatting rule in accordance with said skew and scale correction factors; identifying an approximate center position of a first of said glyphs in said bitmap image space; filtering said bit map image space representation of said glyph code in accordance with a finite number of shape matching discrimination filters for each of said n permissible images, thereby providing at least n filtered representations of said glyph code; spatially sampling all of said filtered representations of said glyph code in substantial accordance with said calibrated spatial formatting rule to obtain relative filter correlated match strength values for each glyph of said glyph code as filtered by each of said filters, said sampling starting at the approximate center position of a predetermined one of said glyphs and continuing from there, approximate glyph center position-to-approximate glyph center position, in substantial accordance with said calibrated spatial formatting rule comparing the filter correlated match strength values of each of said glyphs, glyph-by-glyph for all of said filters, to classify said glyphs by their shapes; and assigning decoded data values to said shape classified glyphs in accordance with the data values preassigned to said glyph shapes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
- said glyphs being selected from a set of n permissible glyph shapes, with each of said glyph shapes being preassigned to the encoding of a predetermined digital data value;
Specification