Source: https://patents.google.com/patent/EP1399873A1
Timestamp: 2018-07-23 17:37:51
Document Index: 230967274

Matched Legal Cases: ['Application No. 09', 'Application No. 09', 'Application No. 09', 'Application No. 09', 'Application No. 09', 'Application No. 09', 'Application No. 09', 'Application No. 09']

EP1399873A1 - Fiducial mark patterns for graphical bar codes - Google Patents
EP1399873A1
EP1399873A1 EP20020726962 EP02726962A EP1399873A1 EP 1399873 A1 EP1399873 A1 EP 1399873A1 EP 20020726962 EP20020726962 EP 20020726962 EP 02726962 A EP02726962 A EP 02726962A EP 1399873 A1 EP1399873 A1 EP 1399873A1
EP20020726962
Fiducial mark patterns (72, 74, 120) for graphical bar codes (10) (i.e., images that contain inconspicuous graphical modulations that encode embedded information (22)) that are characterized by high detection robustness and good local deformation tracking are described. In one bar coding method, a base image (26) is modulated with a graphical encoding of a message (24) to prioduce a graphical bar code (10), and a fiducial mark pattern (72, 74, 120) comprising a plurality of dots arranged to track one or more reference locations and local deformation across the graphical bar code (10) is generated. In another bar coding method, fiducial mark candidates are identified in a fiducial mark pattern (72, 74, 120), a fiducial mark path is computed based upon one or more of the identified fiducial mark candidates, and one or more reference locations are identified based upon the computed fiducial mark path.
FIDUCIAL MARK PATTERNS FOR GRAPHICAL BAR CODES / /
This application relates to the following co-pending applications, each of which is incorporated herein by reference: U.S. Patent Application No. 09/579,010, filed May 25, 2000, by Doron Shaked et al., and entitled "A Method and Apparatus for Generating and Decoding a Visually Significant Bar Code;" U.S. Patent Application No. 09/429,515, filed October 28, 1999 by Renato Kresch et al., and entitled "System and Method for Counterfeit Protection;" U.S. Serial No. 09/728,292, filed December 1, 2000, by Jonathan Yen et al., and entitled "Authenticable Graphical Bar Codes;" U.S. Patent Application No. 09/578,843, filed May 25, 2000, by Doron Shaked et al., and entitled "Geometric Deformation Correction Method and System for Dot Pattern Images;" U.S. Serial No. _, filed on even date herewith, by Doron Shaked et al., and entitled "Generating and
Decoding Graphical Bar Codes" [Attorney Docket No. 10016656-1]; and U.S. Patent Application No. , filed on even date herewith, by Jonathan Yen et al., and entitled "Automatically Extracting Graphical Bar Codes" [Attorney Docket No. 10015191-1].
A typical bar code symbol is a pattern of parallel bars and spaces of various widths that represent data elements or characters. The bars represent strings of binary ones and the spaces represent strings of binary zeros. A conventional "one-dimensional" bar code symbol contains a series of bars and spaces that vary only in a single dimension. One-dimensional bar code symbols have relatively small information storage capacities. "Two-dimensional" bar codes have been developed to meet the increasing need for machine-readable symbols that contain more information than one-dimensional bar code symbols. The information storage capacity of two-dimensional bar code symbols is increased relative to one-dimensional bar codes by varying the bar code patterns in two dimensions. Common two-dimensional bar code standards include PDF417, Code 1, and Maxicode. One-dimensional and two-dimensional bar code symbols typically are read by optical scanning techniques (e.g., by mechanically scanned laser beams or by self- scanning charge-coupled devices (CCD's)) that convert a printed bar code symbol into electrical signals. The electrical signals are digitized and decoded to recover the data encoded in the printed bar code symbol.
As used herein, the term "graphical bar code" broadly refers to an image that contains inconspicuous graphical modulations that encode embedded information. The invention features fiducial mark patterns for graphical bar codes that are characterized by high detection robustness and good local deformation tracking.
The fiducial mark pattern may surround the graphical bar code. The fiducial mark pattern preferably comprises reference color dots and background color dots. The reference color dots and the background color dots may be arranged in a repeating pattern having a characteristic period and comprising one reference color dot and one or more background color dots.
In some embodiments, the reference color dots are arranged along a rectangular fiducial mark path surrounding the graphical bar code. The rectangular fiducial mark path may have a height dimension of 1+H-T and a width dimension of 1+W-T, where H and W have integer values of 1 or greater and T is the characteristic fiducial mark pattern period. The graphical bar code may have a height dimension of H-T - 2-Δ - 1 and a width dimension of W-T - 2-T - 1, where Δ is the dot spacing between the graphical bar code and the fiducial mark pattern.
The graphical bar code and the fiducial mark pattern may be rendered with dots of the same size. In some embodiments, the fiducial mark pattern comprises at least one orientation mark. The orientation mark may be located at a corner position of the fiducial mark pattern. The orientation mark preferably is different from other marks of the fiducial mark pattern. In another aspect of the invention, fiducial mark candidates are identified in a fiducial mark pattern, a fiducial mark path is computed based upon one or more of the identified fiducial mark candidates, and one or more reference locations are identified based upon the computed fiducial mark path.
In some embodiments, the orientation of the graphical bar code may be identified based upon an asymmetric fiducial mark candidate in the fiducial mark pattern. Other features and advantages of the invention will become apparent from the following description, including the drawings and the claims.
FIG. 2 is a flow diagram of a method of rendering a base image with a graphical encoding of information and generating a fiducial mark pattern designed to track one or more reference locations and local deformation across the resulting graphical bar code. FIG. 3 is a diagrammatic view of a fiducial mark pattern surrounding a graphical bar code.
FIG. 4 is a diagrammatic view of a fiducial mark pattern that is formed from a repeating pattern of one reference color dot and four background color dots. FIG. 5 is a flow diagram of a method of distinguishing valid fiducial marks from invalid fiducial marks in a scanned image and interpolating missing fiducial marks to obtain information from which local deformation in a scanned graphical bar code image may be corrected.
Referring to FIG. 1, in one embodiment, a graphical bar code 10 may be generated by an encoding module 12, processed through a document-handling channel 14, and decoded by a decoding module 16. Encoding module 12 includes an encoding stage 18 and a graphic modulation stage 20. Encoding module 12 may be implemented as one or more program modules that are executable on a computer or other programmable processor. In operation, encoding module 12 encodes information 22 into an encoded message 24. For example, information 22 may be compressed in accordance with a conventional compression algorithm, and encoded with an error correction code. Error correction coding provides robustness to errors due to degradations introduced by document-handling channel 14. The error correction codes also may be interleaved to protect against burst errors. In some embodiments, encoding module 12 may be programmed to generate from information 22 a corroborative signed message in accordance with the encoding process described in U.S. Serial No.09/728,292, filed December 1, 2000, by Jonathan Yen et al., and entitled "Authenticate Graphical Bar Codes." During the encoding stage 18, the compressed and error correction coded message is translated into an ordered sequence of information-encoding graphical templates. During the graphic modulation stage 20, a base image 26 is modulated in accordance with the ordered sequence of graphical templates to produce graphical bar code 10. Base image 26 may be any graphical pattern, including a logo (e.g., a company logo), graphics, pictures, text, images, or any pattern that has visual significance. Information 22 may be embedded in the graphical design of text, pictures, images, borders, or the background of base image 26 to produce graphical bar code 10. Information 22 may be embedded in graphical bar code 10 in the form of a binary image (e.g., a dark and bright dot pattern), a multilevel image (e.g., a gray-level image), or a multilevel color image.
In the document-handling channel 14, graphical bar code 10 may be converted into one or more hard copies 30 by a printing stage 28. Hard copies 30 may be processed through a handling stage 32 before being converted into an electronic scanned image 36 by a scanning stage 34. Graphical bar code 10 may be printed by a conventional printer (e.g., a LaserJet® printer available from Hewlett-Packard Company of Palo Alto, California, U.S.A.) or a special-purpose label printing device. Hard copies 30 may be in the form of any one of a wide variety of printed materials, including a bank draft (or check) carrying a graphical bar code of a withdrawal authorization signature, a stock certificate or bond carrying a graphical bar code of an authenticity certification, and an envelope carrying a graphical bar code of postage indicia. Hard copies 30 may be scanned by a conventional desktop optical scanner (e.g., a ScanJet® scanner available from Hewlett-Packard Company of Palo Alto, California, U.S.A.) or a portable scanner (e.g., a CapShare® portable scanner available from Hewlett-Packard Company of Palo Alto, California, U.S.A.). The scanned image 36 that is acquired by the scanner and introduced into decoding module 16 is a degraded version of the original graphical bar code 10. These degradations may be generated at one ormore of the document-handling channel stages, including the printing stage 28, the handling stage 32 (e.g., copying degradations, stains, folds, staples, and markings), and the scanning stage 34.
In general, decoding module 16 includes a pre-processing stage 40, an alignment stage 42, a geometric correction stage 44, an optional probabilistic analysis stage 46, a graphic demodulation stage 48, and a decoding stage 50. Decoding module 16 may be implemented as one or more program modules that are executable on a computer or other programmable processor. During the pre-processing stage 40, a scanned graphical bar code image 52 may be located in scanned image 36, and non-bar code regions may be cropped and trimmed from scanned image 36, as described in U.S. Patent Application No. , filed on even date herewith, by Jonathan Yen et al, and entitled "Automatically Extracting Graphical Bar Codes" [Attorney Docket No. 10015191-1]. During the alignment stage 42, fiducial marks are detected in scanned bar code image 52. The configuration of the detected fiducial marks indicates the type of global deformations that might have been introduced into the graphical bar code during transmission of graphical bar code 10 through document handling channel 14. These global deformations (e.g., translational, rotational, affine and skew distortions) may be corrected during the geometric correction stage 44 as described in U.S. Patent Application No. 09/578,843, filed May 25, 2000, by Doron Shaked et al., and entitled "Geometrc Deformation Correction Method and System for Dot Pattern Images." During the probabilistic analysis stage 46, in one embodiment, probability models are applied to pixel value measurements obtained from the aligned and geometrically-corrected scanned bar code image 53 to produce a set of probability parameters 54. As explained in U.S. Serial No. , filed on even date herewith, by Doron Shaked et al., and entitled "Generating and
Decoding Graphical Bar Codes" [Attorney Docket No. 10016656-1], the probability parameters 54 are used during the graphic demodulation stage 48 to select the most likely sequence of information-encoding graphical templates that corresponds to the graphical template sequence that was originally encoded into base image 26. The selected graphical template sequence is translated into an encoded message 56 that is decoded into information 22 by the decoding stage 50. Referring to FIG. 2, graphical bar code 10 may be produced by graphically modulating base image 26 in accordance with the following graphical encoding process. Base image 26 is partitioned into a plurality of sub-matrices (or sub-images) (step 60). For example, if base image 26 is an M xN pixel image, it may be partitioned into a regular array of O K x K pixel sub-matrices, where O = M x N/(K x K). Optionally, one or more base image sub-matrices may be reserved for fiducial marks (step 62). Unreserved sub-matrices are converted into binary bar code matrices based upon a selected graphical encoding process (step 64). For example, in one graphical encoding embodiment, information 22 may be encoded into a bi-level image by a two-bit encoding process based upon the two-by-two halftone patterns (or matrices) described in U.S. Patent Application No. 09/579,010, filed May 25, 2000, by Doron Shaked et al., and entitled "A Method and Apparatus for Generating and Decoding a Visually Significant Bar Code." In another graphical encoding embodiment, undeserved sub-matrices may be converted into binary bar code matrices by applying an invertible graphical operation (e.g., an XOR graphical operation) between the un-reserved sub-matrices and a sequence of information-encoding graphical templates that is ordered in accordance with the information 22 to be encoded, as described in U.S. Patent Application No. , filed on even day herewith, by Doron Shaked et al., and entitled "Generating and Decoding Graphical Bar Codes" [Attorney Docket No. 10016656-1]. As explained in detail below, a fiducial mark pattern is generated to track one or more reference locations and local deformation across the resulting graphical bar code (step 66).
Referring to FIG. 3, in one embodiment, a graphical bar code 10 (representing, e.g., a United States Postal Service logo) is surrounded by a fiducial mark pattern 72 that includes a plurality of dots that are arranged with respect to graphical bar code 10 to track one or more reference locations and local deformation across the graphical bar code. As used herein, the term "dot" refers to any marking that is used to render a graphical bar code or a fiducial mark pattern regardless of shape. For example, dots may have a rectangular shape or any other geometric shape. In general, the fiducial mark pattern is characterized by a readily detectable signal pattern that allows valid fiducial marks to be distinguished from invalid fiducial marks, and allows missing fiducial marks to be interpolated from valid fiducial marks. The resulting combination of valid and interpolated fiducial marks provides reliable indications of reference locations and local deformation across graphical bar code 10. Fiducial mark pattern 72 may be formed from two or more different color dots arranged along a wide variety of paths that cover a substantial portion of the graphical bar code dimensions. The fiducial mark paths may be curved or straight, and may surround or run through graphical bar code 10. Graphical bar code 10 and fiducial mark pattern 72 may be rendered with dots of the same size or different size dots. Referring to FIG. 4, in one embodiment, a fiducial mark pattern 74 includes a plurality of reference color dots (e.g., the dark dots 76) and background color dots (e.g., the bright dots 78 shown in outline) that are arranged along a rectangular fiducial mark path surrounding graphical bar code 10. The reference color dots 76 and background color dots 78 are arranged in a repeating signal pattern that includes one reference color dot and four background color dots and has a period (T) of five dots. The rectangular fiducial mark path has a width dimension 80 of 1 + 7T (or 36) dots and a height dimension 82 of 1 + 2-T (or 11) dots. In general, in order to repeat the characteristic signal pattern, rectangular fiducial mark paths have width dimensions given by 1+ WT and height dimensions of 1+ H-T, where W and H have integer values of 1 or greater and correspond to the number of repeating signal patterns disposed along the width and height dimensions 80, 82 of the fiducial mark path, respectively. In some embodiments, in order to provide a readily detectable spatial relationship between the dot locations of graphical bar code 10 and fiducial mark pattern 74, graphical bar code 10 is spaced from fiducial mark pattern 74 by an integer number of dots, Δ, which corresponds to thenumber of dots between the outer edge of graphical bar code 10 and the inner edge of fiducial mark pattern 74. Accordingly, with respect to the above-defined fiducial mark path dimensions, graphical bar code 10 may have a width dimension of W-T- 2-Δ - 1 and a height dimension of H-T - 2-Δ - 1.
Referring to FIG. 5, in one embodiment, valid fiducial marks may be distinguished from invalid fiducial marks in scanned image 36, and missing fiducial marks may be interpolated from valid fiducial marks to obtain information from which local deformations in the scanned graphical bar code may be corrected, as follows. Initially, fiducial mark candidates are identified (step 90). In one embodiment, fiducial mark candidates are identified by detecting the dot centers of reference color dots 76. A zigzag scan that begins at the upper left corner of fiducial mark pattern 74 may be used during the detection process. The first detected reference color pixel of each scan (requires a threshold) is considered part of the corresponding fiducial mark candidate and is used as an anchor pixel for that mark. Next, a conventional flood-fill algorithm is used to locate all reference color pixels connected to the anchor pixels. The centers of the fiducial mark candidates are located at the center of mass of the pixels of each mark. Additional details regarding the process of identifying fiducial mark candidates may be obtained from U.S. Patent Application No. 09/579,010, filed May 25, 2000, by Doron Shaked et al., and entitled "A Method and Apparatus for Generating and Decoding a Visually Significant Bar Code." Next, large area (relative to an expected dot count) fiducial mark candidates are discarded as outliers (step 92). The remaining detected fiducial mark candidates are fit to an expected fiducial mark path (step 94). In embodiments having fiducial mark paths formed from linear path segments (e.g., rectangular fiducial mark paths), a conventional least squares line fitting process or a conventional robust linear fitting process may be used to compute the linear path segments of the fiducial mark paths. Fiducial mark candidates with dot centers that are spaced from the computed fiducial mark path by more than a selected distance are discarded (step 96). One or more reference locations are identified based upon the computed fiducial mark path (step 98). For example, in embodiments having fiducial mark paths formed from linear path segments, the intersections of the computed linear path segments of the fiducial mark path may be identified as reference corner locations. The identified reference corner locations may be used to correct global deformation across graphical bar code 10, as described in U.S. Patent Application No. 09/579,010, filed May 25, 2000, by Doron Shaked et al., and entitled "A Method and Apparatus for Generating and Decoding a Visually Significant Bar Code."
Next, the remaining fiducial mark candidates are ordered on the computed fiducial mark path (step 100). Fiducial mark candidates that are substantially- out of synchronization with other fiducial mark candidates are discarded as outliers (step 102). As explained above, the originally generated fiducial mark signal pattern may include a repeating pattern of one reference color dot and one or more background color dots. As a result, the center of each valid fiducial mark is expected to be located within a selected range (i.e., an integer multiple of the signal period plus-or-minus a selected deformation threshold) of other valid fiducial marks. For example, in one embodiment, the synchronization process begins at an identified reference location (e.g., a corner reference location). A first fiducial mark candidate that is located within a selected range of the computed reference corner location is identified as a valid fiducial mark and its location is identified as a reference location for the next fiducial mark candidate. The first valid fiducial mark may be correspond to the first expected fiducial mark location, in which case the fiducial mark candidate would be expected to be spaced from a computed reference corner location by a distance of T+ δ dots (where δ may be a fraction of a dot spacing). If one or more of the fiducial mark candidates neighboring the computed corner location are missing (e.g., because they were not detected or because they were discarded as outliers), the first valid fiducial mark would be expected to be spaced from a computed reference corner location by a distance of N-(T ± δ dots) (where N has an integer value greater than one). The expected locations of the remaining valid fiducial marks may be computed based upon updated reference locations in a similar way. Dot interface locations of valid fiducial marks are identified (step 104). The dot interface locations may be computed as described in U.S. Patent Application No. 09/578,843, filed May 25, 2000, by Doron Shaked et al., and entitled "Geometric Deformation Correction Method and System for Dot Pattern Images." The dot interface locations of missing fiducial marks may be interpolated from the computed valid dot interface locations using, for example, a conventional interpolation process (step 106). The dot interface locations then may be transmitted to graphic demodulation stage 48 (step 108). The computed dot interface locations provide a new, non-Cartesian coordinate system that may be used by graphic demodulation stage 48 to correct space deformation across graphical bar code 10.
The systems and methods described herein are not limited to any particular hardware or software configuration, but rather they may be implemented in any computing or processing environment, including in digital electronic circuitry or in computer hardware, firmware or software. The encoding and decoding modules may be implemented, in part, in a computer program product tangibly embodied in a machine- readable storage device for execution by a computer processor. In some embodiments, these modules preferably are implemented in a high level procedural or object oriented programming language; however, the algorithms may be implemented in assembly or machine language, if desired. In any case, the programming language may be a compiled or interpreted language. The encoding and decoding methods described herein may be performed by a computer processor executing instructions organized, e.g., into program modules to carry out these methods by operating on input data and generating output. Suitable processors include, e.g., both general and special purpose microprocessors. Generally, a processor receives instructions and data from a read-only memory and/or a random access memory. Storage devices suitable for tangibly embodying computer program instructions include all forms of non-volatile memory, including, e.g., semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM. Any of the foregoing technologies may be supplemented by or incorporated in specially-designed ASICs (application-specific integrated circuits). Other embodiments are within the scope of the claims.
WHAT IS CLAIMED IS: 1. A bar coding method, comprising: modulating a base image (26) with a graphical encoding of a message (24) to produce a graphical bar code (10); and generating a fiducial mark pattern (72, 74, 120) comprising a plurality of dots arranged to track one or more reference locations and local deformation across the graphical bar code (10).
2. The method of claim 1, wherein the fiducial mark pattern (72, 74, 120) surrounds the graphical bar code (10).
3. The method of claim 1, wherein the fiducial mark pattern (72, 74, 120) comprises reference color dots and background color dots.
4. The method of claim 3, the reference color dots and the background color dots are arranged in a repeating pattern (72, 74, 120) having a characteristic period and comprising one reference color dot and one or more background color dots.
5. The method of claim 4, wherein the reference color dots are arranged along a rectangular fiducial mark path surrounding the graphical bar code (10).
6. The method of claim 5, wherein the rectangular fiducial mark path has a height dimension of 1+H-T and a width dimension of 1+W-T, where H and W have integer values of 1 or greater and T is the characteristic fiducial mark pattern period.
7. The method of claim 6, wherein the graphical bar code (10) has a height dimension of H-T - 2-Δ - 1 and a width dimension of -T - 2-T - 1, where Δ is the dot spacing between the graphical bar code (10) and the fiducial mark pattern (72, 74, 120).
8. The method of claim 1, further comprising rendering the graphical bar code (10) and the fiducial mark pattern (72, 74, 120) with dots of the same size.
9. The method of claim 1, wherein the fiducial mark pattern (120) comprises at least one orientation mark (122).
10. The method of claim 9, wherein the orientation mark (122) is located at a corner position of the fiducial mark pattern (120).
11. The method of claim 9, wherein the orientation mark (122) is different from other marks of the fiducial mark pattern (120).
12. A computer program residing on a computer-readable medium and comprising computer-readable instructions for causing a computer to: modulate a base image (26) with a graphical encoding of a message (24) to produce a graphical bar code (10); and generate a fiducial mark pattern (72, 74, 120) comprising a plurality of dots arranged to track one or more reference locations and local deformation across the graphical bar code ( 10) .
13. A bar coding method, comprising: identifying fiducial mark candidates in a fiducial mark pattern (72, 74, 120); computing a fiducial mark path based upon one or more of the identified fiducial mark candidates; and identifying one or more reference locations based upon the computed fiducial mark path.
14. The method of claim 13, further comprising correcting global deformations in the graphical bar code (10) based upon the one or more reference locations.
15. The method of claim 13, wherein identifying fiducial mark candidates comprises identifying centers of reference color dots in the fiducial mark pattern (72, 74, 120).
18. The method of claim 13 , wherein a fiducial mark candidate located within a selected range from one of the identified reference locations is identified as a valid fiducial mark and its location is identified as a reference location for a neighboring fiducial mark candidate.
20. The method of claim 13, further comprising identifying the orientation of the graphical bar code (10) based upon an asymmetric fiducial mark candidate in the fiducial mark pattern (72, 74, 120).
21. A computer program residing on a computer-readable medium and comprising computer-readable instructions for causing a computer to: identify fiducial mark candidates in a fiducial mark pattern (72, 74, 120); compute a fiducial mark path based upon one or more of the identified fiducial mark candidates; and identify one or more reference locations based upon the computed boundary path.
EP20020726962 2001-06-07 2002-06-03 Fiducial mark patterns for graphical bar codes Withdrawn EP1399873A1 (en)
US877517 2001-06-07
EP1399873A1 true true EP1399873A1 (en) 2004-03-24
EP20020726962 Withdrawn EP1399873A1 (en) 2001-06-07 2002-06-03 Fiducial mark patterns for graphical bar codes
See references of WO02101632A1 *
Inventor name: ATKINS, C., BRIAN
Inventor name: SAW, CHIT, WEI