CA2097359C - Record with encoded data - Google Patents
Record with encoded data Download PDFInfo
- Publication number
- CA2097359C CA2097359C CA002097359A CA2097359A CA2097359C CA 2097359 C CA2097359 C CA 2097359C CA 002097359 A CA002097359 A CA 002097359A CA 2097359 A CA2097359 A CA 2097359A CA 2097359 C CA2097359 C CA 2097359C
- Authority
- CA
- Canada
- Prior art keywords
- record
- image
- information
- codeword
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
- 238000011084 recovery Methods 0.000 claims abstract description 4
- 238000007639 printing Methods 0.000 claims description 5
- 230000009471 action Effects 0.000 abstract description 2
- 239000011159 matrix material Substances 0.000 description 34
- 238000010586 diagram Methods 0.000 description 20
- 238000012937 correction Methods 0.000 description 13
- 238000012546 transfer Methods 0.000 description 12
- 238000012545 processing Methods 0.000 description 9
- 230000008901 benefit Effects 0.000 description 7
- 230000008859 change Effects 0.000 description 4
- 230000003247 decreasing effect Effects 0.000 description 4
- 238000001514 detection method Methods 0.000 description 4
- 238000000034 method Methods 0.000 description 4
- 238000013479 data entry Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000005259 measurement Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 230000037308 hair color Effects 0.000 description 2
- 238000010348 incorporation Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 241000446304 Vela Species 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 125000001033 ether group Chemical group 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000007480 spreading Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/08—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means
- G06K19/10—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means at least one kind of marking being used for authentication, e.g. of credit or identity cards
- G06K19/18—Constructional details
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/20—Image preprocessing
- G06V10/28—Quantising the image, e.g. histogram thresholding for discrimination between background and foreground patterns
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03H—HOLOGRAPHIC PROCESSES OR APPARATUS
- G03H1/00—Holographic processes or apparatus using light, infrared or ultraviolet waves for obtaining holograms or for obtaining an image from them; Details peculiar thereto
- G03H1/04—Processes or apparatus for producing holograms
- G03H1/0402—Recording geometries or arrangements
- G03H1/041—Optical element in the object space affecting the object beam, not otherwise provided for
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/002—Specific input/output arrangements not covered by G06F3/01 - G06F3/16
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K1/00—Methods or arrangements for marking the record carrier in digital fashion
- G06K1/12—Methods or arrangements for marking the record carrier in digital fashion otherwise than by punching
- G06K1/126—Methods or arrangements for marking the record carrier in digital fashion otherwise than by punching by photographic or thermographic registration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0016—Selecting or retrieving of images by means of their associated code-marks, e.g. coded microfilm or microfiche
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06037—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06046—Constructional details
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/08—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means
- G06K19/10—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means at least one kind of marking being used for authentication, e.g. of credit or identity cards
- G06K19/14—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code using markings of different kinds or more than one marking of the same kind in the same record carrier, e.g. one marking being sensed by optical and the other by magnetic means at least one kind of marking being used for authentication, e.g. of credit or identity cards the marking being sensed by radiation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/01—Details
- G06K7/016—Synchronisation of sensing process
- G06K7/0166—Synchronisation of sensing process by means of clock-signals derived from the code marks, e.g. self-clocking code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10544—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum
- G06K7/10821—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices
- G06K7/1092—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices sensing by means of TV-scanning
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10544—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum
- G06K7/10821—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices
- G06K7/1093—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation by scanning of the records by radiation in the optical part of the electromagnetic spectrum further details of bar or optical code scanning devices sensing, after transfer of the image of the data-field to an intermediate store, e.g. storage with cathode ray tube
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1408—Methods for optical code recognition the method being specifically adapted for the type of code
- G06K7/1417—2D bar codes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1443—Methods for optical code recognition including a method step for retrieval of the optical code locating of the code in an image
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/1439—Methods for optical code recognition including a method step for retrieval of the optical code
- G06K7/1456—Methods for optical code recognition including a method step for retrieval of the optical code determining the orientation of the optical code with respect to the reader and correcting therefore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/146—Methods for optical code recognition the method including quality enhancement steps
- G06K7/1473—Methods for optical code recognition the method including quality enhancement steps error correction
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/146—Methods for optical code recognition the method including quality enhancement steps
- G06K7/1486—Setting the threshold-width for bar codes to be decoded
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/14—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation using light without selection of wavelength, e.g. sensing reflected white light
- G06K7/1404—Methods for optical code recognition
- G06K7/146—Methods for optical code recognition the method including quality enhancement steps
- G06K7/1491—Methods for optical code recognition the method including quality enhancement steps the method including a reconstruction step, e.g. stitching two pieces of bar code together to derive the full bar code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3821—Electronic credentials
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07G—REGISTERING THE RECEIPT OF CASH, VALUABLES, OR TOKENS
- G07G1/00—Cash registers
- G07G1/0036—Checkout procedures
- G07G1/0045—Checkout procedures with a code reader for reading of an identifying code of the article to be registered, e.g. barcode reader or radio-frequency identity [RFID] reader
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/00127—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/00127—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture
- H04N1/00326—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a data reading, recognizing or recording apparatus, e.g. with a bar-code apparatus
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/00127—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture
- H04N1/00326—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a data reading, recognizing or recording apparatus, e.g. with a bar-code apparatus
- H04N1/00328—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a data reading, recognizing or recording apparatus, e.g. with a bar-code apparatus with an apparatus processing optically-read information
- H04N1/00334—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a data reading, recognizing or recording apparatus, e.g. with a bar-code apparatus with an apparatus processing optically-read information with an apparatus processing barcodes or the like
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/0035—User-machine interface; Control console
- H04N1/00352—Input means
- H04N1/00355—Mark-sheet input
- H04N1/00358—Type of the scanned marks
- H04N1/00363—Bar codes or the like
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/0035—User-machine interface; Control console
- H04N1/00352—Input means
- H04N1/00355—Mark-sheet input
- H04N1/00368—Location of the scanned marks
- H04N1/00374—Location of the scanned marks on the same page as at least a part of the image
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/0035—User-machine interface; Control console
- H04N1/00352—Input means
- H04N1/00392—Other manual input means, e.g. digitisers or writing tablets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/00962—Input arrangements for operating instructions or parameters, e.g. updating internal software
- H04N1/00968—Input arrangements for operating instructions or parameters, e.g. updating internal software by scanning marks on a sheet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32037—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing
- H04N1/32042—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing with reading of job-marks on a page
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K2019/06215—Aspects not covered by other subgroups
- G06K2019/06253—Aspects not covered by other subgroups for a specific application
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/00127—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture
- H04N1/00204—Connection or combination of a still picture apparatus with another apparatus, e.g. for storage, processing or transmission of still picture signals or of information associated with a still picture with a digital computer or a digital computer system, e.g. an internet server
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/0008—Connection or combination of a still picture apparatus with another apparatus
- H04N2201/0065—Converting image data to a format usable by the connected apparatus or vice versa
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/0008—Connection or combination of a still picture apparatus with another apparatus
- H04N2201/0065—Converting image data to a format usable by the connected apparatus or vice versa
- H04N2201/0067—Converting to still picture data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/0008—Connection or combination of a still picture apparatus with another apparatus
- H04N2201/0065—Converting image data to a format usable by the connected apparatus or vice versa
- H04N2201/0068—Converting from still picture data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/0077—Types of the still picture apparatus
- H04N2201/0081—Image reader
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/0077—Types of the still picture apparatus
- H04N2201/0082—Image hardcopy reproducer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3225—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3269—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3271—Printing or stamping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N2201/00—Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
- H04N2201/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N2201/3201—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N2201/3278—Transmission
Abstract
A record contains a graphic image and an information area which are interrelated to discourage misuse of the record. The information area can overlay the graphic image and include information encoded in a error-correctable, machine-readable format which allows recovery of the information despite distort.
due to the underlying graphic image. The record may also represent the image by words similar in form to words in the information area. Both the information and graphic words can then be altered when an action regarding the record takes place.
due to the underlying graphic image. The record may also represent the image by words similar in form to words in the information area. Both the information and graphic words can then be altered when an action regarding the record takes place.
Description
RECORD WITH ENCODED DATA
BACKGROUND OF THE INVENTION
The present invention relates generally to records which contain both machine-readable representations of data and images, and more particularly to records, such as driver's licenses, visas, tickets, or bearer bonds, in which the image, such as a photograph, is overlaid or represented in a manner similar to data relating to the image or to the record.
Currently, many records include both images, such as photographs, and data, such as text. Passports, visas, and driver's licenses include photographs of their owners and data about the use of the records. A passport has information recording the status of the traveler. A visa has information regarding the purpose of the visit of the holder. A driver's license has information regarding the owner's driving restrictions.
Other records have images, such as pictures, and different types of data. For example, certain bonds will have a distinctive picture, such as of George Washington, as well as data about the ~~rl ~.~~
bonds. Other records, such as stock certificates and the like, have similar types of images and data.
Currently, the data and images on such records are separate. There has been no mechanism to interrelate the data an~~
images in a way that enhances the properties of the record. Such enhancement could be used to reduce counterfeiting, which is a problem both for records using a photograph for identification ar._ for records using a distinctive picture.
In combining the images and the data, it would also be advantageous to encode the data to make it difficult to understand the information without the appropriate decoding machinery. This would further discourage counterfeiting.
There are also good reasons to encode the data into a format which allows a great deal of information to be placed on the record. For example, for those records which use photographs for identification, the information on the record could include further identifying information about the owner of the record, such as eye color, hair color, height, weight, etc. Then, if a new photograph were inserted over the appropriate photograph, the information would not match the new photograph and the counterfeiting would be detected.
Another way to make counterfeiting more difficult is to place the encoded information over the picture. If this were dons, any replacement or alteration of the picture would also remove or distort some of the verifying information as well.
There are problems in doing this, however. The overlaid .EtT' information may distort or obscure the photograph, thereby making it difficult to use the photograph for identification. In addition, the light and dark areas of the photograph may distort the information, making it difficult to read the information.
For records that have pictorial images, the problem is less one of identification than it is o~ preventing multiple redemption. In such cases, counterfeiting could be detected i the data on the record included information regarding the status of the record so that multiple redemptions could be detected. To make multiple redemptions all the more difficult, it would be advantageous to encode the information and to use the picture as a back-up security measure. Presently, this is not done.
SUA~RY OF THE INVEIJTIOId It is therefore an object of this invention to provide a record with a graphic image along with encoded information to validate or authenticate the record.
It is another object of the invention to provide such infox-mation without substantially distorting the graphic image.
It is a further object of this invention to provide a~record with graphic and encoded information such that any distortion in the information placed on the record can be easily detected.
'. Another object of the invention is to provide a graphic image encoded information on a record in such a way as to incorporate encoded information in the image.
Additional objects and advantages of this invention will be set forth in part in the description which follows and in part will be obvious from that description, or may be learned by practice of this invent.~on. The advantages of this invention may _ 3 be realized and attained by means of the instrumentalities and combinations particularly pointed in the appended claims.
To achieve the objects and in accordance with the purpose o:
the invention, as embodied and broadly described herein, a record according to this invention contains an image portion contain'_ng a graphic image and an information port:Lon including data encode an machine-readable format. The format includes at least two adjacent rows of codewords, each codeword representing at least one pattern of marks.
More specifically, the information portion of the record may overlay the graphic image without obscuring it, and the machine-readable format can be error-correctable and capable of allowing recovery of the information despite distortion due to the graphic image.
Alternatively, the codewords may include a plurality of information words in the information portion, and a plurality of image words in the image portion, with each codeword containing a pattern of marks, and the patterns of marks of all of the image words representing the graphic image.
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the general description, serve tc explain the principles of the invention.
BRIEF DESCRIPTION OF THE DRAWTNGS
Figure 1A is a diagram of a driver's license with a two dimensional bar code overlaying a ghotographp Figure 1B is a diagram of a portion of a bearer bond havi::g both data words and image words;
Figure 1C is a diagram of 'the bearer bond in Figure 19 after having been modified to reflect a redemption;
Figure 1D is an enlarged view of a portion of the bearer bond in Figure 1B;
Figure 2 is a diagram illustrating one example of a codewor in PDF417;
Figure 3 is a diagram illustrating the overall structure of a PDF417 symbol;
Figure 4 is a table listing the number of error correction codewords for a given security level in PDF4I7;
Figure 5 is a block diagram of a system for printing and reading codes including an image;
Figure 5A is a block diagram of a system far reading, modifying and reprinting' a record or a label.
Figure 6 is a perspective view of an encoding means of the system in Figure 5;
Figure 7 is a perspective view of a recognition means of the system in Figure S;
Figure 8 zs a perspective view of a data entry device and reader in which a key may be entered for encrypting and decrypting data;
Figure 9 is a flow diagram of the steps performed by the low-level decoder for decoding a two-dimensional bar code symbol;
Figure 10 is a flow diagram of the steps performed by the low-level decoder for determining the dimensions and security level of the symbol being scanned;
Figure 11 is a flow diagram of the steps performed by the low-level decoder for searching a scan line of data for a start or a stop pattern;
Figure 12 is a diagram illustrating the various width measurements that are used for the "t~-sequence" of a codeword;
Figure 13 is a flow diagram of the steps performed by the low-level decoder for decoding a scan line of data into a vector of codeword values and their cluster numbers;
Figures 14A, 14B, and 14C are diagrams showing an example of a codeward vector;
Figure 15 is a flow diagram of the steps performed by the low-level decoder for decoding an individual codeword value and its cluster number from the scan line data; and Figures 16A and 16B together are a flow diagram of the step performed by the low-level decoder in order to update the codeword matrix using the codeword vector.
DESCRIPTION OF THE PREFERRED EMBODTMENTS
Reference will now be made in detail to presently preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings.
Figure IA shows an embodiment of this invention in which encoded information is overlaid on a graphic image. Figure 1A
includes a diagram of a record 16 which is shown as a driver's license but could as well be a passport, visa, or any other record :.5 _ 6 with an area that contains an image. Record 16 includes a graph=
image 17 which, if record 16 were a driver's license, would be a photograph of the owner of the license.
Overlaid on top of image 17 is a two--dimensional pattern 18 containing encoded information. Preferably the information in pattern 18 is encoded in the PDF417 two-dimensional bar code described in detail below. One advantage of the PDF417 code is that it is error-correctable which allows recovery of information that may be distorted due to the photograph or other image.
Pattern 18 is preferably printed in a very light colored ink which will not significantly distort the graphic image.
Alternatively, pattern 18 may be encoded in an ink that is sensitive to ultraviolet Light and virtually transparent to visible light. In either case, pattern 18 should be placed over graphic image 17 in a manner that would not obscure or distort that image.
The precise content of the information in pattern 18 is not critical to this invention but would preferably relate to record 16. For example, that information could relate to the holder of the item. If record 16 were a driver's license, the information could indicate that the owner of the driver's license was not authorized to drive without corrective lenses. If record 16 were a passport, the information could indicate that the holder of the passport has visited certain countries.
The information could also relate to the record itself. Far example, the code on the visa could indicate that the visa was,a traveller's visa that expired on a certain date.
_ 7 _ i The advantage of the coded information overlaying the photograph is that such an arrangement would make it extremely difficult to change the information on the photograph without detection. Any changes to the information would be reflected in a change to the photograph, and changes to the photograph would cause changes to the information.
As another example of the benefits of this invention, the code could relate to the photograph ita elf. For example, the encoded information could include data on eye color, hair color, and sex, as well as height and weight of the holder.
Alternatively, the data could be a type of "faceprint" in which certain relationships in the face are encoded to identify the owner uniquely.
Such a record would hinder fraudulent identification involving the replacement of a photograph on a record used for identification. If done, this replacement may go undetected, If coded information were placed over the photograph that described the picture in the photograph, then such fraud would be much m~
difficult to practice.
The record 16 may also have additional human-readable data 20 on it, such as some text or a seal. Preferably, the human-readable data would not obscure or distort pattern 18.
The record 16 need not even be a small item, such as a driver's license or a passport. Record 16 could be a large document with a graphic image, and the principhes of the inventic~
could still be used to obtain its advantages.
g _ w 7 t e.~ t~ .~ cJ
These types of records are exemplary only and not intended :.~
limit the invention beyond its allowable scope. Instead, it wi~~
be apparent to those of ordinary skill how the inventive concept can be realised in a large number of applications.
Graphic images and encoded data can be interrelated in another way as well. Figure 1B shows a portion of a record 316, which is shown as a bearer bond but could as well be another instrument, such as a stock certificate. In Figure 1B, record 316 includes an information portion 318, which includes a pattern of encoded data, and a graphic image portion 317, which has a distinctive picture. Preferably, the information in pattern 318 would contain a plurality of information words, such as code words in the PPF417 code discussed below.
Information portion 318 may contain encoded data which identifies the owner of record 316, or may contain certain other data about record 316, such as a unique identification code and its value at certain anniversary dates. Information gortion 318 can also include data about redemptions. In this embodiment, each time the bearer bond was redeemed or some other action was taken, a slight change would be made to the information words in area 318 and to the image portion 317. The result would be a new record 316' as shown in Figure 1C with an information portion 318' and an imag~ portion 317' which differed slightly from the corresponding areas of record 316. The advantage of using bonds or other records in this way would be to thwart counterfeiting.
Appropriate equipment would detect an attempt to duplicate record s 316 in order to redeem it multiple times.
For example, a reader of such bonds would be used when reccr~
316 was redeemed, and a central computer coupled to that reader would note such redemption to preclude redemption of an identical bearer bond.
Image portion 317 in Figure 1B preferably consists of several image words which have alternating black and white areas to effec-.
a desired shading. The shading produced by the image words wou_ appear as the picture on the record. In Figure 1B, the picture in image portion 317 is of George Washington which would preferably be represented by several image words. The change made to image portion 317 when bearer bond 316 is redeemed should be so slight as to make it nearly impossible to detect differences between image portions 317 and 317'.
Figure 1D shows a section 320 of either record 316 or 316' in great detail to illustrate one mechanism of implementing an embodiment of this invention. Section 320 represents a rectangle which includes the upper left hand corner of image portion 318 or 317', and the surrounding areas in information portion 318 or 318'. The record has several rows 321, 322, 323, 324, 325, 326, 327, and 328. Rows 321 and 322 contain only information words.
Rows 323, 324, 325, 326, 327 and 328 contain a sequence of information words followed by a sequence of image words. As explained above, the shading of the image words reflect the shading of the image, whereas the information words contain encoded data.
Preferably each row has a field at one or both ends indicating the lengths of the alternating sequences of informatics.
_ 10 --~, ~ ~'~ ~ '~; ~3 words and image words. The length of a sequence of information words can be designated by the number of such words. The lengths of a sequence data words can be designated by absolute lengths.
The purpose of the fields is to identify information words for devices reading the rows, so those devices do not decode image words. This can also be obtained by using start and stop symbols at the beginning and each of each sequence of information words.
The fields in the rows can also contain other information, such as row number, to help identify desired locations in record 316. This is particularly important when modifying records after redemption.
Code PDF417 Before discussing the method and apparatus for encoding and decoding data in machine readable graphic form, such as the two-dimensional bar code PDF417, it is important to understand the structure of the two-dimensional bar code symbol itself.
Each PDF417 symbol is composed of a stack of rows of bar-coded information. Each row in the symbol consists of a start pattern, several symbol characters called "codewords," and a stop pattern. A codeword is the basic unit for encoding a value representing, or associated with, certain numbers, letters, or other symbols. Collectively, the codewords in each row form data columns.
Both the number of rows and the number of data columns of the PDF417 symbol are variable. The symbol must have at least three rows and may have up to ninety rows. Likewise, within each row, 3 ~ ~1 ~ v the number of codewords or data columns can vary from three to thirty.
Each PDF417 codeword consists of seventeen modules or units.
There are four bars and four spaces in each codeword. Individual bars or spaces can vary in width from one to six modules, but the combined total per codeword is always seventeen modules. Thus each codeward can be defined by an eight-digit sequence, whit:-.
represents the four sets of alternating bar and space widths within the codeword. This is called the "X-sequence" of the codeword and may be represented by the sequence XQ,X1,...X~. For example, for an X-sequence of "51111125", the first element is five modules wide, followed by five elements o.ne module wide, or element two modules wide, and the last element five modules wide.
This example is illustrated in Figure 2.
The set of possible codewords is further partitioned into three mutually exclusive subsets called "clusters." In the PDF4I%
symbol, each row uses only one of the three clusters to encode data, and each cluster repeats sequentially every third row.
Because any two adjacent rows use different clusters, the decoder is able to discriminate between codewords from different rows within the same scan line.
The cluster number of a codeword may be determined from its X-sequence using the following formula:
cluster number = (XD - XZ + X~ - X~) mod 9 where "mod 9" is the remainder after division by nine. Referring .so.; to the codeword in Figure 2, the cluster number is calculated as rT
follows:
=~i !o. a , ~~ ~ ~ ~ J
cluster number = (5 - 1 + 1 - 2) mod 9 = 3 To minimize error probabilities, PDF417 uses only three clusters, even though nine are mathematically possible. Thus, each raw uses only one of the three clusters 0, 3, or 6, to encoda data, with the same cluster repeating sequentially every third row. Row 0 codewords, for example, use cluster 0, row 1 uses cluster 3, and row 2 uses cluster 6, etc. In general, r_he clus~
number may be determined from the row number as follows:
cluster number = ((row number) mod 3) * 3 There are 929 codeword values defined in PDF417. These values are 0 through 928. Each cluster presents the 929 available values with distinct bar-space patterns so that one cluster canny be confused with another.
Figure 3 is a block diagram showing the overall structure of a PDF417 symbol. Each row of the symbol consists of a start pattern, a left row indicator codeword L~, data codewords di or error detection/correction codewords Ci, a right row indicator codeword Ri, and a stop pattern. The minimum number of codewords in a row is three, including the left row indicator codeword, at least one data codeword, and the right row indicator codeword.
The right and left row indicator cadewords, which are discussed further below, help synchronize the structure of the symbol.
The start and stop patterns identify where each row of the symbol begins and ends. PDF417 uses unique start and stop patterns. The start pattern, or left side of each row, has the unique pattern, or X-sequence, of "81111113". The stop pattern, ,~ ,.
~aJ;.u or right side of each row, has the unique X-sequence of "711311121".
Every symbol contains one codeword (the first data codeword in row 0) indicating the total number of codewords within the symbol, and at least two error-detection codewords CQ and C1.
These two error-detection codewords to<~ether form a checksum which is two codewords long.
A PDF417 symbol can also encode data with error correction capability. The level of error correction capability, called the "security level," is selected by the user and ranges from 0 to 8.
This means, for example, that at level 6, a total of 126 codewords can be either missing or destroyed and the entire symbol can be read and decoded. Figure 5 is a table showing the relationship between the security level of the PDF417 symbol and the number of error correction codewords Ci.
In addition to correcting for missing or destroyed data (known as "erasures"), PDF417 can also recover from misdecodes of codewords. Since it requires two codewords to recover from a misdecode, one to detect the error and one to correct it, a given security level can support half the number of misdecodes that it can of undecoded codewords.
This error correction feature is particularly useful when information in PDF417 format overlays a graphic image. Because, as explained above, the encoded information should not obscure or distort the image, the ink used for information must be light-colored. This creates the possibility that the graphic image will distort portions of the encoded information. If that happens, ! errors can be corrected with the PDF417 two-dimensional bar code.
The row indicator codewords in a PDF417 symbol contain several key components: row number, number of rows, number of data columns, and security level. Not every row indicator contains every component, however. The information is spread over several rows, and the pattern repeats itself every three rows.
The pattern for encoding the information in the row indicator codewords can be illustrated as follows:
Row 0: L~ (row #, # of rows) R~ (row #, # of column s Row 1: L1 (row #, security level) Ri (row #, # of rows) Row 2: L2 (row #, # of columns) R2 (row #, security level) Row 3: L3 (row #, # of rows) R~ (row #, # of column s atc . :, In other words, the Ieft row indicator codeword L~,for the first row 0 contains the row number (0) and the total number of rows in the symbol. The right row indicator codeword R~ far row 0.
contains the row number (0) and the number of data columns in the symbol, and so on.
Encoding data into a PDF417 symbol is typically a two-step process. First, data is converted into codeword values of 0 to ~~ 928, which represent the data. This is known as "high-level encoding." The values are then physically represented by ' particular bar-space patterns, which is known as "low-level encoding."
Encoding,/Decodina System Encoders and decoders are discussed more completely in U.S.S.N. 07/851,493, which is herein incorporated by reference.
:.:v a Referring now to Figures 5-7 in the drawings, Figure 5 is a blocs diagram of the system 10 for representing and recognizing data or a record in machine readable graphic image form. System ZO
includes an encoding means, generally indicated by the reference numeral 12, and a recognition means, generally indicated by the reference numeral 14. Encoding means 12 produces a record 16 (~
Figure 1A), such as a driver's license, visa, or passport, wit photograph. pverlaying the photograph would be data encoded i:~ a two-dimensional pattern 18. Record 16 may also contain human readable data 20, such as text. The two-dimensional pattern 18 on record 16 is recognized by recognition means 14 to produce output signals representative of the data encoded into the pattern 18.
Data to be encoded into the two-dimensional pattern 18 on e~
record 16 is entered into the encoding means 12 by entering means 22. The data entered by entering means 22 may include both data to be encoded into the two-dimensional pattern 18 and the data to appear on record 16 in human readable form. That data can even include the photograph or image. Processing means 24 encodes the set of data into a two-dimensional pattern 18 and generates transfer drive signals for controlling the transfer of the indi-onto the record 16. Transferring means 26 transfers an image of the two-dimensional. pattern 18 onto record 16 in response to the transfer drive signals. Preferably, transferring means 26 includes a printer which transfers either light-colored ink or ultraviolet-light sensitive ink as explained above.
If human readable data is also to be transferred onto record 16, the processing means 24 generates a second set of transfer ~~9' drive signals for controlling the transfer of the human readable data onto record 16. A portion or all of the data to be encoded and the human readable data may be transferred from a storage memory in pracessing means 24 or other_ comguter files rather than being entered by means 22.
Recognition means 14 includes converting means 28 that converts the image on record 16 into salectrical signals representative of the graphic indicia. Decoding means 30 decode the electrical signals into decoder output signals, indicated at 32, that are representative of the data encoded into the pattern 18.
Figure 6 is a perspective view of one embodiment of encoding means 12. The embodiment of Figure 6 is for illustrative purposes, and not meant to limit the scope of the invention. In this embodiment, the entering means 22 of Figure 5 is shown in form of a keyboard 32 for entering alphanumeric and graphic data into the encoding means 12. Entering means 22 may take forms other than a keyboard, such as an optical scanning means for scanning data directly from documents for entry into the encoding means 12.
Referring again to Figure 6, the processing means 24 of Figure 5 is shown in the form of a processor and display unit 34.
The data entered by keyboard 32 is transmitted to the processor and display unit 34 for storage and processing. In addition to entering data, the keyboard 32 is also used for entering control ,, commands to effect operation of the processor unit 34.
BACKGROUND OF THE INVENTION
The present invention relates generally to records which contain both machine-readable representations of data and images, and more particularly to records, such as driver's licenses, visas, tickets, or bearer bonds, in which the image, such as a photograph, is overlaid or represented in a manner similar to data relating to the image or to the record.
Currently, many records include both images, such as photographs, and data, such as text. Passports, visas, and driver's licenses include photographs of their owners and data about the use of the records. A passport has information recording the status of the traveler. A visa has information regarding the purpose of the visit of the holder. A driver's license has information regarding the owner's driving restrictions.
Other records have images, such as pictures, and different types of data. For example, certain bonds will have a distinctive picture, such as of George Washington, as well as data about the ~~rl ~.~~
bonds. Other records, such as stock certificates and the like, have similar types of images and data.
Currently, the data and images on such records are separate. There has been no mechanism to interrelate the data an~~
images in a way that enhances the properties of the record. Such enhancement could be used to reduce counterfeiting, which is a problem both for records using a photograph for identification ar._ for records using a distinctive picture.
In combining the images and the data, it would also be advantageous to encode the data to make it difficult to understand the information without the appropriate decoding machinery. This would further discourage counterfeiting.
There are also good reasons to encode the data into a format which allows a great deal of information to be placed on the record. For example, for those records which use photographs for identification, the information on the record could include further identifying information about the owner of the record, such as eye color, hair color, height, weight, etc. Then, if a new photograph were inserted over the appropriate photograph, the information would not match the new photograph and the counterfeiting would be detected.
Another way to make counterfeiting more difficult is to place the encoded information over the picture. If this were dons, any replacement or alteration of the picture would also remove or distort some of the verifying information as well.
There are problems in doing this, however. The overlaid .EtT' information may distort or obscure the photograph, thereby making it difficult to use the photograph for identification. In addition, the light and dark areas of the photograph may distort the information, making it difficult to read the information.
For records that have pictorial images, the problem is less one of identification than it is o~ preventing multiple redemption. In such cases, counterfeiting could be detected i the data on the record included information regarding the status of the record so that multiple redemptions could be detected. To make multiple redemptions all the more difficult, it would be advantageous to encode the information and to use the picture as a back-up security measure. Presently, this is not done.
SUA~RY OF THE INVEIJTIOId It is therefore an object of this invention to provide a record with a graphic image along with encoded information to validate or authenticate the record.
It is another object of the invention to provide such infox-mation without substantially distorting the graphic image.
It is a further object of this invention to provide a~record with graphic and encoded information such that any distortion in the information placed on the record can be easily detected.
'. Another object of the invention is to provide a graphic image encoded information on a record in such a way as to incorporate encoded information in the image.
Additional objects and advantages of this invention will be set forth in part in the description which follows and in part will be obvious from that description, or may be learned by practice of this invent.~on. The advantages of this invention may _ 3 be realized and attained by means of the instrumentalities and combinations particularly pointed in the appended claims.
To achieve the objects and in accordance with the purpose o:
the invention, as embodied and broadly described herein, a record according to this invention contains an image portion contain'_ng a graphic image and an information port:Lon including data encode an machine-readable format. The format includes at least two adjacent rows of codewords, each codeword representing at least one pattern of marks.
More specifically, the information portion of the record may overlay the graphic image without obscuring it, and the machine-readable format can be error-correctable and capable of allowing recovery of the information despite distortion due to the graphic image.
Alternatively, the codewords may include a plurality of information words in the information portion, and a plurality of image words in the image portion, with each codeword containing a pattern of marks, and the patterns of marks of all of the image words representing the graphic image.
The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate embodiments of the invention and, together with the general description, serve tc explain the principles of the invention.
BRIEF DESCRIPTION OF THE DRAWTNGS
Figure 1A is a diagram of a driver's license with a two dimensional bar code overlaying a ghotographp Figure 1B is a diagram of a portion of a bearer bond havi::g both data words and image words;
Figure 1C is a diagram of 'the bearer bond in Figure 19 after having been modified to reflect a redemption;
Figure 1D is an enlarged view of a portion of the bearer bond in Figure 1B;
Figure 2 is a diagram illustrating one example of a codewor in PDF417;
Figure 3 is a diagram illustrating the overall structure of a PDF417 symbol;
Figure 4 is a table listing the number of error correction codewords for a given security level in PDF4I7;
Figure 5 is a block diagram of a system for printing and reading codes including an image;
Figure 5A is a block diagram of a system far reading, modifying and reprinting' a record or a label.
Figure 6 is a perspective view of an encoding means of the system in Figure 5;
Figure 7 is a perspective view of a recognition means of the system in Figure S;
Figure 8 zs a perspective view of a data entry device and reader in which a key may be entered for encrypting and decrypting data;
Figure 9 is a flow diagram of the steps performed by the low-level decoder for decoding a two-dimensional bar code symbol;
Figure 10 is a flow diagram of the steps performed by the low-level decoder for determining the dimensions and security level of the symbol being scanned;
Figure 11 is a flow diagram of the steps performed by the low-level decoder for searching a scan line of data for a start or a stop pattern;
Figure 12 is a diagram illustrating the various width measurements that are used for the "t~-sequence" of a codeword;
Figure 13 is a flow diagram of the steps performed by the low-level decoder for decoding a scan line of data into a vector of codeword values and their cluster numbers;
Figures 14A, 14B, and 14C are diagrams showing an example of a codeward vector;
Figure 15 is a flow diagram of the steps performed by the low-level decoder for decoding an individual codeword value and its cluster number from the scan line data; and Figures 16A and 16B together are a flow diagram of the step performed by the low-level decoder in order to update the codeword matrix using the codeword vector.
DESCRIPTION OF THE PREFERRED EMBODTMENTS
Reference will now be made in detail to presently preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings.
Figure IA shows an embodiment of this invention in which encoded information is overlaid on a graphic image. Figure 1A
includes a diagram of a record 16 which is shown as a driver's license but could as well be a passport, visa, or any other record :.5 _ 6 with an area that contains an image. Record 16 includes a graph=
image 17 which, if record 16 were a driver's license, would be a photograph of the owner of the license.
Overlaid on top of image 17 is a two--dimensional pattern 18 containing encoded information. Preferably the information in pattern 18 is encoded in the PDF417 two-dimensional bar code described in detail below. One advantage of the PDF417 code is that it is error-correctable which allows recovery of information that may be distorted due to the photograph or other image.
Pattern 18 is preferably printed in a very light colored ink which will not significantly distort the graphic image.
Alternatively, pattern 18 may be encoded in an ink that is sensitive to ultraviolet Light and virtually transparent to visible light. In either case, pattern 18 should be placed over graphic image 17 in a manner that would not obscure or distort that image.
The precise content of the information in pattern 18 is not critical to this invention but would preferably relate to record 16. For example, that information could relate to the holder of the item. If record 16 were a driver's license, the information could indicate that the owner of the driver's license was not authorized to drive without corrective lenses. If record 16 were a passport, the information could indicate that the holder of the passport has visited certain countries.
The information could also relate to the record itself. Far example, the code on the visa could indicate that the visa was,a traveller's visa that expired on a certain date.
_ 7 _ i The advantage of the coded information overlaying the photograph is that such an arrangement would make it extremely difficult to change the information on the photograph without detection. Any changes to the information would be reflected in a change to the photograph, and changes to the photograph would cause changes to the information.
As another example of the benefits of this invention, the code could relate to the photograph ita elf. For example, the encoded information could include data on eye color, hair color, and sex, as well as height and weight of the holder.
Alternatively, the data could be a type of "faceprint" in which certain relationships in the face are encoded to identify the owner uniquely.
Such a record would hinder fraudulent identification involving the replacement of a photograph on a record used for identification. If done, this replacement may go undetected, If coded information were placed over the photograph that described the picture in the photograph, then such fraud would be much m~
difficult to practice.
The record 16 may also have additional human-readable data 20 on it, such as some text or a seal. Preferably, the human-readable data would not obscure or distort pattern 18.
The record 16 need not even be a small item, such as a driver's license or a passport. Record 16 could be a large document with a graphic image, and the principhes of the inventic~
could still be used to obtain its advantages.
g _ w 7 t e.~ t~ .~ cJ
These types of records are exemplary only and not intended :.~
limit the invention beyond its allowable scope. Instead, it wi~~
be apparent to those of ordinary skill how the inventive concept can be realised in a large number of applications.
Graphic images and encoded data can be interrelated in another way as well. Figure 1B shows a portion of a record 316, which is shown as a bearer bond but could as well be another instrument, such as a stock certificate. In Figure 1B, record 316 includes an information portion 318, which includes a pattern of encoded data, and a graphic image portion 317, which has a distinctive picture. Preferably, the information in pattern 318 would contain a plurality of information words, such as code words in the PPF417 code discussed below.
Information portion 318 may contain encoded data which identifies the owner of record 316, or may contain certain other data about record 316, such as a unique identification code and its value at certain anniversary dates. Information gortion 318 can also include data about redemptions. In this embodiment, each time the bearer bond was redeemed or some other action was taken, a slight change would be made to the information words in area 318 and to the image portion 317. The result would be a new record 316' as shown in Figure 1C with an information portion 318' and an imag~ portion 317' which differed slightly from the corresponding areas of record 316. The advantage of using bonds or other records in this way would be to thwart counterfeiting.
Appropriate equipment would detect an attempt to duplicate record s 316 in order to redeem it multiple times.
For example, a reader of such bonds would be used when reccr~
316 was redeemed, and a central computer coupled to that reader would note such redemption to preclude redemption of an identical bearer bond.
Image portion 317 in Figure 1B preferably consists of several image words which have alternating black and white areas to effec-.
a desired shading. The shading produced by the image words wou_ appear as the picture on the record. In Figure 1B, the picture in image portion 317 is of George Washington which would preferably be represented by several image words. The change made to image portion 317 when bearer bond 316 is redeemed should be so slight as to make it nearly impossible to detect differences between image portions 317 and 317'.
Figure 1D shows a section 320 of either record 316 or 316' in great detail to illustrate one mechanism of implementing an embodiment of this invention. Section 320 represents a rectangle which includes the upper left hand corner of image portion 318 or 317', and the surrounding areas in information portion 318 or 318'. The record has several rows 321, 322, 323, 324, 325, 326, 327, and 328. Rows 321 and 322 contain only information words.
Rows 323, 324, 325, 326, 327 and 328 contain a sequence of information words followed by a sequence of image words. As explained above, the shading of the image words reflect the shading of the image, whereas the information words contain encoded data.
Preferably each row has a field at one or both ends indicating the lengths of the alternating sequences of informatics.
_ 10 --~, ~ ~'~ ~ '~; ~3 words and image words. The length of a sequence of information words can be designated by the number of such words. The lengths of a sequence data words can be designated by absolute lengths.
The purpose of the fields is to identify information words for devices reading the rows, so those devices do not decode image words. This can also be obtained by using start and stop symbols at the beginning and each of each sequence of information words.
The fields in the rows can also contain other information, such as row number, to help identify desired locations in record 316. This is particularly important when modifying records after redemption.
Code PDF417 Before discussing the method and apparatus for encoding and decoding data in machine readable graphic form, such as the two-dimensional bar code PDF417, it is important to understand the structure of the two-dimensional bar code symbol itself.
Each PDF417 symbol is composed of a stack of rows of bar-coded information. Each row in the symbol consists of a start pattern, several symbol characters called "codewords," and a stop pattern. A codeword is the basic unit for encoding a value representing, or associated with, certain numbers, letters, or other symbols. Collectively, the codewords in each row form data columns.
Both the number of rows and the number of data columns of the PDF417 symbol are variable. The symbol must have at least three rows and may have up to ninety rows. Likewise, within each row, 3 ~ ~1 ~ v the number of codewords or data columns can vary from three to thirty.
Each PDF417 codeword consists of seventeen modules or units.
There are four bars and four spaces in each codeword. Individual bars or spaces can vary in width from one to six modules, but the combined total per codeword is always seventeen modules. Thus each codeward can be defined by an eight-digit sequence, whit:-.
represents the four sets of alternating bar and space widths within the codeword. This is called the "X-sequence" of the codeword and may be represented by the sequence XQ,X1,...X~. For example, for an X-sequence of "51111125", the first element is five modules wide, followed by five elements o.ne module wide, or element two modules wide, and the last element five modules wide.
This example is illustrated in Figure 2.
The set of possible codewords is further partitioned into three mutually exclusive subsets called "clusters." In the PDF4I%
symbol, each row uses only one of the three clusters to encode data, and each cluster repeats sequentially every third row.
Because any two adjacent rows use different clusters, the decoder is able to discriminate between codewords from different rows within the same scan line.
The cluster number of a codeword may be determined from its X-sequence using the following formula:
cluster number = (XD - XZ + X~ - X~) mod 9 where "mod 9" is the remainder after division by nine. Referring .so.; to the codeword in Figure 2, the cluster number is calculated as rT
follows:
=~i !o. a , ~~ ~ ~ ~ J
cluster number = (5 - 1 + 1 - 2) mod 9 = 3 To minimize error probabilities, PDF417 uses only three clusters, even though nine are mathematically possible. Thus, each raw uses only one of the three clusters 0, 3, or 6, to encoda data, with the same cluster repeating sequentially every third row. Row 0 codewords, for example, use cluster 0, row 1 uses cluster 3, and row 2 uses cluster 6, etc. In general, r_he clus~
number may be determined from the row number as follows:
cluster number = ((row number) mod 3) * 3 There are 929 codeword values defined in PDF417. These values are 0 through 928. Each cluster presents the 929 available values with distinct bar-space patterns so that one cluster canny be confused with another.
Figure 3 is a block diagram showing the overall structure of a PDF417 symbol. Each row of the symbol consists of a start pattern, a left row indicator codeword L~, data codewords di or error detection/correction codewords Ci, a right row indicator codeword Ri, and a stop pattern. The minimum number of codewords in a row is three, including the left row indicator codeword, at least one data codeword, and the right row indicator codeword.
The right and left row indicator cadewords, which are discussed further below, help synchronize the structure of the symbol.
The start and stop patterns identify where each row of the symbol begins and ends. PDF417 uses unique start and stop patterns. The start pattern, or left side of each row, has the unique pattern, or X-sequence, of "81111113". The stop pattern, ,~ ,.
~aJ;.u or right side of each row, has the unique X-sequence of "711311121".
Every symbol contains one codeword (the first data codeword in row 0) indicating the total number of codewords within the symbol, and at least two error-detection codewords CQ and C1.
These two error-detection codewords to<~ether form a checksum which is two codewords long.
A PDF417 symbol can also encode data with error correction capability. The level of error correction capability, called the "security level," is selected by the user and ranges from 0 to 8.
This means, for example, that at level 6, a total of 126 codewords can be either missing or destroyed and the entire symbol can be read and decoded. Figure 5 is a table showing the relationship between the security level of the PDF417 symbol and the number of error correction codewords Ci.
In addition to correcting for missing or destroyed data (known as "erasures"), PDF417 can also recover from misdecodes of codewords. Since it requires two codewords to recover from a misdecode, one to detect the error and one to correct it, a given security level can support half the number of misdecodes that it can of undecoded codewords.
This error correction feature is particularly useful when information in PDF417 format overlays a graphic image. Because, as explained above, the encoded information should not obscure or distort the image, the ink used for information must be light-colored. This creates the possibility that the graphic image will distort portions of the encoded information. If that happens, ! errors can be corrected with the PDF417 two-dimensional bar code.
The row indicator codewords in a PDF417 symbol contain several key components: row number, number of rows, number of data columns, and security level. Not every row indicator contains every component, however. The information is spread over several rows, and the pattern repeats itself every three rows.
The pattern for encoding the information in the row indicator codewords can be illustrated as follows:
Row 0: L~ (row #, # of rows) R~ (row #, # of column s Row 1: L1 (row #, security level) Ri (row #, # of rows) Row 2: L2 (row #, # of columns) R2 (row #, security level) Row 3: L3 (row #, # of rows) R~ (row #, # of column s atc . :, In other words, the Ieft row indicator codeword L~,for the first row 0 contains the row number (0) and the total number of rows in the symbol. The right row indicator codeword R~ far row 0.
contains the row number (0) and the number of data columns in the symbol, and so on.
Encoding data into a PDF417 symbol is typically a two-step process. First, data is converted into codeword values of 0 to ~~ 928, which represent the data. This is known as "high-level encoding." The values are then physically represented by ' particular bar-space patterns, which is known as "low-level encoding."
Encoding,/Decodina System Encoders and decoders are discussed more completely in U.S.S.N. 07/851,493, which is herein incorporated by reference.
:.:v a Referring now to Figures 5-7 in the drawings, Figure 5 is a blocs diagram of the system 10 for representing and recognizing data or a record in machine readable graphic image form. System ZO
includes an encoding means, generally indicated by the reference numeral 12, and a recognition means, generally indicated by the reference numeral 14. Encoding means 12 produces a record 16 (~
Figure 1A), such as a driver's license, visa, or passport, wit photograph. pverlaying the photograph would be data encoded i:~ a two-dimensional pattern 18. Record 16 may also contain human readable data 20, such as text. The two-dimensional pattern 18 on record 16 is recognized by recognition means 14 to produce output signals representative of the data encoded into the pattern 18.
Data to be encoded into the two-dimensional pattern 18 on e~
record 16 is entered into the encoding means 12 by entering means 22. The data entered by entering means 22 may include both data to be encoded into the two-dimensional pattern 18 and the data to appear on record 16 in human readable form. That data can even include the photograph or image. Processing means 24 encodes the set of data into a two-dimensional pattern 18 and generates transfer drive signals for controlling the transfer of the indi-onto the record 16. Transferring means 26 transfers an image of the two-dimensional. pattern 18 onto record 16 in response to the transfer drive signals. Preferably, transferring means 26 includes a printer which transfers either light-colored ink or ultraviolet-light sensitive ink as explained above.
If human readable data is also to be transferred onto record 16, the processing means 24 generates a second set of transfer ~~9' drive signals for controlling the transfer of the human readable data onto record 16. A portion or all of the data to be encoded and the human readable data may be transferred from a storage memory in pracessing means 24 or other_ comguter files rather than being entered by means 22.
Recognition means 14 includes converting means 28 that converts the image on record 16 into salectrical signals representative of the graphic indicia. Decoding means 30 decode the electrical signals into decoder output signals, indicated at 32, that are representative of the data encoded into the pattern 18.
Figure 6 is a perspective view of one embodiment of encoding means 12. The embodiment of Figure 6 is for illustrative purposes, and not meant to limit the scope of the invention. In this embodiment, the entering means 22 of Figure 5 is shown in form of a keyboard 32 for entering alphanumeric and graphic data into the encoding means 12. Entering means 22 may take forms other than a keyboard, such as an optical scanning means for scanning data directly from documents for entry into the encoding means 12.
Referring again to Figure 6, the processing means 24 of Figure 5 is shown in the form of a processor and display unit 34.
The data entered by keyboard 32 is transmitted to the processor and display unit 34 for storage and processing. In addition to entering data, the keyboard 32 is also used for entering control ,, commands to effect operation of the processor unit 34.
2~ ~~~'~
The data entered by keyboard 32 is preferably displayed on .;
display screen 36, and upon entry of a proper control command, is also stored in memory. The data to be encoded into the pattern 18 is stored in a first memory in processor 34, and the data, if any, to be transferred in human readable form is stored in a second memory. Alternatively, both data may be stored in a separate portion of a single memory. Upon the appropriate control comrnar.~-from keyboard 32, the processor unit 34 encodes the data in the first memory into a two-dimensional pattern 18 and generates first transfer drive signals representative of the data stored in the first memory. The processor unit 34 also generates second transfer drive signals representative of the data stored in the second memory.
The processor unit 34 is shown in Figure 6 as being coupled to a printer 38. Printer 38 is one form of the transferring means 26 of Figure 5, Printer 38 transfers an image of the two-dimensional pattern 18 on record 16 in response to the first transfer drive signals and prints the second set of data in human readable form onto record 16 in response to the second transfer drive signals.
' Turning now to Figure 7, the recognition means 14 includes a card reader 40 which contains the converting means 28 and the decpding means 30 of Figure 5. The use of appropriate converting means that corresponds to the particular data encoding technology employed is contemplated by the present invention.
,V The converting means 28 may be a bar code reader such as those disclosed in U.S. Patent Application Serial Nos. 317,433 and 31?,533, and incorporated herein by reference, which can read :.:~:e ink used by printer 38. The readers disclosed in the above pata.~.~
applications are open system devices designed to read an optically encoded two-dimensional bar code and to convert the light reflected from the pattern into electrical signals representative of the graphic indicia.
The decoding means 30 decodes the electrical signals into output signals representative of the data encoded onto record 16.
The decoder output signals are outputted from the recognition unit 40 to various output means 42. Figure ? depicts two examples of output devices, one being a display unit 44 and the other a printer 46. Display unit 44 may be any suitable display such as liquid crystal display or a CRT. The printer 46 may be any print . device such as a dot matrix printer, laser printer, etc.
The system maximizes the use of available space for encrypting data. The density of the encoded data is such that for a two-dimensional bar code symbol, a minimum of about 1600 characters can be encoded into a space of approximately 5" x 1/2".
In addition to being compact, the system provides for high security in the transmission of information.
F~lthough the encoding means 12 and the recognition means 14 ' are shown in Figures 5-? as separate devices, they can be in the ,I same device. This is particularly useful when a record 316 (Figure 1B) is read and modified. In such cases it would be useful to have a single unit for both purposes.
Figure 5A shows a block diagram of a system 10' far use with record 316 in Figure LB. System 10' includes elements that correspond to those of system 10 shown in Figures 5-7.
Specifically, system 10' includes a converting means 28' which converts the encoded data from record 316 into electrical signals, and a decoding means 30' which decodes those signals. Processir.7 means 24' then reads the decoded signals arid, based upon certain criteria, cause transferring means 26' to print appropriate out signals to modify record 316 (Figure 1B) into record 316' (Fic 1C).
The slight variations could be determined in a variety of ways. For example, if record 316 is a bearer bond on a stock certificate, processing means 24' could be a large computer or a computer network which keeps track of redemptions. Processing means 24' could also receive data on either the interpretation oz the information or the printing of the information using entering means 22'.
Processing means 24' also preferably includes alignment means 25' for locating selected areas of record 316 for reading a printing. Alignment means 24' interprets fields that identify rows and particular words in those rows. Although alignment 25' is shown as part of processing means 24', it could also be a microprocessar i.n either converting means 28' or transferring means 26'.
Data may also be encaded using a keyed encryption algorithm that may be accessed only by an encryption key. As shown in Figure 8, the data entry means 47 contains the keyed algorithm and upon entry of the key 49, the data will be encoded into a two-r dimensional graphic pattern in a unique configuration. The unique ~~'s c~~i configuration can only be read by a reader 48 having the proper algorithm, and only upon entry of the key 49 into the reader.
Thus, a high degree of security may be provided with the keyed encryption embodiment.
Another feature of the present invention is to have the image on record 316' be a "digital signature" which is embedded as the PDF 417 bar code in encrypted form. The printer which created two dimensional digital signal would then use a keyed encryption algorithm that could be accessed only by an encryption key. By use of a keyboard or other data entry means which had the keyed algorithm, and upon entry of the key, the data entered as plain text on a keyboard would be encoded into the two dimensional graphic pattern in a unique decoded configuration. The unique pattern or code configuration could only be decoded and read by a reader having the algorithm and only upon entry of the identical key into the reader. This provides a high degree of security for applications needing such security.
A low-level decoder may be embodied in a computer program operating on a microcomputer separate from the host computer. T.
low-level decoder would be preferably connected to the host computer by a standard interface, such as an RS-232 interface, for transmitting the codeword values after they are decoded.
Alternatively, the low-level decoder could be embodied entirely in hardware, or a combination of a hardware and software, which is physically located in either the scanner itse~.~ or the host computer.
l ~~~~e.~:a The matrix of codeword values from low-level decoder is l decoded into usable data by a high-level decoder, which may be embodied as a separate computer program operating on the host computer. For example, PDF417 has thx-ee predefined modes and ni~e reserved modes. The predefined modes are Binary, EXC, and Numeric. In the Binary mode, each codeword can encode 1.2 bytes.
In the EXC mode, the alphanumeric data can be encoded in double density (i.e., two characters per code word-), and in Numeric mode, the numeric data can be packed in almost triple density.
Therefore, the high-level decoder in host computer 112 will further decode the code~.aord values (0-928) from low-level decoder 114, depending on the mode, to obtain the actual data embodied in the symbol. The decoded data from the high-level decoder may then be used by a user application program also operating on the host computer 112.
Figure 9 is a flow chart showing the sequence of operation of a low-level decoder for decoding a two-dimensional bar code symbol such as PDF417 into a matrix of codeword velaes. The various steps in the sequence are embodied in a software computer program which is stored and executed by processor 34.
In the first step 150 in Figure 9, the low-level decoder initializes the scanner interface and initiates scanning of the ' symbol. The actual functions performed in this step will depend on the type of scanner and will involve various scanner-dependent routines to initialize the scanner interface and to start scanning.
In step 152, the low-level decoder attempts to detez;nine t'.~,e dimensions and the security level of the symbol being scanned.
Specifically, this step determines the number of rows, the number of data columns, and the security level of the symbol from the left and right row indicator codewords. These dimensions are then used to initialize a two-dimensional c:odeword matrix and other related parameters for decoding the symbol. Each location in the matrix contains bath a codeword value and an associated confidence weight, which are initially set to a null or empty value. Tf the dimensions and security level of the symbol cannot be determined, then the scan is aborted. This step will be discussed in further detail below in connection with Figure 10.
Continuing in Figure 9, step 154 is the first step in a control loop in which the rows of the two-dimensional bar code symbol are repeatedly scanned and the codeword values are filled into the codeword matrix. The steps of the control laop are each repeated until the number of codewords remaining in the matrix which have not been successfully decoded is small enough that the rest of the matrix can be determined using the built-in error correction capability of the symbol. Thus, in step 154, if the number of codewords which have not been successfully decoded is less than the error correction capability of the symbol based on the security level (see Figure 4), an attempt is made to correct the matrix using the error-correction codewords. If the attempted error correction is successful, then in step 156, the control loop ,' is exited and scanning is terminated in step 158. Otherwise, if the attempted error correction is not successful, then the 1 ".
~~~~~:~
following steps 160-164 are performed to try to decode additiona'~
i codewords to fill in the matrix.
First, step 160 searches a scan line of data obtained from the buffer area of the memory for a start or a stop pattern. If either a start or a stop pattern is found, then in step 162, the low-level decoder attempts to decode as many codewords as possi'~
from the scan line. Specifically, the scan line of data is par into individual codewords whose values and cluster numbers are placed in a codeword vector ready for incorporation into the codeword matrix. Both steps 160 and 162 are discussed in further detail below in connection with Figures 11 and 13, respectively.
The codeword vector produced in step 162 is analyzed and th~
used to update the codeword matrix in step 164. In particular, step 164 assigns a confidence weight to each codeword value depending on whether its nearest neighbors were also decoded. Roy numbers are also assigned to each codeword value based on the left or right row indicator codewords and the corresponding cluster number for the codeword. If the scan line crosses a row bound-.-the cluster numbers of the codewords can be used to determine t.
correct row number for each individual codeword. For example, if a decoded scan line has a left row indicator with row number 2, and the cluster numbers of the following codewords are 6, 0, 0, 3, . the Codewords are accordingly placed in the following locations:
(row 2, column 1); (row 3, column 2); (row 3, column 3); and (row 4, column 4). In this way, a single scan line of data can contai~
codewords from more than one row, which can then be stitched into the appropriate location in the codeword matrix. This step is discussed in Further detail in connection with Figures 16A a~d ~53 below.
Figure 10 is a flow chart showing in greater detail the sequence of steps for determining the dimensions and security level of a symbol as referred to in step 152 of Figure 9 above.
In the first step 170 of Figure 10, the low-level decoder searc!~.
a scan line of data obtained from the buffer area of the memory for a start or a stop pattern. This step is the same as step 160 in Figure 9 and is discussed in further detail in connection with Figure 11 below.
Step 172 then decodes the first codeword immediately adjacent to either the start or stop pattern found in the previous step.
As shown in Figure 3, this codeword will be either a left or right row indicator codeword containing the row number and either the number of rows, the number of data columns, or the security level of the symbol. If both a start and a stop pattern are found, then both the left and the right row indicators are decoded. The sequence of steps for decoding an individual codeword are discussed further below in connection with Figure 15.
Continuing in Figure 10, in step 174 the particular dimension or security level encoded in the row indicator is extracted from the codeword value and the cluster number determined in the ' grevious step 172. For example, for a left row indicator codeworc with a cluster number of 0, the number of rows is extracted from the codeword value.
A confidence weight assigned to each of the dimensions and the security level is initially set to 0. Steps 176-184 update ~~~13~:?
both the current value and the confidence weight of the dimens;on or security level extracted in the previous step in the fol.Lowing way. First, the particular parameter, say the number of rows, '_s compared to the current value of the number of rows obtained f~cm previous decodes. If the current value of the number of rows and the newly decoded value are the same, as determined in step L'5, then the confidence weight assigned to the number of rows is increased in step 178. If the current value and the newly-decoded value are different, however, then the confidence weight is decreased in step 180. If the confidence weight assigned to the particular parameter is decreased below zero as determined in step 182, then the newly decoded value is substituted for the current value and a new minimum weight is assigned to the parameter in step 184.
Step 186 determines whether the confidence weight f.or all three parameters, i.e., number of rows, number of data columns, and security level, exceeds a predetermined threshold. If so, then the two-dimensional codeword matrix is initialized in step 188 based on the current values of the number of rows and the number of columns. The number of correctable errors may also be determined from the current value of the security level according to the table in Figure 4. If all three confidence weights do not exceed the threshold in step 186, however, then program control returns to step 170 to begin searching for the start and stop patterns in a new scan line. Steps 170-184 are repeated until all three parameters have been successfully decoded with a high degree of confidence.
~~~~'~3c=~~
Figure 11 .is a flow chart showing in greater detail the sequence of steps for searching a scan line of data for a start ~_ stop pattern as referred to above in step 160 of Figure 9 and stet 170 of Figure 10. Briefly, the search begins at the first location of an individual scan line of data obtained from the buffer area of the memory and is repeated at sequential locations until either a match is found or the length of the scan .Line is exceeded. When a match is found, an :index .is set to a location immediately following or preceding the pattern for decoding the adjacent code word.
P.s shown in Figure 11, the first step 200 sets an index to the location of the data elements in the scan line to "1,"
indicating the first data element or integer value of the scan line. This index is used to identify 'the first element of each sequence of eight elements in the scan line for comparison to the start and stop patterns.
Step 202 is the first step of an iterative loop for searching the scan line from left to right for either a start or a stop pattern. In this step, if the current index is less than the length of the scan line, then the remaining steps are executed and the search continues. Once the index exceeds the length of the scan line, however, then the loop is exited and an indication is returned signifying that the search failed and a start or stop pattern was not found.
Rather than using the X-sequence of codeword, the low-level decoder decodes a symbol by using "edge to similar edge"
s measurements to compensate for ink spreading which occurs when ~~~~V i printing the symbols. Thus, in step 204, a raw "t-sequence" is obtained from the scan line by adding pairs of consecutive integer values beginning at the location specified by the index.
Specifically, the raw t-sequence, which corresponds to the seven width measurements tz,t2,...t~ shown in Figure 12, is calculated by adding pairs of the consecutive integer values x~,xl,...x~, representing the widths of the bars and spaces, as follows:
t1 = x0 + x1 t2 . x1 + x2 t3 ._ x2 + x3 etc.
A width W far the entire codeword is also calculated in step 204 by summing the eight integer values x~ + x1 + . . . + x~.
For the codeword in Figure 12, for example, the sequence of integer values from the scan line, representing the widths of the bars and spaces might be something like: 43, 19, 21, 19, 22, 18, 103, 96. The raw t-sequence tl,t~,...t~ would then be 62,. 40, 41, 40, 121, 199, and the width W would be 341.
In step 206 in Figure 11, the raw t-sequence obtained in step 204 is normalized and rounded to integer values. Specifically, a value for the codeword's "module" or "unit" is first established by dividing the width W of the codeward by the total number of units for each codeword. an a PDF417 symbol, each codeword is seventeen units, so that the width W is divided by seventeen to obtain the unit of the codeword. Thus, for the example in Figure 12, the unit would be (341/17) - 20Ø Each value of the raw t-sequence is then divided by the unit and rounded to an integer to _ 28 -The normalized t-sequence is then compared to the t-sequences of the start and stop patterns of the code in step 208. If the scanner scans from both left to right and right to left, then the t-sequence must be compared to the start and stop patterns in be their normal and reverse orientations.
If there is a match in step 210, then the index is set in step~214 to a location in the scan line immediately following the pattern if it i.s a start pattern or immediately preceding it if it is a stop pattern. If the current t-sequence does not match either the start or the stop pattern, however, then in step 212, the index is incremented by one and steps 202 through 210 are repeated until either a match is found ar the length of the scan line is exceeded.
Figure 13 is a flow chart showing in greater detail the sequence of steps for decoding a scan line of data into a vector of codewords and their clusters as referred to in step 162 of Figure 9 above. In decoding the individual codeword values and cluster numbers from the scan line, the low-level- decoder begins decoding at the start or stop pattern and decodes as many codewords possible. For those codewords that are not successfully decoded, the codeword values in the codeword vector are set to ., gAD . "
At the completion of the sequence of steps shown in Figure 13, the cadeword vector will contain certain codeword values and cluster numbers in locations corresponding to the appropriate ~~ a ~~~~
columns of the codewords that were successfully decoded. Fiqur?
14A shows an example of a codeword vector in which the codewords in eight of the ten columns were successfully decoded. The codeword values in columns 1 and 10 correspond to the left rc~
indicator codeword in row 2 (L2) and the right row indicator codeword in row 1 (RI), respectively. The codewords in columns 5 and 7 were not successfully decoded as indicated by the notation "BAD" in those locations of the codeword vector.
Returning to the first step 220 of Figure 13, an upper limit on the number of codewords that may be decoded ("cwlimit") is set equal to the number of columns in the codeword matrix. If this number of codewords is successfully decoded, then the decoding process for the current scan line is obviously complete.
Step 222 determines the direction of the scan if the scanner scans from both left to right and right to left. If the particular scan was from left to right as determined in step 222, then the column number of the first codeword is set to "1" in step 224 and the amount that it will incremented by ("incr") each time a subsequent codeword is decoded is set to "+1." If the scan was from right to left, however, then in step 226, the column number of the first codeword in 'the scan line will be the last column of the codeword matrix, and the incremental value is set to '-1."
Step 228 is the first step of a control loop in which individual codeword values and their cluster numbers are decoded from the scan lane of data. In step 228, the codeword limit is "' tested to see if it is still greater than zero. If not, then all tit ,~ r,t of the codewords in the scan line have been decoded and the loot is exited.
Otherwise, step 230 obtains the next codeword value and its cluster number from the scan line. This step will be discussed ...
further detail below in connection with Figure 1S.
If the codeword decoded in the previous step is a valid codeword as determined in step 232, then in step 234 the codewor~
value and its cluster number are saved in the codeword vector at a location corresponding to the column of the codeword. The codeword values thus placed in the codeword vector are ready for incorporation into the codeword matrix.
If the codeword decoded in step 230 is not a valid codeword, however, then the codeword value in the codeword vector corresponding to the current column is set to "SAD" in step 236 tc indicate that this codeword was not successfully decoded. A "BAD"
codeword is most likely to occur when the scan line crosses the boundary between two rows in the middle of the codeword.
Finally, in step 238, the current column number is either incremented or decremented depending on the direction of the scan, and the codeword limit is decremented by one. Steps 228-236 are then repeated until there has been an attempt to decode all of the codewords in the scan line.
Figure 15 is a flow chart diagram showing the seguence of steps corresponding to step 230 in Figure 13 and step 172 in Figure 10 in which an attempt is made to decode an individual codeword value and cluster number from the scan line. In the first step 240, a raw t-sequence and the width W are obtained froze the scan line. This same step was discussed previously in connection with step 204 in Figure 11.
In step 242, the width W of the eight elements presumed to be the next codeword are compared to the width of the previously decoded codeword. If the current width W is not within a range c~
plus or minus a predetermined difference (delta), then there is probably a split (undercount by a multiple of two elements) or merge (overcount by a multiple of two elements) error in the current codeword. This codeword is not decoded further, but rather in step 244 its value and cluster number are both set to BAD to indicate that it could not be decoded.
Then in step 246, an attempt is made to resynchronize to t:-boundary of the next codeword by finding a t-sequence with a corresponding width W that falls within a given tolerance of the expected width of a codeward, based on the width of the previous codeword. If the current width W is significantly greater than the expected width, indicating a possible merge error, then the last two integer values are dropped from the t-sequence until i~
falls within the proper limits. Likewise, if the current width W
is significantly less than the expected width, indicating a possible split error, the next two integer values in the scan line are added to the t-sequence until it falls within the proper limits.
If the current width W is within a certain tolerance of th~
expected width, as determined in step 242, then an attempt is ma_~
to decode the codeword. In step 248, the raw t-sequence is normalized as described above in connection with step 206 in ~~~ta ~ ~ ~ '~ '-' Figure 11. Then in step 250, the cluster number is determined from the normalized t-sequence. The cluster number may be determined from the t-sequence (as opposed to the X-sequence described above) as follows:
cluster number = (TI - T2 + TS - T6) mod 9 For codewords in PDF~1'7, valid cluster numbers are 0, 3, and 6. If in step 252 it is determined that the cluster number is r.
0, 3, or 6, then the codeword is not valid. Accordingly, in step 254 the cluster number and value are set to "BAD" to indicate that the codeword was not successfully decoded.
Otherwise, in step 256, the normalized t-sequence and its cluster number are used to find the corresponding codeword value in a look-up table. If no corresponding codeword value is found for the t-sequence, then the codeword value is set to "BAD" to indicate that it was not successfully decoded.
Finally, in step 258 the "last width" value is updated to the current width W of the codeword for use in decoding the next codeword value from the scan line.
Figures 16A and 16B together comprise a flow chart of the sequence of steps executed by the low-level decoder in order to update the codeword matrix using the codeword vector. These figures explain in greater detail step 16~ in Figure 9 discussed above.
The first step 260 of Figure 16A checks the first and last values in the codeword vector to see if either is a valid row indicator. If neither the first nor the last values in the codeword vector is a valid row indicator, then in step 262 'the ,., y !i : C~ ~ e~
program exits the routine and no attempt is made to update the codeword matrix using the codeword vector.
zf a valid row indicator is present, however, then in step 264 confidence weights are assigned to each codeword value in t;.a codeword vector. Specifically, a confidence weight is assigned t..
each codeword depending on whether its nearest neighbors and the cluster were also decoded. For example, as shown in Figure 1a8, the codeword values in columns 1, 2, 3, 9, and 1Q are assigned high~confidence weights ("H") because their immediate neighbors were also successfully decoded and have the same cluster number.
The codeword values for columns 4 and 8 are assigned medium confidence weights ("M") because one of their neighbors was successfully decoded and has the same cluster number but the other neighboring codeword value is "BAD." The codeword value in column 3 is assigned a very low confidence weight ("L") because neither of its neighbors was successfully decoded. Thus, the confidence weight for a codeword value at column i in the codeword vector is essentially a function of the cluster numbers of the codewords at columns i - 1, i, and i -~ 1. This function may be implemented by a look-up table whose index is calculated from the cluster numbers of the three codewords.
In step 266, a row number is assigned to each codeword value in the codeword vector based on 'the row indicator codewords and the cluster numbers. As shown in the example in Figure 14C, the left row indicator codeword L2 indicates that the row number is 2 and the cluster number is 6. The cluster numbers for the codeword tETT
values in columns 2-4 are also 6. Therefore, row number 2 is ~~~~~,1~.~
d.~ a 3 a _~ e;e assigned to the codeword values in the first four columns or t::e codeword vector.
Also in the example in Figure 14C, columns six and 8-10 a:.:.
have a cluster number of 3 and the right row indicator codeword ~.
indicates that the row number is 1. Therefore, it can be assumed that the scan line crossed the row boundary between row 2 and Boa 1 and the codeword values in columns Ei and 8-10 should be assigned to row 1.
Once the confidence weights and row numbers have been assigned to each of the codeword values in the codeword vector, the codeword .matrix is updated one codeword at a time. In step 208, the column number C of both the codeword vector and the codeword matrix is set is initially set to "1." Step 270 is the first step of an iterative loop which steps through the codewords in the codeword vector and uses them to update the corresponding codewords and their associated confidence weights in the codeword matrix. When the column number C exceeds the number of columns in step 270, then all of the codewords in the codeword vector have been processed and the routine ends.
For each codeword in the codeword vector, step 272 sets the row number R of the codeword matrix to the row number assigned .in step 266 to the codeword in the codeword vector at the location C.
Thus, for each cadeword value in the codeword vector, there .is a corresponding value in the codeword matrix at location (R,C].
Continuing in Figure 16~, step 274 determines whether the current codeword value in location (R,C] in the codeword matrix is the same as the corresponding codeword value in the codeword ~~~~~~~~:
vector at column C. If the values are the same, then in step ?
the confidence weight assigned to the codeword value in matrix location [R,C] is increased by the confidence weight of the corresponding codeword value in the codeword vector. If not, the confidence weight of the codeword value in the matrix is decreases by the confidence weight of the codeword value in the vector in step 278.
If the confidence weight was decreased in step 278, then i:.
step 280 that confidence weight is tested to see if it was decreased below zero. Tf the confidence weight is less than zero, then in step 282 the new codeword value in the eodeword vector is substituted for the current codeword value in the corresponding location in the codeword matrix. The confidence weight assignee to the codeword value in the matrix is also changed to a positive value in step 284.
Finally, in step 286 the column number C is incremented by '_ for processing the next codeword value in the codeword vector and program control is returned to step 270 for repeating steps 272 through 286 for all of the columns in the vector.
Returning briefly to step 154 in Figure 9, each time after the codeword matrix has been filled in with the new vector of codeword values and the confidence weights have been updated, an attempt is made to fill in the rest of the matrix using the built-in error correction capability of the symbol. 'The number and location of codewords which have not yet been successfully decoded may be determined by comparing the confidence weights assigned each of the codeword values in the matrix with a predetermined ~~~~ ~v threshold. Those values having confidence weights below the threshold are considered to not yet be decoded. If the number e.
codewords not yet decoded is less than the error correction capability of the symbol as determined by the security level, t'.~.e~
an attempt is made to correct the matrix.
It will be apparent to those skilled in the art that various modifications and variations can be made in the decoding method and apparatus without departing from the scope or spirit of the invention. Other embodiments of the invention will be apparent t:.
those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples he considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
The data entered by keyboard 32 is preferably displayed on .;
display screen 36, and upon entry of a proper control command, is also stored in memory. The data to be encoded into the pattern 18 is stored in a first memory in processor 34, and the data, if any, to be transferred in human readable form is stored in a second memory. Alternatively, both data may be stored in a separate portion of a single memory. Upon the appropriate control comrnar.~-from keyboard 32, the processor unit 34 encodes the data in the first memory into a two-dimensional pattern 18 and generates first transfer drive signals representative of the data stored in the first memory. The processor unit 34 also generates second transfer drive signals representative of the data stored in the second memory.
The processor unit 34 is shown in Figure 6 as being coupled to a printer 38. Printer 38 is one form of the transferring means 26 of Figure 5, Printer 38 transfers an image of the two-dimensional pattern 18 on record 16 in response to the first transfer drive signals and prints the second set of data in human readable form onto record 16 in response to the second transfer drive signals.
' Turning now to Figure 7, the recognition means 14 includes a card reader 40 which contains the converting means 28 and the decpding means 30 of Figure 5. The use of appropriate converting means that corresponds to the particular data encoding technology employed is contemplated by the present invention.
,V The converting means 28 may be a bar code reader such as those disclosed in U.S. Patent Application Serial Nos. 317,433 and 31?,533, and incorporated herein by reference, which can read :.:~:e ink used by printer 38. The readers disclosed in the above pata.~.~
applications are open system devices designed to read an optically encoded two-dimensional bar code and to convert the light reflected from the pattern into electrical signals representative of the graphic indicia.
The decoding means 30 decodes the electrical signals into output signals representative of the data encoded onto record 16.
The decoder output signals are outputted from the recognition unit 40 to various output means 42. Figure ? depicts two examples of output devices, one being a display unit 44 and the other a printer 46. Display unit 44 may be any suitable display such as liquid crystal display or a CRT. The printer 46 may be any print . device such as a dot matrix printer, laser printer, etc.
The system maximizes the use of available space for encrypting data. The density of the encoded data is such that for a two-dimensional bar code symbol, a minimum of about 1600 characters can be encoded into a space of approximately 5" x 1/2".
In addition to being compact, the system provides for high security in the transmission of information.
F~lthough the encoding means 12 and the recognition means 14 ' are shown in Figures 5-? as separate devices, they can be in the ,I same device. This is particularly useful when a record 316 (Figure 1B) is read and modified. In such cases it would be useful to have a single unit for both purposes.
Figure 5A shows a block diagram of a system 10' far use with record 316 in Figure LB. System 10' includes elements that correspond to those of system 10 shown in Figures 5-7.
Specifically, system 10' includes a converting means 28' which converts the encoded data from record 316 into electrical signals, and a decoding means 30' which decodes those signals. Processir.7 means 24' then reads the decoded signals arid, based upon certain criteria, cause transferring means 26' to print appropriate out signals to modify record 316 (Figure 1B) into record 316' (Fic 1C).
The slight variations could be determined in a variety of ways. For example, if record 316 is a bearer bond on a stock certificate, processing means 24' could be a large computer or a computer network which keeps track of redemptions. Processing means 24' could also receive data on either the interpretation oz the information or the printing of the information using entering means 22'.
Processing means 24' also preferably includes alignment means 25' for locating selected areas of record 316 for reading a printing. Alignment means 24' interprets fields that identify rows and particular words in those rows. Although alignment 25' is shown as part of processing means 24', it could also be a microprocessar i.n either converting means 28' or transferring means 26'.
Data may also be encaded using a keyed encryption algorithm that may be accessed only by an encryption key. As shown in Figure 8, the data entry means 47 contains the keyed algorithm and upon entry of the key 49, the data will be encoded into a two-r dimensional graphic pattern in a unique configuration. The unique ~~'s c~~i configuration can only be read by a reader 48 having the proper algorithm, and only upon entry of the key 49 into the reader.
Thus, a high degree of security may be provided with the keyed encryption embodiment.
Another feature of the present invention is to have the image on record 316' be a "digital signature" which is embedded as the PDF 417 bar code in encrypted form. The printer which created two dimensional digital signal would then use a keyed encryption algorithm that could be accessed only by an encryption key. By use of a keyboard or other data entry means which had the keyed algorithm, and upon entry of the key, the data entered as plain text on a keyboard would be encoded into the two dimensional graphic pattern in a unique decoded configuration. The unique pattern or code configuration could only be decoded and read by a reader having the algorithm and only upon entry of the identical key into the reader. This provides a high degree of security for applications needing such security.
A low-level decoder may be embodied in a computer program operating on a microcomputer separate from the host computer. T.
low-level decoder would be preferably connected to the host computer by a standard interface, such as an RS-232 interface, for transmitting the codeword values after they are decoded.
Alternatively, the low-level decoder could be embodied entirely in hardware, or a combination of a hardware and software, which is physically located in either the scanner itse~.~ or the host computer.
l ~~~~e.~:a The matrix of codeword values from low-level decoder is l decoded into usable data by a high-level decoder, which may be embodied as a separate computer program operating on the host computer. For example, PDF417 has thx-ee predefined modes and ni~e reserved modes. The predefined modes are Binary, EXC, and Numeric. In the Binary mode, each codeword can encode 1.2 bytes.
In the EXC mode, the alphanumeric data can be encoded in double density (i.e., two characters per code word-), and in Numeric mode, the numeric data can be packed in almost triple density.
Therefore, the high-level decoder in host computer 112 will further decode the code~.aord values (0-928) from low-level decoder 114, depending on the mode, to obtain the actual data embodied in the symbol. The decoded data from the high-level decoder may then be used by a user application program also operating on the host computer 112.
Figure 9 is a flow chart showing the sequence of operation of a low-level decoder for decoding a two-dimensional bar code symbol such as PDF417 into a matrix of codeword velaes. The various steps in the sequence are embodied in a software computer program which is stored and executed by processor 34.
In the first step 150 in Figure 9, the low-level decoder initializes the scanner interface and initiates scanning of the ' symbol. The actual functions performed in this step will depend on the type of scanner and will involve various scanner-dependent routines to initialize the scanner interface and to start scanning.
In step 152, the low-level decoder attempts to detez;nine t'.~,e dimensions and the security level of the symbol being scanned.
Specifically, this step determines the number of rows, the number of data columns, and the security level of the symbol from the left and right row indicator codewords. These dimensions are then used to initialize a two-dimensional c:odeword matrix and other related parameters for decoding the symbol. Each location in the matrix contains bath a codeword value and an associated confidence weight, which are initially set to a null or empty value. Tf the dimensions and security level of the symbol cannot be determined, then the scan is aborted. This step will be discussed in further detail below in connection with Figure 10.
Continuing in Figure 9, step 154 is the first step in a control loop in which the rows of the two-dimensional bar code symbol are repeatedly scanned and the codeword values are filled into the codeword matrix. The steps of the control laop are each repeated until the number of codewords remaining in the matrix which have not been successfully decoded is small enough that the rest of the matrix can be determined using the built-in error correction capability of the symbol. Thus, in step 154, if the number of codewords which have not been successfully decoded is less than the error correction capability of the symbol based on the security level (see Figure 4), an attempt is made to correct the matrix using the error-correction codewords. If the attempted error correction is successful, then in step 156, the control loop ,' is exited and scanning is terminated in step 158. Otherwise, if the attempted error correction is not successful, then the 1 ".
~~~~~:~
following steps 160-164 are performed to try to decode additiona'~
i codewords to fill in the matrix.
First, step 160 searches a scan line of data obtained from the buffer area of the memory for a start or a stop pattern. If either a start or a stop pattern is found, then in step 162, the low-level decoder attempts to decode as many codewords as possi'~
from the scan line. Specifically, the scan line of data is par into individual codewords whose values and cluster numbers are placed in a codeword vector ready for incorporation into the codeword matrix. Both steps 160 and 162 are discussed in further detail below in connection with Figures 11 and 13, respectively.
The codeword vector produced in step 162 is analyzed and th~
used to update the codeword matrix in step 164. In particular, step 164 assigns a confidence weight to each codeword value depending on whether its nearest neighbors were also decoded. Roy numbers are also assigned to each codeword value based on the left or right row indicator codewords and the corresponding cluster number for the codeword. If the scan line crosses a row bound-.-the cluster numbers of the codewords can be used to determine t.
correct row number for each individual codeword. For example, if a decoded scan line has a left row indicator with row number 2, and the cluster numbers of the following codewords are 6, 0, 0, 3, . the Codewords are accordingly placed in the following locations:
(row 2, column 1); (row 3, column 2); (row 3, column 3); and (row 4, column 4). In this way, a single scan line of data can contai~
codewords from more than one row, which can then be stitched into the appropriate location in the codeword matrix. This step is discussed in Further detail in connection with Figures 16A a~d ~53 below.
Figure 10 is a flow chart showing in greater detail the sequence of steps for determining the dimensions and security level of a symbol as referred to in step 152 of Figure 9 above.
In the first step 170 of Figure 10, the low-level decoder searc!~.
a scan line of data obtained from the buffer area of the memory for a start or a stop pattern. This step is the same as step 160 in Figure 9 and is discussed in further detail in connection with Figure 11 below.
Step 172 then decodes the first codeword immediately adjacent to either the start or stop pattern found in the previous step.
As shown in Figure 3, this codeword will be either a left or right row indicator codeword containing the row number and either the number of rows, the number of data columns, or the security level of the symbol. If both a start and a stop pattern are found, then both the left and the right row indicators are decoded. The sequence of steps for decoding an individual codeword are discussed further below in connection with Figure 15.
Continuing in Figure 10, in step 174 the particular dimension or security level encoded in the row indicator is extracted from the codeword value and the cluster number determined in the ' grevious step 172. For example, for a left row indicator codeworc with a cluster number of 0, the number of rows is extracted from the codeword value.
A confidence weight assigned to each of the dimensions and the security level is initially set to 0. Steps 176-184 update ~~~13~:?
both the current value and the confidence weight of the dimens;on or security level extracted in the previous step in the fol.Lowing way. First, the particular parameter, say the number of rows, '_s compared to the current value of the number of rows obtained f~cm previous decodes. If the current value of the number of rows and the newly decoded value are the same, as determined in step L'5, then the confidence weight assigned to the number of rows is increased in step 178. If the current value and the newly-decoded value are different, however, then the confidence weight is decreased in step 180. If the confidence weight assigned to the particular parameter is decreased below zero as determined in step 182, then the newly decoded value is substituted for the current value and a new minimum weight is assigned to the parameter in step 184.
Step 186 determines whether the confidence weight f.or all three parameters, i.e., number of rows, number of data columns, and security level, exceeds a predetermined threshold. If so, then the two-dimensional codeword matrix is initialized in step 188 based on the current values of the number of rows and the number of columns. The number of correctable errors may also be determined from the current value of the security level according to the table in Figure 4. If all three confidence weights do not exceed the threshold in step 186, however, then program control returns to step 170 to begin searching for the start and stop patterns in a new scan line. Steps 170-184 are repeated until all three parameters have been successfully decoded with a high degree of confidence.
~~~~'~3c=~~
Figure 11 .is a flow chart showing in greater detail the sequence of steps for searching a scan line of data for a start ~_ stop pattern as referred to above in step 160 of Figure 9 and stet 170 of Figure 10. Briefly, the search begins at the first location of an individual scan line of data obtained from the buffer area of the memory and is repeated at sequential locations until either a match is found or the length of the scan .Line is exceeded. When a match is found, an :index .is set to a location immediately following or preceding the pattern for decoding the adjacent code word.
P.s shown in Figure 11, the first step 200 sets an index to the location of the data elements in the scan line to "1,"
indicating the first data element or integer value of the scan line. This index is used to identify 'the first element of each sequence of eight elements in the scan line for comparison to the start and stop patterns.
Step 202 is the first step of an iterative loop for searching the scan line from left to right for either a start or a stop pattern. In this step, if the current index is less than the length of the scan line, then the remaining steps are executed and the search continues. Once the index exceeds the length of the scan line, however, then the loop is exited and an indication is returned signifying that the search failed and a start or stop pattern was not found.
Rather than using the X-sequence of codeword, the low-level decoder decodes a symbol by using "edge to similar edge"
s measurements to compensate for ink spreading which occurs when ~~~~V i printing the symbols. Thus, in step 204, a raw "t-sequence" is obtained from the scan line by adding pairs of consecutive integer values beginning at the location specified by the index.
Specifically, the raw t-sequence, which corresponds to the seven width measurements tz,t2,...t~ shown in Figure 12, is calculated by adding pairs of the consecutive integer values x~,xl,...x~, representing the widths of the bars and spaces, as follows:
t1 = x0 + x1 t2 . x1 + x2 t3 ._ x2 + x3 etc.
A width W far the entire codeword is also calculated in step 204 by summing the eight integer values x~ + x1 + . . . + x~.
For the codeword in Figure 12, for example, the sequence of integer values from the scan line, representing the widths of the bars and spaces might be something like: 43, 19, 21, 19, 22, 18, 103, 96. The raw t-sequence tl,t~,...t~ would then be 62,. 40, 41, 40, 121, 199, and the width W would be 341.
In step 206 in Figure 11, the raw t-sequence obtained in step 204 is normalized and rounded to integer values. Specifically, a value for the codeword's "module" or "unit" is first established by dividing the width W of the codeward by the total number of units for each codeword. an a PDF417 symbol, each codeword is seventeen units, so that the width W is divided by seventeen to obtain the unit of the codeword. Thus, for the example in Figure 12, the unit would be (341/17) - 20Ø Each value of the raw t-sequence is then divided by the unit and rounded to an integer to _ 28 -The normalized t-sequence is then compared to the t-sequences of the start and stop patterns of the code in step 208. If the scanner scans from both left to right and right to left, then the t-sequence must be compared to the start and stop patterns in be their normal and reverse orientations.
If there is a match in step 210, then the index is set in step~214 to a location in the scan line immediately following the pattern if it i.s a start pattern or immediately preceding it if it is a stop pattern. If the current t-sequence does not match either the start or the stop pattern, however, then in step 212, the index is incremented by one and steps 202 through 210 are repeated until either a match is found ar the length of the scan line is exceeded.
Figure 13 is a flow chart showing in greater detail the sequence of steps for decoding a scan line of data into a vector of codewords and their clusters as referred to in step 162 of Figure 9 above. In decoding the individual codeword values and cluster numbers from the scan line, the low-level- decoder begins decoding at the start or stop pattern and decodes as many codewords possible. For those codewords that are not successfully decoded, the codeword values in the codeword vector are set to ., gAD . "
At the completion of the sequence of steps shown in Figure 13, the cadeword vector will contain certain codeword values and cluster numbers in locations corresponding to the appropriate ~~ a ~~~~
columns of the codewords that were successfully decoded. Fiqur?
14A shows an example of a codeword vector in which the codewords in eight of the ten columns were successfully decoded. The codeword values in columns 1 and 10 correspond to the left rc~
indicator codeword in row 2 (L2) and the right row indicator codeword in row 1 (RI), respectively. The codewords in columns 5 and 7 were not successfully decoded as indicated by the notation "BAD" in those locations of the codeword vector.
Returning to the first step 220 of Figure 13, an upper limit on the number of codewords that may be decoded ("cwlimit") is set equal to the number of columns in the codeword matrix. If this number of codewords is successfully decoded, then the decoding process for the current scan line is obviously complete.
Step 222 determines the direction of the scan if the scanner scans from both left to right and right to left. If the particular scan was from left to right as determined in step 222, then the column number of the first codeword is set to "1" in step 224 and the amount that it will incremented by ("incr") each time a subsequent codeword is decoded is set to "+1." If the scan was from right to left, however, then in step 226, the column number of the first codeword in 'the scan line will be the last column of the codeword matrix, and the incremental value is set to '-1."
Step 228 is the first step of a control loop in which individual codeword values and their cluster numbers are decoded from the scan lane of data. In step 228, the codeword limit is "' tested to see if it is still greater than zero. If not, then all tit ,~ r,t of the codewords in the scan line have been decoded and the loot is exited.
Otherwise, step 230 obtains the next codeword value and its cluster number from the scan line. This step will be discussed ...
further detail below in connection with Figure 1S.
If the codeword decoded in the previous step is a valid codeword as determined in step 232, then in step 234 the codewor~
value and its cluster number are saved in the codeword vector at a location corresponding to the column of the codeword. The codeword values thus placed in the codeword vector are ready for incorporation into the codeword matrix.
If the codeword decoded in step 230 is not a valid codeword, however, then the codeword value in the codeword vector corresponding to the current column is set to "SAD" in step 236 tc indicate that this codeword was not successfully decoded. A "BAD"
codeword is most likely to occur when the scan line crosses the boundary between two rows in the middle of the codeword.
Finally, in step 238, the current column number is either incremented or decremented depending on the direction of the scan, and the codeword limit is decremented by one. Steps 228-236 are then repeated until there has been an attempt to decode all of the codewords in the scan line.
Figure 15 is a flow chart diagram showing the seguence of steps corresponding to step 230 in Figure 13 and step 172 in Figure 10 in which an attempt is made to decode an individual codeword value and cluster number from the scan line. In the first step 240, a raw t-sequence and the width W are obtained froze the scan line. This same step was discussed previously in connection with step 204 in Figure 11.
In step 242, the width W of the eight elements presumed to be the next codeword are compared to the width of the previously decoded codeword. If the current width W is not within a range c~
plus or minus a predetermined difference (delta), then there is probably a split (undercount by a multiple of two elements) or merge (overcount by a multiple of two elements) error in the current codeword. This codeword is not decoded further, but rather in step 244 its value and cluster number are both set to BAD to indicate that it could not be decoded.
Then in step 246, an attempt is made to resynchronize to t:-boundary of the next codeword by finding a t-sequence with a corresponding width W that falls within a given tolerance of the expected width of a codeward, based on the width of the previous codeword. If the current width W is significantly greater than the expected width, indicating a possible merge error, then the last two integer values are dropped from the t-sequence until i~
falls within the proper limits. Likewise, if the current width W
is significantly less than the expected width, indicating a possible split error, the next two integer values in the scan line are added to the t-sequence until it falls within the proper limits.
If the current width W is within a certain tolerance of th~
expected width, as determined in step 242, then an attempt is ma_~
to decode the codeword. In step 248, the raw t-sequence is normalized as described above in connection with step 206 in ~~~ta ~ ~ ~ '~ '-' Figure 11. Then in step 250, the cluster number is determined from the normalized t-sequence. The cluster number may be determined from the t-sequence (as opposed to the X-sequence described above) as follows:
cluster number = (TI - T2 + TS - T6) mod 9 For codewords in PDF~1'7, valid cluster numbers are 0, 3, and 6. If in step 252 it is determined that the cluster number is r.
0, 3, or 6, then the codeword is not valid. Accordingly, in step 254 the cluster number and value are set to "BAD" to indicate that the codeword was not successfully decoded.
Otherwise, in step 256, the normalized t-sequence and its cluster number are used to find the corresponding codeword value in a look-up table. If no corresponding codeword value is found for the t-sequence, then the codeword value is set to "BAD" to indicate that it was not successfully decoded.
Finally, in step 258 the "last width" value is updated to the current width W of the codeword for use in decoding the next codeword value from the scan line.
Figures 16A and 16B together comprise a flow chart of the sequence of steps executed by the low-level decoder in order to update the codeword matrix using the codeword vector. These figures explain in greater detail step 16~ in Figure 9 discussed above.
The first step 260 of Figure 16A checks the first and last values in the codeword vector to see if either is a valid row indicator. If neither the first nor the last values in the codeword vector is a valid row indicator, then in step 262 'the ,., y !i : C~ ~ e~
program exits the routine and no attempt is made to update the codeword matrix using the codeword vector.
zf a valid row indicator is present, however, then in step 264 confidence weights are assigned to each codeword value in t;.a codeword vector. Specifically, a confidence weight is assigned t..
each codeword depending on whether its nearest neighbors and the cluster were also decoded. For example, as shown in Figure 1a8, the codeword values in columns 1, 2, 3, 9, and 1Q are assigned high~confidence weights ("H") because their immediate neighbors were also successfully decoded and have the same cluster number.
The codeword values for columns 4 and 8 are assigned medium confidence weights ("M") because one of their neighbors was successfully decoded and has the same cluster number but the other neighboring codeword value is "BAD." The codeword value in column 3 is assigned a very low confidence weight ("L") because neither of its neighbors was successfully decoded. Thus, the confidence weight for a codeword value at column i in the codeword vector is essentially a function of the cluster numbers of the codewords at columns i - 1, i, and i -~ 1. This function may be implemented by a look-up table whose index is calculated from the cluster numbers of the three codewords.
In step 266, a row number is assigned to each codeword value in the codeword vector based on 'the row indicator codewords and the cluster numbers. As shown in the example in Figure 14C, the left row indicator codeword L2 indicates that the row number is 2 and the cluster number is 6. The cluster numbers for the codeword tETT
values in columns 2-4 are also 6. Therefore, row number 2 is ~~~~~,1~.~
d.~ a 3 a _~ e;e assigned to the codeword values in the first four columns or t::e codeword vector.
Also in the example in Figure 14C, columns six and 8-10 a:.:.
have a cluster number of 3 and the right row indicator codeword ~.
indicates that the row number is 1. Therefore, it can be assumed that the scan line crossed the row boundary between row 2 and Boa 1 and the codeword values in columns Ei and 8-10 should be assigned to row 1.
Once the confidence weights and row numbers have been assigned to each of the codeword values in the codeword vector, the codeword .matrix is updated one codeword at a time. In step 208, the column number C of both the codeword vector and the codeword matrix is set is initially set to "1." Step 270 is the first step of an iterative loop which steps through the codewords in the codeword vector and uses them to update the corresponding codewords and their associated confidence weights in the codeword matrix. When the column number C exceeds the number of columns in step 270, then all of the codewords in the codeword vector have been processed and the routine ends.
For each codeword in the codeword vector, step 272 sets the row number R of the codeword matrix to the row number assigned .in step 266 to the codeword in the codeword vector at the location C.
Thus, for each cadeword value in the codeword vector, there .is a corresponding value in the codeword matrix at location (R,C].
Continuing in Figure 16~, step 274 determines whether the current codeword value in location (R,C] in the codeword matrix is the same as the corresponding codeword value in the codeword ~~~~~~~~:
vector at column C. If the values are the same, then in step ?
the confidence weight assigned to the codeword value in matrix location [R,C] is increased by the confidence weight of the corresponding codeword value in the codeword vector. If not, the confidence weight of the codeword value in the matrix is decreases by the confidence weight of the codeword value in the vector in step 278.
If the confidence weight was decreased in step 278, then i:.
step 280 that confidence weight is tested to see if it was decreased below zero. Tf the confidence weight is less than zero, then in step 282 the new codeword value in the eodeword vector is substituted for the current codeword value in the corresponding location in the codeword matrix. The confidence weight assignee to the codeword value in the matrix is also changed to a positive value in step 284.
Finally, in step 286 the column number C is incremented by '_ for processing the next codeword value in the codeword vector and program control is returned to step 270 for repeating steps 272 through 286 for all of the columns in the vector.
Returning briefly to step 154 in Figure 9, each time after the codeword matrix has been filled in with the new vector of codeword values and the confidence weights have been updated, an attempt is made to fill in the rest of the matrix using the built-in error correction capability of the symbol. 'The number and location of codewords which have not yet been successfully decoded may be determined by comparing the confidence weights assigned each of the codeword values in the matrix with a predetermined ~~~~ ~v threshold. Those values having confidence weights below the threshold are considered to not yet be decoded. If the number e.
codewords not yet decoded is less than the error correction capability of the symbol as determined by the security level, t'.~.e~
an attempt is made to correct the matrix.
It will be apparent to those skilled in the art that various modifications and variations can be made in the decoding method and apparatus without departing from the scope or spirit of the invention. Other embodiments of the invention will be apparent t:.
those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples he considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
Claims (24)
1. A record comprising an image portion containing a graphic image; and an information portion including data encoded in an machine-readable format including at least two adjacent rows of codewords, each said codeword representing at least one pattern of marks.
2, The record of claim 1 wherein the information portion overlays but does not obscure the graphic image, and wherein the machine readable format is error-correctable and capable of allowing recovery of the information despite distortion due to the graphic image.
3. The record of claim 1 wherein the codewords include a plurality of information words in the information portion, and wherein the image portion includes a plurality of image words each containing a pattern of marks such that the patterns of marks of all of the codewords in the image portion represent the graphic image.
4. Tho record of claims 2 or 3 wherein the data in the information portion is encoded in a two-dimensional bar code.
5. The record of claim 4 wherein the data in the information portion is encoded in PDF417 format.
6. The record of claim 2 wherein the graphic image is a photograph.
7. The record of claim 6 wherein the photograph is an identification photograph of the owner of the record.
8. The record of claim 7 wherein the record is a driver's license.
9. The record of claim 7 wherein the record is a passport.
10. The record of claim 6 wherein the record is a visa.
11. The record of claim 6 wherein the data in the information portion describes portions of the photograph.
12. The record of claim 3 wherein the record is a bearer bond.
13. The record of claim 3 wherein the record is a stock certificate.
14. The record of claim 3 wherein the information words and im-words are organized as alternating sequences in the at least two adjacent rows.
15. The record of claim 14 wherein each of the rows includes a field indicating the lengths of the alternating sequences of information words and image words.
16. The record of claim 15 wherein each of the rows includes a field identifying the row.
17. A printer system for a record bearing an image, the printer system comprising:
input means for receiving data to be placed onto the record;
encoding means, coupled to the input means, for encoding the received data in an error-correctable, machine-readable format;
and output means, coupled to the encoding means, for printing the encoded data over the image without obscuring the image.
input means for receiving data to be placed onto the record;
encoding means, coupled to the input means, for encoding the received data in an error-correctable, machine-readable format;
and output means, coupled to the encoding means, for printing the encoded data over the image without obscuring the image.
18. The printer system of claim 17 wherein the encoding means includes means for encoding the received data in a two-dimensional bar code format.
19. The printer system of claim 18 wherein the means for encoding the received data in a two-dimensional bar code format includes means for encoding the received data in PDF417 format.
20. The printer system of claim 17 further including means for placing the image onto the record.
21. The printer system of claim 20 wherein the image is a photograph, and wherein the means for placing the image onto the record includes means for placing the photograph onto the record.
22. A printer system for a record containing data in an information portion and a graphic image in an image portion comprising:
input means for receiving information to be printed in selected areas of the information portion of the record and selected areas of the graphic portion of the record;
alignment means for locating the selected areas of the information portion and the graphic portion of the record; and output means, coupled to the alignment means and the input means, for placing the received information into the selected areas of the information portion and the graphic portion of the record.
input means for receiving information to be printed in selected areas of the information portion of the record and selected areas of the graphic portion of the record;
alignment means for locating the selected areas of the information portion and the graphic portion of the record; and output means, coupled to the alignment means and the input means, for placing the received information into the selected areas of the information portion and the graphic portion of the record.
23. The printer system of claim 22 wherein the record has rows with alternating sequences of the information words and image words, and each of the rows have a first field containing data identifying that row; and wherein the alignment means includes means far reading the first field of the rows to locate the selected areas.
24. The printer system of claim 23 wherein each of the rows also includes a second field including the lengths of alternating sequences of information words and image words in the corresponding row, and wherein the aligned means includes means for reading the second field of a selected row to locate the selected areas.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002448709A CA2448709C (en) | 1992-06-01 | 1993-05-31 | Record with encoded data |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US891,742 | 1992-06-01 | ||
US07891742 US5337361C1 (en) | 1990-01-05 | 1992-06-01 | Record with encoded data |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002448709A Division CA2448709C (en) | 1992-06-01 | 1993-05-31 | Record with encoded data |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2097359A1 CA2097359A1 (en) | 1993-12-02 |
CA2097359C true CA2097359C (en) | 2004-03-30 |
Family
ID=25398745
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002097359A Expired - Lifetime CA2097359C (en) | 1992-06-01 | 1993-05-31 | Record with encoded data |
Country Status (10)
Country | Link |
---|---|
US (2) | US5337361C1 (en) |
EP (1) | EP0572989B1 (en) |
JP (1) | JPH06199078A (en) |
KR (1) | KR930022236A (en) |
CN (1) | CN1035642C (en) |
AT (1) | ATE204398T1 (en) |
CA (1) | CA2097359C (en) |
DE (1) | DE69330582T2 (en) |
ES (1) | ES2159284T3 (en) |
TW (1) | TW241355B (en) |
Families Citing this family (353)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5675137A (en) * | 1986-04-18 | 1997-10-07 | Cias, Inc. | Bar code decoding using moving averages to break the (n,k) code barrier for UPC, EAN Code 128 and others |
US5489158A (en) * | 1990-01-05 | 1996-02-06 | Symbol Technologies, Inc. | Printer system for removable machine readable code |
US6385352B1 (en) * | 1994-10-26 | 2002-05-07 | Symbol Technologies, Inc. | System and method for reading and comparing two-dimensional images |
US6738491B1 (en) * | 1992-06-30 | 2004-05-18 | Minolta Co., Ltd. | Image forming apparatus and copy management system |
US6301369B2 (en) | 1992-07-31 | 2001-10-09 | Digimarc Corporation | Image marking to permit later identification |
US5721788A (en) * | 1992-07-31 | 1998-02-24 | Corbis Corporation | Method and system for digital image signatures |
US5594470A (en) | 1992-10-02 | 1997-01-14 | Teletransaction, Inc. | Highly integrated portable electronic work slate unit |
US5825617A (en) * | 1992-10-02 | 1998-10-20 | Teletransactions, Inc. | Workslate computer having modular device docking stations on horizontal and vertical side portions |
US5864622A (en) * | 1992-11-20 | 1999-01-26 | Pitney Bowes Inc. | Secure identification card and method and apparatus for producing and authenticating same |
US5490217A (en) * | 1993-03-05 | 1996-02-06 | Metanetics Corporation | Automatic document handling system |
US5848426A (en) * | 1993-03-05 | 1998-12-08 | Metanetics Corporation | Automatic data translation between different business systems |
GB9314894D0 (en) * | 1993-07-19 | 1993-09-01 | Tracker The Corp | Method for identifying personal possessions |
US5505494B1 (en) * | 1993-09-17 | 1998-09-29 | Bell Data Software Corp | System for producing a personal id card |
JPH07175458A (en) * | 1993-10-12 | 1995-07-14 | Internatl Business Mach Corp <Ibm> | Method and system for reduction of looking-on of data on screen |
JP3493522B2 (en) * | 1993-10-20 | 2004-02-03 | ミノルタ株式会社 | Image processing device |
US7044395B1 (en) * | 1993-11-18 | 2006-05-16 | Digimarc Corporation | Embedding and reading imperceptible codes on objects |
US6345104B1 (en) * | 1994-03-17 | 2002-02-05 | Digimarc Corporation | Digital watermarks and methods for security documents |
US5822436A (en) | 1996-04-25 | 1998-10-13 | Digimarc Corporation | Photographic products and methods employing embedded information |
US8505108B2 (en) * | 1993-11-18 | 2013-08-06 | Digimarc Corporation | Authentication using a digital watermark |
US6983051B1 (en) | 1993-11-18 | 2006-01-03 | Digimarc Corporation | Methods for audio watermarking and decoding |
US6611607B1 (en) | 1993-11-18 | 2003-08-26 | Digimarc Corporation | Integrating digital watermarks in multimedia content |
US5832119C1 (en) | 1993-11-18 | 2002-03-05 | Digimarc Corp | Methods for controlling systems using control signals embedded in empirical data |
US6122403A (en) | 1995-07-27 | 2000-09-19 | Digimarc Corporation | Computer system linked by using information in data objects |
US6944298B1 (en) | 1993-11-18 | 2005-09-13 | Digimare Corporation | Steganographic encoding and decoding of auxiliary codes in media signals |
US6757406B2 (en) * | 1993-11-18 | 2004-06-29 | Digimarc Corporation | Steganographic image processing |
US5768426A (en) | 1993-11-18 | 1998-06-16 | Digimarc Corporation | Graphics processing system employing embedded code signals |
US20020009208A1 (en) * | 1995-08-09 | 2002-01-24 | Adnan Alattar | Authentication of physical and electronic media objects using digital watermarks |
ATE199469T1 (en) | 1993-11-18 | 2001-03-15 | Digimarc Corp | VIDEO COPY CONTROL WITH VARIOUS EMBEDDED SIGNALS |
US7171016B1 (en) | 1993-11-18 | 2007-01-30 | Digimarc Corporation | Method for monitoring internet dissemination of image, video and/or audio files |
US6424725B1 (en) | 1996-05-16 | 2002-07-23 | Digimarc Corporation | Determining transformations of media signals with embedded code signals |
US6408082B1 (en) | 1996-04-25 | 2002-06-18 | Digimarc Corporation | Watermark detection using a fourier mellin transform |
US6449377B1 (en) | 1995-05-08 | 2002-09-10 | Digimarc Corporation | Methods and systems for watermark processing of line art images |
US7116781B2 (en) * | 1993-11-18 | 2006-10-03 | Digimarc Corporation | Counteracting geometric distortions in watermarking |
US7113596B2 (en) * | 1993-11-18 | 2006-09-26 | Digimarc Corporation | Embedding information related to a subject of an identification document in the identification document |
US7313251B2 (en) | 1993-11-18 | 2007-12-25 | Digimarc Corporation | Method and system for managing and controlling electronic media |
US6580819B1 (en) | 1993-11-18 | 2003-06-17 | Digimarc Corporation | Methods of producing security documents having digitally encoded data and documents employing same |
US6614914B1 (en) | 1995-05-08 | 2003-09-02 | Digimarc Corporation | Watermark embedder and reader |
US5841886A (en) | 1993-11-18 | 1998-11-24 | Digimarc Corporation | Security system for photographic identification |
US6546112B1 (en) * | 1993-11-18 | 2003-04-08 | Digimarc Corporation | Security document with steganographically-encoded authentication data |
US7676059B2 (en) * | 1994-10-21 | 2010-03-09 | Digimarc Corporation | Video steganography or encoding |
US6516079B1 (en) | 2000-02-14 | 2003-02-04 | Digimarc Corporation | Digital watermark screening and detecting strategies |
US6681028B2 (en) | 1995-07-27 | 2004-01-20 | Digimarc Corporation | Paper-based control of computer systems |
US5748763A (en) | 1993-11-18 | 1998-05-05 | Digimarc Corporation | Image steganography system featuring perceptually adaptive and globally scalable signal embedding |
JPH07249075A (en) * | 1994-03-10 | 1995-09-26 | Fujitsu Ltd | Terminal device, method, and medium for customer management |
US6985600B2 (en) * | 1994-03-17 | 2006-01-10 | Digimarc Corporation | Printing media and methods employing digital watermarking |
US6882738B2 (en) * | 1994-03-17 | 2005-04-19 | Digimarc Corporation | Methods and tangible objects employing textured machine readable data |
US8144368B2 (en) * | 1998-01-20 | 2012-03-27 | Digimarc Coporation | Automated methods for distinguishing copies from original printed objects |
US7778437B2 (en) * | 1994-03-17 | 2010-08-17 | Digimarc Corporation | Media and methods employing steganographic marking |
US7286684B2 (en) * | 1994-03-17 | 2007-10-23 | Digimarc Corporation | Secure document design carrying auxiliary machine readable information |
GB2288476A (en) * | 1994-04-05 | 1995-10-18 | Ibm | Authentication of printed documents. |
US5513264A (en) * | 1994-04-05 | 1996-04-30 | Metanetics Corporation | Visually interactive encoding and decoding of dataforms |
US7016524B2 (en) * | 1994-04-14 | 2006-03-21 | Moore Lewis J | System for authenticating and processing of checks and other bearer documents |
US6005960A (en) * | 1994-04-14 | 1999-12-21 | Moore; Lewis J. | Anti-counterfeiting system |
US5592561A (en) * | 1994-04-14 | 1997-01-07 | Moore; Lewis J. | Anti-counterfeiting system |
US7213763B2 (en) * | 1994-05-25 | 2007-05-08 | Rathus Spencer A | Method and apparatus for accessing electronic data via a familiar printed medium |
US8261993B2 (en) | 1994-05-25 | 2012-09-11 | Marshall Feature Recognition, Llc | Method and apparatus for accessing electronic data via a familiar printed medium |
US6164534A (en) * | 1996-04-04 | 2000-12-26 | Rathus; Spencer A. | Method and apparatus for accessing electronic data via a familiar printed medium |
US7712668B2 (en) | 1994-05-25 | 2010-05-11 | Marshall Feature Recognition, Llc | Method and apparatus for accessing electronic data via a familiar printed medium |
US8910876B2 (en) | 1994-05-25 | 2014-12-16 | Marshall Feature Recognition, Llc | Method and apparatus for accessing electronic data via a familiar printed medium |
US5568556A (en) * | 1994-05-26 | 1996-10-22 | Graph-It, Inc. | System and method for encrypting sensitive information |
US6266045B1 (en) | 1994-06-30 | 2001-07-24 | Telxon Corporation | Interactive display user interface computer and method |
EP0772530B1 (en) * | 1994-07-26 | 2001-11-21 | International Data Matrix, Inc. | Unalterable self-verifying articles |
FR2723795B1 (en) * | 1994-08-16 | 1996-10-25 | France Telecom | DEVICE AND METHOD FOR SECURING A DOCUMENT AND GRAPHIC AUTHENTICATION CODE. |
US5492559A (en) * | 1994-10-19 | 1996-02-20 | Xerox Corporation | Liquid crystalline microemulsion ink compositions |
US6560349B1 (en) | 1994-10-21 | 2003-05-06 | Digimarc Corporation | Audio monitoring using steganographic information |
US6778682B2 (en) | 1994-10-21 | 2004-08-17 | Digimarc Corporation | Redundantly embedding auxiliary data in source signals |
US7986806B2 (en) | 1994-11-16 | 2011-07-26 | Digimarc Corporation | Paper products and physical objects as means to access and control a computer or to navigate over or act as a portal on a network |
US7362775B1 (en) | 1996-07-02 | 2008-04-22 | Wistaria Trading, Inc. | Exchange mechanisms for digital information packages with bandwidth securitization, multichannel digital watermarks, and key management |
US5572010A (en) * | 1995-01-03 | 1996-11-05 | Xerox Corporation | Distributed type labeling for embedded data blocks |
US5929429A (en) * | 1995-01-03 | 1999-07-27 | Xerox Corporation | Distributed dimensional labeling for dimensional characterization of border-type embedded data blocks |
US5671282A (en) * | 1995-01-23 | 1997-09-23 | Ricoh Corporation | Method and apparatus for document verification and tracking |
US5602377A (en) * | 1995-03-01 | 1997-02-11 | Metanetics Corporation | Bar code dataform scanning and labeling apparatus and method |
US5661284A (en) * | 1995-03-13 | 1997-08-26 | Albert J. Freeman | Commercial transaction system |
US5596652A (en) * | 1995-03-23 | 1997-01-21 | Portable Data Technologies, Inc. | System and method for accounting for personnel at a site and system and method for providing personnel with information about an emergency site |
US5793882A (en) * | 1995-03-23 | 1998-08-11 | Portable Data Technologies, Inc. | System and method for accounting for personnel at a site and system and method for providing personnel with information about an emergency site |
DE69629071T2 (en) * | 1995-03-29 | 2004-04-22 | Eastman Kodak Co. | Device for printing, storing and retrieving a recorded image |
US6744906B2 (en) | 1995-05-08 | 2004-06-01 | Digimarc Corporation | Methods and systems using multiple watermarks |
US6760463B2 (en) * | 1995-05-08 | 2004-07-06 | Digimarc Corporation | Watermarking methods and media |
US6763123B2 (en) | 1995-05-08 | 2004-07-13 | Digimarc Corporation | Detection of out-of-phase low visibility watermarks |
US7620200B2 (en) * | 1995-05-08 | 2009-11-17 | Digimarc Corporation | Authentication of identification documents |
US7054462B2 (en) | 1995-05-08 | 2006-05-30 | Digimarc Corporation | Inferring object status based on detected watermark data |
ATE261225T1 (en) * | 1995-05-08 | 2004-03-15 | Digimarc Corp | USE OF STEGANOGRAPHICALLY EMBEDDED CALIBRATION DATA IN THE TRANSFORMATION AREA FOR DETECTING IMAGE DISTORTIONS |
US20090097695A9 (en) * | 1995-05-08 | 2009-04-16 | Rhoads Geoffrey B | Personal document authentication system using watermarking |
US7555139B2 (en) * | 1995-05-08 | 2009-06-30 | Digimarc Corporation | Secure documents with hidden signals, and related methods and systems |
US5706099A (en) * | 1995-06-05 | 1998-01-06 | Xerox Corporation | Method and apparatus for generating serpentine halftone images |
US5710636A (en) * | 1995-06-05 | 1998-01-20 | Xerox Corporation | Method and apparatus for generating halftone images having human readable patterns formed therein |
US5613004A (en) | 1995-06-07 | 1997-03-18 | The Dice Company | Steganographic method and device |
US7562392B1 (en) * | 1999-05-19 | 2009-07-14 | Digimarc Corporation | Methods of interacting with audio and ambient music |
US6650761B1 (en) | 1999-05-19 | 2003-11-18 | Digimarc Corporation | Watermarked business cards and methods |
US6788800B1 (en) | 2000-07-25 | 2004-09-07 | Digimarc Corporation | Authenticating objects using embedded data |
US5796088A (en) * | 1995-08-15 | 1998-08-18 | Teletransactions, Inc. | Hand held portable bar code dataform reader having a rotatable reader module portion |
US5750975A (en) * | 1995-08-25 | 1998-05-12 | Teletransactions, Inc. | Hand held bar code dataform reader having a rotatable reading assembly |
US5680611A (en) * | 1995-09-29 | 1997-10-21 | Electronic Data Systems Corporation | Duplicate record detection |
US5742685A (en) * | 1995-10-11 | 1998-04-21 | Pitney Bowes Inc. | Method for verifying an identification card and recording verification of same |
US5759729A (en) * | 1995-12-05 | 1998-06-02 | Xerox Corporation | Photochromic electrostatic toner compositions |
US5593486A (en) * | 1995-12-05 | 1997-01-14 | Xerox Corporation | Photochromic hot melt ink compositions |
US5710420A (en) * | 1995-12-05 | 1998-01-20 | Xerox Corporation | Method for embedding and recovering machine-readable information |
US5633109A (en) * | 1995-12-05 | 1997-05-27 | Xerox Corporation | Ink compositions with liposomes containing photochromic compounds |
US5967556A (en) | 1996-01-16 | 1999-10-19 | Direct Business Technologies, Inc. | Method and system for generating, storing and managing records |
US7664263B2 (en) * | 1998-03-24 | 2010-02-16 | Moskowitz Scott A | Method for combining transfer functions with predetermined key creation |
US6205249B1 (en) | 1998-04-02 | 2001-03-20 | Scott A. Moskowitz | Multiple transform utilization and applications for secure digital watermarking |
US6201879B1 (en) * | 1996-02-09 | 2001-03-13 | Massachusetts Institute Of Technology | Method and apparatus for logo hiding in images |
US6098882A (en) * | 1996-03-01 | 2000-08-08 | Cobblestone Software, Inc. | Variable formatting of digital data into a pattern |
US5995630A (en) * | 1996-03-07 | 1999-11-30 | Dew Engineering And Development Limited | Biometric input with encryption |
US5930759A (en) * | 1996-04-30 | 1999-07-27 | Symbol Technologies, Inc. | Method and system for processing health care electronic data transactions |
US6229924B1 (en) * | 1996-05-16 | 2001-05-08 | Digimarc Corporation | Method and apparatus for watermarking video images |
US7412072B2 (en) * | 1996-05-16 | 2008-08-12 | Digimarc Corporation | Variable message coding protocols for encoding auxiliary data in media signals |
US6381341B1 (en) | 1996-05-16 | 2002-04-30 | Digimarc Corporation | Watermark encoding method exploiting biases inherent in original signal |
US7095874B2 (en) * | 1996-07-02 | 2006-08-22 | Wistaria Trading, Inc. | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
US5889868A (en) | 1996-07-02 | 1999-03-30 | The Dice Company | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
US7177429B2 (en) | 2000-12-07 | 2007-02-13 | Blue Spike, Inc. | System and methods for permitting open access to data objects and for securing data within the data objects |
US7346472B1 (en) | 2000-09-07 | 2008-03-18 | Blue Spike, Inc. | Method and device for monitoring and analyzing signals |
US7159116B2 (en) | 1999-12-07 | 2007-01-02 | Blue Spike, Inc. | Systems, methods and devices for trusted transactions |
US7457962B2 (en) | 1996-07-02 | 2008-11-25 | Wistaria Trading, Inc | Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data |
US6463416B1 (en) * | 1996-07-15 | 2002-10-08 | Intelli-Check, Inc. | Authentication system for identification documents |
US5734752A (en) * | 1996-09-24 | 1998-03-31 | Xerox Corporation | Digital watermarking using stochastic screen patterns |
US5766075A (en) * | 1996-10-03 | 1998-06-16 | Harrah's Operating Company, Inc. | Bet guarantee system |
NL1004433C2 (en) * | 1996-11-05 | 1998-05-08 | Iai Bv | Security feature in the form of a perforation pattern. |
DE69739017D1 (en) * | 1996-11-28 | 2008-11-13 | Nec Corp | Card-type registration means, registration method and apparatus for the registration means, system for generating such registration means, ciphering system and decoder therefor, and registration means |
US5767497A (en) * | 1996-12-04 | 1998-06-16 | United Parcel Service Of America, Inc. | Method and apparatus for decoding bar code symbols using ratio analysis of module size |
US6047892A (en) * | 1996-12-09 | 2000-04-11 | Symbol Technologies, Inc. | Two-dimensional bar code symbology using implicit version information encoding |
US6594406B1 (en) | 1996-12-20 | 2003-07-15 | Xerox Corporation | Multi-level selection methods and apparatus using context identification for embedded data graphical user interfaces |
US7730317B2 (en) | 1996-12-20 | 2010-06-01 | Wistaria Trading, Inc. | Linear predictive coding implementation of digital watermarks |
US5790703A (en) * | 1997-01-21 | 1998-08-04 | Xerox Corporation | Digital watermarking using conjugate halftone screens |
US6119932A (en) * | 1997-02-18 | 2000-09-19 | Protech Video Security, Inc. | Identification verification apparatus and method |
US6786420B1 (en) | 1997-07-15 | 2004-09-07 | Silverbrook Research Pty. Ltd. | Data distribution mechanism in the form of ink dots on cards |
US6618117B2 (en) | 1997-07-12 | 2003-09-09 | Silverbrook Research Pty Ltd | Image sensing apparatus including a microcontroller |
US7110024B1 (en) | 1997-07-15 | 2006-09-19 | Silverbrook Research Pty Ltd | Digital camera system having motion deblurring means |
US6624848B1 (en) | 1997-07-15 | 2003-09-23 | Silverbrook Research Pty Ltd | Cascading image modification using multiple digital cameras incorporating image processing |
US7551201B2 (en) | 1997-07-15 | 2009-06-23 | Silverbrook Research Pty Ltd | Image capture and processing device for a print on demand digital camera system |
US6690419B1 (en) | 1997-07-15 | 2004-02-10 | Silverbrook Research Pty Ltd | Utilising eye detection methods for image processing in a digital image camera |
US6879341B1 (en) | 1997-07-15 | 2005-04-12 | Silverbrook Research Pty Ltd | Digital camera system containing a VLIW vector processor |
JP3236246B2 (en) * | 1997-08-04 | 2001-12-10 | 忠男 宇野 | Passport manufacturing method |
US6148091A (en) * | 1997-09-05 | 2000-11-14 | The Identiscan Company, Llc | Apparatus for controlling the rental and sale of age-controlled merchandise and for controlling access to age-controlled services |
US6523741B1 (en) | 1997-09-05 | 2003-02-25 | Dimaria Peter C. | Apparatus for controlling the rental and sale of age-controlled merchandise and for controlling access to age-controlled services |
US6561428B2 (en) | 1997-10-17 | 2003-05-13 | Hand Held Products, Inc. | Imaging device having indicia-controlled image parsing mode |
US6298176B2 (en) | 1997-10-17 | 2001-10-02 | Welch Allyn Data Collection, Inc. | Symbol-controlled image data reading system |
FR2771207A1 (en) * | 1997-11-19 | 1999-05-21 | Jacques Rivailler | Method of identification of an image or document |
US6104812A (en) * | 1998-01-12 | 2000-08-15 | Juratrade, Limited | Anti-counterfeiting method and apparatus using digital screening |
US7054463B2 (en) | 1998-01-20 | 2006-05-30 | Digimarc Corporation | Data encoding using frail watermarks |
US6126074A (en) * | 1998-01-28 | 2000-10-03 | Symbol Technologies, Inc. | Error correction in macro bar code symbols |
US6636332B1 (en) * | 1998-02-05 | 2003-10-21 | Eastman Kodak Company | System for reproducing images and method thereof |
US6608911B2 (en) | 2000-12-21 | 2003-08-19 | Digimarc Corporation | Digitally watermaking holograms for use with smart cards |
US6782115B2 (en) | 1998-04-16 | 2004-08-24 | Digimarc Corporation | Watermark holograms |
US7602940B2 (en) | 1998-04-16 | 2009-10-13 | Digimarc Corporation | Steganographic data hiding using a device clock |
US7162052B2 (en) * | 1998-04-16 | 2007-01-09 | Digimarc Corporation | Steganographically encoding specular surfaces |
GB9808651D0 (en) * | 1998-04-23 | 1998-06-24 | Cooke Charles B D | Animated print |
EP1014618A1 (en) * | 1998-07-30 | 2000-06-28 | Sony Corporation | Content processing system |
US6978036B2 (en) * | 1998-07-31 | 2005-12-20 | Digimarc Corporation | Tamper-resistant authentication techniques for identification documents |
AUPP702098A0 (en) | 1998-11-09 | 1998-12-03 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ART73) |
US7532740B2 (en) | 1998-09-25 | 2009-05-12 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |
US7197156B1 (en) | 1998-09-25 | 2007-03-27 | Digimarc Corporation | Method and apparatus for embedding auxiliary information within original data |
US7373513B2 (en) | 1998-09-25 | 2008-05-13 | Digimarc Corporation | Transmarking of multimedia signals |
US7055034B1 (en) * | 1998-09-25 | 2006-05-30 | Digimarc Corporation | Method and apparatus for robust embedded data |
JP2000155798A (en) | 1998-11-18 | 2000-06-06 | Toshiba Corp | Method and system for device control |
EP1131769B1 (en) * | 1998-11-19 | 2005-02-16 | Digimarc Corporation | Printing and validation of self validating security documents |
US7664264B2 (en) | 1999-03-24 | 2010-02-16 | Blue Spike, Inc. | Utilizing data reduction in steganographic and cryptographic systems |
AUPQ056099A0 (en) | 1999-05-25 | 1999-06-17 | Silverbrook Research Pty Ltd | A method and apparatus (pprint01) |
US6514140B1 (en) * | 1999-06-17 | 2003-02-04 | Cias, Inc. | System for machine reading and processing information from gaming chips |
JP3541731B2 (en) * | 1999-06-18 | 2004-07-14 | 株式会社デンソー | Forgery determination method, forgery determination device, and recording medium |
US8103542B1 (en) | 1999-06-29 | 2012-01-24 | Digimarc Corporation | Digitally marked objects and promotional methods |
US7475246B1 (en) | 1999-08-04 | 2009-01-06 | Blue Spike, Inc. | Secure personal content server |
US6993655B1 (en) | 1999-12-20 | 2006-01-31 | Xerox Corporation | Record and related method for storing encoded information using overt code characteristics to identify covert code characteristics |
US6765688B1 (en) * | 2000-02-08 | 2004-07-20 | Hewlett-Packard Development Company, L.P. | Generic method of defining a watermark for both print and copy |
US6625297B1 (en) * | 2000-02-10 | 2003-09-23 | Digimarc Corporation | Self-orienting watermarks |
WO2001080169A1 (en) | 2000-04-17 | 2001-10-25 | Digimarc Corporation | Authentication of physical and electronic media objects using digital watermarks |
US6891959B2 (en) | 2000-04-19 | 2005-05-10 | Digimarc Corporation | Hiding information out-of-phase in color channels |
US8027509B2 (en) | 2000-04-19 | 2011-09-27 | Digimarc Corporation | Digital watermarking in data representing color channels |
US7738673B2 (en) * | 2000-04-19 | 2010-06-15 | Digimarc Corporation | Low visible digital watermarks |
US7305104B2 (en) * | 2000-04-21 | 2007-12-04 | Digimarc Corporation | Authentication of identification documents using digital watermarks |
US7111168B2 (en) * | 2000-05-01 | 2006-09-19 | Digimarc Corporation | Digital watermarking systems |
US7346184B1 (en) * | 2000-05-02 | 2008-03-18 | Digimarc Corporation | Processing methods combining multiple frames of image data |
US6572025B1 (en) * | 2000-05-10 | 2003-06-03 | Japan Gain The Summit Co., Ltd. | Information code product, manufacturing device and method for manufacturing the same, information code reading device, authentication system, authentication terminal, authentication server, and authentication method |
US7152047B1 (en) | 2000-05-24 | 2006-12-19 | Esecure.Biz, Inc. | System and method for production and authentication of original documents |
US7089420B1 (en) | 2000-05-24 | 2006-08-08 | Tracer Detection Technology Corp. | Authentication method and system |
US7162035B1 (en) | 2000-05-24 | 2007-01-09 | Tracer Detection Technology Corp. | Authentication method and system |
US7107453B2 (en) * | 2000-05-25 | 2006-09-12 | Hewlett-Packard Development Company, L.P. | Authenticatable graphical bar codes |
US6751352B1 (en) * | 2000-05-25 | 2004-06-15 | Hewlett-Packard Development Company, L.P. | Method and apparatus for generating and decoding a visually significant barcode |
US6612500B2 (en) * | 2000-06-12 | 2003-09-02 | Giesecke & Devrient America, Inc. | Separator card |
US6666377B1 (en) | 2000-07-18 | 2003-12-23 | Scott C. Harris | Bar code data entry device |
US7058199B1 (en) | 2000-08-14 | 2006-06-06 | The Hong Kong University Of Science And Technology | Methods and apparatus for hiding data in halftone images |
US7114660B1 (en) * | 2000-08-29 | 2006-10-03 | Eastman Kodak Company | Non-image pixel data stored on hard-copy image media |
US6674876B1 (en) * | 2000-09-14 | 2004-01-06 | Digimarc Corporation | Watermarking in the time-frequency domain |
US7127615B2 (en) | 2000-09-20 | 2006-10-24 | Blue Spike, Inc. | Security based on subliminal and supraliminal channels for data objects |
US6943830B1 (en) * | 2000-10-20 | 2005-09-13 | Silverbrook Research Pty Ltd | Printed card based user interface system |
US8594364B2 (en) * | 2000-11-02 | 2013-11-26 | Digimarc Corporation | Batch identifier registration and embedding in media signals |
DE10058638A1 (en) | 2000-11-25 | 2002-06-13 | Orga Kartensysteme Gmbh | Method for producing a data carrier and a data carrier |
US6938017B2 (en) * | 2000-12-01 | 2005-08-30 | Hewlett-Packard Development Company, L.P. | Scalable, fraud resistant graphical payment indicia |
US6690811B2 (en) | 2000-12-08 | 2004-02-10 | The Hong Kong University Of Science And Technology | Methods and apparatus for hiding data in halftone images |
AU2002235181A1 (en) * | 2000-12-15 | 2002-06-24 | United States Postal Service | Electronic postmarking without directly utilizing an electronic postmark server |
CA2432070A1 (en) * | 2000-12-18 | 2002-06-27 | United States Postal Service | Method of using personal signature as postage |
US6731409B2 (en) * | 2001-01-31 | 2004-05-04 | Xerox Corporation | System and method for generating color digital watermarks using conjugate halftone screens |
US20040078333A1 (en) * | 2001-02-09 | 2004-04-22 | David Hilton | Document printed with graphical symbols which encode information |
US20020158137A1 (en) * | 2001-04-30 | 2002-10-31 | William Grey | Systems and methods wherein a machine-readable item code is substantially invisible to a human |
US7502937B2 (en) | 2001-04-30 | 2009-03-10 | Digimarc Corporation | Digital watermarking security systems |
US8543823B2 (en) | 2001-04-30 | 2013-09-24 | Digimarc Corporation | Digital watermarking for identification documents |
US7958359B2 (en) | 2001-04-30 | 2011-06-07 | Digimarc Corporation | Access control systems |
US7111787B2 (en) | 2001-05-15 | 2006-09-26 | Hand Held Products, Inc. | Multimode image capturing and decoding optical reader |
US6942151B2 (en) | 2001-05-15 | 2005-09-13 | Welch Allyn Data Collection, Inc. | Optical reader having decoding and image capturing functionality |
US6358655B1 (en) | 2001-05-24 | 2002-03-19 | Xerox Corporation | Marking particles |
US6365312B1 (en) | 2001-05-24 | 2002-04-02 | Xerox Corporation | Marking particles |
US6814289B2 (en) * | 2001-05-30 | 2004-11-09 | Sandia Corporation | Self-registering spread-spectrum barcode method |
US6895116B2 (en) * | 2001-06-07 | 2005-05-17 | Hewlett-Packard Development Company, L.P. | Automatically extracting graphical bar codes |
US6742708B2 (en) | 2001-06-07 | 2004-06-01 | Hewlett-Packard Development Company, L.P. | Fiducial mark patterns for graphical bar codes |
US8094869B2 (en) | 2001-07-02 | 2012-01-10 | Digimarc Corporation | Fragile and emerging digital watermarks |
US6834807B2 (en) | 2001-07-13 | 2004-12-28 | Hand Held Products, Inc. | Optical reader having a color imager |
US20030048908A1 (en) * | 2001-08-31 | 2003-03-13 | Hamilton Jon W. | System and method for protecting the content of digital cinema products |
EP1454180B1 (en) * | 2001-11-09 | 2007-07-18 | International Barcode Corporation | System and method for embedding characters in a bar of a bar code |
US7207491B2 (en) * | 2001-11-09 | 2007-04-24 | International Barcode Corporation | System and method for generating a combined bar code image |
US7322514B2 (en) * | 2001-11-30 | 2008-01-29 | International Barcode Corporation | Method for identifying and authenticating goods using codes, barcodes and radio frequency identification |
EP1461760B1 (en) * | 2001-11-30 | 2009-08-19 | International Barcode Corporation | System and method for validating a digital image and corresponding data |
GB2399669B (en) * | 2001-12-07 | 2005-06-29 | Fracturecode Corp Aps | Method and apparatus for associating data with an article |
GB2407425B (en) * | 2001-12-07 | 2006-09-27 | Fracturecode Corp Aps | Method and apparatus for associating data with an article |
GB0129369D0 (en) * | 2001-12-07 | 2002-01-30 | Filtrona United Kingdom Ltd | Method and apparatus for marking articles |
PT1456810E (en) | 2001-12-18 | 2011-07-25 | L 1 Secure Credentialing Inc | Multiple image security features for identification documents and methods of making same |
EP1459246B1 (en) | 2001-12-24 | 2012-05-02 | L-1 Secure Credentialing, Inc. | Method for full color laser marking of id documents |
US7728048B2 (en) | 2002-12-20 | 2010-06-01 | L-1 Secure Credentialing, Inc. | Increasing thermal conductivity of host polymer used with laser engraving methods and compositions |
US7694887B2 (en) | 2001-12-24 | 2010-04-13 | L-1 Secure Credentialing, Inc. | Optically variable personalized indicia for identification documents |
WO2003055638A1 (en) | 2001-12-24 | 2003-07-10 | Digimarc Id Systems, Llc | Laser etched security features for identification documents and methods of making same |
EP1459239B1 (en) | 2001-12-24 | 2012-04-04 | L-1 Secure Credentialing, Inc. | Covert variable information on id documents and methods of making same |
US6808118B2 (en) * | 2001-12-31 | 2004-10-26 | Zebra Atlantek, Inc. | Security code verification for identification cards |
US7321667B2 (en) | 2002-01-18 | 2008-01-22 | Digimarc Corporation | Data hiding through arrangement of objects |
US7567721B2 (en) * | 2002-01-22 | 2009-07-28 | Digimarc Corporation | Digital watermarking of low bit rate video |
US20030145208A1 (en) * | 2002-01-25 | 2003-07-31 | Willins Bruce A. | System and method for improving integrity and authenticity of an article utilizing secure overlays |
US20030142358A1 (en) * | 2002-01-29 | 2003-07-31 | Bean Heather N. | Method and apparatus for automatic image capture device control |
EP1339016A1 (en) * | 2002-01-30 | 2003-08-27 | Khephren Sa | Digital data carrier |
US7152786B2 (en) * | 2002-02-12 | 2006-12-26 | Digimarc Corporation | Identification document including embedded data |
JP4011362B2 (en) * | 2002-02-15 | 2007-11-21 | 浩 近藤 | Passport forgery prevention information creation system, passport and forgery passport detection system |
WO2003088144A2 (en) | 2002-04-09 | 2003-10-23 | Digimarc Id Systems, Llc | Image processing techniques for printing identification cards and documents |
US7287275B2 (en) | 2002-04-17 | 2007-10-23 | Moskowitz Scott A | Methods, systems and devices for packet watermarking and efficient provisioning of bandwidth |
US7824029B2 (en) | 2002-05-10 | 2010-11-02 | L-1 Secure Credentialing, Inc. | Identification card printer-assembler for over the counter card issuing |
WO2003098540A1 (en) | 2002-05-14 | 2003-11-27 | Mediasec Technologies, Gmbh | Visible authentication patterns for printed document |
US7708189B1 (en) | 2002-05-17 | 2010-05-04 | Cipriano Joseph J | Identification verification system and method |
US7519819B2 (en) * | 2002-05-29 | 2009-04-14 | Digimarc Corporatino | Layered security in digital watermarking |
US7974495B2 (en) * | 2002-06-10 | 2011-07-05 | Digimarc Corporation | Identification and protection of video |
US8108322B2 (en) | 2002-07-29 | 2012-01-31 | United States Postal Services | PC postage™ service indicia design for shipping label |
US7577841B2 (en) | 2002-08-15 | 2009-08-18 | Digimarc Corporation | Watermark placement in watermarking of time varying media signals |
JP2005537571A (en) * | 2002-08-29 | 2005-12-08 | ユナイテッド ステイツ ポスタル サービス | System and method for reevaluating postage of mail being processed |
US8171567B1 (en) | 2002-09-04 | 2012-05-01 | Tracer Detection Technology Corp. | Authentication method and system |
US7028902B2 (en) * | 2002-10-03 | 2006-04-18 | Hewlett-Packard Development Company, L.P. | Barcode having enhanced visual quality and systems and methods thereof |
AU2003285891A1 (en) | 2002-10-15 | 2004-05-04 | Digimarc Corporation | Identification document and related methods |
JP4052190B2 (en) * | 2002-10-29 | 2008-02-27 | 株式会社デンソー | Two-dimensional code formation structure |
US7116840B2 (en) | 2002-10-31 | 2006-10-03 | Microsoft Corporation | Decoding and error correction in 2-D arrays |
US7133563B2 (en) | 2002-10-31 | 2006-11-07 | Microsoft Corporation | Passive embedded interaction code |
US7804982B2 (en) | 2002-11-26 | 2010-09-28 | L-1 Secure Credentialing, Inc. | Systems and methods for managing and detecting fraud in image databases used with identification documents |
US7712673B2 (en) | 2002-12-18 | 2010-05-11 | L-L Secure Credentialing, Inc. | Identification document with three dimensional image of bearer |
KR20050103977A (en) * | 2003-03-06 | 2005-11-01 | 디지맥 코포레이션 | Camera and digital watermarking systems and methods |
US7763179B2 (en) | 2003-03-21 | 2010-07-27 | Digimarc Corporation | Color laser engraving and digital watermarking |
DE602004030434D1 (en) | 2003-04-16 | 2011-01-20 | L 1 Secure Credentialing Inc | THREE-DIMENSIONAL DATA STORAGE |
US7637430B2 (en) * | 2003-05-12 | 2009-12-29 | Hand Held Products, Inc. | Picture taking optical reader |
US20040258280A1 (en) * | 2003-06-23 | 2004-12-23 | Canadian Bank Note Company, Ltd. | Optical document authentication system |
WO2005010684A2 (en) * | 2003-07-17 | 2005-02-03 | Digimarc Corporation | Uniquely linking security elements in identification documents |
US7191934B2 (en) * | 2003-07-21 | 2007-03-20 | Salamander Technologies, Inc. | Technique for creating incident-specific credentials at the scene of a large-scale incident or WMD event |
US7328847B1 (en) * | 2003-07-30 | 2008-02-12 | Hewlett-Packard Development Company, L.P. | Barcode data communication methods, barcode embedding methods, and barcode systems |
US20050063562A1 (en) * | 2003-08-07 | 2005-03-24 | Brunk Hugh L. | Conveying fingerprint minutiae with digital watermarks |
SK10072003A3 (en) * | 2003-08-08 | 2005-03-04 | Dušan Kočiš | Data channel of the background on paper carrier or other carrier |
US20050052706A1 (en) * | 2003-09-10 | 2005-03-10 | Nelson Terry M. | Location patterns and methods and apparatus for generating such patterns |
US20050052707A1 (en) * | 2003-09-10 | 2005-03-10 | Nelson Terry M. | Location patterns and methods and apparatus for generating such patterns |
US20050052700A1 (en) * | 2003-09-10 | 2005-03-10 | Andrew Mackenzie | Printing digital documents |
US6962450B2 (en) * | 2003-09-10 | 2005-11-08 | Hewlett-Packard Development Company L.P. | Methods and apparatus for generating images |
US8438395B2 (en) * | 2003-09-18 | 2013-05-07 | Digimarc Corporation | Digitally watermarking documents associated with vehicles |
US20050071656A1 (en) * | 2003-09-25 | 2005-03-31 | Klein Dean A. | Secure processor-based system and method |
US7706565B2 (en) * | 2003-09-30 | 2010-04-27 | Digimarc Corporation | Multi-channel digital watermarking |
EP1689585A1 (en) * | 2003-10-27 | 2006-08-16 | Veritec, Inc. | Laminated cards and methods of manufacture for secure applications |
US8363282B2 (en) * | 2003-10-31 | 2013-01-29 | Hewlett-Packard Development Company, L.P. | Halftone screening and bitmap based encoding of information in images |
US7364081B2 (en) * | 2003-12-02 | 2008-04-29 | Hand Held Products, Inc. | Method and apparatus for reading under sampled bar code symbols |
BRPI0417392A (en) * | 2003-12-08 | 2007-04-17 | Int Barcode Corp | method for identifying and authenticating goods using code identification, bar codes and radio frequency |
US20050132194A1 (en) * | 2003-12-12 | 2005-06-16 | Ward Jean R. | Protection of identification documents using open cryptography |
US7583842B2 (en) * | 2004-01-06 | 2009-09-01 | Microsoft Corporation | Enhanced approach of m-array decoding and error correction |
US7263224B2 (en) | 2004-01-16 | 2007-08-28 | Microsoft Corporation | Strokes localization by m-array decoding and fast image matching |
US7497379B2 (en) | 2004-02-27 | 2009-03-03 | Microsoft Corporation | Counterfeit and tamper resistant labels with randomly occurring features |
US7744002B2 (en) | 2004-03-11 | 2010-06-29 | L-1 Secure Credentialing, Inc. | Tamper evident adhesive and identification document including same |
US8127137B2 (en) | 2004-03-18 | 2012-02-28 | Digimarc Corporation | Watermark payload encryption for media including multiple watermarks |
US7336806B2 (en) * | 2004-03-22 | 2008-02-26 | Microsoft Corporation | Iris-based biometric identification |
TW200613813A (en) * | 2004-05-05 | 2006-05-01 | Koninkl Philips Electronics Nv | Display device |
US7410750B2 (en) * | 2004-06-30 | 2008-08-12 | Xerox Corporation | Multicolored photochromic display |
US8140848B2 (en) | 2004-07-01 | 2012-03-20 | Digimarc Corporation | Digital watermark key generation |
US8891811B2 (en) | 2004-09-17 | 2014-11-18 | Digimarc Corporation | Hierarchical watermark detector |
US7293712B2 (en) | 2004-10-05 | 2007-11-13 | Hand Held Products, Inc. | System and method to automatically discriminate between a signature and a dataform |
JP4231946B2 (en) * | 2004-10-15 | 2009-03-04 | 健治 吉田 | Print structure on the media surface printed with dot patterns |
US7011245B1 (en) * | 2004-11-05 | 2006-03-14 | Michael Hu | Pedigree code enabling authentification through computer generated unbroken chain reflective coding including transaction party data |
JP2006130801A (en) * | 2004-11-08 | 2006-05-25 | Seiko Instruments Inc | Printer, printing method and printing program |
US7860318B2 (en) | 2004-11-09 | 2010-12-28 | Intelli-Check, Inc | System and method for comparing documents |
WO2006053685A2 (en) * | 2004-11-18 | 2006-05-26 | Giesecke & Devrient Gmbh | Value documents production and checking of value documents |
US8209267B2 (en) * | 2004-12-08 | 2012-06-26 | Lockheed Martin Corporation | Automatic revenue protection and adjustment of postal indicia products |
US7937332B2 (en) * | 2004-12-08 | 2011-05-03 | Lockheed Martin Corporation | Automatic verification of postal indicia products |
US8005764B2 (en) | 2004-12-08 | 2011-08-23 | Lockheed Martin Corporation | Automatic verification of postal indicia products |
SE528368C2 (en) * | 2005-02-02 | 2006-10-31 | Axtronic Ab | Registration control system and procedure |
US7607076B2 (en) | 2005-02-18 | 2009-10-20 | Microsoft Corporation | Embedded interaction code document |
US7826074B1 (en) | 2005-02-25 | 2010-11-02 | Microsoft Corporation | Fast embedded interaction code printing with custom postscript commands |
US7568628B2 (en) | 2005-03-11 | 2009-08-04 | Hand Held Products, Inc. | Bar code reading device with global electronic shutter control |
US7780089B2 (en) | 2005-06-03 | 2010-08-24 | Hand Held Products, Inc. | Digital picture taking optical reader having hybrid monochrome and color image sensor array |
US7611060B2 (en) | 2005-03-11 | 2009-11-03 | Hand Held Products, Inc. | System and method to automatically focus an image reader |
JP2006302050A (en) * | 2005-04-21 | 2006-11-02 | Main:Kk | Two-dimensional bar code |
US7599560B2 (en) | 2005-04-22 | 2009-10-06 | Microsoft Corporation | Embedded interaction code recognition |
US7421439B2 (en) | 2005-04-22 | 2008-09-02 | Microsoft Corporation | Global metadata embedding and decoding |
US7400777B2 (en) | 2005-05-25 | 2008-07-15 | Microsoft Corporation | Preprocessing for information pattern analysis |
US7729539B2 (en) | 2005-05-31 | 2010-06-01 | Microsoft Corporation | Fast error-correcting of embedded interaction codes |
US7580576B2 (en) | 2005-06-02 | 2009-08-25 | Microsoft Corporation | Stroke localization and binding to electronic document |
US7770799B2 (en) | 2005-06-03 | 2010-08-10 | Hand Held Products, Inc. | Optical reader having reduced specular reflection read failures |
US7619607B2 (en) | 2005-06-30 | 2009-11-17 | Microsoft Corporation | Embedding a pattern design onto a liquid crystal display |
US7427025B2 (en) * | 2005-07-08 | 2008-09-23 | Lockheed Marlin Corp. | Automated postal voting system and method |
JP2009504026A (en) * | 2005-07-27 | 2009-01-29 | ダグ カーソン アンド アソシエーツ,インク. | Verification history data associated with digital content |
US7622182B2 (en) | 2005-08-17 | 2009-11-24 | Microsoft Corporation | Embedded interaction code enabled display |
US7817816B2 (en) | 2005-08-17 | 2010-10-19 | Microsoft Corporation | Embedded interaction code enabled surface type identification |
US7540430B2 (en) * | 2005-09-27 | 2009-06-02 | The Boeing Company | System and method for string distance measurement for alphanumeric indicia |
KR100746641B1 (en) * | 2005-11-11 | 2007-08-06 | 주식회사 칼라짚미디어 | Image code based on moving picture, apparatus for generating/decoding image code based on moving picture and method therefor |
US7792522B1 (en) | 2006-01-13 | 2010-09-07 | Positive Access Corporation | Software key control for mobile devices |
JP3953501B1 (en) | 2006-03-03 | 2007-08-08 | 株式会社バンダイナムコゲームス | Program, information storage medium, two-dimensional code generation system, image generation system, and two-dimensional code |
CN101063999B (en) * | 2006-04-29 | 2010-09-15 | 银河联动信息技术(北京)有限公司 | Synthesis system and method of two-dimension code and sign |
JP4873623B2 (en) * | 2006-07-28 | 2012-02-08 | Kddi株式会社 | Method and apparatus for embedding barcode in color image, and computer program |
US8056821B2 (en) | 2006-10-18 | 2011-11-15 | Xerox Corporation | Security marks simulating natural defects for embedding information in documents |
FR2908203B1 (en) * | 2006-11-03 | 2009-04-24 | Suanez Patricia Etienne | METHODS AND DEVICES FOR AUTHENTICATING A PRODUCT AND A BIDIMENSIONAL CODE AND NEW APPLICATION OF A BIDIMENSIONAL CODE. |
US7950581B2 (en) * | 2006-12-01 | 2011-05-31 | Intermec Ip Corp. | System and method of acquiring a machine-readable symbol |
US8027096B2 (en) | 2006-12-15 | 2011-09-27 | Hand Held Products, Inc. | Focus module and components with actuator polymer control |
US7813047B2 (en) | 2006-12-15 | 2010-10-12 | Hand Held Products, Inc. | Apparatus and method comprising deformable lens element |
WO2008111054A2 (en) * | 2007-03-12 | 2008-09-18 | In-Dot Ltd. | A reader device having various functionalities |
DE102007018903A1 (en) * | 2007-04-19 | 2008-10-23 | Deutsche Post Ag | Method for detecting a machine-readable code applied to a mailpiece, device for carrying out the method, mailpiece and method for providing the mailpiece with a machine-readable code |
AT505138A1 (en) * | 2007-04-26 | 2008-11-15 | Moorecroft Llp | METHOD FOR PROVIDING DATA FOR DISPLAY ON MOBILE DISPLAY DEVICES AND DATA CARRIER FOR USE WITH SUCH A METHOD |
US20090060343A1 (en) * | 2007-08-30 | 2009-03-05 | Andrew Rosca | Method for partially obscuring content of documents and images |
KR100865467B1 (en) * | 2007-12-11 | 2008-10-27 | 송호섭 | An advertisement method using barcode shape |
AU2007254661A1 (en) * | 2007-12-24 | 2009-07-09 | Canon Kabushiki Kaisha | Printing and authentication of a security document on a substrate |
US8313029B2 (en) * | 2008-01-31 | 2012-11-20 | Seiko Epson Corporation | Apparatus and methods for decoding images |
US7995196B1 (en) | 2008-04-23 | 2011-08-09 | Tracer Detection Technology Corp. | Authentication method and system |
KR20100009952A (en) * | 2008-07-21 | 2010-01-29 | 삼성에스디아이 주식회사 | Method for driving plasma display panel, and plasma display apparatus adopting the method |
US8085980B2 (en) * | 2008-08-13 | 2011-12-27 | Lockheed Martin Corporation | Mail piece identification using bin independent attributes |
US20100100233A1 (en) * | 2008-10-22 | 2010-04-22 | Lockheed Martin Corporation | Universal intelligent postal identification code |
US9117268B2 (en) * | 2008-12-17 | 2015-08-25 | Digimarc Corporation | Out of phase digital watermarking in two chrominance directions |
US8199969B2 (en) | 2008-12-17 | 2012-06-12 | Digimarc Corporation | Out of phase digital watermarking in two chrominance directions |
US8305691B2 (en) * | 2009-04-29 | 2012-11-06 | Hand Held Products, Inc. | Fluid lens element for use in changing thermal operating environment |
JP5379626B2 (en) * | 2009-09-29 | 2013-12-25 | 日本電産サンキョー株式会社 | Stack bar code information reading method and stack bar code information reading device |
GB2477951B (en) * | 2010-02-19 | 2013-04-10 | Innovia Films Sarl | Article tracking method |
US8381984B2 (en) | 2010-03-31 | 2013-02-26 | Hand Held Products, Inc. | System operative for processing frame having representation of substrate |
US9104934B2 (en) | 2010-03-31 | 2015-08-11 | Hand Held Products, Inc. | Document decoding system and method for improved decoding performance of indicia reading terminal |
US9298964B2 (en) | 2010-03-31 | 2016-03-29 | Hand Held Products, Inc. | Imaging terminal, imaging sensor to determine document orientation based on bar code orientation and methods for operating the same |
US8600167B2 (en) | 2010-05-21 | 2013-12-03 | Hand Held Products, Inc. | System for capturing a document in an image signal |
US9047531B2 (en) | 2010-05-21 | 2015-06-02 | Hand Held Products, Inc. | Interactive user interface for capturing a document in an image signal |
US8366002B2 (en) | 2010-05-26 | 2013-02-05 | Hand Held Products, Inc. | Solid elastic lens element and method of making same |
US8657200B2 (en) | 2011-06-20 | 2014-02-25 | Metrologic Instruments, Inc. | Indicia reading terminal with color frame processing |
JP2013025782A (en) * | 2011-07-25 | 2013-02-04 | Koji Sakahashi | Computer for outputting two-dimensional code and program to be executed by the same computer |
US10474858B2 (en) | 2011-08-30 | 2019-11-12 | Digimarc Corporation | Methods of identifying barcoded items by evaluating multiple identification hypotheses, based on data from sensors including inventory sensors and ceiling-mounted cameras |
US8629926B2 (en) | 2011-11-04 | 2014-01-14 | Honeywell International, Inc. | Imaging apparatus comprising image sensor array having shared global shutter circuitry |
US9076140B2 (en) * | 2012-06-26 | 2015-07-07 | Wal-Mart Stores, Inc. | Image embedding apparatus and method |
WO2014145193A1 (en) * | 2013-03-15 | 2014-09-18 | Nexref Technologies, Llc | Marker-based augmented reality (ar) display with inventory management |
JP6095194B2 (en) * | 2013-03-28 | 2017-03-15 | 日本電産サンキョー株式会社 | Stack bar code reading apparatus and stack bar code reading method |
JP6167956B2 (en) * | 2013-09-20 | 2017-07-26 | 株式会社デンソーウェーブ | Information code generation method, information code, information code reader, and information code utilization system |
JP6277880B2 (en) * | 2014-06-19 | 2018-02-14 | 株式会社デンソーウェーブ | Information code medium and information code utilization system |
US10373409B2 (en) | 2014-10-31 | 2019-08-06 | Intellicheck, Inc. | Identification scan in compliance with jurisdictional or other rules |
CN106250833B (en) * | 2016-07-22 | 2019-11-19 | 深圳棒棒帮科技有限公司 | The recognition methods of the generation method of micrographics group for information MAP and micro- figure group |
US10936837B1 (en) * | 2018-05-23 | 2021-03-02 | Amazon Technologies, Inc. | 2D barcode overlays |
US11543939B2 (en) | 2020-06-08 | 2023-01-03 | Snap Inc. | Encoded image based messaging system |
CN112651475B (en) * | 2021-01-06 | 2022-09-23 | 北京字节跳动网络技术有限公司 | Two-dimensional code display method, device, equipment and medium |
CN113657133B (en) * | 2021-08-24 | 2023-12-12 | 凌云光技术股份有限公司 | Correction method and device for two-dimensional code extraction information |
Family Cites Families (39)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3621589A (en) * | 1968-12-03 | 1971-11-23 | Harry S Jones | Indicia coding and decoding apparatus |
US3636317A (en) * | 1969-04-28 | 1972-01-18 | Charecogn Systems Inc | Machine readable code track |
US3676644A (en) * | 1970-03-05 | 1972-07-11 | Columbia Controls Research Cor | Coded document and system for automatically reading same |
US3647275A (en) * | 1970-09-09 | 1972-03-07 | Optronics International | Identification system using reference beam coded holograms |
US3761683A (en) * | 1971-11-08 | 1973-09-25 | S Rogers | Security system |
US3812328A (en) * | 1972-05-31 | 1974-05-21 | Pitney Bowes Inc | Credit card |
US3836754A (en) * | 1972-09-18 | 1974-09-17 | F Toye | Coded card employing differential translucencies |
US4141078A (en) * | 1975-10-14 | 1979-02-20 | Innovated Systems, Inc. | Library circulation control system |
US4568936A (en) * | 1980-06-23 | 1986-02-04 | Light Signatures, Inc. | Verification system for document substance and content |
US4318090A (en) * | 1980-10-27 | 1982-03-02 | Sensormatic Electronics Corporation | Apparatus for deactivating a surveillance tag |
WO1982004149A1 (en) * | 1981-05-20 | 1982-11-25 | Pratt David E | Method and apparatus for making a security card and a security card made thereby |
JPS5924465A (en) * | 1982-07-30 | 1984-02-08 | Hitachi Ltd | Controller of variable speed reproduction of magnetic video recording and reproducing device |
JPS5944157A (en) * | 1982-09-06 | 1984-03-12 | Nippon Telegr & Teleph Corp <Ntt> | Dialless telephone system using facsimile device |
JPS59125162A (en) * | 1982-12-29 | 1984-07-19 | Fuji Photo Film Co Ltd | Method and device for facsimile incoming information |
US4908873A (en) * | 1983-05-13 | 1990-03-13 | Philibert Alex C | Document reproduction security system |
SE463897B (en) * | 1983-07-01 | 1991-02-04 | Esselte Security Syst Ab | PROCEDURE PROVIDES TO SAY SIMPLE CODES |
US4660221A (en) * | 1983-07-18 | 1987-04-21 | Pitney Bowes Inc. | System for printing encrypted messages with bar-code representation |
US4583083A (en) * | 1984-06-28 | 1986-04-15 | Bogasky John J | Checkout station to reduce retail theft |
US4654793A (en) * | 1984-10-15 | 1987-03-31 | Showdata, Inc. | System and method for registering and keeping track of the activities of attendees at a trade show, convention or the like |
US4689477A (en) * | 1984-12-31 | 1987-08-25 | Light Signatures, Inc. | Verification system for document substance and content |
US4835713A (en) * | 1985-08-06 | 1989-05-30 | Pitney Bowes Inc. | Postage meter with coded graphic information in the indicia |
JPS6291075A (en) * | 1985-10-17 | 1987-04-25 | Omron Tateisi Electronics Co | Facsimile equipment |
US4658126A (en) * | 1985-11-10 | 1987-04-14 | May Joseph A | Check identification system |
GB2198390A (en) * | 1986-02-05 | 1988-06-15 | Michael Ivor Ogle | The use of personal identification on cheques, cheque cards etc |
JPS62184596A (en) * | 1986-02-10 | 1987-08-12 | オムロン株式会社 | Electronic type cash register |
DE3617319A1 (en) * | 1986-05-23 | 1987-11-26 | Glory Kogyo Kk | CONFIRMATION IDENTIFICATION MEDIUM |
US4794239A (en) * | 1987-10-13 | 1988-12-27 | Intermec Corporation | Multitrack bar code and associated decoding method |
GB8804689D0 (en) * | 1988-02-29 | 1988-03-30 | Alcatel Business Systems | Franking system |
US4939354A (en) * | 1988-05-05 | 1990-07-03 | Datacode International, Inc. | Dynamically variable machine readable binary code and method for reading and producing thereof |
US4868375A (en) * | 1988-08-22 | 1989-09-19 | Ncr Corporation | Method for changing the functions of a bar code reader |
US4945218A (en) * | 1988-09-06 | 1990-07-31 | Talbott Alex F | Mailing device and machine-readable business card |
US4949381A (en) * | 1988-09-19 | 1990-08-14 | Pitney Bowes Inc. | Electronic indicia in bit-mapped form |
US5025399A (en) * | 1988-09-23 | 1991-06-18 | Datacard Corporation | Method and apparatus for personalizing plastic cards |
JPH02141889A (en) * | 1988-11-22 | 1990-05-31 | Eastman Kodatsuku Japan Kk | Bar-code reading method |
US5304786A (en) * | 1990-01-05 | 1994-04-19 | Symbol Technologies, Inc. | High density two-dimensional bar code symbol |
US4893333A (en) * | 1989-03-14 | 1990-01-09 | Paul Baran | Interactive facsimile system and method of information retrieval |
US4972476A (en) * | 1989-05-11 | 1990-11-20 | Nathans Robert L | Counterfeit proof ID card having a scrambled facial image |
US5070504A (en) * | 1989-06-23 | 1991-12-03 | International Business Machines | Method and apparatus for providing error correction to symbol level codes |
US4975948A (en) * | 1989-10-13 | 1990-12-04 | Andresen Dennis R | Rapid dialing method for telecommunications |
-
1992
- 1992-06-01 US US07891742 patent/US5337361C1/en not_active Expired - Lifetime
-
1993
- 1993-04-30 KR KR1019930007469A patent/KR930022236A/en not_active Application Discontinuation
- 1993-05-19 CN CN93105757A patent/CN1035642C/en not_active Expired - Lifetime
- 1993-05-31 CA CA002097359A patent/CA2097359C/en not_active Expired - Lifetime
- 1993-06-01 JP JP5130633A patent/JPH06199078A/en active Pending
- 1993-06-01 ES ES93108816T patent/ES2159284T3/en not_active Expired - Lifetime
- 1993-06-01 AT AT93108816T patent/ATE204398T1/en active
- 1993-06-01 EP EP93108816A patent/EP0572989B1/en not_active Expired - Lifetime
- 1993-06-01 DE DE69330582T patent/DE69330582T2/en not_active Expired - Lifetime
- 1993-11-17 TW TW082109611A patent/TW241355B/zh active
-
1994
- 1994-05-20 US US08246786 patent/US5471533B1/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
ATE204398T1 (en) | 2001-09-15 |
DE69330582T2 (en) | 2001-11-29 |
JPH06199078A (en) | 1994-07-19 |
DE69330582D1 (en) | 2001-09-20 |
ES2159284T3 (en) | 2001-10-01 |
KR930022236A (en) | 1993-11-23 |
CA2097359A1 (en) | 1993-12-02 |
EP0572989A2 (en) | 1993-12-08 |
TW241355B (en) | 1995-02-21 |
CN1035642C (en) | 1997-08-13 |
EP0572989A3 (en) | 1994-03-02 |
US5337361A (en) | 1994-08-09 |
EP0572989B1 (en) | 2001-08-16 |
CN1087191A (en) | 1994-05-25 |
US5337361C1 (en) | 2001-05-15 |
US5471533B1 (en) | 2000-04-18 |
US5471533A (en) | 1995-11-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2097359C (en) | Record with encoded data | |
US5880453A (en) | Reader system for removable two dimensional code | |
US5243655A (en) | System for encoding and decoding data in machine readable graphic form | |
US7198194B2 (en) | Two-dimensional code having superior decoding properties making it possible to control the level of error correcting codes, and a method for encoding and decoding the same | |
EP0721630B1 (en) | Packet bar code encoding and decoding | |
CA2192008C (en) | Clock free two-dimensional barcode and method for printing and reading the same | |
US5113445A (en) | System for encoding data in machine readable graphic form | |
EP1016027B1 (en) | Distortion resistant double-data correcting color transition barcode and method of generating and using same | |
KR930012137B1 (en) | Reading apparatus of dynamically variable machine readable binary code and deciding apparatus of size and density of binary code | |
US5159635A (en) | System for encoding data in machine readable graphic form | |
US5710419A (en) | Record with removable two-dimensional code | |
US5821519A (en) | Bar code scan stitching | |
CN101512561A (en) | Bar code authentication | |
KR20010014553A (en) | Method of reading barcode and barcode reading system | |
KR100919818B1 (en) | Method of encoding divided two-dimensional barcodes for mobile communication terminal | |
EP0575989A2 (en) | Record with removable two-dimensional code | |
US20060289661A1 (en) | Bi-directional readable two-dimensional bar code system and its reading method | |
CA2448709C (en) | Record with encoded data | |
US6761314B2 (en) | Bar code symbology for consumer scanning applications | |
AU655800B2 (en) | Systems for encoding and decoding data in machine readable graphic form | |
EA002213B1 (en) | Method for identifying an image or a document | |
CA2063103A1 (en) | Systems for encoding and decoding data in machine readable graphic form | |
JPH05290204A (en) | Method and device for encoding data to mechanically readable graphic shape and decoding this shape | |
US20060119898A1 (en) | Methods for providing encoded visual borders on a scannable document | |
IL104209A (en) | Systems for encoding and decoding data in machine readable graphic form |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request |