US20050150963A1 - Data storage device incorporating a two-dimensional code - Google Patents
Data storage device incorporating a two-dimensional code Download PDFInfo
- Publication number
- US20050150963A1 US20050150963A1 US10/962,404 US96240404A US2005150963A1 US 20050150963 A1 US20050150963 A1 US 20050150963A1 US 96240404 A US96240404 A US 96240404A US 2005150963 A1 US2005150963 A1 US 2005150963A1
- Authority
- US
- United States
- Prior art keywords
- data
- pixel
- column
- dot
- target
- 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.)
- Abandoned
Links
- 238000013500 data storage Methods 0.000 title claims abstract description 12
- 238000012545 processing Methods 0.000 claims abstract description 46
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 30
- 229920003023 plastic Polymers 0.000 claims description 10
- 239000004033 plastic Substances 0.000 claims description 9
- 238000012937 correction Methods 0.000 claims description 8
- 239000000463 material Substances 0.000 claims description 5
- 230000000007 visual effect Effects 0.000 claims description 4
- 238000000034 method Methods 0.000 description 166
- 230000008569 process Effects 0.000 description 148
- 239000000976 ink Substances 0.000 description 49
- 230000006870 function Effects 0.000 description 22
- 230000000694 effects Effects 0.000 description 19
- 238000001514 detection method Methods 0.000 description 18
- 238000003860 storage Methods 0.000 description 18
- 238000013515 script Methods 0.000 description 17
- 238000003780 insertion Methods 0.000 description 15
- 230000037431 insertion Effects 0.000 description 15
- 238000007639 printing Methods 0.000 description 15
- FFBHFFJDDLITSX-UHFFFAOYSA-N benzyl N-[2-hydroxy-4-(3-oxomorpholin-4-yl)phenyl]carbamate Chemical compound OC1=C(NC(=O)OCC2=CC=CC=C2)C=CC(=C1)N1CCOCC1=O FFBHFFJDDLITSX-UHFFFAOYSA-N 0.000 description 14
- 239000000872 buffer Substances 0.000 description 13
- 238000009826 distribution Methods 0.000 description 13
- 230000007246 mechanism Effects 0.000 description 13
- 239000010408 film Substances 0.000 description 12
- 238000005070 sampling Methods 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 11
- 230000008859 change Effects 0.000 description 10
- 238000000605 extraction Methods 0.000 description 7
- 238000013507 mapping Methods 0.000 description 7
- 238000011084 recovery Methods 0.000 description 6
- 239000000758 substrate Substances 0.000 description 6
- 230000009471 action Effects 0.000 description 5
- 230000001174 ascending effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 5
- 238000011065 in-situ storage Methods 0.000 description 5
- 239000010410 layer Substances 0.000 description 5
- 238000004519 manufacturing process Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- NCGICGYLBXGBGN-UHFFFAOYSA-N 3-morpholin-4-yl-1-oxa-3-azonia-2-azanidacyclopent-3-en-5-imine;hydrochloride Chemical compound Cl.[N-]1OC(=N)C=[N+]1N1CCOCC1 NCGICGYLBXGBGN-UHFFFAOYSA-N 0.000 description 3
- 238000012952 Resampling Methods 0.000 description 3
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 3
- 239000013078 crystal Substances 0.000 description 3
- 238000013075 data extraction Methods 0.000 description 3
- 230000001419 dependent effect Effects 0.000 description 3
- 239000004744 fabric Substances 0.000 description 3
- 230000033001 locomotion Effects 0.000 description 3
- 238000003825 pressing Methods 0.000 description 3
- 229910052710 silicon Inorganic materials 0.000 description 3
- 239000010703 silicon Substances 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000007792 addition Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 2
- 238000006731 degradation reaction Methods 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 239000011888 foil Substances 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000001575 pathological effect Effects 0.000 description 2
- 239000002985 plastic film Substances 0.000 description 2
- 239000010453 quartz Substances 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- VYPSYNLAJGMNEJ-UHFFFAOYSA-N silicon dioxide Inorganic materials O=[Si]=O VYPSYNLAJGMNEJ-UHFFFAOYSA-N 0.000 description 2
- 238000013519 translation Methods 0.000 description 2
- 101150048848 ART10 gene Proteins 0.000 description 1
- 102100041023 Coronin-2A Human genes 0.000 description 1
- 239000004593 Epoxy Substances 0.000 description 1
- 101000748858 Homo sapiens Coronin-2A Proteins 0.000 description 1
- 101001106523 Homo sapiens Regulator of G-protein signaling 1 Proteins 0.000 description 1
- 229920000134 Metallised film Polymers 0.000 description 1
- 206010030312 On and off phenomenon Diseases 0.000 description 1
- 208000002193 Pain Diseases 0.000 description 1
- 102100021269 Regulator of G-protein signaling 1 Human genes 0.000 description 1
- 230000004913 activation Effects 0.000 description 1
- 238000004026 adhesive bonding Methods 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 229910052782 aluminium Inorganic materials 0.000 description 1
- XAGFODPZIPBFFR-UHFFFAOYSA-N aluminium Chemical compound [Al] XAGFODPZIPBFFR-UHFFFAOYSA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000013474 audit trail Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000740 bleeding effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000000994 depressogenic effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000003708 edge detection Methods 0.000 description 1
- 230000008030 elimination Effects 0.000 description 1
- 238000003379 elimination reaction Methods 0.000 description 1
- 239000012530 fluid Substances 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 238000005286 illumination Methods 0.000 description 1
- 238000010348 incorporation Methods 0.000 description 1
- 238000007373 indentation Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 230000013011 mating Effects 0.000 description 1
- 229910052751 metal Inorganic materials 0.000 description 1
- 239000002184 metal Substances 0.000 description 1
- 239000011104 metalized film Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000002991 molded plastic Substances 0.000 description 1
- 238000010422 painting Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 229920006255 plastic film Polymers 0.000 description 1
- 229920000642 polymer Polymers 0.000 description 1
- 239000011241 protective layer Substances 0.000 description 1
- 230000005855 radiation Effects 0.000 description 1
- 230000008521 reorganization Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000007789 sealing Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/14—Structure thereof only for on-demand ink jet heads
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J15/00—Devices or arrangements of selective printing mechanisms, e.g. ink-jet printers or thermal printers, specially adapted for supporting or handling copy material in continuous form, e.g. webs
- B41J15/04—Supporting, feeding, or guiding devices; Mountings for web rolls or spindles
- B41J15/044—Cassettes or cartridges containing continuous copy material, tape, for setting into printing devices
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/14—Structure thereof only for on-demand ink jet heads
- B41J2/14314—Structure of ink jet print heads with electrostatically actuated membrane
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/14—Structure thereof only for on-demand ink jet heads
- B41J2/14427—Structure of ink jet print heads with thermal bend detached actuators
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1601—Production of bubble jet print heads
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1623—Manufacturing processes bonding and adhesion
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1626—Manufacturing processes etching
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1626—Manufacturing processes etching
- B41J2/1628—Manufacturing processes etching dry etching
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1626—Manufacturing processes etching
- B41J2/1629—Manufacturing processes etching wet etching
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1631—Manufacturing processes photolithography
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1632—Manufacturing processes machining
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1635—Manufacturing processes dividing the wafer into individual chips
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1637—Manufacturing processes molding
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/1637—Manufacturing processes molding
- B41J2/1639—Manufacturing processes molding sacrificial molding
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/164—Manufacturing processes thin film formation
- B41J2/1642—Manufacturing processes thin film formation thin film formation by CVD [chemical vapor deposition]
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/164—Manufacturing processes thin film formation
- B41J2/1643—Manufacturing processes thin film formation thin film formation by plating
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/164—Manufacturing processes thin film formation
- B41J2/1645—Manufacturing processes thin film formation thin film formation by spincoating
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1621—Manufacturing processes
- B41J2/164—Manufacturing processes thin film formation
- B41J2/1646—Manufacturing processes thin film formation thin film formation by sputtering
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/16—Production of nozzles
- B41J2/1648—Production of print heads with thermal bend detached actuators
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/17—Ink jet characterised by ink handling
- B41J2/175—Ink supply systems ; Circuit parts therefor
- B41J2/17503—Ink cartridges
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/17—Ink jet characterised by ink handling
- B41J2/175—Ink supply systems ; Circuit parts therefor
- B41J2/17503—Ink cartridges
- B41J2/17513—Inner structure
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/17—Ink jet characterised by ink handling
- B41J2/175—Ink supply systems ; Circuit parts therefor
- B41J2/17596—Ink pumps, ink valves
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J29/00—Details of, or accessories for, typewriters or selective printing mechanisms not otherwise provided for
- B41J29/02—Framework
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J29/00—Details of, or accessories for, typewriters or selective printing mechanisms not otherwise provided for
- B41J29/12—Guards, shields or dust excluders
- B41J29/13—Cases or covers
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J3/00—Typewriters or selective printing or marking mechanisms characterised by the purpose for which they are constructed
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B82—NANOTECHNOLOGY
- B82Y—SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES
- B82Y30/00—Nanotechnology for materials or surface science, e.g. nanocomposites
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03B—APPARATUS OR ARRANGEMENTS FOR TAKING PHOTOGRAPHS OR FOR PROJECTING OR VIEWING THEM; APPARATUS OR ARRANGEMENTS EMPLOYING ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ACCESSORIES THEREFOR
- G03B17/00—Details of cameras or camera bodies; Accessories therefor
- G03B17/02—Bodies
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03B—APPARATUS OR ARRANGEMENTS FOR TAKING PHOTOGRAPHS OR FOR PROJECTING OR VIEWING THEM; APPARATUS OR ARRANGEMENTS EMPLOYING ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ACCESSORIES THEREFOR
- G03B17/00—Details of cameras or camera bodies; Accessories therefor
- G03B17/24—Details of cameras or camera bodies; Accessories therefor with means for separately producing marks on the film, e.g. title, time of exposure
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03B—APPARATUS OR ARRANGEMENTS FOR TAKING PHOTOGRAPHS OR FOR PROJECTING OR VIEWING THEM; APPARATUS OR ARRANGEMENTS EMPLOYING ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ACCESSORIES THEREFOR
- G03B17/00—Details of cameras or camera bodies; Accessories therefor
- G03B17/48—Details of cameras or camera bodies; Accessories therefor adapted for combination with other photographic or optical apparatus
-
- G—PHYSICS
- G03—PHOTOGRAPHY; CINEMATOGRAPHY; ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ELECTROGRAPHY; HOLOGRAPHY
- G03B—APPARATUS OR ARRANGEMENTS FOR TAKING PHOTOGRAPHS OR FOR PROJECTING OR VIEWING THEM; APPARATUS OR ARRANGEMENTS EMPLOYING ANALOGOUS TECHNIQUES USING WAVES OTHER THAN OPTICAL WAVES; ACCESSORIES THEREFOR
- G03B27/00—Photographic printing apparatus
- G03B27/02—Exposure apparatus for contact printing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F1/00—Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00
- G06F1/16—Constructional details or arrangements
- G06F1/1613—Constructional details or arrangements for portable computers
- G06F1/1626—Constructional details or arrangements for portable computers with a single-body enclosure integrating a flat display, e.g. Personal Digital Assistants [PDAs]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/78—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data
- G06F21/79—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure storage of data in semiconductor storage media, e.g. directly-addressable memories
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
- G06F21/86—Secure or tamper-resistant housings
-
- 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/121—Methods or arrangements for marking the record carrier in digital fashion otherwise than by punching by printing code marks
-
- 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
-
- 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/067—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components
- G06K19/07—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips
- G06K19/073—Special arrangements for circuits, e.g. for protecting identification code in memory
-
- 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
-
- 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/10712—Fixed beam scanning
- G06K7/10722—Photodetector array or CCD 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/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
- 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/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
- G06Q20/36—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
- G06Q20/367—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes
- G06Q20/3674—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes involving authentication
-
- 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
-
- 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/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T1/00—General purpose image data processing
- G06T1/20—Processor architectures; Processor configuration, e.g. pipelining
-
- G06T3/02—
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
- G07F7/08—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
- G07F7/08—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means
- G07F7/086—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means by passive credit-cards adapted therefor, e.g. constructive particularities to avoid counterfeiting, e.g. by inclusion of a physical or chemical security-layer
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
- G07F7/08—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means
- G07F7/12—Card verification
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B7/00—Recording or reproducing by optical means, e.g. recording using a thermal beam of optical radiation by modifying optical properties or the physical structure, reproducing using an optical beam at lower power by sensing optical properties; Record carriers therefor
- G11B7/002—Recording, reproducing or erasing systems characterised by the shape or form of the carrier
- G11B7/0033—Recording, reproducing or erasing systems characterised by the shape or form of the carrier with cards or other card-like flat carriers, e.g. flat sheets of optical film
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B7/00—Recording or reproducing by optical means, e.g. recording using a thermal beam of optical radiation by modifying optical properties or the physical structure, reproducing using an optical beam at lower power by sensing optical properties; Record carriers therefor
- G11B7/007—Arrangement of the information on the record carrier, e.g. form of tracks, actual track shape, e.g. wobbled, or cross-section, e.g. v-shaped; Sequential information structures, e.g. sectoring or header formats within a track
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
- G11C11/56—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using storage elements with more than two stable states represented by steps, e.g. of voltage, current, phase, frequency
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C16/00—Erasable programmable read-only memories
- G11C16/02—Erasable programmable read-only memories electrically programmable
- G11C16/06—Auxiliary circuits, e.g. for writing into memory
- G11C16/22—Safety or protection circuits preventing unauthorised or accidental access to memory cells
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L23/00—Details of semiconductor or other solid state devices
- H01L23/57—Protection from inspection, reverse engineering or tampering
- H01L23/576—Protection from inspection, reverse engineering or tampering using active circuits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
-
- 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/00278—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 printing apparatus, e.g. a laser beam printer
-
- 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/0035—User-machine interface; Control console
- H04N1/00352—Input means
- H04N1/00355—Mark-sheet input
-
- 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/00405—Output means
- H04N1/00408—Display of information to the user, e.g. menus
- H04N1/0044—Display of information to the user, e.g. menus for image preview or review, e.g. to help the user position 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/00962—Input arrangements for operating instructions or parameters, e.g. updating internal software
- H04N1/00965—Input arrangements for operating instructions or parameters, e.g. updating internal software using a plug-in memory module, e.g. memory card, memory stick
-
- 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/21—Intermediate information storage
- H04N1/2104—Intermediate information storage for one or a few pictures
- H04N1/2112—Intermediate information storage for one or a few pictures using still video cameras
-
- 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/21—Intermediate information storage
- H04N1/2104—Intermediate information storage for one or a few pictures
- H04N1/2112—Intermediate information storage for one or a few pictures using still video cameras
- H04N1/2154—Intermediate information storage for one or a few pictures using still video cameras the still video camera incorporating a hardcopy reproducing device, e.g. a printer
-
- 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/23—Reproducing arrangements
- H04N1/2307—Circuits or arrangements for the control thereof, e.g. using a programmed control device, according to a measured quantity
-
- 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/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32106—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title separate from the image data, e.g. in a different computer file
- H04N1/32122—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title separate from the image data, e.g. in a different computer file in a separate device, e.g. in a memory or on a display separate from image data
-
- 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/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
- H04N1/32128—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title attached to the image data, e.g. file header, transmitted message header, information on the same page or in the same computer file as the image
- H04N1/32133—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title attached to the image data, e.g. file header, transmitted message header, information on the same page or in the same computer file as the image on the same paper sheet, e.g. a facsimile page header
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N23/00—Cameras or camera modules comprising electronic image sensors; Control thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N25/00—Circuitry of solid-state image sensors [SSIS]; Control thereof
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N5/00—Details of television systems
- H04N5/222—Studio circuitry; Studio devices; Studio equipment
- H04N5/262—Studio circuits, e.g. for mixing, switching-over, change of character of image, other special effects ; Cameras specially adapted for the electronic generation of special effects
- H04N5/2628—Alteration of picture size, shape, position or orientation, e.g. zooming, rotation, rolling, perspective, translation
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/165—Preventing or detecting of nozzle clogging, e.g. cleaning, capping or moistening for nozzles
- B41J2/16585—Preventing or detecting of nozzle clogging, e.g. cleaning, capping or moistening for nozzles for paper-width or non-reciprocating print heads
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/015—Ink jet characterised by the jet generation process
- B41J2/04—Ink jet characterised by the jet generation process generating single droplets or particles on demand
- B41J2002/041—Electromagnetic transducer
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2/00—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed
- B41J2/005—Typewriters or selective printing mechanisms characterised by the printing or marking process for which they are designed characterised by bringing liquid or particles selectively into contact with a printing material
- B41J2/01—Ink jet
- B41J2/135—Nozzles
- B41J2/14—Structure thereof only for on-demand ink jet heads
- B41J2002/14491—Electrical connection
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
- B41J—TYPEWRITERS; SELECTIVE PRINTING MECHANISMS, i.e. MECHANISMS PRINTING OTHERWISE THAN FROM A FORME; CORRECTION OF TYPOGRAPHICAL ERRORS
- B41J2202/00—Embodiments of or processes related to ink-jet or thermal heads
- B41J2202/01—Embodiments of or processes related to ink-jet heads
- B41J2202/21—Line printing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/20—Employing a main memory using a specific memory technology
- G06F2212/202—Non-volatile memory
- G06F2212/2022—Flash memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2129—Authenticate client device independently of the user
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09G—ARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
- G09G2310/00—Command of the display device
- G09G2310/02—Addressing, scanning or driving the display screen or processing steps related thereto
- G09G2310/0264—Details of driving circuits
- G09G2310/0281—Arrangement of scan or data electrode driver circuits at the periphery of a panel not inherent to a split matrix structure
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01L—SEMICONDUCTOR DEVICES NOT COVERED BY CLASS H10
- H01L2924/00—Indexing scheme for arrangements or methods for connecting or disconnecting semiconductor or solid-state bodies as covered by H01L24/00
- H01L2924/0001—Technical content checked by a classifier
- H01L2924/0002—Not covered by any one of groups H01L24/00, H01L24/00 and H01L2224/00
-
- 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
- H04N2101/00—Still video cameras
-
- 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
-
- 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/0084—Digital still camera
-
- 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/3212—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a job, e.g. communication, capture or filing of an image
- H04N2201/3222—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to a job, e.g. communication, capture or filing of an image of processing required or performed, e.g. forwarding, urgent or confidential handling
-
- 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
- H04N2201/3242—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 of processing required or performed, e.g. for reproduction or before recording
-
- 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/3261—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of multimedia information, e.g. a sound signal
-
- 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/3261—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of multimedia information, e.g. a sound signal
- H04N2201/3264—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of multimedia information, e.g. a sound signal of sound signals
-
- 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/3274—Storage or retrieval of prestored additional information
- H04N2201/3276—Storage or retrieval of prestored additional information of a customised additional information profile, e.g. a profile specific to a user ID
-
- 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/328—Processing of the additional information
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K1/00—Printed circuits
- H05K1/02—Details
- H05K1/14—Structural association of two or more printed circuits
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K1/00—Printed circuits
- H05K1/18—Printed circuits structurally associated with non-printed electric components
- H05K1/189—Printed circuits structurally associated with non-printed electric components characterised by the use of a flexible or folded printed circuit
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S977/00—Nanotechnology
- Y10S977/839—Mathematical algorithms, e.g. computer software, specifically adapted for modeling configurations or properties of nanostructure
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S977/00—Nanotechnology
- Y10S977/84—Manufacture, treatment, or detection of nanostructure
- Y10S977/842—Manufacture, treatment, or detection of nanostructure for carbon nanotubes or fullerenes
- Y10S977/843—Gas phase catalytic growth, i.e. chemical vapor deposition
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S977/00—Nanotechnology
- Y10S977/84—Manufacture, treatment, or detection of nanostructure
- Y10S977/901—Manufacture, treatment, or detection of nanostructure having step or means utilizing electromagnetic property, e.g. optical, x-ray, electron beamm
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S977/00—Nanotechnology
- Y10S977/902—Specified use of nanostructure
- Y10S977/932—Specified use of nanostructure for electronic or optoelectronic application
- Y10S977/94—Specified use of nanostructure for electronic or optoelectronic application in a logic circuit
Definitions
- the present invention relates to a data distribution system and in particular discloses a data distribution mechanism in the form of Dotcards.
- a print media scanning system that allows for high volumes of computer data to be stored on simple print media, such as a card, and to simultaneously be able to tolerate a high degree of corruption of the data.
- the form of distribution can suffer a number of data corruption errors when the surface is scanned by a scanning device.
- the errors can include:
- CD compact disc
- CD compact disc
- the utilization of Compact Disks provides for an extremely low cost form of storage.
- the technologies involved are quite complex and the use of rewritable CD type devices is extremely limited.
- a data storage device which comprises
- the data carrier may be a card such that the array of detectable items are positioned on a first surface of the card and a visual depiction representing the code may be positioned on a second opposite surface of the card.
- the card may be of a plastics material that is coated with a hydrophilic dye-fixing layer.
- the detectable items may be in the form of dots printed on the first surface of the card.
- the redundancy encoding may include reed-solomon fault correction encoding.
- the array of dots may be printed with a 1600 dpi resolution.
- the dots may define at least one target which is detectable by the sensor, the target being associated with at least one data area defined by the dots.
- the targets may be oriented to permit reading of the card in at least two directions.
- an identifying card comprising: a first surface carrying human readable information relevant to an owner of the identifying card; and a second, opposed surface carrying encoded information encoded in a highly fault tolerant manner, said encoded information being adapted for sensing by a sensing device and decoded by a computational processor, so as to provide information relevant to the owner in a human readable form, the encoded information comprising an array of dots applied to said second surface; wherein the encoded information comprises spatially distributed redundancy encoded data such that the information is encoded in a highly fault tolerant manner and can be decoded by said processor despite a localized obliteration of the encoded information on the card.
- FIG. 1 illustrates an Artcam device constructed in accordance with the preferred embodiment
- FIG. 2 is a schematic block diagram of the main Artcam electronic components
- FIG. 3 illustrates a time line of the process of sampling an Artcard
- FIG. 4 illustrates the super sampling process
- FIG. 5 illustrates the process of reading a rotated Artcard
- FIG. 6 illustrates a flow chart of the steps necessary to decode an Artcard
- FIG. 7 illustrates an enlargement of the left hand corner of a single Artcard
- FIG. 8 illustrates a single target for detection
- FIG. 9 illustrates the method utilised to detect targets
- FIG. 10 illustrates the method of calculating the distance between two targets
- FIG. 11 illustrates the process of centroid drift
- FIG. 12 shows one form of centroid lookup table
- FIG. 13 illustrates the centroid updating process
- FIG. 14 illustrates a delta processing lookup table utilised in the preferred embodiment
- FIG. 15 illustrates the process of unscrambling Artcard data
- FIG. 16 illustrates a magnified view of a series of dots
- FIG. 17 illustrates the data surface of a dot card
- FIG. 18 illustrates schematically the layout of a single datablock
- FIG. 19 illustrates a single datablock
- FIG. 20 and FIG. 21 illustrate magnified views of portions of the datablock of FIG. 19 ;
- FIG. 22 illustrates a single target structure
- FIG. 23 illustrates the target structure of a datablock
- FIG. 24 illustrates the positional relationship of targets relative to border clocking regions of a data region
- FIG. 25 illustrates the orientation columns of a datablock
- FIG. 26 illustrates the array of dots of a datablock
- FIG. 27 illustrates schematically the structure of data for Reed-Solomon encoding
- FIG. 28 illustrates an example Reed-Solomon encoding
- FIG. 29 illustrates the Reed-Solomon encoding process
- FIG. 30 illustrates the layout of encoded data within a datablock
- FIG. 31 illustrates the sampling process in sampling an alternative Artcard
- FIG. 32 illustrates, in exaggerated form, an example of sampling a rotated alternative Artcard
- FIG. 33 illustrates the scanning process
- FIG. 34 illustrates the likely scanning distribution of the scanning process
- FIG. 35 illustrates the relationship between probability of symbol errors and Reed-Solomon block errors
- FIG. 36 illustrates a flow chart of the decoding process
- FIG. 37 illustrates a process utilization diagram of the decoding process
- FIG. 38 illustrates the dataflow steps in decoding
- FIG. 39 illustrates the reading process in more detail
- FIG. 40 illustrates the process of detection of the start of an alternative Artcard in more detail
- FIG. 41 illustrates the extraction of bit data process in more detail
- FIG. 42 illustrates the segmentation process utilized in the decoding process
- FIG. 43 illustrates the decoding process of finding targets in more detail
- FIG. 44 illustrates the data structures utilized in locating targets
- FIG. 45 illustrates the Lancos 3 function structure
- FIG. 46 illustrates an enlarged portion of a datablock illustrating the clockmark and border region
- FIG. 47 illustrates the processing steps in decoding a bit image
- FIG. 48 illustrates the dataflow steps in decoding a bit image
- FIG. 49 illustrates the descrambling process of the preferred embodiment
- FIG. 50 illustrates the process of generating an 8 bit dot output
- FIG. 51 illustrates a perspective view of the card reader
- FIG. 52 illustrates an exploded perspective of a card reader
- FIG. 53 illustrates a close up view of the Artcard reader
- FIG. 54 illustrates a perspective view of the print roll and print head
- FIG. 55 illustrates a first exploded perspective view of the print roll
- FIG. 56 illustrates a second exploded perspective view of the print roll
- FIG. 57 illustrates the print roll authentication chip
- FIG. 58 illustrates an enlarged view of the print roll authentication chip
- the digital image processing camera system constructed in accordance with the preferred embodiment is as illustrated in FIG. 1 .
- the camera unit 1 includes means for the insertion of an integral print roll (not shown).
- the camera unit 1 can include an area image sensor 2 which sensors an image 3 for captured by the camera.
- the second area image sensor can be provided to also image the scene 3 and to optionally provide for the production of stereographic output effects.
- the camera 1 can include an optional color display 5 for the display of the image being sensed by the sensor 2 .
- the button 6 can be depressed resulting in the printed image 8 being output by the camera unit 1 .
- a series of cards, herein after known as “Artcards” 9 contain, on one surface encoded information and on the other surface, contain an image distorted by the particular effect produced by the Artcard 9 .
- the Artcard 9 is inserted in an Artcard reader 10 in the side of camera 1 and, upon insertion, results in output image 8 be distorted in the same manner as the distortion appearing on the surface of Artcard 9 .
- a user wishing to produce a particular effect can insert one of many Artcards 9 into the Artcard reader 10 and utilize button 19 to take a picture of the image 3 resulting in a corresponding distorted output image 8 .
- the camera unit 1 can also include a number of other control button 13 , 14 in addition to a simple LCD output display 15 for the display of informative information including the number of printouts left on the internal print roll on the camera unit. Additionally, different output formats can be controlled by CHP switch 17 .
- FIG. 2 there is illustrated a schematic view of the internal hardware of the camera unit 1 .
- the internal hardware is based around an Artcam central processor unit (ACP) 31 .
- ACP Artcam central processor unit
- the Artcam central processor 31 provides many functions which form the ‘heart’ of the system.
- the ACP 31 is preferably implemented as a complex, high speed, CMOS system on-a-chip. Utilizing standard cell design with some full custom regions is recommended. Fabrication on a 0.251 ⁇ CMOS process will provide the density and speed required, along with a reasonably small die area.
- the functions provided by the ACP 31 include:
- a quartz crystal 58 is used as a frequency reference for the system clock.
- the ACP 31 includes a phase locked loop clock circuit to increase the frequency derived from the crystal 58 .
- the Artcard 9 is a program storage medium for the Artcam unit. As noted previously, the programs are in the form of Vark scripts. Vark is a powerful image processing language especially developed for the Artcam unit. Each Artcard 9 contains one Vark script, and thereby defines one image processing style.
- the VARK language is highly image processing specific.
- the language includes facilities for handling many image processing functions including image warping via a warp map, convolution, color lookup tables, posterizing an image, adding noise to an image, image enhancement filters, painting algorithms, brush jittering and manipulation edge detection filters, tiling, illumination via light sources, bump maps, text, face detection and object detection attributes, fonts, including three dimensional fonts, and arbitrary complexity pre-rendered icons. Further details of the operation of the Vark language interpreter are contained hereinafter.
- VARK interpreter is incorporated in the camera device
- a device independent scenario is provided whereby the underlying technology can be completely varied over time.
- the VARK scripts can be updated as new filters are created and distributed in an inexpensive manner, such as via simple cards for card reading.
- the Artcard 9 is a piece of thin white plastic with the same format as a credit card (86 mm long by 54 mm wide).
- the Artcard is printed on both sides using a high resolution ink jet printer.
- the inkjet printer technology is assumed to be the same as that used in the Artcam, with 1600 dpi (63 dpmm) resolution.
- a major feature of the Artcard 9 is low manufacturing cost Artcards can be manufactured at high speeds as a wide web of plastic film.
- the plastic web is coated on both sides with a hydrophilic dye fixing layer.
- the web is printed simultaneously on both sides using a ‘pagewidth’ color ink jet printer.
- the web is then cut and punched into individual cards.
- On one face of the card is printed a human readable representation of the effect the Artcard 9 will have on the sensed image. This can be simply a standard image which has been processed using the Vark script stored on the back face of the card.
- the print area is 80 mm ⁇ 50 mm, giving a total of 15,876,000 dots.
- This array of dots could represent at least 1.89 Mbytes of data.
- extensive error detection and correction is incorporated in the array of dots. This allows a substantial portion of the card to be defaced, worn, creased, or dirty with no effect on data integrity.
- the data coding used is Reed-Solomon coding, with half of the data devoted to error correction. This allows the storage of 967 Kbytes of error corrected data on each Artcard 9 .
- the Artcard linear sensor 34 converts the aforementioned Artcard data image to electrical signals.
- the linear image sensor can be fabricated using either CCD or APS CMOS technology.
- the active length of the image sensor 34 is 50 mm, equal to the width of the data array on the Artcard 9 .
- the resolution of the linear image sensor 34 must be at least twice the highest spatial frequency of the Artcard optical image reaching the image sensor. In practice, data detection is easier if the image sensor resolution is substantially above this.
- a resolution of 4800 dpi (189 dpmm) is chosen, giving a total of 9,450 pixels. This resolution requires a pixel sensor pitch of 5.3 ⁇ m. This can readily be achieved by using four staggered rows of 20 ⁇ m pixel sensors.
- the linear image sensor is mounted in a special package which includes a LED 65 to illuminate the Artcard 9 via a light-pipe (not shown).
- the Artcard reader light-pipe can be a molded light-pipe which has several function:
- the Artcard reader motor propels the Artcard past the linear image sensor 34 at a relatively constant rate.
- the motor 37 is a standard miniature motor geared down to an appropriate speed to drive a pair of rollers which move the Artcard 9 .
- the speed variations, rumble, and other vibrations will affect the raw image data as circuitry within the APC 31 includes extensive compensation for these effects to reliably read the Artcard data.
- the motor 37 is driven in reverse when the Artcard is to be ejected.
- the Artcard motor driver 61 is a small circuit which amplifies the digital motor control signals from the APC 31 to levels suitable for driving the motor 37 .
- the card insertion sensor 49 is an optical sensor which detects the presence of a card as it is being inserted in the card reader 34 . Upon a signal from this sensor 49 , the APC 31 initiates the card reading process, including the activation of the Artcard reader motor 37 .
- a card eject button 16 ( FIG. 1 ) is used by the user to eject the current Artcard, so that another Artcard can be inserted.
- the APC 31 detects the pressing of the button, and reverses the Artcard reader motor 37 to eject the card.
- a card status indicator 66 is provided to signal the user as to the status of the Artcard reading process. This can be a standard bi-color (red/green) LED. When the card is successfully read, and data integrity has been verified, the LED lights up green continually. If the card is faulty, then the LED lights up red.
- the power supply voltage is less than the forward voltage drop of the greed LED, and the LED will not light.
- red LEDs can be used, or the LED can be powered from a voltage pump which also powers other circuits in the Artcam which require higher voltage.
- the camera utilizes 8 Mbytes of memory 33 . This can be provided by a single 64 Mbit memory chip. Of course, with changing memory technology increased-Dram storage sizes may be substituted.
- High speed access to the memory chip is required. This can be achieved by using a Rambus DRAM (burst access rate of 500 Mbytes per second) or chips using the new open standards such as double data rate (DDR) SDRAM or Synclink DRAM.
- Rambus DRAM burst access rate of 500 Mbytes per second
- DDR double data rate SDRAM
- Synclink DRAM Synclink DRAM
- the Artcard Sensor 49 detects it notifying the ACP 72 . This results in the software inserting an ‘Artcard Inserted‘ event into the event queue. When the event is processed several things occur
- the Data Card reading process has 4 phases operated while the pixel data is read from the card.
- the phases are as follows:
- the Artcard 9 must be sampled at least at double the printed resolution to satisfy Nyquist's Theorem. In practice it is better to sample at a higher rate than this.
- the pixels are sampled 230 at 3 times the resolution of a printed dot in each dimension, requiring 9 pixels to define a single dot.
- the resolution of the Artcard 9 is 1600 dpi
- the resolution of the sensor 34 is 4800 dpi
- a dot is not exactly aligned with the sampling CCD the worst and most likely case is that a dot will be sensed over a 16 pixel area (4 ⁇ 4) 231.
- An Artcard 9 may be slightly warped due to heat damage, slightly rotated (up to, say 1 degree) due to differences in insertion into an Artcard reader, and can have slight differences in true data rate due to fluctuations in the speed of the reader motor 37 . These changes will cause columns of data from the card not to be read as corresponding columns of pixel data. As illustrated in FIG. 5 , a 1 degree rotation in the Artcard 9 can cause the pixels from a column on the card to be read as pixels across 166 columns:
- the Artcard 9 should be read in a reasonable amount of time with respect to the human operator.
- the data on the Artcard covers most of the Artcard surface, so timing concerns can be limited to the Artcard data itself. A reading time of 1.5 seconds is adequate for Artcard reading.
- the Artcard should be loaded in 1.5 seconds. Therefore all 16,000 columns of pixel data must be read from the CCD 34 in 1.5 second, i.e. 10,667 columns per second. Therefore the time available to read one column is 1/10667 second or 93,747 ns. Pixel data can be written to the DRAM one column at a time, completely independently from any processes that are reading the pixel data.
- the time to write one column of data (9450/2 bytes since the reading can be 4 bits per pixel giving 2 ⁇ 4 bit pixels per byte) to DRAM is reduced by using 8 cache lines. If 4 lines were written out at one time, the 4 banks can be written to independently, and thus overlap latency reduced. Thus the 4725 bytes can be written in 11,840ns (4725/128*320 ns). Thus the time taken to write a given column's data to DRAM uses just under 13% of the available bandwidth.
- a simple look at the data sizes shows the impossibility of fitting the process into the 8 MB of memory 33 if the entire Artcard pixel data (140 MB if each bit is read as a 3 ⁇ 3 array) as read by the linear CCD 34 is kept. For this re reading of the linear CCD, decoding of the bitmap, and the un-bitmap process should take place in real-time (while the Artcard 9 is traveling past the linear CCD 34 ), and these processes must effectively work without having entire data stores available.
- the old stored Print Image and any expanded Photo Image becomes invalid.
- the new Artcard 9 can contain directions for creating a new image based on the currently captured Photo Image.
- the old Print Image is invalid, and the area holding expanded Photo Image data and image pyramid is invalid, leaving more than 5 MB that can be used as scratch memory during the read process.
- the 1 MB area where the Artcard raw data is to be written can also be used as scratch data during the Artcard read process as long as by the time the final Reed-Solomon decode is to occur, that 1 MB area is free again.
- the reading process described here does not make use of the extra 1 MB area (except as a final destination for the data).
- the unscrambling process requires two sets of 2 MB areas of memory since unscrambling cannot occur in place. Fortunately the 5 MB scratch area contains enough space for this process.
- FIG. 6 there is shown a flowchart 220 of the steps necessary to decode the Artcard data. These steps include reading in the Artcard 221 , decoding the read data to produce corresponding encoded XORed scrambled bitmap data 223 . Next a checkerboard XOR is applied to the data to produces encoded scrambled data 224 . This data is then unscrambled 227 to produce data 225 before this data is subjected to Reed-Solomon decoding to produce the original raw data 226 . Alternatively, unscrambling and XOR process can take place together, not requiring a separate pass of the data. Each of the above steps is discussed in further detail hereinafter. As noted previously with reference to FIG. 6 , the Artcard Interface, therefore, has 4 phases, the first 2 of which are time-critical, and must take place while pixel data is being read from the CCD:
- Phase 1 As the Artcard 9 moves past the CCD 34 the AI must detect the start of the data area by robustly detecting special targets on the Artcard to the left of the data area. If these cannot be detected, the card is marked as invalid. The detection must occur in real-time, while the Artcard 9 is moving past the CCD 34 .
- rotation invariance can be provided.
- the targets are repeated on the right side of the Artcard, but relative to the bottom right corner instead of the top corner. In this way the targets end up in the correct orientation if the card is inserted the “wrong” way.
- Phase 3 below can be altered to detect the orientation of the data, and account for the potential rotation.
- Phase 2 Once the data area has been determined, the main read process begins, placing pixel data from the CCD into an ‘Artcard data window’, detecting bits from this window, assembling the detected bits into bytes, and constructing a byte-image in DRAM. This must all be done while the Artcard is moving past the CCD.
- Phase 3 Once all the pixels have been read from the Artcard data area, the Artcard motor 37 can be stopped, and the byte image descrambled and XORed. Although not requiring real-time performance, the process should be fast enough not to annoy the human operator. The process must take 2 MB of scrambled bit-image and write the unscrambled/XORed bit-image to a separate 2 MB image.
- Phase 4 The final phase in the Artcard read process is the Reed-Solomon decoding process, where the 2 MB bit-image is decoded into a 1 MB valid Artcard data area. Again, while not requiring real-time performance it is still necessary to decode quickly with regard to the human operator. If the decode process is valid, the card is marked as valid. If the decode failed, any duplicates of data in the bit-image are attempted to be decoded, a process that is repeated until success or until there are no more duplicate images of the data in the bit image.
- the four phase process described requires 4.5 MB of DRAM. 2 MB is reserved for Phase 2 output, and 0.5 MB is reserved for scratch data during phases 1 and 2. The remaining 2 MB of space can hold over 440 columns at 4725 byes per column. In practice, the pixel data being read is a few columns ahead of the phase 1 algorithm, and in the worst case, about 180 columns behind phase 2, comfortably inside the 440 column limit.
- This phase is concerned with robustly detecting the left-hand side of the data area on the Artcard 9 .
- Accurate detection of the data area is achieved by accurate detection of special targets printed on the left side of the card. These targets are especially designed to be easy to detect even if rotated up to 1 degree.
- FIG. 7 there is shown an enlargement of the left hand side of an Artcard 9 .
- the side of the card is divided into 16 bands, 239 with a target eg. 241 located at the center of each band.
- the bands are logical in that there is n line drawn to separate bands.
- FIG. 8 there is shown a single target 241 .
- the target 241 is a printed black square containing a single white dot. The idea is to detect firstly as many targets 241 as possible, and then to join at least 8 of the detected white-dot locations into a single logical straight line. If this can be done, the start of the data area 243 is a fixed distance from this logical line. If it cannot be done, then the card is rejected as invalid.
- the height of the card 9 is 3150 dots.
- a target (Target 0 ) 241 is placed a fixed distance of 24 dots away from the top left corner 244 of the data area so that it falls well within the first of 16 equal sized regions 239 of 192 dots (576 pixels) with no target in the final pixel region of the card.
- the target 241 must be big enough to be easy to detect, yet be small enough not to go outside the height of the region if the card is rotated 1 degree.
- a suitable size for the target is a 31 ⁇ 31 dot (93 ⁇ 93 sensed pixels) black square 241 with the white dot 242 .
- the black part of the rectangle is 57 pixels high (19 dots) we can be sure that at least 9.5 black pixels will be read in the same column by the CCD (worst case is half the pixels are in one column and half in the next).
- 31 dots is 91 pixels, which at most suffers a 3 pixel shift in column, easily within the 576 pixel band.
- each target is a block of 31 ⁇ 31 dots (93 ⁇ 93 pixels) each with the composition:
- Targets are detected by reading columns of pixels, one column at a time rather than by detecting dots. It is necessary to look within a given band for a number of columns consisting of large numbers of contiguous black pixels to build up the left side of a target. Next, it is expected to see a white region in the center of further black columns, and finally the black columns to the left of the target center.
- Each logical read fills 4 cache lines via 4 sub-reads while the other 4 cache-lines are being used. This effectively uses up 13% of the available DRAM bandwidth.
- the detection mechanism FIFO for detecting the targets uses a filter 245 , run-length encoder 246 , and a FIFO 247 that requires special wiring of the top 3 elements (S1, S2, and S3) for random access.
- the run-length encoder 246 only encodes contiguous pixels within a 576 pixel (192 dot) region.
- the top 3 elements in the FIFO 247 can be accessed 252 in any random order.
- the run lengths (in pixels) of these entries are filtered into 3 values: short, medium, and long in accordance with the following table: Short Used to detect white dot.
- RunLength ⁇ 16 Medium Used to detect runs of 16 ⁇ RunLength ⁇ 48 black above or below the white dot in the center of the target.
- Long Used to detect run lengths RunLength > 48 of black to the left and right of the center dot in the target.
- Case 1 white long
- the targets After the targets have been detected, they should be processed. All the targets may be available or merely some of them. Some targets may also have been erroneously detected.
- This phase of processing is to determine a mathematical line that passes through the center of as many targets as possible. The more targets that the line passes through, the more confident the target position has been found. The limit is set to be 8 targets. If a line passes through at least 8 targets, then it is taken to be the right one.
- the resulting algorithm takes 180 divides to calculate ⁇ row and ⁇ column, 180 multiply/adds to calculate target 0 position, and then 2880 adds/comparisons.
- Step 0 Locate the Data Area
- TargetA From Target 0 ( 241 of FIG. 7 ) it is a predetermined fixed distance in rows and columns to the top left border 244 of the data area, and then a further 1 dot column to the vertical clock marks 276 . So we use TargetA, ⁇ row and ⁇ column found in the previous stage ( ⁇ row and ⁇ column refer to distances between targets) to calculate the centroid or expected location for Target 0 as described previously.
- Step 1 Write Out the Initial Centroid Deltas ( ⁇ ) and Bit History
- bit history is actually an expected bit history since it is known that to the left of the clock mark column 276 is a border column 277 , and before that, a white area.
- the bit history therefore is 011, 010, 011, 010 etc.
- Step 2 Update the Centroids Based on Actual Pixels Read.
- the bit history is set up in Step 1 according to the expected clock marks and data border.
- the actual centroids for each dot row can now be more accurately set (they were initially 0) by comparing the expected data against the actual pixel values.
- the centroid updating mechanism is achieved by simply performing step 3 of Phase 2 .
- Phase 2 Detect Bit Pattern from Artcard Based on Pixels Read, and Write as Bytes.
- the worst case is that we cannot process the first column until at least 165 columns have been read into DRAM. Phase 2 would therefore finish the same amount of time after the read process had terminated.
- Step 0 Advance to the Next Dot Column
- the column number is recorded in a register called CurrentColumn. Every time the sensor advances to the next dot column it is necessary to increment the CurrentColumn register. The first time it is incremented, it is incremented from ⁇ 1 to 0 (see Step 0 Phase 1 ).
- the CurrentColumn register determines when to terminate the read process (when reaching maxColumns), and also is used to advance the DataOut Pointer to the next column of byte information once all 8 bits have been written to the byte (once every 8 dot columns). The lower 3 bits determine what bit we're up to within the current byte. It will be the same bit being written for the whole column.
- Step 1 Detect the Top and Bottom of an Artcard Dot Column.
- dotColumnTop points to the clock mark column 276 .
- step 2 whose first task will be to add the ⁇ row and ⁇ column values to dotColumnTop to arrive at the first data dot of the column.
- Step 2 Process an Artcard's Dot Column
- the pixels around the centroid need to be examined to detect the status of the dot and hence the value of the bit.
- a dot covers a 4 ⁇ 4 pixel area.
- the number of pixels required to detect the status of the dot and hence the bit value is much less than this. We only require access to 3 columns of pixel columns at any one time.
- centroids will shift I column every 57 pixel rows, but since a dot is 3 pixels in diameter, a given column will be valid for 171 pixel rows (3*57). As a byte contains 2 pixels, the number of bytes valid in each buffered read (4 cache lines) will be a worst case of 86 (out of 128 read).
- the read/shift&OR/write process requires 2 cache lines.
- a dot 290 has a radius of about 1.5 pixels. Therefore the pixel 291 that holds the centroid, regardless of the actual position of the centroid within that pixel, should be 100% of the dot's value. If the centroid is exactly in the center of the pixel 291 , then the pixels above 292 & below 293 the centroid's pixel, as well as the pixels to the left 294 & right 295 of the centroid's pixel will contain a majority of the dot's value. The further a centroid is away from the exact center of the pixel 295 , the more likely that more than the center pixel will have 100% coverage by the dot.
- FIG. 11 only shows centroids differing to the left and below the center, the same relationship obviously holds for centroids above and to the right of center. center.
- the centroid is exactly in the center of the middle pixel 295 .
- the center pixel 295 is completely covered by the dot, and the pixels above, below, left and right are also well covered by the dot.
- the centroid is to the left of the center of the middle pixel 291 .
- the center pixel is still completely covered by the dot, and the pixel 294 to the left of the center is now completely covered by the dot.
- the pixels above 292 and below 293 are still well covered.
- the centroid is below the center of the middle pixel 291 .
- the center pixel 291 is still completely covered by the dot 291 , and the pixel below center is now completely covered by the dot.
- the pixels left 294 and right 295 of center are still well covered.
- the centroid is left and below the center of the middle pixel.
- the center pixel 291 is still completely covered by the dot, and both the pixel to the left of center 294 and the pixel below center 293 are completely covered by the dot.
- the algorithm for updating the centroid uses the distance of the centroid from the center of the middle pixel 291 in order to select 3 representative pixels and thus decide the value of the dot:
- the value of each pixel is output to a pre-calculated lookup table 301 .
- the 3 pixels are fed into a 12-bit lookup table, which outputs a single bit indicating the value of the dot—on or off.
- the lookup table 301 is constructed at chip definition time, and can be compiled into about 500 gates.
- the lookup table can be a simple threshold table, with the exception that the center pixel (Pixel 1 ) is weighted more heavily.
- Step 3 Update the Centroid ⁇ s for Each Row in the Column
- the idea of the ⁇ s processing is to use the previous bit history to generate a ‘perfect’ dot at the expected centroid location for each row in a current column.
- the actual pixels (from the CCD) are compared with the expected ‘perfect’ pixels. If the two match, then the actual centroid location must be exactly in the expected position, so the centroid ⁇ s must be valid and not need updating. Otherwise a process of changing the centroid ⁇ s needs to occur in order to best fit the expected centroid location to the actual data.
- the new centroid ⁇ s will be used for processing the dot in the next column.
- centroid ⁇ are processed as ⁇ column ⁇ row respectively to reduce complexity.
- centroid updating requires more than simply the information about a given single dot.
- FIG. 13 shows a single dot 310 from the previous column with a given centroid 311 .
- the 20 bit bit-pattern represents the expected A values for each of the 5 pixels across the horizontal dimension.
- the first nibble would represent the rightmost pixel of the leftmost dot.
- the next 3 nibbles represent the 3 pixels across the center of the dot 310 from the previous column and the last nibble would be the leftmost pixel 317 of the rightmost dot (from the current column).
- the pixels to the left and right of the center dot are either 0 or D depending on whether the bit was a 0 or 1 respectively.
- the center three pixels are either 000 or DFD depending on whether the bit was a 0 or 1 respectively. These values are based on the physical area taken by a dot for a given pixel. Depending on the distance of the centroid from the exact center of the pixel, we would expect data shifted slightly, which really only affects the pixels either side of the center pixel. Since there are 16 possibilities, it is possible to divide the distance from the center by 16 and use that amount to shift the expected pixels.
- the 20 bit 5 pixel expected value can be compared against the actual pixels read. This can proceed by subtracting the expected pixels from the actual pixels read on a pixel by pixel basis, and finally adding the differences together to obtain a distance from the expected ⁇ values.
- FIG. 14 illustrates one form of implementation of the above algorithm which includes a look up table 320 which receives the bit history 322 and central fractional component 323 and outputs 324 the corresponding 20 bit number which subtracted 321 from the central pixel input 326 to produce a pixel difference 327 .
- the 2 MB bit-image DRAM area is read from and written to during Phase 2 processing.
- the 2 MB pixel-data DRAM area is read.
- the next step in decoding is to unscramble and XOR the raw data.
- the 2 MB byte image as taken from the Artcard, is in a scrambled XORed form. It must be unscrambled and re-XORed to retrieve the bit image necessary for the Reed Solomon decoder in phase 4 .
- the unscrambling process 330 takes a 2 MB scrambled byte image 331 and writes an unscrambled 2 MB image 332 .
- the process cannot reasonably be performed in-place, so 2 sets of 2 MB areas are utilised.
- the scrambled data 331 is in symbol block order arranged in a 16 ⁇ 16 array, with symbol block 0 ( 334 ) having all the symbol 0 's from all the code words in random order.
- Symbol block 1 has all the symbol 1 's from all the code words in random order etc. Since there are only 255 symbols, the 256 th symbol block is currently unused.
- a linear feedback shift register is used to determine the relationship between the position within a symbol block eg. 334 and what code word eg. 355 it came from. This works as long as the same seed is used when generating the original Artcard images.
- the XOR of bytes from alternative source lines with 0xAA and 0x55 respectively is effectively free (in time) since the bottleneck of time is waiting for the DRAM to be ready to read/write to non-sequential addresses.
- This phase is a loop, iterating through copies of the data in the bit image, passing them to the Reed-Solomon decode module until either a successful decode is made or until there are no more copies to attempt decode from.
- the Reed-Solomon decoder used can be the VLIW processor, suitably programmed or, alternatively, a separate hardwired core such as LSI Logic's L64712.
- the overall time taken to read the Artcard 9 and decode it is therefore approximately 2.15 seconds.
- the apparent delay to the user is actually only 0.65 seconds (the total of Phases 3 and 4 ), since the Artcard stops moving after 1.5
- the Artvark script must be interpreted, Rather than run the script immediately, the script is only run upon the pressing of the ‘Print’ button 13 ( FIG. 1 ).
- the time taken to run the script will vary depending on the complexity of the script, and must be taken into account for the perceived delay between pressing the print button and the actual print button and the actual printing.
- the Alternative Artcards can be used in both embedded and PC type applications, providing a user-friendly interface to large amounts of data or configuration information.
- Alternative Artcard technology can also be independent of the printing resolution.
- the notion of storing data as dots on a card simply means that if it is possible put more dots in the same space (by increasing resolution), then those dots can represent more data.
- the preferred embodiment assumes utilisation of 1600 dpi printing on a 86 mm ⁇ 55 mm card as the sample Artcard, but it is simple to determine alternative equivalent layouts and data sizes for other card sizes and/or other print resolutions. Regardless of the print resolution, the reading technique remain the same.
- alternative Artcards are capable of storing up to 1 Megabyte of data at print resolutions up to 1600 dpi.
- Alternative Artcards can store megabytes of data at print resolutions greater than 1600 dpi.
- the following two tables summarize the effective alternative Artcard data storage capacity for certain print resolutions:
- the dots on the data side of an alternative Artcard can be monochrome. For example, black dots printed on a white background at a predetermined desired print resolution. Consequently a “black dot” is physically different from a “white dot”.
- FIG. 16 illustrates various examples of magnified views of black and white dots.
- the monochromatic scheme of black dots on a white background is preferably chosen to maximize dynamic range in blurry reading environments.
- the black dots are printed at a particular pitch (eg. 1600 dpi)
- the dots themselves are slightly larger in order to create continuous lines when dots are printed contiguously.
- the dots are not as merged as they may be in reality as a result of bleeding. There would be more smoothing out of the black indentations.
- the alternative Artcard system described in the preferred embodiment allows for flexibly different dot sizes, exact dot sizes and ink/printing behaviour for a particular printing technology should be studied in more detail in order to obtain best results.
- the term dot refers to a physical printed dot (ink, thermal, electro-photographic, silver-halide etc) on an alternative Artcard
- the dots must be sampled at least double the printed resolution to satisfy Nyquist's Theorem.
- the term pixel refers to a sample value from an alternative Artcard reader device. For example, when 1600 dpi dots are scanned at 4800 dpi there are 3 pixels in each dimension of a dot, or 9 pixels per dot. The sampling process will be further explained hereinafter.
- each alternative Artcard consists of an “active” region 1102 surrounded by a white border region 1103 .
- the white border 1103 contains no data information, but can be used by an alternative Artcard reader to calibrate white levels.
- the active region is an array of data blocks eg. 1104 , with each data block separated from the next by a gap of 8 white dots eg. 1106 .
- the number of data blocks on an alternative Artcard will vary.
- the array can be 8 ⁇ 8.
- Each data block 1104 has dimensions of 627 ⁇ 394 dots. With an inter-block gap 1106 of 8 white of an alternative Artcard is therefore 5072 ⁇ 3208 dots (8.1 mm ⁇ 5.1 mm at 1600 dpi).
- FIG. 18 there is shown a single data block 1107 .
- the active region of an alternative Artcard consists of an array of identically structured data blocks 1107 .
- Each of the data blocks has the following structure: a data region 1108 surrounded by clock-marks 1109 , borders 1110 , and targets 1111 .
- the data region holds the encoded data proper, while the clock-marks, borders and targets are present specifically to help locate the data region and ensure accurate recovery of data from within the region.
- Each data block 1107 has dimensions of 627 ⁇ 394 dots. Of this, the central area of 595 ⁇ 384 dots is the data region 1108 . The surrounding dots are used to hold the clock-marks, borders, and targets.
- FIG. 19 illustrates a data block with FIG. 20 and FIG. 21 illustrating magnified edge portions thereof.
- the top 5 dot high region consists of an outer black dot border line 1112 (which stretches the length of the data block), a white dot separator line 1113 (to ensure the border line is independent), and a 3 dot high set of clock marks 1114 .
- the clock marks alternate between a white and black row, starting with a black clock mark at the 8th column from either end of the data block. There is no separation between clockmark dots and dots in the data region.
- the clock marks are symmetric in that if the alternative Artcard is inserted rotated 180 degrees, the same relative border/clockmark regions will be encountered.
- the border 1112 , 1113 is intended for use by an alternative Artcard reader to keep vertical tracking as data is read from the data region.
- the clockmarks 1114 are intended to keep horizontal tracking as data is read from the data region.
- the separation between the border and clockmarks by a white line of dots is desirable as a result of blurring occurring during reading.
- the border thus becomes a black line with white on either side, making for a good frequency response on reading.
- the clockmarks alternating between white and black have a similar result, except in the horizontal rather than the vertical dimension.
- Any alternative Artcard reader must locate the clockmarks and border if it intends to use them for tracking.
- targets which are designed to point the way to the clockmarks, border and data.
- each target region 1116 , 1117 there are two 15-dot wide target regions 1116 , 1117 in each data block: one to the left and one to the right of the data region.
- the target regions are separated from the data region by a single column of dots used for orientation.
- the purpose of the Target Regions 1116 , 1117 is to point the way to the clockmarks, border and data regions.
- Each Target Region contains 6 targets eg. 1118 that are designed to be easy to find by an alternative Artcard reader.
- FIG. 22 there is shown the structure of a single target 1120 .
- Each target 1120 is a 15 ⁇ 15 dot black square with a center structure 1121 and a run-length encoded target number 1122 .
- the center structure 1121 is a simple white cross, and the target number component 1122 is simply two columns of white dots, each being 2 dots long for each part of the target number.
- target number 1 's target id 1122 is 2 dots long
- target number 2 's target id 1122 is 4 dots wide etc.
- the targets are arranged so that they are rotation invariant with regards to card insertion. This means that the left targets and right targets are the same, except rotated 180 degrees.
- the targets are arranged such that targets 1 to 6 are located top to bottom respectively.
- the targets are arranged so that target numbers 1 to 6 are located bottom to top. The target number id is always in the half closest to the data region.
- the magnified view portions of FIG. 23 reveals clearly the how the right targets are simply the same as the left targets, except rotated 180 degrees.
- the targets 1124 , 1125 are specifically placed within the Target Region with centers 55 dots apart.
- the first black clockmark in both regions begins directly in line with the target center (the 8th dot position is the center of the 15 dot-wide target).
- FIG. 24 illustrates the distances between target centers as well as the distance from Target 1 ( 1124 ) to the first dot of the first black clockmark ( 1126 ) in the upper border/clockmark region. Since there is a distance of 55 dots to the Clockmarks from both the upper and lower targets, and both sides of the alternative Artcard are symmetrical (rotated through 180 degrees), the card can be read left-to-right or right-to-left. Regardless of reading direction, the orientation does need to be determined in order to extract the data from the data region.
- Orientation Columns 1127 , 1128 there are two 1 dot wide Orientation Columns 1127 , 1128 in each data block: one directly to the left and one directly to the right of the data region.
- the Orientation Columns are present to give orientation information to an alternative Artcard reader: On the left side of the data region (to the right of the Left Targets) is a single column of white dots 1127 . On the right side of the data region (to the left of the Right Targets) is a single column of black dots 1128 . Since the targets are rotation invariant, these two columns of dots allow an alternative Artcard reader to determine the orientation of the alternative Artcard—has the card been inserted the right way, or back to front. From the alternative Artcard reader's point of view, assuming no degradation to the dots, there are two possibilities:
- the data region of a data block consists of 595 columns of 384 dots each, for a total of 228,480 dots. These dots must be interpreted and decoded to yield the original data. Each dot represents a single bit, so the 228,480 dots represent 228,480 bits, or 28,560 bytes. The interpretation of each dot can be as follows: Black 1 White 0
- Reed-Solomon encoding is preferably chosen for its ability to deal with burst errors and effectively detect and correct errors using a minimum of redundancy.
- Reed Solomon encoding is adequately discussed in the standard texts such as Wicker, S., and Bhargava, V., 1994, Reed-Solomon Codes and their Applications, EEEE Press. Rorabaugh, C, 1996, Error Coding Cookbook, McGraw-Hill. Lyppens, H., 1997, Reed-Solomon Error Correction, Dr. Dobb's Journal, January 1997 (Volume 22, Issue 1).
- Reed-Solomon encoding can be used, including different symbol sizes and different levels of redundancy.
- the following encoding parameters are used:
- n 255 bytes (2 8 -1 symbols).
- 2t symbols in the final block size must be taken up with redundancy symbols.
- the practical result is that 127 bytes of original data are encoded to become a 255-byte block of Reed-Solomon encoded data.
- the encoded 255-byte blocks are stored on the alternative Artcard and later decoded back to the original 127 bytes again by the alternative Artcard reader.
- the 384 dots in a single column of a data block's data region can hold 48 bytes (384/8). 595 of these columns can hold 28,560 bytes. This amounts to 112 Reed-Solomon blocks (each block having 255 bytes).
- the 64 data blocks of a complete alternative Artcard can hold a total of 7168 Reed-Solomon blocks (1,827,840 bytes, at 255 bytes per Reed-Solomon block).
- FIG. 27 illustrates the overall form of encoding utilised.
- Each of the 2 Control blocks 1132 , 1133 contain the same encoded information required for decoding the remaining 7,166 Reed-Solomon blocks:
- Each control block is then Reed-Solomon encoded, turning the 127 bytes of control information into 255 bytes of Reed-Solomon encoded data.
- the Control Block is stored twice to give greater chance of it surviving.
- the repetition of the data within the Control Block has particular significance when using Reed-Solomon encoding.
- the first 127 bytes of data are exactly the original data, and can be looked at in an attempt to recover the original message if the Control Block fails decoding (more than 64 symbols are corrupted).
- the Control Block fails decoding it is possible to examine sets of 3 bytes in an effort to determine the most likely values for the 2 decoding parameters. It is not guaranteed to be recoverable, but it has a better chance through redundancy.
- the last 159 bytes of the Control Block are destroyed, and the first 96 bytes are perfectly ok. Looking at the first 96 bytes will show a repeating set of numbers. These numbers can be sensibly used to decode the remainder of the message in the remaining 7,166 Reed-Solomon blocks.
- the alternative Artcard would consist of 7,168 Reed-Solomon blocks.
- the first 2 blocks would be Control Blocks
- the next 79 would be the encoded data
- the next 79 would be a duplicate of the encoded data
- the next 79 would be another duplicate of the encoded data, and so on.
- the remaining 56 Reed-Solomon blocks would be another duplicate of the first 56 blocks from the 79 blocks of encoded data (the final 23 blocks of encoded data would not be stored again as there is not enough room on the alternative Artcard).
- a hex representation of the 127 bytes in each Control Block data before being Reed-Solomon encoded would be as illustrated in FIG. 28 .
- a maximum 1,827,840 bytes of data can be stored on the alternative Artcard (2 Control Blocks and 7,166 information blocks, totalling 7,168 Reed-Solomon encoded blocks).
- the data is not directly stored onto the alternative Artcard at this stage however, or all 255 bytes of one Reed-Solomon block will be physically together on the card. Any dirt, grime, or stain that causes physical damage to the card has the potential of damaging more than 64 bytes in a single Reed-Solomon block, which would make that block unrecoverable. If there are no duplicates of that Reed-Solomon block, then the entire alternative Artcard cannot be decoded.
- the solution is to take advantage of the fact that there are a large number of bytes on the alternative Artcard, and that the alternative Artcard has a reasonable physical size.
- the data can therefore be scrambled to ensure that symbols from a single Reed-Solomon block are not in close proximity to one another.
- pathological cases of card degradation can cause Reed-Solomon blocks to be unrecoverable, but on average, the scrambling of data makes the card much more robust.
- the scrambling scheme chosen is simple and is illustrated schematically in FIG. 29 . All the Byte 0 s from each Reed-Solomon block are-placed together 1136 , then all the Byte 1 s etc. There will therefore be 7,168 byte 0 's, then 7,168 B etc.
- Each data block on the alternative Artcard can store 28,560 bytes. Consequently there are approximately 4 bytes from each Reed-Solomon block in each of the 64 data blocks on the alternative Artcard.
- the data is simply written out to the alternative Artcard data blocks so that the first data block contains the first 28,560 bytes of the scrambled data, the second data block contains the next 28,560 bytes etc.
- the data is written out column-wise left to right.
- the left-most column within a data block contains the first 48 bytes of the 28,560 bytes of scrambled data
- the last column contains the last 48 bytes of the 28,560 bytes of scrambled data.
- bytes are written out top to bottom, one bit at a time, starting from bit 7 and finishing with bit 0 . If the bit is set (1), a black dot is placed on the alternative Artcard, if the clear (0), no dot is placed, leaving it the white background color of the card.
- a set of 1,827,840 bytes of data can be created by scrambling 7,168 Reed-Solomon encoded blocks to be stored onto an alternative Artcard.
- the first 28,560 bytes of data are written to the first data block.
- the first 48 bytes of the first 28,560 bytes are written to the first column of the data block, the next 48 bytes to the next column and so on.
- the first two bytes of the 28,560 bytes are hex D3 5F. Those first two bytes will be stored in column 0 of the data block.
- Bit 7 of byte 0 will be stored first, then bit 6 and so on.
- Bit 7 of byte 1 will be stored through to Since each “1” is stored as a black dot, and each “0” as a white dot, these two bytes will be represented on the alternative Artcard as the following set of dots:
- This section deals with extracting the original data from an alternative Artcard in an accurate and robust manner. Specifically, it assumes the alternative Artcard format as described in the previous chapter, and describes a method of extracting the original pre-encoded data from the alternative Artcard.
- an alternative Artcard is to store data for use in different applications.
- a user inserts an alternative Artcard into an alternative Artcard reader, and expects the data to be loaded in a “reasonable time”.
- a motor transport moves the alternative Artcard into an alternative Artcard reader. This is not perceived as a problematic delay, since the alternative Artcard is in motion. Any time after the alternative Artcard has stopped is perceived as a delay, and should be minimized in any alternative Artcard reading scheme. Ideally, the entire alternative Artcard would be read while in motion, and thus there would be no perceived delay after the card had stopped moving.
- a reasonable time for an alternative Artcard to be physically loaded is defined to be 1.5 seconds. There should be a minimization of time for additional decoding after the alternative Artcard has stopped moving. Since the Active region of an alternative Artcard covers most of the alternative Artcard surface we can limit our timing concerns to that region.
- the dots on an alternative Artcard must be sampled by a CCD reader or the like at least at double the printed resolution to satisfy Nyquist's Theorem. In practice it is better to sample at a higher rate than this.
- dots are preferably sampled at 3 times their printed resolution in each dimension, requiring 9 pixels to define a single dot If the resolution of the alternative Artcard dots is 1600 dpi, the alternative Artcard reader's image sensor must scan pixels at 4800 dpi. Of course if a dot is not exactly aligned with the sampling sensor, the worst and most likely case as illustrated in FIG. 31 , is that a dot will be sensed over a 4 ⁇ 4 pixel area.
- Each sampled pixel is 1 byte (8 bits). The lowest 2 bits of each pixel can contain significant noise. Decoding algorithms must therefore be noise tolerant.
- this angle of rotation is a maximum of 1 degree. There can be some slight aberrations in angle due to jitter and motor rumble during the reading process, but these are assumed to essentially stay within the 1-degree limit.
- the length of the CCD itself must accommodate:
- the actual amount of memory required for reading and decoding an alternative Artcard is twice the amount of space required to hold the encoded data, together with a small amount of scratch space (1-2 KB). For the 1600 dpi alternative Artcard, this implies a 4 MB memory requirement.
- the actual usage of the memory is detailed in the following algorithm description.
- a standard Rambus Direct RDRAM architecture is assumed, as defined in Rambus Inc, October 1997, Direct Rambus Technology Disclosure, with a peak data transfer rate of 1.6 GB/sec. Assuming 75% efficiency (easily achieved), we have an average of 1.2 GB/sec data transfer rate. The average time to access a block of 16 bytes is therefore 12 ns.
- Alternative Artcards Physically damaged alternative Artcards can be inserted into a reader.
- Alternative Artcards may be scratched, or be stained with grime or dirt.
- a alternative Artcard reader can't assume to read everything perfectly. The effect of dirty data is made worse by blurring, as the dirty data affects the surrounding clean dots.
- FIG. 33 is a schematic illustration of the overlapping of sensed data.
- Black and white dots were chosen for alternative Artcards to give the best dynamic range in blurry reading environments. Blurring can cause problems in attempting to determine whether a given dot is black or white.
- FIG. 34 shows the distribution of resultant center dot values for black and white dots.
- the diagram is intended to be a representative blurring.
- the curve 1140 from 0 to around 180 shows the range of black dots.
- the curve 1141 from 75 to 250 shows the range of white dots.
- a pixel value at the center point of intersection is ambiguous—the dot is equally likely to be a black or a white.
- FIG. 34 is a graph of number predicted number of alternative Artcard Reed-Solomon blocks that cannot be recovered given a particular symbol error rate. Notice how the Reed-Solomon decoding scheme performs well and then substantially degrades. If there is no Reed-Solomon block duplication, then only 1 block needs to be in error for the data to be unrecoverable. Of course, with block duplication the chance of an alternative Artcard decoding increases.
- FIG. 35 only illustrates the symbol (byte) errors corresponding to the number of Reed-Solomon blocks in error.
- the amount of blurring that can be coped with compared to the amount of damage that has been done to a card. Since all error detection and correction is performed by a Reed-Solomon decoder, there is a finite number of errors per Reed-Solomon data block that can be coped with. The more errors introduced through blurring, the fewer the number of errors that can be coped with due to alternative Artcard damage.
- a motor transport ideally carries the alternative Artcard past a monochrome linear CCD image sensor.
- the card is sampled in each dimension at three times the printed resolution.
- Alternative Artcard reading hardware and software compensate for rotation up to 1 degree, jitter and vibration due to the motor transport, and blurring due to variations in alternative Artcard to CCD distance.
- a digital bit image of the data is extracted from the sampled image by a complex method described here.
- Reed-Solomon decoding corrects arbitrarily distributed data corruption of up to 25% of the raw data on the alternative Artcard Approximately 1 MB of corrected data is extracted from a 1600 dpi card.
- the decoding process requires the following steps:
- the rotation and unscrambling of the bit image cannot occur until the whole bit image has been extracted. It is therefore necessary to assign a memory region to hold the extracted bit image.
- the bit image fits easily within 2 MB, leaving 2 MB for use in the extraction process.
- the time taken for Phase 1 is 1.5 seconds, since this is the time taken for the alternative Artcard to travel past the CCD and physically load.
- Phase 2 has no real-time requirements, in that the alternative Artcard has stopped moving, and we are only concerned with the user's perception of elapsed time. Phase 2 therefore involves the remaining tasks of decoding an alternative Artcard:
- the input to Phase 2 is the 2 MB bit image buffer. Unscrambling and rotating cannot be performed in situ, so a second 2 MB buffer is required. The 2 MB buffer used to hold scanned pixels in Phase 1 is no longer required and can be used to store the rotated unscrambled data.
- the Reed-Solomon decoding task takes the unscrambled bit image and decodes it to 910,082 bytes.
- the decoding can be performed in situ, or to a specified location elsewhere. The decoding process does not require any additional memory buffers.
- the 4 MB memory is therefore used as follows:
- Phase 2 The time taken for Phase 2 is hardware dependent and is bound by the time taken for Reed-Solomon decoding. Using a dedicated core such as LSI Logic's L64712, or an equivalent CPU/DSP combination, it is estimated that Phase 2 would take 0.32 seconds.
- Phase 1 can be divided into 2 asynchronous process streams.
- the first of these streams is simply the real-time reader of alternative Artcard pixels from the CCD, writing the pixels to DRAM.
- the second stream involves looking at the pixels, and extracting the bits.
- the second process stream is itself divided into 2 processes.
- the first process is a global process, concerned with locating the start of the alternative Artcard.
- the second process is the bit image extraction proper.
- FIG. 38 illustrates the data flow from a data/process perspective.
- the CCD scans the alternative Artcard at 4800 dpi, and generates 11,000 1-byte pixel samples per column. This process simply takes the data from the CCD and writes it to DRAM, completely independently of any other process that is reading the pixel data from DRAM.
- FIG. 39 illustrates the steps involved.
- the pixels are written contiguously to a 2 MB buffer that can hold 190 full columns of pixels.
- the buffer always holds the 190 columns most recently read. Consequently, any process that wants to read the pixel data (such as Processes 2 and 3 ) must firstly know where to look for a given column, and secondly, be fast enough to ensure that the data required is actually in the buffer.
- Process 1 makes the current scanline number (CurrentScanLine) available to other processes so they can ensure they are not attempting to access pixels from scanlines that have not been read yet.
- Process 1 therefore uses just under 9% of the available DRAM bandwidth (8256/92296).
- This process is concerned with locating the Active Area on a scanned alternative Artcard.
- the input to this stage is the pixel data from DRAM (placed there by Process 1 ).
- the output is a set of bounds for the first 8 data blocks on the alternative Artcard, required as input to Process 3 .
- a high level overview of the process can be seen in FIG. 40 .
- An alternative Artcard can have vertical slop of 1 mm upon insertion. With a rotation of 1 degree there is further vertical slop of 1.5 mm (86 sin 1°). Consequently there is a total vertical slop of 2.5 mm. At 1600 dpi, this equates to a slop of approximately 160 dots. Since a single data block is only 394 dots high, the slop is just under half a data block. To get a better estimate of where the data blocks are located the alternative Artcard itself needs to be detected.
- Process 2 therefore consists of two parts:
- the scanned pixels outside the alternative Artcard area are black (the surface can be black plastic or some other non-reflective surface).
- the ProcessColumn function is simple. Pixels from two areas of the scanned column are passed through a threshold filter to determine if they are black or white. It is possible to then wait for a certain number of white pixels and announce the start of the alternative Artcard once the given number has been detected.
- the logic of processing a pixel column is shown in the following pseudocode. 0 is returned if the alternative Artcard has not been detected during the column. Otherwise the pixel number of the detected location is returned.
- the second step of Process 2 determines which was detected and sets the data block bounds for Phase 3 appropriately.
- each data block has a StartPixel and an EndPixel to determine where to look for targets in order to locate the data block's data region.
- the pixel value is in the upper half of the card, it is possible to simply use that as the first StartPixel bounds. If the pixel value is in the lower half of the card, it is possible to move back so that the pixel value is the last segment's EndPixel bounds. We step forwards or backwards by the alternative Artcard data size, and thus set up each segment with appropriate bounds. We are now ready to begin extracting data from the alternative Artcard.
- the MaxPixel value is defined in Process 3 , and the SetBounds function simply sets StartPixel and EndPixel clipping with respect to 0 and MaxPixel.
- This process is concerned with extracting the bit data from the CCD pixel data.
- the process essentially creates a bit-image from the pixel data, based on scratch information created by Process 2 , and maintained by Process 3 .
- a high level overview of the process can be seen in FIG. 41 .
- Process 3 Rather than simply read an alternative Artcard's pixel column and determine what pixels belong to what data block, Process 3 works the other way around. It knows where to look for the pixels of a given data block. It does this by dividing a logical alternative Artcard into 8 segments, each containing 8 data blocks as shown in FIG. 42 .
- the segments as shown match the logical alternative Artcard. Physically, the alternative Artcard is likely to be rotated by some amount. The segments remain locked to the logical alternative Artcard structure, and hence are rotation-independent. A given segment can have one of two states:
- the process is complete when all 64 data blocks have been extracted, 8 from each region.
- Each data block consists of 595 columns of data, each with 48 bytes.
- the 2 orientation columns for the data block are each extracted at 48 bytes each, giving a total of 28,656 bytes extracted per data block.
- the nth data block for a given segment is stored at the location: StartBuffer+(256 k*n) Data Structure for Segments
- Each of the 8 segments has an associated data structure.
- the data structure defining each segment is stored in the scratch data area.
- the structure can be as set out in the following table: DataName Comment CurrentState Defines the current state of the segment. Can be one of: LookingForTargets ExtractingBitImage Initial value is LookingForTargets Used during LookingForTargets: StartPixel Upper pixel bound of segment. Initially set by Process 2. EndPixel Lower pixel bound of segment. Initially set by Process 2 MaxPixel The maximum pixel number for any scanline. It is set to the same value for each segment: 10,866. CurrentColumn Pixel column we're up to while looking for targets. FinalColumn Defines the last pixel column to look in for targets.
- Process 3 simply iterates through each of the segments, performing a single line of processing depending on the segment's current state.
- Process 3 must be halted by an external controlling process if it has not terminated after a specified amount of time. This will only be the case if the data cannot be extracted. A simple mechanism is to start a countdown after Process 1 has finished reading the alternative Artcard. If Process 3 has not finished by that time, the data from the alternative Artcard cannot be recovered.
- Targets are detected by reading columns of pixels, one pixel-column at a time rather than by detecting dots within a given band of pixels (between StartPixel and EndPixel) certain patterns of pixels are detected.
- the pixel columns are processed one at a time until either all the targets are found, or until a specified number of columns have been processed. At that time the targets can be processed and the data area located via clockmarks.
- the state is changed to ExtractingBitImage to signify that the data is now to be extracted. If enough valid targets are not located, then the data block is ignored, skipping to a column definitely within the missed data block, and then beginning again the process of looking for the targets in the next data block.
- Each pixel column is processed within the specified bounds (between StartPixel and EndPixel) to search for certain patterns of pixels which will identify the targets.
- the structure of a single target (target number 2 ) is as previously shown in FIG. 23 :
- a target can be identified by:
- the pixels 1150 from each column are passed through a filter 1151 to detect black or white, and then run length encoded 1152 .
- the run-lengths are then passed to a state machine 1153 that has access to the last 3 run lengths and the 4th last color. Based on these values, possible targets pass through e of the identification stages.
- the GatherMin&Max process 1155 simply keeps the minimum & maximum pixel values encountered during the processing of the segment. These are used once the targets have been located to set BlackMax, WhiteMin, and MidRange values.
- Each segment keeps a set of target structures in its search for targets. While the target structures themselves don't move around in memory, several segment variables point to lists of pointers to these target structures. The three pointer lists are repeated here: LocatedTargets Points to a set of Target structures that represent located targets. PossibleTargets Points to a set of pointers to Target structures that represent currently investigated pixel shapes that may be targets. AvailableTargets Points to a set of pointers to Target structures that are currently unused.
- TargetsFound PossibleTargetCount
- AvailableTargetCount AvailableTargetCount
- TargetsFound and PossibleTargetCount are set to 0, and AvailableTargetCount is set to 28 (the maximum number of target structures possible to have under investigation since the minimum size of a target border is 40 pixels, and the data area is approximately 1152 pixels).
- AvailableTargetCount is set to 28 (the maximum number of target structures possible to have under investigation since the minimum size of a target border is 40 pixels, and the data area is approximately 1152 pixels).
- An example of the target pointer layout is as illustrated in FIG. 44 .
- the target data structure is updated, and the pointer to the structure is added to the PossibleTargets list 1158 .
- a target is completely verified, it is added to the LocatedTargets list 1159 . If a possible target is found not to be a target after all, it is placed back onto the AvailableTargets list 1157 . Consequently there are always 28 target pointers in circulation at any time, moving between the lists.
- the Target data structure 1160 can have the following form: DataName Comment CurrentState The current state of the target search DetectCount Counts how long a target has been in a given state StartPixel Where does the target start? All the lines of pixels in this target should start within a tolerance of this pixel value. TargetNumber Which target number is this (according to what was read) Column Best estimate of the target's center column ordinate Pixel Best estimate of the target's center pixel ordinate
- the ProcessPixelColumn function within the find targets module 1162 goes through all the run lengths one by one, comparing the runs against existing possible targets (via StartPixel), or creating new possible targets if a potential target is found where none was previously known. In all cases, the comparison is only made if S 0 .color is white and S 1 .color is black.
- AddToTarget is a function within the find targets module that determines whether it is possible or not to add the specific run to the given target:
- the EvaluateState procedure takes action depending on the current state and the run type.
- the located targets (in the LocatedTargets list) are stored in the order they were located. Depending on alternative Artcard rotation these targets will be in ascending pixel order or descending pixel order. In addition, the target numbers recovered from the targets may be in error. We may have also have recovered a false target. Before the clockmark estimates can be obtained, the targets need to be processed to ensure that invalid targets are discarded, and valid targets have target numbers fixed if in error (e.g. a damaged target number due to dirt). Two main steps are involved:
- the first step is simple.
- the nature of the target retrieval means that the data should already be sorted in either ascending pixel or descending pixel.
- a simple swap sort ensures that if the 6 targets are already sorted correctly a maximum of 14 comparisons is made with no swaps. If the data is not sorted, 14 comparisons are made, with 3 swaps.
- Locating and fixing erroneous target numbers is only slightly more complex.
- each of the N targets found is assumed to be correct.
- the other targets are compared to this “correct” target and the number of targets that require change should target N be correct is counted. If the number of changes is 0, then all the targets must already be correct. Otherwise the target that requires the fewest changes to the others is used as the base for change.
- a change is registered if a given target's target number and pixel position do not correlate when compared to the “correct” target's pixel position and target number.
- the change may mean updating a target's target number, or it may mean elimination of the target. It is possible to assume that ascending targets have pixels in ascending order (since they have already been sorted).
- the LocatedTargets list needs to be compacted and all NULL targets removed.
- the upper region's first clockmark dot 1126 is 55 dots away from the center of the first target 1124 (which is the same as the distance between target centers).
- the center of the clockmark dots is a further 1 dot away, and the black border line 1123 is a further 4 dots away from the first clockmark dot
- the lower region's first clockmark dot is exactly 7 targets-distance away (7 ⁇ 55 dots) from the upper region's first clockmark dot 1126 .
- Targets 1 and 6 have been located, so it is necessary to use the upper-most and lower-most targets, and use the target numbers to determine which targets are being used. It is necessary at least 2 targets at this point.
- the target centers are only estimates of the actual target centers. It is to locate the target center more accurately. The center of a target is white, surrounded by black. We therefore want to find the local maximum in both pixel & column dimensions. This involves reconstructing the continuous image since the maximum is unlikely to be aligned exactly on an integer boundary (our estimate).
- the existing target centers actually are the top left coordinate of the bounding box of the target center. It is a simple process to go through each of the pixels for the area defining the center of the target, and find the pixel with the highest value. There may be more than one pixel with the same maximum pixel value, but the estimate of the center value only requires one pixel.
- the target center coordinates point to the whitest pixel of the target, which should be within one pixel of the actual center.
- the process of building a more accurate position for the target center involves reconstructing the continuous signal for 7 scanline slices of the target, 3 to either side of the estimated target center.
- the 7 maximum values found are then used to reconstruct a continuous signal in the column dimension and thus to locate the maximum value in that dimension.
- FindMax is a function that reconstructs the original 1 dimensional signal based sample points and returns the position of the maximum as well as the maximum value found.
- the method of signal reconstruction/resampling used is the Lanczos3 windowed sinc function as shown in FIG. 45 .
- the Lanczos3 windowed sinc function takes 7 (pixel) samples from the dimension being reconstructed, centered around the estimated position x, i.e. at X ⁇ 3, X ⁇ 2, X ⁇ 1, X, X+1, X+2, X+3.
- LowerClock.pixel UpperClock.pixel ((TARGETS_PER_BLOCK+1) * deltaPixel)
- LowerClock.column UpperClock.column ((TARGETS_PER_BLOCK+1) * deltaColumn)
- the ExtractingBitImage state is one where the data block has already been accurately located via the targets, and bit data is currently being extracted one dot column at a time and written to the alternative Artcard bit image.
- the following of data block clockmarks/borders gives accurate dot recovery regardless of rotation, and thus the segment bounds are ignored.
- Processing a given dot column involves two tasks:
- FIG. 46 illustrates an example data block's top left which corner reveals that there are clockmarks 3 dots high 1166 extending out to the target area, a white row, and then a black border line.
- an estimation of the center of the first black clockmark position is provided (based on the target positions).
- the clockmark estimate is taken and by looking at the pixel data in its vicinity, the continuous signal is reconstructed and the exact center is determined. Since we have broken out the two dimensions into a clockmark and border, this is a simple one-dimensional process that needs to be performed twice. However, this is only done every second dot column, when there is a black clockmark to register against. For the white clockmarks we simply use the estimate and leave it at that Alternatively, we could update the pixel coordinate based on the border each dot column (since it is always present). In practice it is sufficient to update both ordinates every other column (with the black clockmarks) since the resolution being worked at is so fine.
- DetermineAccurateUpperDotCenter is implemented via the following pseudocode: // Use the estimated pixel position of // the border to determine where to look for // a more accurate clockmark center.
- the clockmark // is 3 dots high so even if the estimated position // of the border is wrong, it won't affect the // fixing of the clockmark position.
- GetAccuratePixel and GetAccurateColumn are functions that determine an accurate dot center given a coordinate, but only from the perspective of a single dimension. Determining accurate dot centers is a process of signal reconstruction and then finding the location where the minimum signal value is found (this is different to locating a target center, which is locating the maximum value of the signal since the target center is white, not black).
- the method chosen for signal reconstruction/resampling for this application is the Lanczos3 windowed sinc function as previously discussed with reference to FIG. 45 .
- the clockmark or border has been damaged in some way—perhaps it has been scratched. If the new center value retrieved by the resampling differs from the estimate by more than a tolerance amount, the center value is only moved by the maximum tolerance. If it is an invalid position, it should be close enough to use for data retrieval, and future clockmarks will resynchronize the position.
- the first thing to do is calculate the deltas for the dot column. This is achieved simply by subtracting the UpperClock from the LowerClock, and then dividing by the number of dots between the two points. It is possible to actually multiply by the inverse of the number of dots since it is constant for an alternative Artcard, and multiplying is faster. It is possible to use different constants for obtaining the deltas in pixel and column dimensions.
- the delta in pixels is the distance between the two borders, while the delta in columns is between the centers of the two clockmarks.
- DetermineDataInfo is two parts.
- kDeltaColumnFactor 1/([DOTS_PER_DATA_COLUMN+2+2 ⁇ 1)
- the variable CurrentDot points is determined to the center of the first dot of the current column.
- DataDelta 2 additions: 1 for the column ordinate, the other for the pixel ordinate.
- a sample of the dot at the given coordinate (bi-linear interpolation) is taken, and a pixel value representing the center of the dot is determined.
- the pixel value is then used to determine the bit value for that dot.
- the GetPixel function takes a dot coordinate (fixed point) and samples 4 CCD pixels to arrive at a center pixel value via bilinear interpolation.
- the DetermineCenterDot function takes the pixel values representing the dot centers to either side of the dot whose bit value is being determined, and attempts to intelligently guess the value of that center dot's bit value. From the generalized blurring curve of FIG. 33 there are three common cases to consider:
- the scheme used to determine a dot's value if the pixel value is between BlackMax and WhiteMin is not too complex, but gives good results. It uses the pixel values of the dot centers to the left and right of the dot in question, using their values to help determine a more likely value for the center dot:
- DRAM utilization is specified relative to Process 1 , which writes each pixel once in a consecutive manner, consuming 9% of the DRAM bandwidth.
- the timing as described in this section shows that the DRAM is easily able to cope with the demands of the alternative Artcard Reader algorithm.
- the timing bottleneck will therefore be the implementation of the algorithm in terms of logic speed, not DRAM access.
- the algorithms have been designed however, with simple architectures in mind, requiring a minimum number of logical operations for every memory cycle. From this point of view, as long as the implementation state machine or equivalent CPU/DSP architecture is able to perform as described in the following sub-sections, the target speed will be met.
- Targets are located by reading pixels within the bounds of a pixel column. Each pixel is read once at most Assuming a run-length encoder that operates fast enough, the bounds on the location of targets is memory access. The accesses will therefore be no worse than the timing for Process 1 , which means a 9% utilization of the DRAM bandwidth.
- the total utilization of DRAM during target location (including Process 1 ) is therefore 18%, meaning that the target locator will always be catching up to the alternative Artcard image sensor pixel reader.
- a target is positively identified on the first pixel column after the target number. Since there are 2 dot columns before the orientation column, there are 6 pixel columns.
- the Target Location process effectively uses up the first of the pixel columns, but the remaining 5 pixel columns are not processed at all. Therefore the data area can be located in 2 ⁇ 5 of the time available without impinging on any other process time.
- Extracting the dot information involves only 4 pixel reads per dot (rather than the average 9 that define the dot). Considering the data area of 1152 pixels (384 dots), at best this will save 72 cache reads by only reading 4 pixel dots instead of 9. The worst case is a rotation of 1° which is a single pixel translation every 57 pixels, which gives only slightly worse savings.
- Phase 2 is the non-real-time phase of alternative Artcard data recovery algorithm.
- a bit image has been extracted from the alternative Artcard. It represents the bits read from the data regions of the alternative Artcard. Some of the bits will be in error, and perhaps the entire data is rotated 180° because the alternative Artcard was rotated when inserted.
- Phase 2 is concerned with reliably extracting the original data from this encoded bit image. There are basically 3 steps to be carried out as illustrated in FIG. 48 :
- Each of the 3 steps is defined as a separate process, and performed consecutively, since the output of one is required as the input to the next It is straightforward to combine the first two steps into a single process, but for the purposes of clarity, they are treated separately here.
- Phase 2 has the structure as illustrated in FIG. 49 .
- Processes 1 and 2 are likely to be negligible, consuming less than 1/1000 th of a second between them.
- Process 3 (Reed Solomon decode) consumes approximately 0.32 seconds, making this the total time required for Phase 2 .
- bit map in DRAM now represents the retrieved data from the alternative Artcard. However the bit image is not contiguous. It is broken into 64 32 k chunks, one chunk for each data block. Each 32 k chunk contains only 28,656 useful bytes:
- the 2 MB buffer used for pixel data (stored by Process 1 of Phase 1 ) can be used to hold the reorganized bit image, since pixel data is not required during Phase 2 . At the end of the reorganization, a correctly oriented contiguous bit image will be in the 2 MB pixel buffer, ready for Reed-Solomon decoding.
- the leftmost Orientation Column will be white and the rightmost Orientation Column will be black. If the card has been rotated 180°, then the leftmost Orientation Column will be black and the rightmost Orientation Column will be white.
- FIG. 49 illustrates the unscrambling process conducted memory
- the algorithm performs the decoding one Reed-Solomon block at a time, and can (if desired) be performed in situ, since the encoded block is larger than the decoded block, and the redundancy bytes are stored after the data bytes.
- the first 2 Reed-Solomon blocks are control blocks, containing information about the size of the data to be extracted from the bit image. This meta-information must be decoded first, and the resultant information used to decode the data proper.
- the decoding of the data proper is simply a case of decoding the data blocks one at a time. Duplicate data blocks can be used if a particular block fails to decode.
- the GetControlData function is straightforward as long as there are no decoding errors.
- the function simply calls DecodeBlock to decode one control block at a time until successful.
- the control parameters can then be extracted from the first 3 bytes of the decoded data (destBlocks is stored in the bytes 0 and 1 , and lastBlock is stored in byte 2 ). If there are decoding errors the function must traverse the 32 sets of 3 bytes and decide which is the most likely set value to be correct.
- One simple method is to find 2 consecutive equal copies of the 3 bytes, and to declare those values the correct ones.
- An alternative method is to count occurrences of the different sets of 3 bytes, and announce the most common occurrence to be the correct one.
- Reed-Solomon decode depends on the implementation. While it is possible to use a dedicated core to perform the Reed-Solomon decoding process (such as LSI Logic's L64712), it is preferable to select a CPU/DSP combination that can be more generally used throughout the embedded system (usually to do something with the decoded data) depending on the application. Of course decoding time must be fast enough with the CPU/DSP combination.
- the L64712 has a throughput of 50 Mbits per second (around 6.25 MB per second), so the time is bound by the speed of the Reed-Solomon decoder rather than the maximum 2 MB read and 1 MB write memory access time.
- the current reading algorithm of the preferred embodiment has the ability to use the surrounding dots in the same column in order to make a better decision about a dot's value. Since the previous column's dots have already been decoded, a previous column dot history could be useful in determining the value of those dots whose pixel values are in the not-sure range.
- a different possibility with regard to the initial stage is to remove it entirely, make the initial bounds of the data blocks larger than necessary and place greater intelligence into the ProcessingTargets functions. This may reduce overall complexity. Care must be taken to maintain data block independence.
- control block mechanism can be made more robust:
- FIG. 51 there is illustrated one form of card reader 500 which allows for the insertion of Artcards 9 for reading.
- FIG. 50 shows an exploded perspective of the reader of FIG. 51 .
- Cardreader is interconnected to a computer system and includes a CCD reading mechanism 35 .
- the cardreader includes pinch rollers 506 , 507 for pinching an inserted Artcard 9 .
- One of the roller e.g. 506 is driven by an Artcard motor 37 for the advancement of the card 9 between the two rollers 506 and a uniformed speed.
- the Artcard 9 is passed over a series of LED lights 512 which are encased within a clear plastic mould 514 having a semi circular cross section.
- the cross section focuses the light from the LEDs eg 512 onto the surface of the card 9 as it passes by the LEDs 512 . From the surface it is reflected to a high resolution linear CCD 34 which is constructed to a resolution of approximately 480 dpi.
- the surface of the Artcard 9 is encoded to the level of approximately 1600 dpi hence, the linear CCD 34 supersamples the Artcard surface with an approximately three times multiplier.
- the Artcard 9 is further driven at a speed such that the linear CCD 34 is able to supersample in the direction of Artcard movement at a rate of approximately 4800 readings per inch.
- the scanned Artcard CCD data is forwarded from the Artcard reader to ACP 31 for processing.
- a sensor 49 which can comprise a light sensor acts to detect of the presence of the card 13 .
- the CCD reader includes a bottom substrate 516 , a top substrate 514 which comprises a transparent molded plastic. In between the two substrates is inserted the linear CCD array 34 which comprises a thin long linear CCD array constructed by means of semi-conductor manufacturing processes.
- FIG. 52 there is illustrated a side perspective view, partly in section, of an example construction of the CCD reader unit.
- the series of LEDs eg. 512 are operated to emit light when a card 9 is passing across the surface of the CCD reader 34 .
- the emitted light is transmitted through a portion of the top substrate 523 .
- the substrate includes a portion eg. 529 having a curved circumference so as to focus light emitted from LED 512 to a point eg. 532 on the surface of the card 9 .
- the focused light is reflected from the point 532 towards the CCD array 34 .
- a series of microlenses eg. 534 shown in exaggerated form, are formed on the surface of the top substrate 523 .
- the microlenses 523 act to focus light received across the surface to the focused down to a point 536 which corresponds to point on the surface of the CCD reader 34 for sensing of light falling on the light sensing portion of the CCD array 34 .
- the sensing devices on the linear CCD 34 may be staggered.
- the corresponding microlenses 34 can also be correspondingly formed as to focus light into a staggered series of spots so as to correspond to the staggered CCD sensors.
- the data surface area of the Artcard 9 is modulated with a checkerboard pattern as previously discussed with reference to FIG. 5 .
- Other forms of high frequency modulation may be possible however.
- an Artcard printer can be provided as for the printing out of data on storage Artcard.
- the Artcard system can be utilized as a general form of information distribution outside of the Artcam device.
- An Artcard printer can prints out Artcards on high quality print surfaces and multiple Artcards can be printed on same sheets and later separated.
- On a second surface of the Artcard 9 can be printed information relating to the files etc. stored on the Artcard 9 for subsequent storage.
- the Artcard system allows for a simplified form of storage which is suitable for use in place of other forms of storage such as CD ROMs, magnetic disks etc.
- the Artcards 9 can also be mass produced and thereby produced in a substantially inexpensive form for redistribution.
- FIG. 54 there is illustrated the print roll 42 and print-head portions of the Artcam.
- the paper/film 611 is fed in a continuous “web-like” process to a printing mechanism 15 which includes further pinch rollers 616 - 619 and a print head 44
- the pinch roller 613 is connected to a drive mechanism (not shown) and upon rotation of the print roller 613 , “paper” in the form of film 611 is forced through the printing mechanism 615 and out of the picture output slot 6 .
- a rotary guillotine mechanism (not shown) is utilised to cut the roll of paper 611 at required photo sizes.
- printer roll 42 is responsible for supplying “paper” 611 to the print mechanism 615 for printing of photographically imaged pictures.
- FIG. 55 there is shown an exploded perspective of the print roll 42 .
- the printer roll 42 includes output printer paper 611 which is output under the operation of pinching rollers 612 , 613 .
- FIG. 56 there is illustrated a more fully exploded perspective view, of the print roll 42 of FIG. 55 without the “paper” film roll.
- the print roll 42 includes three main parts comprising ink reservoir section 620 , paper roll sections 622 , 623 and outer casing sections 626 , 627 .
- the ink reservoir section 620 which includes the ink reservoir or ink supply sections 633 .
- the ink for printing is contained within three bladder type containers 630 - 632 .
- the printer roll 42 is assumed to provide full color output inks.
- a first ink reservoir or bladder container 630 contains cyan colored ink.
- a second reservoir 631 contains magenta colored ink and a third reservoir 632 contains yellow ink.
- Each of the reservoirs 630 - 632 although having different volumetric dimensions, are designed to have substantially the same volumetric size.
- the ink reservoir sections 621 , 633 , in addition to cover 624 can be made of plastic sections and are designed to be mated together by means of heat sealing, ultra violet radiation, etc.
- Each of the equally sized ink reservoirs 630 - 632 is connected to a corresponding ink channel 639 - 641 for allowing the flow of ink from the reservoir 630 - 632 to a corresponding ink output port 635 - 637 .
- the ink reservoirs 630 - 632 can be filled with corresponding ink and the section 633 joined to the section 621 .
- the ink reservoir sections 630 - 632 being collapsible bladders, allow for ink to traverse ink channels 639 - 641 and therefore be in fluid communication with the ink output ports 635 - 637 .
- an air inlet port can also be provided to allow the pressure associated with ink channel reservoirs 630 - 632 to be maintained as required.
- the cap 624 can be joined to the ink reservoir section 620 so as to form a pressurized cavity, accessible by the air pressure inlet port.
- the ink reservoir sections 621 , 633 and 624 are designed to be connected together as an integral unit and to be inserted inside printer roll sections 622 , 623 .
- the printer roll sections 622 , 623 are designed to mate together by means of a snap fit by means of male portions 645 - 647 mating with corresponding female portions (not shown).
- female portions 654 - 656 are designed to mate with corresponding male portions 660 - 662 .
- the paper roll sections 622 , 623 therefore designed to be snapped together.
- One end of the film within the role is pinched between the two sections 622 , 623 when they are joined together. The print film can then be rolled on the print roll sections 622 , 625 as required.
- the ink reservoir sections 620 , 621 , 633 , 624 are designed to be inserted inside the paper roll sections 622 , 623 .
- the printer roll sections 622 , 623 are able to be rotatable around stationery ink reservoir sections 621 , 633 and 624 to dispense film on demand.
- the outer casing sections 626 and 627 are further designed to be coupled around the print roller sections 622 , 623 .
- each end of pinch rollers eg 612 , 613 is designed to clip in to a corresponding cavity eg 670 in cover 626 , 627 with roller 613 being driven externally (not shown) to feed the print film and out of the print roll.
- a cavity 677 can be provided in the ink reservoir sections 620 , 621 for the insertion and gluing of an silicon chip integrated circuit type device 53 for the storage of information associated with the print roll 42 .
- the print roll 42 is designed to be inserted into the Artcam camera device so as to couple with a coupling unit 680 which includes connector pads 681 for providing a connection with the silicon chip 53 .
- the connector 680 includes end connectors of four connecting with ink supply ports 635 - 637 .
- the ink supply ports are in turn to connect to ink supply lines eg 682 which are in turn interconnected to printheads supply ports eg. 687 for the flow of ink to print-head 44 in accordance with requirements.
- the “media” 611 utilised to form the roll can comprise many different materials on which it is designed to print suitable images.
- opaque rollable plastic material may be utilized
- transparencies may be used by using transparent plastic sheets
- metallic printing can take place via utilization of a metallic sheet film.
- fabrics could be utilised within the printer roll 42 for printing images on fabric, although care must be taken that only fabrics having a suitable stiffness or suitable backing material are utilised.
- the print media When the print media is plastic, it can be coated with a layer which fixes and absorbs the ink. Further, several types of print media may be used, for example, opaque white matte, opaque white gloss, transparent film, frosted transparent film, lenticular array film for stereoscopic 3D prints, metallised film, film with the embossed optical variable devices such as gratings or holograms, media which is pre-printed on the reverse side, and media which includes a magnetic recording layer.
- the metallic foil When utilising a metallic foil, the metallic foil can have a polymer base, coated with a thin (several micron) evaporated layer of aluminum or other metal and then coated with a clear protective layer adapted to receive the ink via the ink printer mechanism.
- the print roll 42 is obviously designed to be inserted inside a camera device so as to provide ink and paper for the printing of images on demand.
- the ink output ports 635 - 637 meet with corresponding ports within the camera device and the pinch rollers 672 , 673 are operated to allow the supply of paper to the camera device under the control of the camera device.
- a mounted silicon chip 53 is insert in one end of the print roll 42 .
- the authentication chip 53 is shown in more detail and includes four communications leads 680 - 683 for communicating details from the chip 53 to the corresponding camera to which it is inserted.
- the chip can be separately created by means of encasing a small integrated circuit 687 in epoxy and running bonding leads eg. 688 to the external communications leads 680 - 683 .
- the integrated chip 687 being approximately 400 microns square with a 100 micron scribe boundary. Subsequently, the chip can be glued to an appropriate surface of the cavity of the print roll 42 .
- FIG. 58 there is illustrated the integrated circuit 687 interconnected to bonding pads 681 , 682 in an exploded view of the arrangement of FIG. 57 .
- Artcards can, of course, be used in many other environments. For example ArtCards can be used in both embedded and personal computer (PC) applications, providing a user-friendly interface to large amounts of data or configuration information.
- ArtCards reader can be attached to a PC.
- the applications for PCs are many and varied.
- the simplest application is as a low cost read-only distribution medium. Since ArtCards are printed, they provide an audit trail if used for data distribution within a company.
- FIG. 59 provides for an efficient distribution of information in the forms of books, newspapers, magazines, technical manuals, etc.
- the front side of a ArtCards 80 can show an image that includes an artistic effect to be applied to a sampled image.
- a camera system 81 can be provided which includes a cardreader 82 for reading the programmed data on the back of the card 80 and applying the algorithmic data to a sampled image 83 so as to produce an output image 84 .
- the camera unit 81 including an on board inkjet printer and sufficient processing means for processing the sampled image data.
- BizCard is to store company information on business cards. BizCard is a new concept in company information.
- the front side of a bizCard as illustrated in FIG.
- each bizCard contains a printed array of black and white dots that holds 1-2 megabytes of data about the company. The result is similar to having the storage of a 3.5′′ disk attached to each business card.
- BizCards can be read by any ArtCards reader such as an attached PC card reader, which can be connected to a standard PC by a USB port. BizCards can also be displayed as documents on specific embedded devices. In the case of a PC, a user simply inserts the bizCard into their reader. The bizCard is then preferably navigated just like a web-site using a regular web browser.
- each bizCard can be used to electronically verify that the person is in fact who they claim to be and does actually work for the specified company.
- a bizCard permits simple initiation of secure communications.
- TourCard is an application of the ArtCards which contains information for tourists and visitors to a city.
- information can be in the form of:
- TourCard is a low cost alternative to tourist brochures, guide books and street directories. With a manufacturing cost of just one cent per card, tourCards could be distributed at tourist information centres, hotels and tourist attractions, at a minimum cost, or free if sponsored by advertising. The portability of the bookreader makes it the perfect solution for tourists. TourCards can also be used at information kiosk's, where a computer equipped with the ArtCards reader can decode the information encoded into the tourCard on any web browser.
- the tourCard eliminates the need for separate maps, guide books, timetables and restaurant guides and creates a simple solution for the independent traveller.
- the ArtCards could include a book's contents or a newspaper's contents.
- An example of such a system is as illustrated in FIG. 59 wherein the ArtCards 70 includes a book title on one surface with the second surface having the encoded contents of the book printed thereon.
- the card 70 is inserted in the reader 72 which can include a flexible display 73 which allows for the folding up of card reader 72 .
- the card reader 72 can include display controls 74 which allow for paging forward and back and other controls of the card reader 72 .
Abstract
A data storage device includes a data carrier having at least one planar surface. An array of detectable items is positioned on the planar surface and is detectable with a sensing device. The array is configured to represent a two-dimensional code that defines at least executable instructions and redundancy encoding to impart fault tolerant characteristics to the code. The executable instructions include image processing algorithms.
Description
- The following Australian provisional patent applications are hereby incorporated by cross-reference. For the purposes of location and identification, U.S. patent applications identified by their U.S. patent application Ser. No. (U.S. Ser. No.) are listed alongside the Australian applications from which the US patent applications claim the right of priority.
US PATENT/PATENT CROSS-REFERENCED APPLICATION (CLAIMING AUSTRALIAN PRO- RIGHT OF PRIORITY VISIONAL PATENT FROM AUSTRALIAN PRO- DOCKET APPLICATION NO. VISIONAL APPLICATION) NO. PO7991 09/113,060 ART01 PO8505 09/113,070 ART02 PO7988 09/113,073 ART03 PO9395 6,322,181 ART04 PO8017 09/112,747 ART06 PO8014 09/112,776 ART07 PO8025 09/112,750 ART08 PO8032 09/112,746 ART09 PO7999 09/112,743 ART10 PO7998 09/112,742 ART11 PO8031 09/112,741 ART12 PO8030 6,196,541 ART13 PO7997 6,195,150 ART15 PO7979 09/113,053 ART16 PO8015 09/112,738 ART17 PO7978 09/113,067 ART18 PO7982 09/113,063 ART19 PO7989 09/113,069 ART20 PO8019 09/112,744 ART21 PO7980 6,356,715 ART22 PO8018 09/112,777 ART24 PO7938 09/113,224 ART25 PO8016 6,366,693 ART26 PO8024 09/112,805 ART27 PO7940 09/113,072 ART28 PO7939 09/112,785 ART29 PO8501 6,137,500 ART30 PO8500 09/112,796 ART31 PO7987 09/113,071 ART32 PO8022 09/112,824 ART33 PO8497 09/113,090 ART34 PO8020 09/112,823 ART38 PO8023 09/113,222 ART39 PO8504 09/112,786 ART42 PO8000 09/113,051 ART43 PO7977 09/112,782 ART44 PO7934 09/113,056 ART45 PO7990 09/113,059 ART46 PO8499 09/113,091 ART47 PO8502 09/112,753 ART48 PO7981 6,317,192 ART50 PO7986 09/113,057 ART51 PO7983 09/113,054 ART52 PO8026 09/112,752 ART53 PO8027 09/112,759 ART54 PO8028 09/112,757 ART56 PO9394 09/112,758 ART57 PO9396 09/113,107 ART58 PO9397 6,271,931 ART59 PO9398 6,353,772 ART60 PO9399 6,106,147 ART61 PO9400 09/112,790 ART62 PO9401 6,304,291 ART63 PO9402 09/112,788 ART64 PO9403 6,305,770 ART65 PO9405 6,289,262 ART66 PP0959 6,315,200 ART68 PP1397 6,217,165 ART69 PP2370 09/112,781 DOT01 PP2371 09/113,052 DOT02 PO8003 09/112,834 Fluid01 PO8005 09/113,103 Fluid02 PO9404 09/113,101 Fluid03 PO8066 6,227,652 IJ01 PO8072 6,213,588 IJ02 PO8040 6,213,589 IJ03 PO8071 6,231,163 IJ04 PO8047 6,247,795 IJ05 PO8035 09/113,099 IJ06 PO8044 6,244,691 IJ07 PO8063 6,257,704 IJ08 PO8057 09/112,778 IJ09 PO8056 6,220,694 IJ10 PO8069 6,257,705 IJ11 PO8049 6,247,794 IJ12 PO8036 6,234,610 IJ13 PO8048 6,247,793 IJ14 PO8070 6,264,306 IJ15 PO8067 6,241,342 IJ16 PO8001 6,247,792 IJ17 PO8038 6,264,307 IJ18 PO8033 6,254,220 IJ19 PO8002 6,234,611 IJ20 PO8068 09/112,808 IJ21 PO8062 6,283,582 IJ22 PO8034 6,239,821 IJ23 PO8039 09/113,083 IJ24 PO8041 6,247,796 IJ25 PO8004 09/113,122 IJ26 PO8037 09/112,793 IJ27 PO8043 09/112,794 IJ28 PO8042 09/113,128 IJ29 PO8064 09/113,127 IJ30 PO9389 6,227,653 IJ31 PO9391 6,234,609 IJ32 PP0888 6,238,040 IJ33 PP0891 6,188,415 IJ34 PP0890 6,227,654 IJ35 PP0873 6,209,989 IJ36 PP0993 6,247,791 IJ37 PP0890 09/112,764 IJ38 PP1398 6,217,153 IJ39 PP2592 09/112,767 IJ40 PP2593 6,243,113 IJ41 PP3991 6,283,581 IJ42 PP3987 6,247,790 IJ43 PP3985 6,260,953 IJ44 PP3983 6,267,469 IJ45 PO7935 6,224,780 IJM01 PO7936 6,235,212 IJM02 PO7937 6,280,643 IJM03 PO8061 6,284,147 IJM04 PO8054 6,214,244 IJM05 PO8065 6,071,750 IJM06 PO8055 6,267,905 IJM07 PO8053 6,251,298 IJM08 PO8078 6,258,285 IJM09 PO7933 6,225,138 IJM10 PO7950 6,241,904 IJM11 PO7949 09/113,129 IJM12 PO8060 09/113,124 IJM13 PO8059 6,231,773 IJM14 PO8073 6,190,931 IJM15 PO8076 6,248,249 IJM16 PO8075 09/113,120 IJM17 PO8079 6,241,906 IJM18 PO8050 09/113,116 IJM19 PO8052 6,241,905 IJM20 PO7948 09/113,117 IJM21 PO7951 6,231,772 IJM22 PO8074 6,274,056 IJM23 PO7941 09/113,110 IJM24 PO8077 6,248,248 IJM25 PO8058 09/113,087 IJM26 PO8051 09/113,074 IJM27 PO8045 6,110,754 IJM28 PO7952 09/113,088 IJM29 PO8046 09/112,771 IJM30 PO9390 6,264,849 IJM31 PO9392 6,254,793 IJM32 PP0889 6,235,211 IJM35 PP0887 09/112,801 IJM36 PP0882 6,264,850 IJM37 PP0874 6,258,284 IJM38 PP1396 09/113,098 IJM39 PP3989 6,228,668 IJM40 PP2591 6,180,427 IJM41 PP3990 6,171,875 IJM42 PP3986 6,267,904 IJM43 PP3984 6,245,247 IJM44 PP3982 09/112,835 IJM45 PP0895 6,231,148 IR01 PP0870 09/113,106 IR02 PP0869 09/113,105 IR04 PP0887 09/113,104 IR05 PP0885 6,238,033 IR06 PP0884 09/112,766 IR10 PP0886 6,238,111 IR12 PP0871 09/113,086 IR13 PP0876 09/113,094 IR14 PP0877 09/112,760 IR16 PP0878 6,196,739 IR17 PP0879 09/112,774 IR18 PP0883 6,270,182 IR19 PP0880 6,152,619 IR20 PP0881 09/113,092 IR21 PO8006 6,087,638 MEMS02 PO8007 09/113,093 MEMS03 PO8008 09/113,062 MEMS04 PO8010 6,041,600 MEMS05 PO8011 09/113,082 MEMS06 PO7947 6,067,797 MEMS07 PO7944 09/113,080 MEMS09 PO7946 6,044,646 MEMS10 PO9393 09/113,065 MEMS11 PP0875 09/113,078 MEMS12 PP0894 09/113,075 MEMS13 - Not applicable.
- The present invention relates to a data distribution system and in particular discloses a data distribution mechanism in the form of Dotcards.
- Methods for distribution of data for automatic reading by computer systems are well known. For example, barcodes are often utilised in conjunction with an optical scanner for the distribution of corresponding barcode data. Further, magnetic ink scanning systems have particular application on bank cheques which are automatically scanned and the original data determined from the cheque.
- There is a general need for a print media scanning system that allows for high volumes of computer data to be stored on simple print media, such as a card, and to simultaneously be able to tolerate a high degree of corruption of the data. For example, the form of distribution can suffer a number of data corruption errors when the surface is scanned by a scanning device. The errors can include:
-
- 1. Dead pixel errors which are a result of reading the surface of the card with a linear CCD having a faulty pixel reader for a line thereby producing the same value for all points on the line.
- 2. The system adopted should tolerate writing errors wherein text is written by the owner of the card on the surface. Such text writing errors are ideally tolerated by any scanning system scanning the card.
- 3. Various data errors on the surface of the card may rise and any scuffs or blotches should be tolerated by any system determining the information stored on the surface of the card.
- 4. A certain degree of “play” exists in the insertion of the card into a card reader. This play can comprise a degree of rotation of the card when read by a card reader.
- 5. Further, the card reader is assumed to be driven past a CCD type scanner device by means of an electric motor. The electric motor may experience a degree of fluctuation which will result in fluctuations in the rate of transmission of the data across the surface of the CCD. These motor fluctuation errors should also be tolerated by the data encoding method on the surface of the card.
- 6. The scanner of the surface of the card may experience various device fluctuations such that the intensity of individual pixels may vary. Reader intensity variations should also be accounted for in any system or method implemented in the data contained on the surface of the card.
- Many forms of condensed information storage are well known. For example, in the field of computer devices, it is common to utilize magnetic disc drives which can be of a fixed or portable nature. In respect of portable discs, “Floppy Discs”, “Zip Discs”, and other forms of portable magnetic storage media have achieved a large degree of acceptance on the market place.
- Another form of portable storage is the compact disc “CD” which utilizes a series of elongated pits along a spiral track which is read by a laser beam device. The utilization of Compact Disks provides for an extremely low cost form of storage. However, the technologies involved are quite complex and the use of rewritable CD type devices is extremely limited.
- Other forms of storage include magnetic cards, often utilized for credit cards or the like. These cards normally have a magnetic strip on the back for recording information which is of relevance to the card user. Recently, the convenience of magnetic cards has been extended in the form of SmartCard technology which includes incorporation of integrated circuit type devices on to the card. Unfortunately, the cost of such devices is often high and the complexity of the technology utilized can also be significant.
- It is an object of the present invention to provide for an improved form data distribution.
- According to a first aspect of the invention, there is provided a data storage device which comprises
-
- a data carrier having at least one planar surface; and
- an array of detectable items positioned on the planar surface and detectable with a sensing device, the array being configured to represent a two-dimensional code that defines at least executable instructions and redundancy encoding to impart fault tolerant characteristics to the code, the executable instructions including image processing algorithms.
- The data carrier may be a card such that the array of detectable items are positioned on a first surface of the card and a visual depiction representing the code may be positioned on a second opposite surface of the card.
- The card may be of a plastics material that is coated with a hydrophilic dye-fixing layer.
- The detectable items may be in the form of dots printed on the first surface of the card.
- The redundancy encoding may include reed-solomon fault correction encoding.
- The array of dots may be printed with a 1600 dpi resolution.
- The dots may define at least one target which is detectable by the sensor, the target being associated with at least one data area defined by the dots.
- The targets may be oriented to permit reading of the card in at least two directions.
- In accordance with a second aspect of the present invention, there is provided an identifying card comprising: a first surface carrying human readable information relevant to an owner of the identifying card; and a second, opposed surface carrying encoded information encoded in a highly fault tolerant manner, said encoded information being adapted for sensing by a sensing device and decoded by a computational processor, so as to provide information relevant to the owner in a human readable form, the encoded information comprising an array of dots applied to said second surface; wherein the encoded information comprises spatially distributed redundancy encoded data such that the information is encoded in a highly fault tolerant manner and can be decoded by said processor despite a localized obliteration of the encoded information on the card.
- Notwithstanding any other forms which may fall within the scope of the present invention, preferred forms of the invention will now be described, by way of example only, with reference to the accompanying drawings in which:
-
FIG. 1 illustrates an Artcam device constructed in accordance with the preferred embodiment; -
FIG. 2 is a schematic block diagram of the main Artcam electronic components; -
FIG. 3 illustrates a time line of the process of sampling an Artcard, -
FIG. 4 illustrates the super sampling process; -
FIG. 5 illustrates the process of reading a rotated Artcard; -
FIG. 6 illustrates a flow chart of the steps necessary to decode an Artcard, -
FIG. 7 illustrates an enlargement of the left hand corner of a single Artcard; -
FIG. 8 illustrates a single target for detection; -
FIG. 9 illustrates the method utilised to detect targets; -
FIG. 10 illustrates the method of calculating the distance between two targets; -
FIG. 11 illustrates the process of centroid drift; -
FIG. 12 shows one form of centroid lookup table; -
FIG. 13 illustrates the centroid updating process; -
FIG. 14 illustrates a delta processing lookup table utilised in the preferred embodiment; -
FIG. 15 illustrates the process of unscrambling Artcard data; -
FIG. 16 illustrates a magnified view of a series of dots; -
FIG. 17 illustrates the data surface of a dot card; -
FIG. 18 illustrates schematically the layout of a single datablock; -
FIG. 19 illustrates a single datablock; -
FIG. 20 andFIG. 21 illustrate magnified views of portions of the datablock ofFIG. 19 ; -
FIG. 22 illustrates a single target structure; -
FIG. 23 illustrates the target structure of a datablock; -
FIG. 24 illustrates the positional relationship of targets relative to border clocking regions of a data region; -
FIG. 25 illustrates the orientation columns of a datablock; -
FIG. 26 illustrates the array of dots of a datablock; -
FIG. 27 illustrates schematically the structure of data for Reed-Solomon encoding; -
FIG. 28 illustrates an example Reed-Solomon encoding; -
FIG. 29 illustrates the Reed-Solomon encoding process; -
FIG. 30 illustrates the layout of encoded data within a datablock; -
FIG. 31 illustrates the sampling process in sampling an alternative Artcard; -
FIG. 32 illustrates, in exaggerated form, an example of sampling a rotated alternative Artcard; -
FIG. 33 illustrates the scanning process; -
FIG. 34 illustrates the likely scanning distribution of the scanning process; -
FIG. 35 illustrates the relationship between probability of symbol errors and Reed-Solomon block errors; -
FIG. 36 illustrates a flow chart of the decoding process; -
FIG. 37 illustrates a process utilization diagram of the decoding process; -
FIG. 38 illustrates the dataflow steps in decoding; -
FIG. 39 illustrates the reading process in more detail; -
FIG. 40 illustrates the process of detection of the start of an alternative Artcard in more detail; -
FIG. 41 illustrates the extraction of bit data process in more detail; -
FIG. 42 illustrates the segmentation process utilized in the decoding process; -
FIG. 43 illustrates the decoding process of finding targets in more detail; -
FIG. 44 illustrates the data structures utilized in locating targets; -
FIG. 45 illustrates theLancos 3 function structure; -
FIG. 46 illustrates an enlarged portion of a datablock illustrating the clockmark and border region; -
FIG. 47 illustrates the processing steps in decoding a bit image; -
FIG. 48 illustrates the dataflow steps in decoding a bit image; -
FIG. 49 illustrates the descrambling process of the preferred embodiment; -
FIG. 50 illustrates the process of generating an 8 bit dot output; -
FIG. 51 illustrates a perspective view of the card reader, -
FIG. 52 illustrates an exploded perspective of a card reader; -
FIG. 53 illustrates a close up view of the Artcard reader; -
FIG. 54 illustrates a perspective view of the print roll and print head; -
FIG. 55 illustrates a first exploded perspective view of the print roll; -
FIG. 56 illustrates a second exploded perspective view of the print roll; -
FIG. 57 illustrates the print roll authentication chipFIG. 58 illustrates an enlarged view of the print roll authentication chip; - The digital image processing camera system constructed in accordance with the preferred embodiment is as illustrated in
FIG. 1 . Thecamera unit 1 includes means for the insertion of an integral print roll (not shown). Thecamera unit 1 can include anarea image sensor 2 which sensors animage 3 for captured by the camera. Optionally, the second area image sensor can be provided to also image thescene 3 and to optionally provide for the production of stereographic output effects. - The
camera 1 can include anoptional color display 5 for the display of the image being sensed by thesensor 2. When a simple image is being displayed on thedisplay 5, thebutton 6 can be depressed resulting in the printedimage 8 being output by thecamera unit 1. A series of cards, herein after known as “Artcards” 9 contain, on one surface encoded information and on the other surface, contain an image distorted by the particular effect produced by theArtcard 9. TheArtcard 9 is inserted in anArtcard reader 10 in the side ofcamera 1 and, upon insertion, results inoutput image 8 be distorted in the same manner as the distortion appearing on the surface ofArtcard 9. Hence, by means of this simple user interface a user wishing to produce a particular effect can insert one ofmany Artcards 9 into theArtcard reader 10 and utilizebutton 19 to take a picture of theimage 3 resulting in a correspondingdistorted output image 8. - The
camera unit 1 can also include a number ofother control button LCD output display 15 for the display of informative information including the number of printouts left on the internal print roll on the camera unit. Additionally, different output formats can be controlled byCHP switch 17. - Turning now to
FIG. 2 , there is illustrated a schematic view of the internal hardware of thecamera unit 1. The internal hardware is based around an Artcam central processor unit (ACP) 31. -
Artcam Central Processor 31 - The Artcam
central processor 31 provides many functions which form the ‘heart’ of the system. TheACP 31 is preferably implemented as a complex, high speed, CMOS system on-a-chip. Utilising standard cell design with some full custom regions is recommended. Fabrication on a 0.251 μ CMOS process will provide the density and speed required, along with a reasonably small die area. - The functions provided by the
ACP 31 include: -
- 1. Control and digitization of the
area image sensor 2. A 3D stereoscopic version of the ACP requires two area image sensor interfaces with a secondoptional image sensor 4 being provided for stereoscopic effects. - 2. Area image sensor compensation, reformatting, and image enhancement.
- 3. Memory interface and management to a
memory store 33. - 4. Interface, control, and analog to digital conversion of an Artcard reader
linear image sensor 34 which is provided for the reading of data from theArtcards 9. - 5. Extraction of the raw Artcard data from the digitized and encoded Artcard image.
- 6. Reed-Solomon error detection and correction of the Artcard encoded data. The encoded surface of the
Artcard 9 includes information on how to process an image to produce the effects displayed on the image distorted surface of theArtcard 9. This information is in the form of a script, hereinafter known as a “Vark script”. The Vark script is utilised by an interpreter running within theACP 31 to produce the desired effect. - 7. Interpretation of the Vark script on the
Artcard 9. - 8. Performing image processing operations as specified by the Vark script.
- 9. Controlling various motors for the
paper transport 36,zoom lens 38,autofocus 39 andArtcard driver 37. - 10. Controlling a
guillotine actuator 40 for the operation of aguillotine 41 for the cutting ofphotographs 8 fromprint roll 42. - 11. Half-toning of the image data for printing.
- 12. Providing the print data to a print-
head 44 at the appropriate times. - 13. Controlling the
print head 44. - 14. Controlling the ink pressure feed to print-
head 44. - 15. Controlling
optional flash unit 56. - 16. Reading and acting on various sensors in the camera, including camera orientation sensor 46, autofocus 47 and
Artcard insertion sensor 49. - 17. Reading and acting on the
user interface buttons - 18. Controlling the
status display 15. - 19. Providing viewfinder and preview images to the
color display 5. - 20. Control of the system power consumption, including the ACP power consumption via
power management circuit 51. - 21. Providing
external communications 52 to general purpose computers (using part USB). - 22. Reading and storing information in a printing
roll authentication chip 53. - 23. Reading and storing information in a
camera authentication chip 54. - 24. Communicating with an
optional mini-keyboard 57 for text modification.
Quartz Crystal 58
- 1. Control and digitization of the
- A
quartz crystal 58 is used as a frequency reference for the system clock. As the system clock is very high, theACP 31 includes a phase locked loop clock circuit to increase the frequency derived from thecrystal 58. -
Artcard 9 - The
Artcard 9 is a program storage medium for the Artcam unit. As noted previously, the programs are in the form of Vark scripts. Vark is a powerful image processing language especially developed for the Artcam unit. EachArtcard 9 contains one Vark script, and thereby defines one image processing style. - Preferably, the VARK language is highly image processing specific. By being highly image processing specific, the amount of storage required to store the details on the card are substantially reduced. Further, the ease with which new programs can be created, including enhanced effects, is also substantially increased. Preferably, the language includes facilities for handling many image processing functions including image warping via a warp map, convolution, color lookup tables, posterizing an image, adding noise to an image, image enhancement filters, painting algorithms, brush jittering and manipulation edge detection filters, tiling, illumination via light sources, bump maps, text, face detection and object detection attributes, fonts, including three dimensional fonts, and arbitrary complexity pre-rendered icons. Further details of the operation of the Vark language interpreter are contained hereinafter.
- Hence, by utilizing the language constructs as defined by the created language, new affects on arbitrary images can be created and constructed for inexpensive storage on Artcard and subsequent distribution to camera owners. Further, on one surface of the card can be provided an example illustrating the effect that a particular VARK script, stored on the other surface of the card, will have on an arbitrary captured image.
- By utilizing such a system, camera technology can be distributed without a great fear of obsolescence in that, provided a VARK interpreter is incorporated in the camera device, a device independent scenario is provided whereby the underlying technology can be completely varied over time. Further, the VARK scripts can be updated as new filters are created and distributed in an inexpensive manner, such as via simple cards for card reading.
- The
Artcard 9 is a piece of thin white plastic with the same format as a credit card (86 mm long by 54 mm wide). The Artcard is printed on both sides using a high resolution ink jet printer. The inkjet printer technology is assumed to be the same as that used in the Artcam, with 1600 dpi (63 dpmm) resolution. A major feature of theArtcard 9 is low manufacturing cost Artcards can be manufactured at high speeds as a wide web of plastic film. The plastic web is coated on both sides with a hydrophilic dye fixing layer. The web is printed simultaneously on both sides using a ‘pagewidth’ color ink jet printer. The web is then cut and punched into individual cards. On one face of the card is printed a human readable representation of the effect theArtcard 9 will have on the sensed image. This can be simply a standard image which has been processed using the Vark script stored on the back face of the card. - On the back face of the card is printed an array of dots which can be decoded into the Vark script that defines the image processing sequence. The print area is 80 mm×50 mm, giving a total of 15,876,000 dots. This array of dots could represent at least 1.89 Mbytes of data. To achieve high reliability, extensive error detection and correction is incorporated in the array of dots. This allows a substantial portion of the card to be defaced, worn, creased, or dirty with no effect on data integrity. The data coding used is Reed-Solomon coding, with half of the data devoted to error correction. This allows the storage of 967 Kbytes of error corrected data on each
Artcard 9. -
Linear Image Sensor 34 - The Artcard
linear sensor 34 converts the aforementioned Artcard data image to electrical signals. As with thearea image sensor image sensor 34 is 50 mm, equal to the width of the data array on theArtcard 9. To satisfy Nyquist's sampling theorem, the resolution of thelinear image sensor 34 must be at least twice the highest spatial frequency of the Artcard optical image reaching the image sensor. In practice, data detection is easier if the image sensor resolution is substantially above this. A resolution of 4800 dpi (189 dpmm) is chosen, giving a total of 9,450 pixels. This resolution requires a pixel sensor pitch of 5.3 μm. This can readily be achieved by using four staggered rows of 20 μm pixel sensors. - The linear image sensor is mounted in a special package which includes a
LED 65 to illuminate theArtcard 9 via a light-pipe (not shown). - The Artcard reader light-pipe can be a molded light-pipe which has several function:
-
- 1. It diffuses the light from the LED over the width of the card using total internal reflection facets.
- 2. It focuses the light onto a 16 μm wide strip of the
Artcard 9 using an integrated cylindrical lens. - 3. It focuses light reflected from the Artcard onto the linear image sensor pixels using a molded array of microlenses.
- The operation of the Artcard reader is explained further hereinafter.
-
Artcard Reader Motor 37 - The Artcard reader motor propels the Artcard past the
linear image sensor 34 at a relatively constant rate. As it may not be cost effective to include extreme precision mechanical components in the Artcard reader, themotor 37 is a standard miniature motor geared down to an appropriate speed to drive a pair of rollers which move theArtcard 9. The speed variations, rumble, and other vibrations will affect the raw image data as circuitry within theAPC 31 includes extensive compensation for these effects to reliably read the Artcard data. - The
motor 37 is driven in reverse when the Artcard is to be ejected. -
Artcard Motor Driver 61 - The
Artcard motor driver 61 is a small circuit which amplifies the digital motor control signals from theAPC 31 to levels suitable for driving themotor 37. -
Card Insertion Sensor 49 - The
card insertion sensor 49 is an optical sensor which detects the presence of a card as it is being inserted in thecard reader 34. Upon a signal from thissensor 49, theAPC 31 initiates the card reading process, including the activation of theArtcard reader motor 37. - Card Eject Button 16
- A card eject button 16 (
FIG. 1 ) is used by the user to eject the current Artcard, so that another Artcard can be inserted. TheAPC 31 detects the pressing of the button, and reverses theArtcard reader motor 37 to eject the card. -
Card Status Indicator 66 - A
card status indicator 66 is provided to signal the user as to the status of the Artcard reading process. This can be a standard bi-color (red/green) LED. When the card is successfully read, and data integrity has been verified, the LED lights up green continually. If the card is faulty, then the LED lights up red. - If the camera is powered from a 1.5 V instead of 3 V battery, then the power supply voltage is less than the forward voltage drop of the greed LED, and the LED will not light. In this case, red LEDs can be used, or the LED can be powered from a voltage pump which also powers other circuits in the Artcam which require higher voltage.
- 64
Mbit DRAM 33 - To perform the wide variety of image processing effects, the camera utilizes 8 Mbytes of
memory 33. This can be provided by a single 64 Mbit memory chip. Of course, with changing memory technology increased-Dram storage sizes may be substituted. - High speed access to the memory chip is required. This can be achieved by using a Rambus DRAM (burst access rate of 500 Mbytes per second) or chips using the new open standards such as double data rate (DDR) SDRAM or Synclink DRAM.
- Inserting an Artcard
- When a user inserts an
Artcard 9, theArtcard Sensor 49 detects it notifying the ACP72. This results in the software inserting an ‘Artcard Inserted‘ event into the event queue. When the event is processed several things occur -
- The current Artcard is marked as invalid (as opposed to ‘none’).
- The Print Image is marked as invalid.
- The
Artcard motor 37 is started up to load the Artcard - The Artcard Interface 87 is instructed to read the Artcard
- The Artcard Interface 87 accepts signals from the Artcard scanner
linear CCD 34, detects the bit pattern printed on the card, and corrects errors in the detected bit pattern, producing a valid Artcard data block in DRAM.
Reading Data from the Artcard CCD—General Considerations
- As illustrated in
FIG. 3 , the Data Card reading process has 4 phases operated while the pixel data is read from the card. The phases are as follows: -
-
Phase 1. Detect data area on Artcard -
Phase 2. Detect bit pattern from Artcard based on CCD pixels, and write as bytes. -
Phase 3. Descramble and XOR the byte-pattern -
Phase 4. Decode data (Reed-Solomon decode)
-
- As illustrated in
FIG. 4 , theArtcard 9 must be sampled at least at double the printed resolution to satisfy Nyquist's Theorem. In practice it is better to sample at a higher rate than this. Preferably, the pixels are sampled 230 at 3 times the resolution of a printed dot in each dimension, requiring 9 pixels to define a single dot. Thus if the resolution of theArtcard 9 is 1600 dpi, and the resolution of thesensor 34 is 4800 dpi, then using a 50 mm CCD image sensor results in 9450 column. Therefore if we require 2 MB of dot data (at 9 pixels per dot) then this requires 2 MB*8*9/9450=15,978 columns=approximately 16,000 columns. Of course if a dot is not exactly aligned with the sampling CCD the worst and most likely case is that a dot will be sensed over a 16 pixel area (4×4) 231. - An
Artcard 9 may be slightly warped due to heat damage, slightly rotated (up to, say 1 degree) due to differences in insertion into an Artcard reader, and can have slight differences in true data rate due to fluctuations in the speed of thereader motor 37. These changes will cause columns of data from the card not to be read as corresponding columns of pixel data. As illustrated inFIG. 5 , a 1 degree rotation in theArtcard 9 can cause the pixels from a column on the card to be read as pixels across 166 columns: - Finally, the
Artcard 9 should be read in a reasonable amount of time with respect to the human operator. The data on the Artcard covers most of the Artcard surface, so timing concerns can be limited to the Artcard data itself. A reading time of 1.5 seconds is adequate for Artcard reading. - The Artcard should be loaded in 1.5 seconds. Therefore all 16,000 columns of pixel data must be read from the
CCD 34 in 1.5 second, i.e. 10,667 columns per second. Therefore the time available to read one column is 1/10667 second or 93,747 ns. Pixel data can be written to the DRAM one column at a time, completely independently from any processes that are reading the pixel data. - The time to write one column of data (9450/2 bytes since the reading can be 4 bits per pixel giving 2×4 bit pixels per byte) to DRAM is reduced by using 8 cache lines. If 4 lines were written out at one time, the 4 banks can be written to independently, and thus overlap latency reduced. Thus the 4725 bytes can be written in 11,840ns (4725/128*320 ns). Thus the time taken to write a given column's data to DRAM uses just under 13% of the available bandwidth.
- Decoding an Artcard
- A simple look at the data sizes shows the impossibility of fitting the process into the 8 MB of
memory 33 if the entire Artcard pixel data (140 MB if each bit is read as a 3×3 array) as read by thelinear CCD 34 is kept. For this re reading of the linear CCD, decoding of the bitmap, and the un-bitmap process should take place in real-time (while theArtcard 9 is traveling past the linear CCD 34), and these processes must effectively work without having entire data stores available. - When an
Artcard 9 is inserted, the old stored Print Image and any expanded Photo Image becomes invalid. Thenew Artcard 9 can contain directions for creating a new image based on the currently captured Photo Image. The old Print Image is invalid, and the area holding expanded Photo Image data and image pyramid is invalid, leaving more than 5 MB that can be used as scratch memory during the read process. Strictly speaking, the 1 MB area where the Artcard raw data is to be written can also be used as scratch data during the Artcard read process as long as by the time the final Reed-Solomon decode is to occur, that 1 MB area is free again. The reading process described here does not make use of the extra 1 MB area (except as a final destination for the data). - It should also be noted that the unscrambling process requires two sets of 2 MB areas of memory since unscrambling cannot occur in place. Fortunately the 5 MB scratch area contains enough space for this process.
- Turning now to
FIG. 6 , there is shown aflowchart 220 of the steps necessary to decode the Artcard data. These steps include reading in theArtcard 221, decoding the read data to produce corresponding encoded XORed scrambledbitmap data 223. Next a checkerboard XOR is applied to the data to produces encoded scrambleddata 224. This data is then unscrambled 227 to producedata 225 before this data is subjected to Reed-Solomon decoding to produce the originalraw data 226. Alternatively, unscrambling and XOR process can take place together, not requiring a separate pass of the data. Each of the above steps is discussed in further detail hereinafter. As noted previously with reference toFIG. 6 , the Artcard Interface, therefore, has 4 phases, the first 2 of which are time-critical, and must take place while pixel data is being read from the CCD: -
-
Phase 1. Detect data area on Artcard -
Phase 2. Detect bit pattern from Artcard based on CCD pixels, and write as bytes. -
Phase 3. Descramble and XOR the byte-pattern -
Phase 4. Decode data (Reed-Solomon decode)
-
- The four phases are described in more detail as follows:
-
Phase 1. As theArtcard 9 moves past theCCD 34 the AI must detect the start of the data area by robustly detecting special targets on the Artcard to the left of the data area. If these cannot be detected, the card is marked as invalid. The detection must occur in real-time, while theArtcard 9 is moving past theCCD 34. - If necessary, rotation invariance can be provided. In this case, the targets are repeated on the right side of the Artcard, but relative to the bottom right corner instead of the top corner. In this way the targets end up in the correct orientation if the card is inserted the “wrong” way.
Phase 3 below can be altered to detect the orientation of the data, and account for the potential rotation. -
Phase 2. Once the data area has been determined, the main read process begins, placing pixel data from the CCD into an ‘Artcard data window’, detecting bits from this window, assembling the detected bits into bytes, and constructing a byte-image in DRAM. This must all be done while the Artcard is moving past the CCD. -
Phase 3. Once all the pixels have been read from the Artcard data area, theArtcard motor 37 can be stopped, and the byte image descrambled and XORed. Although not requiring real-time performance, the process should be fast enough not to annoy the human operator. The process must take 2 MB of scrambled bit-image and write the unscrambled/XORed bit-image to a separate 2 MB image. -
Phase 4. The final phase in the Artcard read process is the Reed-Solomon decoding process, where the 2 MB bit-image is decoded into a 1 MB valid Artcard data area. Again, while not requiring real-time performance it is still necessary to decode quickly with regard to the human operator. If the decode process is valid, the card is marked as valid. If the decode failed, any duplicates of data in the bit-image are attempted to be decoded, a process that is repeated until success or until there are no more duplicate images of the data in the bit image. - The four phase process described requires 4.5 MB of DRAM. 2 MB is reserved for
Phase 2 output, and 0.5 MB is reserved for scratch data duringphases phase 1 algorithm, and in the worst case, about 180 columns behindphase 2, comfortably inside the 440 column limit. - A description of the actual operation of each phase will now be provided in greater detail.
-
Phase 1—Detect Data Area on Artcard - This phase is concerned with robustly detecting the left-hand side of the data area on the
Artcard 9. Accurate detection of the data area is achieved by accurate detection of special targets printed on the left side of the card. These targets are especially designed to be easy to detect even if rotated up to 1 degree. - Turning to
FIG. 7 , there is shown an enlargement of the left hand side of anArtcard 9. The side of the card is divided into 16 bands, 239 with a target eg. 241 located at the center of each band. The bands are logical in that there is n line drawn to separate bands. Turning toFIG. 8 , there is shown asingle target 241. Thetarget 241, is a printed black square containing a single white dot. The idea is to detect firstly asmany targets 241 as possible, and then to join at least 8 of the detected white-dot locations into a single logical straight line. If this can be done, the start of the data area 243 is a fixed distance from this logical line. If it cannot be done, then the card is rejected as invalid. - As shown in
FIG. 7 , the height of thecard 9 is 3150 dots. A target (Target0) 241 is placed a fixed distance of 24 dots away from the topleft corner 244 of the data area so that it falls well within the first of 16 equalsized regions 239 of 192 dots (576 pixels) with no target in the final pixel region of the card. Thetarget 241 must be big enough to be easy to detect, yet be small enough not to go outside the height of the region if the card is rotated 1 degree. A suitable size for the target is a 31×31 dot (93×93 sensed pixels)black square 241 with thewhite dot 242. - At the worst rotation of 1 degree, a 1 column shift occurs every 57 pixels. Therefore in a 590 pixel sized band, we cannot place any part of our symbol in the top or bottom 12 pixels or so of the band or they could be detected in the wrong band at CCD read time if the card is worst case rotated.
- Therefore, if the black part of the rectangle is 57 pixels high (19 dots) we can be sure that at least 9.5 black pixels will be read in the same column by the CCD (worst case is half the pixels are in one column and half in the next). To be sure of reading at least 10 black dots in the same column, we must have a height of 20 dots. To give room for erroneous detection on the edge of the start of the black dots, we increase the number of dots to 31, giving us 15 on either side of the white dot at the target's local coordinate (15, 15). 31 dots is 91 pixels, which at most suffers a 3 pixel shift in column, easily within the 576 pixel band.
- Thus each target is a block of 31×31 dots (93×93 pixels) each with the composition:
-
- 15 columns of 31 black dots each (45 pixel width columns of 93 pixels).
- 1 column of 15 black dots (45 pixels) followed by 1 white dot (3 pixels) and then a further 15 black dots (45 pixels)
-
- 15 columns of 31 black dots each (45 pixel width columns of 93 pixels)
Detect targets
- 15 columns of 31 black dots each (45 pixel width columns of 93 pixels)
- Targets are detected by reading columns of pixels, one column at a time rather than by detecting dots. It is necessary to look within a given band for a number of columns consisting of large numbers of contiguous black pixels to build up the left side of a target. Next, it is expected to see a white region in the center of further black columns, and finally the black columns to the left of the target center.
- Eight cache lines are required for good cache performance on the reading of the pixels. Each logical read fills 4 cache lines via 4 sub-reads while the other 4 cache-lines are being used. This effectively uses up 13% of the available DRAM bandwidth.
- As illustrated in
FIG. 9 , the detection mechanism FIFO for detecting the targets uses afilter 245, run-length encoder 246, and aFIFO 247 that requires special wiring of the top 3 elements (S1, S2, and S3) for random access. - The columns of input pixels are processed one at a time until either all the targets are found, or until a specified number of columns have been processed. To process a column, the pixels are read from DRAM, passed through a
filter 245 to detect a 0 or 1, and then run length encoded 246. The bit value and the number of contiguous bits of the same value are placed inFIFO 247. Each entry of theFIFO 249 is in 8 bits, 7bits 250 to hold the run-length, and 1bit 249 to hold the value of the bit detected. - The run-
length encoder 246 only encodes contiguous pixels within a 576 pixel (192 dot) region. - The top 3 elements in the
FIFO 247 can be accessed 252 in any random order. The run lengths (in pixels) of these entries are filtered into 3 values: short, medium, and long in accordance with the following table:Short Used to detect white dot. RunLength < 16 Medium Used to detect runs of 16 <= RunLength < 48 black above or below the white dot in the center of the target. Long Used to detect run lengths RunLength >= 48 of black to the left and right of the center dot in the target. - Looking at the top three entries in the
FIFO 247 there are 3 specific cases of interest:Case 1S1 = white long We have detected a black column S2 = black long of the target to the left of or S3 = white to the right of the white medium/long center dot. Case 2S1 = white long If we've been processing a S2 = black medium series of columns of Case 1s, S3 = white short then we have probably detected Previous 8 columns the white dot in this column. were Case 1We know that the next entry will be black (or it would have been included in the white S3 entry), but the number of black pixels is in question. Need to verify by checking after the next FIFO advance (see Case 3). Case 3Prev = Case 2We have detected part of the S3 = black med white dot. We expect around 3 of these, and then some more columns of Case 1. - Preferably, the following information per region band is kept:
TargetDetected 1 bit BlackDetectCount 4 bits WhiteDetectCount 3 bits PrevColumnStartPixel 15 bits TargetColumn ordinate 16 bits (15:1) TargetRow ordinate 16 bits (15:1) TOTAL 7 bytes (rounded to 8 bytes for easy addressing) - Given a total of 7 bytes. It makes address generation easier if the total is assumed to be 8 bytes. Thus 16 entries requires 16*8=128 bytes, which fits in 4 cache lines. The address range should be inside the scratch 0.5 MB DRAM area since other phases make use of the remaining 4 MB data area.
- When beginning to process a given pixel column, the
register value S2StartPixel 254 is reset to 0. As entries in the FIFO advance from S2 to S1, they are also added 255 to the existing S2StartPixel value, giving the exact pixel position the run currently defined in S2. Looking at each of the 3 cases of interest in the FIFO, S2StartPixel can be used to the start of the black area of a target (Cases 1 and 2), and also the start of the white dot in the center of the target (Case 3). An algorithm for processing columns can be as follows:1 TargetDetected[0-15] := 0 BlackDetectCount[0-15] := 0 WhiteDetectCount[0-15] := 0 TargetRow[0-15] := 0 TargetColumn[0-15] := 0 PrevColStartPixel[0-15] := 0 CurrentColumn := 0 2 Do ProcessColumn 3 CurrentColumn++ 4 If (CurrentColumn <= LastValidColumn) Goto 2 - The steps involved in the processing a column (Process Column) are as follows:
1 S2StartPixel := 0 FIFO := 0 BlackDetectCount := 0 WhiteDetectCount := 0 ThisColumnDetected := FALSE PrevCaseWasCase2 := FALSE 2 If (! TargetDetected[Target]) & (! ColumnDetected[Target]) ProcessCases EndIf 3 PrevCaseWasCase2 := Case=2 4 Advance FIFO - The processing for each of the 3 (Process Cases) cases is as follows:
- Case 1:
BlackDetectCount[target] < 8 {square root} := ABS(S2StartPixel − PrevColStartPixel[Target]) OR If (0<={square root} < 2) WhiteDetectCount[Target] = 0 BlackDetectCount[Target]++ (max value =8) Else BlackDetectCount[Target] := 1 WhiteDetectCount[Target] := 0 EndIf PrevColStartPixel[Target] := S2StartPixel ColumnDetected[Target] := TRUE BitDetected = 1 BlackDetectCount[target] >= 8 PrevColStartPixel[Target] := S2StartPixel WhiteDetectCount[Target] != 0 ColumnDetected[Target] := TRUE BitDetected = 1 TargetDetected[Target] := TRUE TargetColumn[Target] := CurrentColumn − 8 − (WhiteDetectCount[Target]/2)
Case 2: - No special processing is recorded except for setting the ‘PrevCaseWasCase2’ flag for identifying Case 3 (see
Step 3 of processing a column described above) - Case 3:
PrevCaseWasCase2 = TRUE If (WhiteDetectCount[Target] < 2) BlackDetectCount[Target] >= 8 TargetRow[Target] = WhiteDetectCount = 1 S2StartPixel + (S2RunLength/2) EndIf {square root} := ABS(S2StartPixel − PrevColStartPixel[Target]) If(0<={square root} < 2) WhiteDetectCount[Target]++ Else WhiteDetectCount[Target] := 1 EndIf PrevColStartPixel[Target] := S2StartPixel ThisColumnDetected := TRUE BitDetected = 0 - At the end of processing a given column, a comparison is made of the current column to the maximum number of columns for target detection. If the number of columns allowed has been exceeded, then it is necessary to check how many targets have been found. If fewer than 8 have been found, the card is considered invalid.
- Process targets
- After the targets have been detected, they should be processed. All the targets may be available or merely some of them. Some targets may also have been erroneously detected.
- This phase of processing is to determine a mathematical line that passes through the center of as many targets as possible. The more targets that the line passes through, the more confident the target position has been found. The limit is set to be 8 targets. If a line passes through at least 8 targets, then it is taken to be the right one.
- It is all right to take a brute-force but straightforward approach since there is the time to do so (see below), and lowering complexity makes testing easier. It is necessary to determine the line between
targets 0 and 1 (if both targets are considered valid) and then determine how many targets fall on this line. Then we determine the line betweentargets targets targets TargetA := 0 MaxFound := 0 BestLine := 0 While (TargetA < 15) If (TargetA is Valid) TargetB:= TargetA + 1 While (TargetB<= 15) If (TargetB is valid) CurrentLine := line between TargetA and TargetB TargetC := 0; While (TargetC <= 15) If (TargetC valid AND TargetC on line AB) TargetsHit++ EndIf If (TargetsHit > MaxFound) MaxFound := TargetsHit BestLine := CurrentLine EndIf TargetC++ EndWhile EndIf TargetB ++ EndWhile EndIf TargetA++ EndWhile If (MaxFound < 8) Card is Invalid Else Store expected centroids for rows based on BestLine EndIf - As illustrated in
FIG. 3 , in the algorithm above, to determine aCurrentLine 260 fromTarget A 261 and target B, it is necessary to calculate Δrow (264) & Δcolumn (263) betweentargets Target 0 to Target 1 etc. by adding Δrow and Δcolumn. The found (if actually found) location of target N can be compared to the calculated expected position of Target N on the line, and if it falls within the tolerance, then Target N is determined to be on the line. - To calculate Δrow & Δcolumn:
Δrow=(rowTargetA−rowTargetB)/(B−A)
Δcolumn=(columnTargetA−columnTargetB)/(B−A)
Then we calculate the position of Target0:
row=rowTargetA−(A*Δrow)
column=columnTargetA−(A*Δcolumn) - And compare (row, column) against the actual rowTarget0 and columnTarget0. To move from one expected target to the next (e.g. from Target0 to Target1), we simply add Δrow and Δcolumn to row and column respectively. To check if each target is on the line, we must calculate the expected position of Target0, and then perform one add and one comparison for each target ordinate.
- At the end of comparing all 16 targets against a maximum of 90 lines, the result is the best line through the valid targets. If that line passes through at least 8 targets (i.e. MaxFound>=8), it can be said that enough targets have been f to form a line, and thus the card can be processed. If the best line passes through fewer than 8, then the card is considered invalid.
- The resulting algorithm takes 180 divides to calculate Δrow and Δcolumn, 180 multiply/adds to calculate target0 position, and then 2880 adds/comparisons. The time we have to perform this processing is the time taken to read 36 columns of pixel data=3,374,892 ns. Not even accounting for the fact that an add takes less time than a divide, it is necessary to perform 3240 mathematical operations in 3,374,892 ns. That gives approximately 1040 ns per operation, or 104 cycles. The CPU can therefore safely perform the entire processing of targets, reducing complexity of design.
- Update Centroids Based on Data Edge Border and Clockmarks
- Step 0: Locate the Data Area
- From Target 0 (241 of
FIG. 7 ) it is a predetermined fixed distance in rows and columns to the topleft border 244 of the data area, and then a further 1 dot column to the vertical clock marks 276. So we use TargetA, Δrow and Δcolumn found in the previous stage (Δrow and Δcolumn refer to distances between targets) to calculate the centroid or expected location for Target0 as described previously. - Since the fixed pixel offset from Target0 to the data area is related to the distance between targets (192 dots between targets, and 24 dots between Target0 and the data area 243), simply add Δrow/8 to Target0's centroid column coordinate (aspect ratio of dots is 1:1). Thus the top co-ordinate can be defined as:
(columnDotColumnTop=columnTarget0+(Δrow/8)
(rowDotColumnTop=rowTarget 0+(Δcolumn/8) - Next Δrow and Δcolumn are updated to give the number of pixels between dots in a single column (instead of between targets) by dividing them by the number of dots between targets:
Δrow=Δrow/192
Δcolumn=Δcolumn/192 - We also set the currentColumn register (see Phase 2) to be −1 so that after
step 2, whenphase 2 begins, the currentColumn register will increment from −1 to 0. - Step 1: Write Out the Initial Centroid Deltas (Δ) and Bit History
- This simply involves writing setup information required for
Phase 2. - This can be achieved by writing 0s to all the Δrow and Δcolumn entries for each row, and a bit history. The bit history is actually an expected bit history since it is known that to the left of the
clock mark column 276 is aborder column 277, and before that, a white area. The bit history therefore is 011, 010, 011, 010 etc. - Step 2: Update the Centroids Based on Actual Pixels Read.
- The bit history is set up in
Step 1 according to the expected clock marks and data border. The actual centroids for each dot row can now be more accurately set (they were initially 0) by comparing the expected data against the actual pixel values. The centroid updating mechanism is achieved by simply performingstep 3 ofPhase 2. -
Phase 2—Detect Bit Pattern from Artcard Based on Pixels Read, and Write as Bytes. - Since a dot from the
Artcard 9 requires a minimum of 9 sensed pixels over 3 columns to be represented, there is little point in performing dot detection calculations every sensed pixel column. It is better to average the time required for processing over the average dot occurrence, and thus make the most of the available processing time. This allows processing of a column of dots from anArtcard 9 in the time it takes to read 3 columns of data from the Artcard. Although the most likely case is that it takes 4 columns to represent a dot, the 4th column will be the last column of one dot and the first column of a next dot Processing should therefore be limited to only 3 columns. - As the pixels from the CCD are written to the DRAM in 13% of the time available, 83% of the time is available for processing of 1 column of dots i.e. 83% of (93,747*3)=83% of 281,241 ns=233,430 ns.
- In the available time, it is necessary to detect 3150 dots, and write their bit values into the raw data area of memory. The processing therefore requires the following steps:
-
- For each column of dots on the Artcard:
- Step 0: Advance to the next dot column
- Step 1: Detect the top and bottom of an Artcard dot column (check clock marks)
- Step 2: Process the dot column, detecting bits and storing them appropriately
- Step 3: Update the centroids
- Since we are processing the Artcard's logical dot columns, and these may shift over 165 pixels, the worst case is that we cannot process the first column until at least 165 columns have been read into DRAM.
Phase 2 would therefore finish the same amount of time after the read process had terminated. The worst case time is: 165*93,747 ns=15,468,255 ns or 0.015 seconds. - Step 0: Advance to the Next Dot Column
- In order to advance to the next column of dots we add Δrow and Δcolumn to the dotColumnTop to give us the centroid of the dot at the top of the column. The first time we do this, we are currently at the clock marks
column 276 to the left of the bit image data area, and so we advance to the first column of data. Since Δrow and Δcolumn refer to distance between dots within a column, to move between dot columns it is necessary to add Δrow to columndotColumnTop and Δcolumn to rowdotColumnTop. - To keep track of what column number is being processed, the column number is recorded in a register called CurrentColumn. Every time the sensor advances to the next dot column it is necessary to increment the CurrentColumn register. The first time it is incremented, it is incremented from −1 to 0 (see
Step 0 Phase 1). The CurrentColumn register determines when to terminate the read process (when reaching maxColumns), and also is used to advance the DataOut Pointer to the next column of byte information once all 8 bits have been written to the byte (once every 8 dot columns). The lower 3 bits determine what bit we're up to within the current byte. It will be the same bit being written for the whole column. - Step 1: Detect the Top and Bottom of an Artcard Dot Column.
- In order to process a dot column from an Artcard, it is necessary to detect the top and bottom of a column. The column should form a straight line between the top and bottom of the column (except for local warping etc.). Initially dotColumnTop points to the
clock mark column 276. We simply toggle the expected value, write it out into the bit history, and move on to step 2, whose first task will be to add the Δrow and Δcolumn values to dotColumnTop to arrive at the first data dot of the column. - Step 2: Process an Artcard's Dot Column
- Given the centroids of the top and bottom of a column in pixel coordinates the column should form a straight line between them, with possible minor variances due to warping etc.
- Assuming the processing is to start at the top of a column (at the top centroid coordinate) and move down to the bottom of the column, subsequent expected dot centroids are given as:
rownext=row+Δrow
columnnext=column+Δcolumn - This gives us the address of the expected centroid for the next dot of the column. However to account for local warping and error we add another Δrow and Δcolumn based on the last time we found the dot in a given row. In this way we can account for small drifts that accumulate into a maximum drift of some percentage from the straight line joining the top of the column to the bottom.
- We therefore keep 2 values for each row, but store them in separate tables since the row history is used in
step 3 of this phase. -
- Δrow and Δcolumn (2@4 bits each=1 byte)
- row history (3 bits per row, 2 rows are stored per byte)
- For each row we need to read a Δrow and Δcolumn to determine the change to the centroid. The read process takes 5% of the bandwidth and 2 cache lines:
76*(3150/32)+2*31.50=13,824 ns=5% of bandwidth - Once the centroid has been determined, the pixels around the centroid need to be examined to detect the status of the dot and hence the value of the bit. In the worst case a dot covers a 4×4 pixel area. However, thanks to the fact that we are sampling at 3 times the resolution of the dot, the number of pixels required to detect the status of the dot and hence the bit value is much less than this. We only require access to 3 columns of pixel columns at any one time.
- In the worst case of pixel drift due to a 1% rotation, centroids will shift I column every 57 pixel rows, but since a dot is 3 pixels in diameter, a given column will be valid for 171 pixel rows (3*57). As a byte contains 2 pixels, the number of bytes valid in each buffered read (4 cache lines) will be a worst case of 86 (out of 128 read).
- Once the bit has been detected it must be written out to DRAM. We store the bits from 8 columns as a set of contiguous bytes to minimize DRAM delay. Since all the bits from a given dot column will correspond to the next bit position in a data byte, we can read the old value for the byte, shift and OR in the new bit, and write the byte back.
- The read/shift&OR/write process requires 2 cache lines.
- We need to read and write the bit history for the given row as we update it. We only require 3 bits of history per row, allowing the storage of 2 rows of history in a single byte. The read/shift&OR/write process requires 2 cache lines.
- The total bandwidth required for the bit detection and storage is summarised in the following table:
Read centroid Δ 5 % Read 3 columns of pixel data 19% Read/Write detected bits into byte buffer 10% Read/ Write bit history 5 % TOTAL 39%
Detecting a Dot - The process of detecting the value of a dot (and hence the value of a bit) given a centroid is accomplished by examining 3 pixel values and getting the result from a lookup table. The process is fairly simple and is illustrated in
FIG. 11 . Adot 290 has a radius of about 1.5 pixels. Therefore thepixel 291 that holds the centroid, regardless of the actual position of the centroid within that pixel, should be 100% of the dot's value. If the centroid is exactly in the center of thepixel 291, then the pixels above 292 & below 293 the centroid's pixel, as well as the pixels to the left 294 & right 295 of the centroid's pixel will contain a majority of the dot's value. The further a centroid is away from the exact center of thepixel 295, the more likely that more than the center pixel will have 100% coverage by the dot. - Although
FIG. 11 only shows centroids differing to the left and below the center, the same relationship obviously holds for centroids above and to the right of center. center. InCase 1, the centroid is exactly in the center of themiddle pixel 295. Thecenter pixel 295 is completely covered by the dot, and the pixels above, below, left and right are also well covered by the dot. InCase 2, the centroid is to the left of the center of themiddle pixel 291. The center pixel is still completely covered by the dot, and thepixel 294 to the left of the center is now completely covered by the dot. The pixels above 292 and below 293 are still well covered. InCase 3, the centroid is below the center of themiddle pixel 291. Thecenter pixel 291 is still completely covered by thedot 291, and the pixel below center is now completely covered by the dot. The pixels left 294 and right 295 of center are still well covered. InCase 4, the centroid is left and below the center of the middle pixel. Thecenter pixel 291 is still completely covered by the dot, and both the pixel to the left ofcenter 294 and the pixel belowcenter 293 are completely covered by the dot. - The algorithm for updating the centroid uses the distance of the centroid from the center of the
middle pixel 291 in order to select 3 representative pixels and thus decide the value of the dot: -
- Pixel 1: the pixel containing the centroid
- Pixel 2: the pixel to the left of
Pixel 1 if the centroid's X coordinate (column value) is <½, otherwise the pixel to the right ofPixel 1. - Pixel 3: the pixel above
pixel 1 if the centroid's Y coordinate (row value) is <½, otherwise the pixel belowPixel 1.
- As shown in
FIG. 12 , the value of each pixel is output to a pre-calculated lookup table 301. The 3 pixels are fed into a 12-bit lookup table, which outputs a single bit indicating the value of the dot—on or off. The lookup table 301 is constructed at chip definition time, and can be compiled into about 500 gates. The lookup table can be a simple threshold table, with the exception that the center pixel (Pixel 1) is weighted more heavily. - Step 3: Update the Centroid Δs for Each Row in the Column
- The idea of the Δs processing is to use the previous bit history to generate a ‘perfect’ dot at the expected centroid location for each row in a current column. The actual pixels (from the CCD) are compared with the expected ‘perfect’ pixels. If the two match, then the actual centroid location must be exactly in the expected position, so the centroid Δs must be valid and not need updating. Otherwise a process of changing the centroid Δs needs to occur in order to best fit the expected centroid location to the actual data. The new centroid Δs will be used for processing the dot in the next column.
- Updating the centroid Δs is done as a subsequent process from
Step 2 for the following reasons: -
- to reduce complexity in design, so that it can be performed as
Step 2 ofPhase 1 there is enough bandwidth remaining to allow it to allow reuse of DRAM buffers, and - to ensure that all the data required for centroid updating is available at the start of the process without special pipelining.
- to reduce complexity in design, so that it can be performed as
- The centroid Δ are processed as Δcolumn Δrow respectively to reduce complexity.
- Although a given dot is 3 pixels in diameter, it is likely to occur in a 4∴4 pixel area. However the edge of one dot will as a result be in the same pixel as the edge of the next dot. For this reason, centroid updating requires more than simply the information about a given single dot.
-
FIG. 13 shows asingle dot 310 from the previous column with a givencentroid 311. In this example, thedot 310 extend Δ over 4 pixel columns 312-315 and in fact, part of the previous dot column's dot (coordinate=(Prevcolumn, Current Row)) has entered the current column for the dot on the current row. If the dot in the current row and column was white, we would expect therightmost pixel column 314 from the previous dot column to be a low value, since there is only the dot information from the previous column's dot (the current column's dot is white). From this we can see that the higher the pixel value is in thispixel column 315, the more the centroid should be to the right Of course, if the dot to the right was also black, we cannot adjust the centroid as we cannot get information sub-pixel. The same can be said for the dots to the left, above and below the dot at dot coordinates (PrevColumn, CurrentRow). - From this we can say that a maximum of 5 pixel columns and rows are required. It is possible to simplify the situation by taking the cases of row and column centroid Δs separately, treating them as the same problem, only rotated 90 degrees.
- Taking the horizontal case first, it is necessary to change the column centroid Δs if the expected pixels don't match the detected pixels. From the bit history, the value of the bits found for the Current Row in the current dot column the previous dot column, and the (previous-1)th dot column are known. The expected centroid location is also known. Using these two pieces of information, it is possible to generate a 20 bit expected bit pattern should the read be ‘perfect’. The 20 bit bit-pattern represents the expected A values for each of the 5 pixels across the horizontal dimension. The first nibble would represent the rightmost pixel of the leftmost dot. The next 3 nibbles represent the 3 pixels across the center of the
dot 310 from the previous column and the last nibble would be theleftmost pixel 317 of the rightmost dot (from the current column). - If the expected centroid is in the center of the pixel, we would expect a 20 bit pattern based on the following table:
Bit Expected history pixels 000 00000 001 0000D 010 0DFD0 011 0DFDD 100 D0000 101 D000D 110 DDFD0 111 DDFDD - The pixels to the left and right of the center dot are either 0 or D depending on whether the bit was a 0 or 1 respectively. The center three pixels are either 000 or DFD depending on whether the bit was a 0 or 1 respectively. These values are based on the physical area taken by a dot for a given pixel. Depending on the distance of the centroid from the exact center of the pixel, we would expect data shifted slightly, which really only affects the pixels either side of the center pixel. Since there are 16 possibilities, it is possible to divide the distance from the center by 16 and use that amount to shift the expected pixels.
- Once the 20
bit 5 pixel expected value has been determined it can be compared against the actual pixels read. This can proceed by subtracting the expected pixels from the actual pixels read on a pixel by pixel basis, and finally adding the differences together to obtain a distance from the expected Δ values. -
FIG. 14 illustrates one form of implementation of the above algorithm which includes a look up table 320 which receives the bit history 322 and centralfractional component 323 andoutputs 324 the corresponding 20 bit number which subtracted 321 from thecentral pixel input 326 to produce apixel difference 327. - This process is carried out for the expected centroid and once for a shift of the centroid left and right by 1 amount in Δcolumn. The centroid with the smallest difference from the actual pixels is considered to be the ‘winner’ and the Δcolumn updated accordingly (which hopefully is ‘no change’). As a result, a Δcolumn cannot change by more than 1 each dot column.
- The process is repeated for the vertical pixels, and Δrow is consequentially updated.
- There is a large amount of scope here for parallelism. Depending on the rate of the clock chosen for the
ACP unit 31 these units can be placed in series (and thus the testing of 3 different Δ could occur in consecutive clock cycles), or in parallel where all 3 can be tested simultaneously. If the clock rate is fast enough there is less need for parallelism. - Bandwidth Utilization
- It is necessary to read the old Δ of the Δs, and to write them out again. This takes 10% of the bandwidth:
2*(76(3150/32)+2*3150)=27,648 ns=10% of bandwidth - It is necessary to read the bit history for the given row as we update its Δs. Each byte contains 2 row's bit histories, thus taking 2.5% of the bandwidth:
76((3150/2)/32)+2*(3150/2)=4,085 ns=2.5% of bandwidth - In the worst case of pixel drift due to a 1% rotation, centroids will shift 1 column every 57 pixel rows, but since a dot is 3 pixels in diameter, a given pixel column will be valid for 171 pixel rows (3*57). As a byte contains 2 pixels, the number of bytes valid in cached reads will be a worst case of 86 (out of 128 read). The worst case timing for 5 columns is therefore 31% bandwidth.
5*(((9450/(128*2))*320)*128/86)=88,112 ns=31% of bandwidth. - The total bandwidth required for the updating the centroid Δ is summarised in the following table:
Read/Write centroid Δ 10% Read bit history 2.5 % Read 5 columns of pixel data 31% TOTAL 43.5%
Memory Usage for Phase 2: - The 2 MB bit-image DRAM area is read from and written to during
Phase 2 processing. The 2 MB pixel-data DRAM area is read. - The 0.5 MB scratch DRAM area is used for storing row data, namely:
Centroid array 24 bits (16:8) * 2 * 3150 = 18,900 byes Bit History array 3 bits * 3150 entries (2 per byte) = 1575 bytes
Phase 3—Unscramble and XOR the Raw Data - Returning to
FIG. 6 , the next step in decoding is to unscramble and XOR the raw data. The 2 MB byte image, as taken from the Artcard, is in a scrambled XORed form. It must be unscrambled and re-XORed to retrieve the bit image necessary for the Reed Solomon decoder inphase 4. - Turning to
FIG. 15 , theunscrambling process 330 takes a 2 MB scrambledbyte image 331 and writes an unscrambled 2MB image 332. The process cannot reasonably be performed in-place, so 2 sets of 2 MB areas are utilised. The scrambleddata 331 is in symbol block order arranged in a 16×16 array, with symbol block 0 (334) having all thesymbol 0's from all the code words in random order.Symbol block 1 has all thesymbol 1's from all the code words in random order etc. Since there are only 255 symbols, the 256 th symbol block is currently unused. - A linear feedback shift register is used to determine the relationship between the position within a symbol block eg. 334 and what code word eg. 355 it came from. This works as long as the same seed is used when generating the original Artcard images. The XOR of bytes from alternative source lines with 0xAA and 0x55 respectively is effectively free (in time) since the bottleneck of time is waiting for the DRAM to be ready to read/write to non-sequential addresses.
- The timing of the unscrambling XOR process is effectively 2 MB of random byte-reads, and 2 MB of random byte-writes i.e. 2*(2 MB*76 ns+2 MB*2 ns)=327,155,712 ns or approximately 0.33 seconds. This timing assumes no caching.
-
Phase 4—Reed Solomon Decode - This phase is a loop, iterating through copies of the data in the bit image, passing them to the Reed-Solomon decode module until either a successful decode is made or until there are no more copies to attempt decode from.
- The Reed-Solomon decoder used can be the VLIW processor, suitably programmed or, alternatively, a separate hardwired core such as LSI Logic's L64712. The L64712 has a throughput of 50 Mbits per second (around 6.25 MB per second), so the time may be bound by the speed of the Reed-Solomon decoder rather than the 2 MB read and 1 MB write memory access time (500 MB/sec for sequential accesses). The time taken in the worst case is thus 2/6.25 s=approximately 0.32 seconds.
-
Phase 5 Running the Vark Script - The overall time taken to read the
Artcard 9 and decode it is therefore approximately 2.15 seconds. The apparent delay to the user is actually only 0.65 seconds (the total ofPhases 3 and 4), since the Artcard stops moving after 1.5 - Once the Artcard is loaded, the Artvark script must be interpreted, Rather than run the script immediately, the script is only run upon the pressing of the ‘Print’ button 13 (
FIG. 1 ). The time taken to run the script will vary depending on the complexity of the script, and must be taken into account for the perceived delay between pressing the print button and the actual print button and the actual printing. - Alternative Artcard Format
- Of course, other artcard formats are possible. There will now be described one such alternative artcard format with a number of preferable feature. Described hereinafter will be the alternative Artcard data format, a mechanism for mapping user data onto dots on an alternative Artcard, and a fast alternative Artcard reading algorithm for use in embedded systems where resources are scarce.
- Alternative Artcard Overview
- The Alternative Artcards can be used in both embedded and PC type applications, providing a user-friendly interface to large amounts of data or configuration information.
- While the back side of an alternative Artcard has the same visual appearance regardless of the application (since it stores the data), the front of an alternative Artcard can be application dependent. It must make sense to the user in the context of the application.
- Alternative Artcard technology can also be independent of the printing resolution. The notion of storing data as dots on a card simply means that if it is possible put more dots in the same space (by increasing resolution), then those dots can represent more data. The preferred embodiment assumes utilisation of 1600 dpi printing on a 86 mm×55 mm card as the sample Artcard, but it is simple to determine alternative equivalent layouts and data sizes for other card sizes and/or other print resolutions. Regardless of the print resolution, the reading technique remain the same. After all decoding and other overhead has been taken into account, alternative Artcards are capable of storing up to 1 Megabyte of data at print resolutions up to 1600 dpi. Alternative Artcards can store megabytes of data at print resolutions greater than 1600 dpi. The following two tables summarize the effective alternative Artcard data storage capacity for certain print resolutions:
- Format of an Alternative Artcard
- The structure of data on the alternative Artcard is therefore specifically designed to aid the recovery of data. This section describes the format of the data (back) side of an alternative Artcard.
- Dots
- The dots on the data side of an alternative Artcard can be monochrome. For example, black dots printed on a white background at a predetermined desired print resolution. Consequently a “black dot” is physically different from a “white dot”.
FIG. 16 illustrates various examples of magnified views of black and white dots. The monochromatic scheme of black dots on a white background is preferably chosen to maximize dynamic range in blurry reading environments. Although the black dots are printed at a particular pitch (eg. 1600 dpi), the dots themselves are slightly larger in order to create continuous lines when dots are printed contiguously. In the example images ofFIG. 16 , the dots are not as merged as they may be in reality as a result of bleeding. There would be more smoothing out of the black indentations. Although the alternative Artcard system described in the preferred embodiment allows for flexibly different dot sizes, exact dot sizes and ink/printing behaviour for a particular printing technology should be studied in more detail in order to obtain best results. - In describing this artcard embodiment, the term dot refers to a physical printed dot (ink, thermal, electro-photographic, silver-halide etc) on an alternative Artcard When an alternative Artcard reader scans an alternative Artcard, the dots must be sampled at least double the printed resolution to satisfy Nyquist's Theorem. The term pixel refers to a sample value from an alternative Artcard reader device. For example, when 1600 dpi dots are scanned at 4800 dpi there are 3 pixels in each dimension of a dot, or 9 pixels per dot. The sampling process will be further explained hereinafter.
- Turning to
FIG. 17 , there is shown the data surface 1101 a sample of alternative Artcard. Each alternative Artcard consists of an “active”region 1102 surrounded by awhite border region 1103. Thewhite border 1103 contains no data information, but can be used by an alternative Artcard reader to calibrate white levels. The active region is an array of data blocks eg. 1104, with each data block separated from the next by a gap of 8 white dots eg. 1106. Depending on the print resolution, the number of data blocks on an alternative Artcard will vary. On a 1600 dpi alternative Artcard, the array can be 8×8. Each data block 1104 has dimensions of 627×394 dots. With aninter-block gap 1106 of 8 white of an alternative Artcard is therefore 5072×3208 dots (8.1 mm×5.1 mm at 1600 dpi). - Data blocks
- Turning now to
FIG. 18 , there is shown asingle data block 1107. The active region of an alternative Artcard consists of an array of identically structured data blocks 1107. Each of the data blocks has the following structure: adata region 1108 surrounded by clock-marks 1109, borders 1110, and targets 1111. The data region holds the encoded data proper, while the clock-marks, borders and targets are present specifically to help locate the data region and ensure accurate recovery of data from within the region. - Each data block 1107 has dimensions of 627×394 dots. Of this, the central area of 595×384 dots is the
data region 1108. The surrounding dots are used to hold the clock-marks, borders, and targets. - Borders and Clockmarks
-
FIG. 19 illustrates a data block withFIG. 20 andFIG. 21 illustrating magnified edge portions thereof. As illustrated inFIG. 20 andFIG. 21 , there are two 5 dot high border and clockmark regions 1170, 1177 in each data block: one above and one below the data region. For example, The top 5 dot high region consists of an outer black dot border line 1112 (which stretches the length of the data block), a white dot separator line 1113 (to ensure the border line is independent), and a 3 dot high set of clock marks 1114. The clock marks alternate between a white and black row, starting with a black clock mark at the 8th column from either end of the data block. There is no separation between clockmark dots and dots in the data region. - The clock marks are symmetric in that if the alternative Artcard is inserted rotated 180 degrees, the same relative border/clockmark regions will be encountered. The
border clockmarks 1114 are intended to keep horizontal tracking as data is read from the data region. The separation between the border and clockmarks by a white line of dots is desirable as a result of blurring occurring during reading. The border thus becomes a black line with white on either side, making for a good frequency response on reading. The clockmarks alternating between white and black have a similar result, except in the horizontal rather than the vertical dimension. Any alternative Artcard reader must locate the clockmarks and border if it intends to use them for tracking. The next section deals with targets, which are designed to point the way to the clockmarks, border and data. - Targets in the Target Region
- As shown in
FIG. 23 , there are two 15-dotwide target regions Target Regions FIG. 22 there is shown the structure of asingle target 1120. Eachtarget 1120 is a 15×15 dot black square with acenter structure 1121 and a run-length encodedtarget number 1122. Thecenter structure 1121 is a simple white cross, and thetarget number component 1122 is simply two columns of white dots, each being 2 dots long for each part of the target number. Thustarget number 1'starget id 1122 is 2 dots long,target number 2'starget id 1122 is 4 dots wide etc. - As shown in
FIG. 23 , the targets are arranged so that they are rotation invariant with regards to card insertion. This means that the left targets and right targets are the same, except rotated 180 degrees. In theleft Target Region 1116, the targets are arranged such thattargets 1 to 6 are located top to bottom respectively. In the right Target Region, the targets are arranged so thattarget numbers 1 to 6 are located bottom to top. The target number id is always in the half closest to the data region. The magnified view portions ofFIG. 23 reveals clearly the how the right targets are simply the same as the left targets, except rotated 180 degrees. - As shown in
FIG. 24 , thetargets centers 55 dots apart. In addition, there is a distance of 55 dots from the center of target 1 (1124) to thefirst clockmark dot 1126 in the upper clockmark region, and a distance of 55 dots from the center of the target to the first clockmark dot in the lower clockmark region (not shown). The first black clockmark in both regions begins directly in line with the target center (the 8th dot position is the center of the 15 dot-wide target). - The simplified schematic illustrations of
FIG. 24 illustrates the distances between target centers as well as the distance from Target 1 (1124) to the first dot of the first black clockmark (1126) in the upper border/clockmark region. Since there is a distance of 55 dots to the Clockmarks from both the upper and lower targets, and both sides of the alternative Artcard are symmetrical (rotated through 180 degrees), the card can be read left-to-right or right-to-left. Regardless of reading direction, the orientation does need to be determined in order to extract the data from the data region. - Orientation Columns
- As illustrated in
FIG. 25 , there are two 1 dotwide Orientation Columns white dots 1127. On the right side of the data region (to the left of the Right Targets) is a single column ofblack dots 1128. Since the targets are rotation invariant, these two columns of dots allow an alternative Artcard reader to determine the orientation of the alternative Artcard—has the card been inserted the right way, or back to front. From the alternative Artcard reader's point of view, assuming no degradation to the dots, there are two possibilities: -
- If the column of dots to the left of the data region is white, and the column to the right of the data region is black, then the reader will know that the card has been inserted the same way as it was written.
- If the column of dots to the left of the data region is black, and the column to the right of the data region is white, then the reader will know that the card has been inserted backwards, and the data region is appropriately rotated. The reader must take appropriate action to correctly recover the information from the alternative Artcard.
Data Region
- As shown in
FIG. 26 , the data region of a data block consists of 595 columns of 384 dots each, for a total of 228,480 dots. These dots must be interpreted and decoded to yield the original data. Each dot represents a single bit, so the 228,480 dots represent 228,480 bits, or 28,560 bytes. The interpretation of each dot can be as follows:Black 1 White 0 - The actual interpretation of the bits derived from the dots, however, requires understanding of the mapping from the original data to the dots in the data regions of the alternative Artcard.
- Mapping Original Data to Data Region Dots
- There will now be described the process of taking an original data file of maximum size 910,082 bytes and mapping it to the dots in the data regions of the 64 data blocks on a 1600 dpi alternative Artcard. An alternative Artcard reader would reverse the process in order to extract the original data from the dots on an alternative Artcard. At first glance it seems trivial to map data onto dots: binary data is comprised of 1s and 0s, so it would be possible to simply write black and white dots onto the card. This scheme however, does not allow for the fact that ink can fade, parts of a card may be damaged with dirt, grime, or even scratches. Without error-detection encoding, there is no way to detect if the data retrieved from the card is correct And without redundancy encoding, there is no way to correct the detected errors. The aim of the mapping process then, is to make the data recovery highly robust, and also give the alternative Artcard reader the ability to know it read the data correctly.
- There are three basic steps involved in mapping an original data file to data region dots:
-
- Redundancy encode the original data
- Shuffle the encoded data in a deterministic way to reduce the effect of localized alternative Artcard damage
- Write out the shuffled, encoded data as dots to the data blocks on the alternative Artcard
- Each of these steps is examined in detail in the following sections.
- Redundancy Encode Using Reed-Solomon Encoding
- The mapping of data to alternative Artcard dots relies heavily on the method of redundancy encoding employed. Reed-Solomon encoding is preferably chosen for its ability to deal with burst errors and effectively detect and correct errors using a minimum of redundancy. Reed Solomon encoding is adequately discussed in the standard texts such as Wicker, S., and Bhargava, V., 1994, Reed-Solomon Codes and their Applications, EEEE Press. Rorabaugh, C, 1996, Error Coding Cookbook, McGraw-Hill. Lyppens, H., 1997, Reed-Solomon Error Correction, Dr. Dobb's Journal, January 1997 (Volume 22, Issue 1).
- A variety of different parameters for Reed-Solomon encoding can be used, including different symbol sizes and different levels of redundancy. Preferably, the following encoding parameters are used:
-
- m=8
- t=64
- Having m=8 means that the symbol size is 8 bits (1 byte). It also means that each Reed-Solomon encoded block size n is 255 bytes (28-1 symbols). In order to allow correction of up to t symbols, 2t symbols in the final block size must be taken up with redundancy symbols. Having t=64 means that 64 bytes (symbols) can be corrected per block if they are in error. Each 255 byte block therefore has 128 (2×64) redundancy bytes, and the remaining 127 bytes (k=127) are used to hold original data. Thus:
-
- n=255
- k=127
- The practical result is that 127 bytes of original data are encoded to become a 255-byte block of Reed-Solomon encoded data. The encoded 255-byte blocks are stored on the alternative Artcard and later decoded back to the original 127 bytes again by the alternative Artcard reader. The 384 dots in a single column of a data block's data region can hold 48 bytes (384/8). 595 of these columns can hold 28,560 bytes. This amounts to 112 Reed-Solomon blocks (each block having 255 bytes). The 64 data blocks of a complete alternative Artcard can hold a total of 7168 Reed-Solomon blocks (1,827,840 bytes, at 255 bytes per Reed-Solomon block). Two of the 7,168 Reed-Solomon blocks are reserved for control information, but the remaining 7166 are used to store data. Since each Reed-Solomon block holds 127 bytes of actual data, the total amount of data that can be stored on an alternative Artcard is 910,082 bytes (7166×127). If the original data is less than amount, the data can be encoded to fit an exact number of Reed-Solomon blocks, and then the encoded blocks can be replicated until all 7,166 are used.
FIG. 27 illustrates the overall form of encoding utilised. - Each of the 2 Control blocks 1132, 1133 contain the same encoded information required for decoding the remaining 7,166 Reed-Solomon blocks:
-
- The number of Reed-Solomon blocks in a full message (16 bits stored lo/hi), and
- The number of data bytes in the last Reed-Solomon block of the message (8 bits)
- These two numbers are repeated 32 times (consuming. 96 bytes) with the remaining 31 bytes reserved and set to 0. Each control block is then Reed-Solomon encoded, turning the 127 bytes of control information into 255 bytes of Reed-Solomon encoded data.
- The Control Block is stored twice to give greater chance of it surviving. In addition, the repetition of the data within the Control Block has particular significance when using Reed-Solomon encoding. In an uncorrupted Reed-Solomon encoded block, the first 127 bytes of data are exactly the original data, and can be looked at in an attempt to recover the original message if the Control Block fails decoding (more than 64 symbols are corrupted). Thus, if a Control Block fails decoding, it is possible to examine sets of 3 bytes in an effort to determine the most likely values for the 2 decoding parameters. It is not guaranteed to be recoverable, but it has a better chance through redundancy. Say the last 159 bytes of the Control Block are destroyed, and the first 96 bytes are perfectly ok. Looking at the first 96 bytes will show a repeating set of numbers. These numbers can be sensibly used to decode the remainder of the message in the remaining 7,166 Reed-Solomon blocks.
- By way of example, assume a data file containing exactly 9,967 bytes of data. The number of Reed-Solomon blocks required is 79. The first 78 Reed-Solomon blocks are completely utilized, consuming 9,906 bytes (78×127) 79th block has only 61 bytes of data (with the remaining 66 bytes all 0s).
- The alternative Artcard would consist of 7,168 Reed-Solomon blocks. The first 2 blocks would be Control Blocks, the next 79 would be the encoded data, the next 79 would be a duplicate of the encoded data, the next 79 would be another duplicate of the encoded data, and so on. After storing the 79 Reed-Solomon blocks 90 times, the remaining 56 Reed-Solomon blocks would be another duplicate of the first 56 blocks from the 79 blocks of encoded data (the final 23 blocks of encoded data would not be stored again as there is not enough room on the alternative Artcard). A hex representation of the 127 bytes in each Control Block data before being Reed-Solomon encoded would be as illustrated in
FIG. 28 . - Scramble the Encoded Data
- Assuming all the encoded blocks have been stored contiguously in memory, a maximum 1,827,840 bytes of data can be stored on the alternative Artcard (2 Control Blocks and 7,166 information blocks, totalling 7,168 Reed-Solomon encoded blocks). Preferably, the data is not directly stored onto the alternative Artcard at this stage however, or all 255 bytes of one Reed-Solomon block will be physically together on the card. Any dirt, grime, or stain that causes physical damage to the card has the potential of damaging more than 64 bytes in a single Reed-Solomon block, which would make that block unrecoverable. If there are no duplicates of that Reed-Solomon block, then the entire alternative Artcard cannot be decoded.
- The solution is to take advantage of the fact that there are a large number of bytes on the alternative Artcard, and that the alternative Artcard has a reasonable physical size. The data can therefore be scrambled to ensure that symbols from a single Reed-Solomon block are not in close proximity to one another. Of course pathological cases of card degradation can cause Reed-Solomon blocks to be unrecoverable, but on average, the scrambling of data makes the card much more robust. The scrambling scheme chosen is simple and is illustrated schematically in
FIG. 29 . All the Byte 0s from each Reed-Solomon block are-placed together 1136, then all the Byte 1s etc. There will therefore be 7,168byte 0's, then 7,168 B etc. Each data block on the alternative Artcard can store 28,560 bytes. Consequently there are approximately 4 bytes from each Reed-Solomon block in each of the 64 data blocks on the alternative Artcard. - Under this scrambling scheme, complete damage to 16 entire data blocks on the alternative Artcard will result in 64 symbol errors per Reed-Solomon block. This means that if there is no other damage to the alternative Artcard, the entire data is completely recoverable, even if there is no data duplication.
- Write the Scrambled Encoded Data to the Alternative Artcard
- Once the original data has been Reed-Solomon encoded, duplicated, and scrambled, there are 1,827,840 bytes of data to be stored on the alternative Artcard. Each of the 64 data blocks on the alternative Artcard stores 28,560 bytes.
- The data is simply written out to the alternative Artcard data blocks so that the first data block contains the first 28,560 bytes of the scrambled data, the second data block contains the next 28,560 bytes etc.
- As illustrated in
FIG. 30 , within a data block, the data is written out column-wise left to right. Thus the left-most column within a data block contains the first 48 bytes of the 28,560 bytes of scrambled data, and the last column contains the last 48 bytes of the 28,560 bytes of scrambled data. Within a column, bytes are written out top to bottom, one bit at a time, starting frombit 7 and finishing withbit 0. If the bit is set (1), a black dot is placed on the alternative Artcard, if the clear (0), no dot is placed, leaving it the white background color of the card. - For example, a set of 1,827,840 bytes of data can be created by scrambling 7,168 Reed-Solomon encoded blocks to be stored onto an alternative Artcard. The first 28,560 bytes of data are written to the first data block. The first 48 bytes of the first 28,560 bytes are written to the first column of the data block, the next 48 bytes to the next column and so on. Suppose the first two bytes of the 28,560 bytes are hex D3 5F. Those first two bytes will be stored in
column 0 of the data block.Bit 7 ofbyte 0 will be stored first, then bit 6 and so on. ThenBit 7 ofbyte 1 will be stored through to Since each “1” is stored as a black dot, and each “0” as a white dot, these two bytes will be represented on the alternative Artcard as the following set of dots: -
- D3 (1101 0011) becomes: black black, white, black, white, white, black, black
- 5F (0101 1111) becomes: white, black, white, black, black, black, black, black
Decoding an Alternative Artcard
- This section deals with extracting the original data from an alternative Artcard in an accurate and robust manner. Specifically, it assumes the alternative Artcard format as described in the previous chapter, and describes a method of extracting the original pre-encoded data from the alternative Artcard.
- There are a number of general considerations that are part of the assumptions for decoding an alternative Artcard.
- User
- The purpose of an alternative Artcard is to store data for use in different applications. A user inserts an alternative Artcard into an alternative Artcard reader, and expects the data to be loaded in a “reasonable time”. From the user's perspective, a motor transport moves the alternative Artcard into an alternative Artcard reader. This is not perceived as a problematic delay, since the alternative Artcard is in motion. Any time after the alternative Artcard has stopped is perceived as a delay, and should be minimized in any alternative Artcard reading scheme. Ideally, the entire alternative Artcard would be read while in motion, and thus there would be no perceived delay after the card had stopped moving.
- For the purpose of the preferred embodiment, a reasonable time for an alternative Artcard to be physically loaded is defined to be 1.5 seconds. There should be a minimization of time for additional decoding after the alternative Artcard has stopped moving. Since the Active region of an alternative Artcard covers most of the alternative Artcard surface we can limit our timing concerns to that region.
- Sampling Dots
- The dots on an alternative Artcard must be sampled by a CCD reader or the like at least at double the printed resolution to satisfy Nyquist's Theorem. In practice it is better to sample at a higher rate than this. In the alternative Artcard reader environment, dots are preferably sampled at 3 times their printed resolution in each dimension, requiring 9 pixels to define a single dot If the resolution of the alternative Artcard dots is 1600 dpi, the alternative Artcard reader's image sensor must scan pixels at 4800 dpi. Of course if a dot is not exactly aligned with the sampling sensor, the worst and most likely case as illustrated in
FIG. 31 , is that a dot will be sensed over a 4×4 pixel area. - Each sampled pixel is 1 byte (8 bits). The lowest 2 bits of each pixel can contain significant noise. Decoding algorithms must therefore be noise tolerant.
- Alignment/Rotation
- It is extremely unlikely that a user will insert an alternative Artcard into an alternative Artcard reader perfectly aligned with no rotation. Certain physical constraints at a reader entrance and motor transport grips will help ensure that once inserted, an alternative Artcard will stay at the original angle of insertion relative to the CCD. Preferably this angle of rotation, as illustrated in
FIG. 32 is a maximum of 1 degree. There can be some slight aberrations in angle due to jitter and motor rumble during the reading process, but these are assumed to essentially stay within the 1-degree limit. - The physical dimensions of an alternative Artcard are 86 mm×55 mm. A 1 degree rotation adds 1.5 mm to the effective height of the card as 86 mm passes under the CCD (86
sin 1°), which will affect the required CCD length. - The effect of a 1 degree rotation on alternative Artcard reading is that a single scanline from the CCD will include a number of different columns of dots from the alternative Artcard. This is illustrated in an exaggerated form in
FIG. 32 which shows the drift of dots across the columns of pixels. Although exaggerated in this diagram, the actual drift will be a maximum 1 pixel column shift every 57 pixels. - When an alternative Artcard is not rotated, a single column of dots can be read over 3 pixel scanlines. The more an alternative Artcard is rotated, the greater the local effect. The more dots being read, the longer the rotation effect is applied. As either of these factors increase, the larger the number of pixel scanlines that are needed to be read to yield a given set of dots from a single column on an alternative Artcard. The following table shows how many pixel scanlines are required for a single column of dots in a particular alternative Artcard structure.
Region Height 0° rotation 1° rotation Active region 3208 dots 3 pixel columns 168 pixel columns Data block 394 dots 3 pixel columns 21 pixel columns - To read an entire alternative Artcard, we need to read 87 mm (86 mm+1 mm due to 1° rotation). At 4800 dpi this implies 16,252 pixel columns.
- CCD (or other Linear Image Sensor) Length
- The length of the CCD itself must accommodate:
-
- the physical height of the alternative Artcard (55 mm),
- vertical slop on physical alternative Artcard insertion (1 mm)
- insertion rotation of up to 1 degree (86
sin 1°=1.5 mm)
- These factors combine to form a total length of 57.5 mm.
- When the alternative Artcard Image sensor CCD in an alternative Artcard reader scans at 4800 dpi, a single scanline is 10,866 pixels. For simplicity, this figure has been rounded up to 11,000 pixels. The Active Region of an alternative Artcard has a height of 3208 dots, which implies 9,624 pixels. A Data Region has a height of 384 dots, which implies 1,152 pixels.
- DRAM Size
- The amount of memory required for alternative Artcard reading and decoding is ideally minimized. The typical placement of an alternative Artcard reader is an embedded system where memory resources are precious. This is made more problematic by the effects of rotation. As described above, the more an alternative Artcard is rotated, the more scanlines are required to effectively recover original dots.
- There is a trade-off between algorithmic complexity, user perceived delays, robustness, and memory usage. One of the simplest reader algorithms would be to simply scan the whole alternative Artcard, and then to process the whole data without real-time constraints. Not only would this require huge reserves of memory, it would take longer than a reader algorithm that occurred concurrently with the alternative Artcard reading process.
- The actual amount of memory required for reading and decoding an alternative Artcard is twice the amount of space required to hold the encoded data, together with a small amount of scratch space (1-2 KB). For the 1600 dpi alternative Artcard, this implies a 4 MB memory requirement. The actual usage of the memory is detailed in the following algorithm description.
- Transfer Rate
- DRAM bandwidth assumptions need to be made for timing considerations and to a certain extent affect algorithmic design, especially since alternative Artcard readers are typically part of an embedded system.
- A standard Rambus Direct RDRAM architecture is assumed, as defined in Rambus Inc, October 1997, Direct Rambus Technology Disclosure, with a peak data transfer rate of 1.6 GB/sec. Assuming 75% efficiency (easily achieved), we have an average of 1.2 GB/sec data transfer rate. The average time to access a block of 16 bytes is therefore 12 ns.
- Dirty Data
- Physically damaged alternative Artcards can be inserted into a reader. Alternative Artcards may be scratched, or be stained with grime or dirt. A alternative Artcard reader can't assume to read everything perfectly. The effect of dirty data is made worse by blurring, as the dirty data affects the surrounding clean dots.
- Blurry Environment
- There are two ways that blurring is introduced into the alternative Artcard reading environment:
-
- Natural blurring due to nature of the CCD's distance from the alternative Artcard.
- Warping of alternative Artcard
- Natural blurring of an alternative Artcard image occurs when there is overlap of sensed data from the CCD. Blurring can be useful, as the overlap ensures there are no high frequencies in the sensed data, and that there is no data missed by the CCD. However if the area covered by a CCD pixel is too large, there will be too much blurring and the sampling required to recover the data will not be met.
FIG. 33 is a schematic illustration of the overlapping of sensed data. - Another form of blurring occurs when an alternative Artcard is slightly warped due to heat damage. When the warping is in the vertical dimension, the distance between the alternative Artcard and the CCD will not be constant, and the level of blurring will vary across those areas.
- Black and white dots were chosen for alternative Artcards to give the best dynamic range in blurry reading environments. Blurring can cause problems in attempting to determine whether a given dot is black or white.
- As the blurring increases, the more a given dot is influenced by the surrounding dots. Consequently the dynamic range for a particular dot decreases. Consider a white dot and a black dot, each surrounded by all possible sets of dots. The 9 dots are blurred, and the center dot sampled.
FIG. 34 shows the distribution of resultant center dot values for black and white dots. - The diagram is intended to be a representative blurring. The curve 1140 from 0 to around 180 shows the range of black dots. The curve 1141 from 75 to 250 shows the range of white dots. However the greater the blurring, the more the two curves shift towards the center of the range and therefore the greater the intersection area, which means the more difficult it is to determine whether a given dot is black or white. A pixel value at the center point of intersection is ambiguous—the dot is equally likely to be a black or a white.
- As the blurring increases, the likelihood of a read bit error increases. Fortunately, the Reed-Solomon decoding algorithm can cope with these gracefully up to t symbol errors.
FIG. 34 is a graph of number predicted number of alternative Artcard Reed-Solomon blocks that cannot be recovered given a particular symbol error rate. Notice how the Reed-Solomon decoding scheme performs well and then substantially degrades. If there is no Reed-Solomon block duplication, then only 1 block needs to be in error for the data to be unrecoverable. Of course, with block duplication the chance of an alternative Artcard decoding increases. -
FIG. 35 only illustrates the symbol (byte) errors corresponding to the number of Reed-Solomon blocks in error. There is a trade-off between the amount of blurring that can be coped with, compared to the amount of damage that has been done to a card. Since all error detection and correction is performed by a Reed-Solomon decoder, there is a finite number of errors per Reed-Solomon data block that can be coped with. The more errors introduced through blurring, the fewer the number of errors that can be coped with due to alternative Artcard damage. - Overview of Alternative Artcard Decoding
- As noted previously, when the user inserts an alternative Artcard into an alternative Artcard reading unit, a motor transport ideally carries the alternative Artcard past a monochrome linear CCD image sensor. The card is sampled in each dimension at three times the printed resolution. Alternative Artcard reading hardware and software compensate for rotation up to 1 degree, jitter and vibration due to the motor transport, and blurring due to variations in alternative Artcard to CCD distance. A digital bit image of the data is extracted from the sampled image by a complex method described here. Reed-Solomon decoding corrects arbitrarily distributed data corruption of up to 25% of the raw data on the alternative Artcard Approximately 1 MB of corrected data is extracted from a 1600 dpi card.
- The steps involved in decoding are so as indicated in
FIG. 36 . - The decoding process requires the following steps:
-
- Scan 1144 the alternative Artcard at three times printed resolution (eg scan 1600 dpi alternative Artcard at 4800 dpi)
- Extract 1145 the data bitmap from the scanned dots on the card.
- Reverse 1146 the bitmap if the alternative Artcard was inserted backwards.
- Unscramble 1147 the encoded data
- Reed-Solomon 1148 decode the data from the bitmap
Algorithmic Overview
Phase 1—Real Time Bit Image Extraction
- A simple comparison between the available memory (4 MB) and the memory required to hold all the scanned pixels for a 1600 dpi alternative Artcard (172.5 MB) shows that unless the card is read multiple times (not a realistic option), the extraction of the bitmap from the pixel data must be done on the fly, in real time, while the alternative Artcard is moving past the CCD. Two tasks must be accomplished in this phase:
-
- Scan the alternative Artcard at 4800 dpi
- Extract the data bitmap from the scanned dots on the card
- The rotation and unscrambling of the bit image cannot occur until the whole bit image has been extracted. It is therefore necessary to assign a memory region to hold the extracted bit image. The bit image fits easily within 2 MB, leaving 2 MB for use in the extraction process.
- Rather than extracting the bit image while looking only at the current scanline of pixels from the CCD, it is possible to allocate a buffer to act as a window onto the alternative Artcard, storing the last N scanlines read. Memory requirements do not allow the entire alternative Artcard to be stored this way (172.5 MB would be required), but allocating 2 MB to store 190 pixel columns (each scanline takes less than 11,000 bytes) makes the bit image extraction process simpler.
-
- The 4 MB memory is therefore used as follows:
- 2 MB for the extracted bit image
- 2 MB for the scanned pixels
- 1.5 KB for
Phase 1 scratch data (as required by algorithm)
- The time taken for
Phase 1 is 1.5 seconds, since this is the time taken for the alternative Artcard to travel past the CCD and physically load. -
Phase 2—Data Extraction from Bit Image - Once the bit image has been extracted, it must be unscrambled and potentially rotated 180°. It must then be decoded.
Phase 2 has no real-time requirements, in that the alternative Artcard has stopped moving, and we are only concerned with the user's perception of elapsed time.Phase 2 therefore involves the remaining tasks of decoding an alternative Artcard: -
- Re-organize the bit image, reversing it if the alternative Artcard was inserted backwards
- Unscramble the encoded data
- Reed-Solomon decode the data from the bit image
- The input to
Phase 2 is the 2 MB bit image buffer. Unscrambling and rotating cannot be performed in situ, so a second 2 MB buffer is required. The 2 MB buffer used to hold scanned pixels inPhase 1 is no longer required and can be used to store the rotated unscrambled data. - The Reed-Solomon decoding task takes the unscrambled bit image and decodes it to 910,082 bytes. The decoding can be performed in situ, or to a specified location elsewhere. The decoding process does not require any additional memory buffers.
- The 4 MB memory is therefore used as follows:
-
- 2 MB for the extracted bit image (from Phase 1)
- ˜2 MB for the unscrambled, potentially rotated bit image
- <1KB for
Phase 2 scratch data (as required by algorithm)
- The time taken for
Phase 2 is hardware dependent and is bound by the time taken for Reed-Solomon decoding. Using a dedicated core such as LSI Logic's L64712, or an equivalent CPU/DSP combination, it is estimated thatPhase 2 would take 0.32 seconds. -
Phase 1—Extract Bit Image - This is the real-time phase of the algorithm, and is concerned with extracting the bit image from the alternative Artcard as scanned by the CCD.
- As shown in
FIG. 37 Phase 1 can be divided into 2 asynchronous process streams. The first of these streams is simply the real-time reader of alternative Artcard pixels from the CCD, writing the pixels to DRAM. The second stream involves looking at the pixels, and extracting the bits. The second process stream is itself divided into 2 processes. The first process is a global process, concerned with locating the start of the alternative Artcard. The second process is the bit image extraction proper. -
FIG. 38 illustrates the data flow from a data/process perspective. - Timing For an entire 1600 dpi alternative Artcard, it is necessary to read a maximum of 16,252 pixel-columns. Given a total time of 1.5 seconds for the whole alternative Artcard, this implies a maximum time of 92,296ns per pixel column during the course of the various processes.
-
Process 1—Read pixels from CCD - The CCD scans the alternative Artcard at 4800 dpi, and generates 11,000 1-byte pixel samples per column. This process simply takes the data from the CCD and writes it to DRAM, completely independently of any other process that is reading the pixel data from DRAM.
FIG. 39 illustrates the steps involved. - The pixels are written contiguously to a 2 MB buffer that can hold 190 full columns of pixels. The buffer always holds the 190 columns most recently read. Consequently, any process that wants to read the pixel data (such as
Processes 2 and 3) must firstly know where to look for a given column, and secondly, be fast enough to ensure that the data required is actually in the buffer. -
Process 1 makes the current scanline number (CurrentScanLine) available to other processes so they can ensure they are not attempting to access pixels from scanlines that have not been read yet. - The time taken to write out a single column of data (11,000 bytes) to DRAM is:
11,000/16*12=8,256 ns -
Process 1 therefore uses just under 9% of the available DRAM bandwidth (8256/92296). -
Process 2—Detect Start of Alternative Artcard - This process is concerned with locating the Active Area on a scanned alternative Artcard. The input to this stage is the pixel data from DRAM (placed there by Process 1). The output is a set of bounds for the first 8 data blocks on the alternative Artcard, required as input to
Process 3. A high level overview of the process can be seen inFIG. 40 . - An alternative Artcard can have vertical slop of 1 mm upon insertion. With a rotation of 1 degree there is further vertical slop of 1.5 mm (86
sin 1°). Consequently there is a total vertical slop of 2.5 mm. At 1600 dpi, this equates to a slop of approximately 160 dots. Since a single data block is only 394 dots high, the slop is just under half a data block. To get a better estimate of where the data blocks are located the alternative Artcard itself needs to be detected. -
Process 2 therefore consists of two parts: -
- Locate the start of the alternative Artcard, and if found,
- Calculate the bounds of the first 8 data blocks based on the start of the alternative Artcard.
Locate the Start of the Alternative Artcard
- The scanned pixels outside the alternative Artcard area are black (the surface can be black plastic or some other non-reflective surface). The border of the alternative Artcard area is white. If we process the pixel columns one by one, and filter the pixels to either black or white, the transition point from black to white will mark the start of the alternative Artcard. The highest level process is as follows:
for (Column=0; Column < MAX_COLUMN; Column++) { Pixel = ProcessColumn(Column) if (Pixel) return (Pixel, Column) // success! } return failure // no alternative Artcard found - The ProcessColumn function is simple. Pixels from two areas of the scanned column are passed through a threshold filter to determine if they are black or white. It is possible to then wait for a certain number of white pixels and announce the start of the alternative Artcard once the given number has been detected. The logic of processing a pixel column is shown in the following pseudocode. 0 is returned if the alternative Artcard has not been detected during the column. Otherwise the pixel number of the detected location is returned.
// Try upper region first count = 0 for (i=0; i<UPPER_REGION_BOUND; i++) { if (GetPixel(column, i) < THRESHOLD) { count = 0 // pixel is black } else { count++ // pixel is white if (count > WHITE_ALTERNATIVE ARTCARD) return i } } // Try lower region next. Process pixels in reverse count = 0 for (i=MAX_PIXEL_BOUND; i>LOWER_REGION_BOUND; i−−) { if (GetPixel(column, i) < THRESHOLD) { count = 0 // pixel is black } else { count++ // pixel is white if (count > WHITE_ALTERNATIVE ARTCARD) return i } }
//Not in upper bound or in lower boundReturn failure return 0
Calculate Data Block Bounds - At this stage, the alternative Artcard has been detected. Depending on the rotation of the alternative Artcard, either the top of the alternative Artcard has been detected or the lower part of the alternative Artcard has been detected. The second step of
Process 2 determines which was detected and sets the data block bounds forPhase 3 appropriately. - A look at
Phase 3 reveals that it works on data block segment bounds: each data block has a StartPixel and an EndPixel to determine where to look for targets in order to locate the data block's data region. - If the pixel value is in the upper half of the card, it is possible to simply use that as the first StartPixel bounds. If the pixel value is in the lower half of the card, it is possible to move back so that the pixel value is the last segment's EndPixel bounds. We step forwards or backwards by the alternative Artcard data size, and thus set up each segment with appropriate bounds. We are now ready to begin extracting data from the alternative Artcard.
// Adjust to become first pixel if is lower pixel if (pixel > LOWER_REGION_BOUND) { pixel −= 6 * 1152 if (pixel < 0) pixel = 0 } for (i=0; i<6; i++) { endPixel = pixel + 1152 segment[i].MaxPixel = MAX_PIXEL_BOUND segment[i].SetBounds(pixel, endPixel) pixel = endPixel } - The MaxPixel value is defined in
Process 3, and the SetBounds function simply sets StartPixel and EndPixel clipping with respect to 0 and MaxPixel. -
Process 3—Extract Bit Data from Pixels - This is the heart of the alternative Artcard Reader algorithm. This process is concerned with extracting the bit data from the CCD pixel data. The process essentially creates a bit-image from the pixel data, based on scratch information created by
Process 2, and maintained byProcess 3. A high level overview of the process can be seen inFIG. 41 . - Rather than simply read an alternative Artcard's pixel column and determine what pixels belong to what data block,
Process 3 works the other way around. It knows where to look for the pixels of a given data block. It does this by dividing a logical alternative Artcard into 8 segments, each containing 8 data blocks as shown inFIG. 42 . - The segments as shown match the logical alternative Artcard. Physically, the alternative Artcard is likely to be rotated by some amount. The segments remain locked to the logical alternative Artcard structure, and hence are rotation-independent. A given segment can have one of two states:
-
- LookingForTargets: where the exact data block position for this segment has not yet been determined. Targets are being located by scanning pixel column data in the bounds indicated by the segment bounds. Once the data block has been located via the targets, and bounds set for black & white, the state changes to ExtractingBitImage.
- ExtractingBitImage: where the data block has been accurately located, and bit data is being extracted one dot column at a time and written to the alternative Artcard bit image. The following of data block clockmarks gives accurate dot recovery regardless of rotation, and thus the segment bounds are ignored. Once the entire data block has been extracted, new segment bounds are calculated for the next data block based on the current position. The state changes to LookingForTargets.
- The process is complete when all 64 data blocks have been extracted, 8 from each region.
- Each data block consists of 595 columns of data, each with 48 bytes. Preferably, the 2 orientation columns for the data block are each extracted at 48 bytes each, giving a total of 28,656 bytes extracted per data block. For simplicity, it is possible to divide the 2 MB of memory into 64×32 k chunks. The nth data block for a given segment is stored at the location:
StartBuffer+(256 k*n)
Data Structure for Segments - Each of the 8 segments has an associated data structure. The data structure defining each segment is stored in the scratch data area. The structure can be as set out in the following table:
DataName Comment CurrentState Defines the current state of the segment. Can be one of: LookingForTargets ExtractingBitImage Initial value is LookingForTargets Used during LookingForTargets: StartPixel Upper pixel bound of segment. Initially set by Process 2.EndPixel Lower pixel bound of segment. Initially set by Process 2MaxPixel The maximum pixel number for any scanline. It is set to the same value for each segment: 10,866. CurrentColumn Pixel column we're up to while looking for targets. FinalColumn Defines the last pixel column to look in for targets. LocatedTargets Points to a list of located Targets. PossibleTargets Points to a set of pointers to Target structures that represent currently investigated pixel shapes that may be targets AvailableTargets Points to a set of pointers to Target structures that are currently unused. TargetsFound The number of Targets found so far in this data block. PossibleTargetCount The number of elements in the PossibleTargets list AvailabletargetCount The number of elements in the AvailableTargets list Used during ExtractingBitImage: BitImage The start of the Bit Image data area in DRAM where to store the next data block: Segment 1 = X,Segment 2 = X + 32k etcAdvances by 256k each time the state changes from ExtractingBitImageData to Looking ForTargets CurrentByte Offset within BitImage where to store next extracted byte CurrentDotColumn Holds current clockmark/dot column number. Set to −8 when transitioning from state LookingForTarget to ExtractingBitImage. UpperClock Coordinate (column/pixel) of current upper clockmark/border LowerClock Coordinate (column/pixel) of current lower clockmark/border CurrentDot The center of the current data dot for the current dot column. Initially set to the center of the first (topmost) dot of the data column. DataDelta What to add (column/pixel) to CurrentDot to advance to the center of the next dot. BlackMax Pixel value above which a dot is definitely white WhiteMin Pixel value below which a dot is definitely black MidRange The pixel value that has equal likelihood of coming from black or white. When all smarts have not determined the dot, this value is used to determine it. Pixels below this value are black, and above it are white.
High Level ofProcess 3 -
Process 3 simply iterates through each of the segments, performing a single line of processing depending on the segment's current state. The pseudocode is straightforward:blockCount = 0 while (blockCount < 64) for (i=0; i<8; i++) { finishedBlock = segment[i].ProcessState( ) if (finishedBlock) blockCount++ } -
Process 3 must be halted by an external controlling process if it has not terminated after a specified amount of time. This will only be the case if the data cannot be extracted. A simple mechanism is to start a countdown afterProcess 1 has finished reading the alternative Artcard. IfProcess 3 has not finished by that time, the data from the alternative Artcard cannot be recovered. - CurrentState=LookingForTargets
- Targets are detected by reading columns of pixels, one pixel-column at a time rather than by detecting dots within a given band of pixels (between StartPixel and EndPixel) certain patterns of pixels are detected. The pixel columns are processed one at a time until either all the targets are found, or until a specified number of columns have been processed. At that time the targets can be processed and the data area located via clockmarks. The state is changed to ExtractingBitImage to signify that the data is now to be extracted. If enough valid targets are not located, then the data block is ignored, skipping to a column definitely within the missed data block, and then beginning again the process of looking for the targets in the next data block. This can be seen in the following pseudocode:
finishedBlock = FALSE if(CurrentColumn < Process1.CurrentScanLine) { ProcessPixelColumn( ) CurrentColumn++ } if ((TargetsFound == 6) ∥ (CurrentColumn > LastColumn)) { if (TargetsFound >= 2) ProcessTargets( ) if (TargetsFound >= 2) { BuildClockmarkEstimates( ) SetBlackAndWhiteBounds( ) CurrentState = ExtractingBitImage CurrentDotColumn = −8 } else { // data block cannot be recovered. Look for // next instead. Must adjust pixel bounds to // take account of possible 1 degree rotation. finishedBlock = TRUE SetBounds(StartPixel−12, EndPixel+12) BitImage += 256KB CurrentByte = 0 LastColumn += 1024 TargetsFound = 0 } } return finishedBlock ProcessPixelColumn - Each pixel column is processed within the specified bounds (between StartPixel and EndPixel) to search for certain patterns of pixels which will identify the targets. The structure of a single target (target number 2) is as previously shown in
FIG. 23 : - From a pixel point of view, a target can be identified by:
-
- Left black region, which is a number of pixel columns consisting of large numbers of contiguous black pixels to build up the first part of the target.
- Target center, which is a white region in the center of further black columns
- Second black region, which is the 2 black dot columns after the target center
- Target number, which is a black-surrounded white region that defines the target number by its length
- Third black region, which is the 2 black columns after the target number
- An overview of the required process is as shown in
FIG. 43 . - Since identification only relies on black or white pixels, the pixels 1150 from each column are passed through a filter 1151 to detect black or white, and then run length encoded 1152. The run-lengths are then passed to a state machine 1153 that has access to the last 3 run lengths and the 4th last color. Based on these values, possible targets pass through e of the identification stages.
- The GatherMin&Max process 1155 simply keeps the minimum & maximum pixel values encountered during the processing of the segment. These are used once the targets have been located to set BlackMax, WhiteMin, and MidRange values.
- Each segment keeps a set of target structures in its search for targets. While the target structures themselves don't move around in memory, several segment variables point to lists of pointers to these target structures. The three pointer lists are repeated here:
LocatedTargets Points to a set of Target structures that represent located targets. PossibleTargets Points to a set of pointers to Target structures that represent currently investigated pixel shapes that may be targets. AvailableTargets Points to a set of pointers to Target structures that are currently unused. - There are counters associated with each of these list pointers: TargetsFound, PossibleTargetCount, and AvailableTargetCount respectively.
- Before the alternative Artcard is loaded, TargetsFound and PossibleTargetCount are set to 0, and AvailableTargetCount is set to 28 (the maximum number of target structures possible to have under investigation since the minimum size of a target border is 40 pixels, and the data area is approximately 1152 pixels). An example of the target pointer layout is as illustrated in
FIG. 44 . - As potential new targets are found, they are taken from the AvailableTargets list 1157, the target data structure is updated, and the pointer to the structure is added to the PossibleTargets list 1158. When a target is completely verified, it is added to the LocatedTargets list 1159. If a possible target is found not to be a target after all, it is placed back onto the AvailableTargets list 1157. Consequently there are always 28 target pointers in circulation at any time, moving between the lists.
- The Target data structure 1160 can have the following form:
DataName Comment CurrentState The current state of the target search DetectCount Counts how long a target has been in a given state StartPixel Where does the target start? All the lines of pixels in this target should start within a tolerance of this pixel value. TargetNumber Which target number is this (according to what was read) Column Best estimate of the target's center column ordinate Pixel Best estimate of the target's center pixel ordinate - The ProcessPixelColumn function within the find targets module 1162 (
FIG. 43 ) then, goes through all the run lengths one by one, comparing the runs against existing possible targets (via StartPixel), or creating new possible targets if a potential target is found where none was previously known. In all cases, the comparison is only made if S0.color is white and S1.color is black. - The pseudocode for the ProcessPixelColumn set out hereinafter. When the first target is positively identified, the last column to be checked for targets can be determined as being within a maximum distance from it. For 1° rotation, the maximum distance is 18 pixel columns.
pixel = StartPixel t = 0 target=PossibleTarget[t] while ((pixel < EndPixel) && (TargetsFound < 6)) { if ((S0.Color == white) && (S1.Color == black)) { do { keepTrying = FALSE if ( (target != NULL) && (target−>AddToTarget(Column, pixel, S1, S2, S3)) ) { if (target−>CurrentState == IsATarget) { Remove target from PossibleTargets List Add target to LocatedTargets List TargetsFound++ if (TargetsFound == 1) FinalColumn = Column + MAX_TARGET_DELTA} } else if (target−>CurrentState == NotATarget) { Remove target from PossibleTargets List Add target to AvailableTargets List keepTrying = TRUE } else { t++ // advance to next target } target = PossibleTarget[t] } else { tmp = AvailableTargets[0] if (tmp−>AddToTarget(Column,pixel,S1,S2,S3) { Remove tmp from AvailableTargets list Add tmp to PossibleTargets list t++ // target t has been shifted right } } } while (keepTrying) } pixel += S1.RunLength Advance S0/S1/S2/S3 } - AddToTarget is a function within the find targets module that determines whether it is possible or not to add the specific run to the given target:
-
- If the run is within the tolerance of target's starting position, the run is directly related to the current target, and can therefore be applied to it.
- If the run starts before the target, we assume that the existing target is still ok, but not relevant to the run. The target is therefore left unchanged, and a return value of FALSE tells the caller that the run was not applied. The caller can subsequently check the run to see if it starts a whole new target of its own.
- If the run starts after the target, we assume the target is no longer a possible target. The state is changed to be NotATarget, and a return value of TRUE is returned.
- If the run is to be applied to the target, a specific action is performed based on the current state and set of runs in S1, S2, and S3. The AddToTarget pseudocode is as follows:
MAX_TARGET_DELTA = 1 if (CurrentState != NothingKnown) { if (pixel > StartPixel) // run starts after target { diff = pixel − StartPixel if (diff> MAX_TARGET_DELTA) { Currentstate = NotATarget return TRUE } } else { diff = StartPixel − pixel if (diff> MAX_TARGET_DELTA) return FALSE } } runType = DetermineRunType(S1, S2, S3) EvaluateState(runType) StartPixel = currentPixel return TRUE - Types of pixel runs are identified in DetermineRunType is as follows:
Types of Pixel Runs Type How identified (S1 is always black) TargetBorder S1 = 40 < RunLength < 50 S2 = white run TargetCenter S1 = 15 < RunLength < 26 S2 = white run with [RunLength < 12] S3 = black run with [15 < RunLength < 26] TargetNumber S2 = white run with [RunLength <= 40] - The EvaluateState procedure takes action depending on the current state and the run type.
- The actions are shown as follows in tabular form:
Type of CurrentState Pixel Run Action NothingKnown TargetBorder DetectCount = 1 CurrentState = LeftOfCenter LeftOfCenter TargetBorder DetectCount++ if (DetectCount > 24) CurrentState = NotATarget TargetCenter DetectCount = 1 CurrentState = InCenter Column = currentColumn Pixel = currentPixel + S1.RunLength CurrentState = NotATarget InCenter TargetCenter DetectCount++ tmp = currentPixel + S1.RunLength if (tmp < Pixel) Pixel = tmp if (DetectCount > 13) CurrentState = NotATarget TargetBorder DetectCount = 1 CurrentState = RightOfCenter CurrentState = NotATarget RightOfCenter TargetBorder DetectCount++ if (DetectCount >= 12) CurrentState = NotATarget TargetNumber DetectCount = 1 CurrentState = InTargetNumber TargetNumber = (S2.RunLength+ 2)/6 CurrentState = NotATarget InTargetNumber TargetNumber tmp = (S2.RunLength+ 2)/6 if (tmp > TargetNumber) TargetNumber = tmp DetectCount++ if (DetectCount >= 12) CurrentState = NotATarget TargetBorder if (DetectCount >= 3) CurrentState = IsATarget else CurrentState = NotATarget CurrentState = NotATarget IsATarget or — — NotATarget
Processing Targets - The located targets (in the LocatedTargets list) are stored in the order they were located. Depending on alternative Artcard rotation these targets will be in ascending pixel order or descending pixel order. In addition, the target numbers recovered from the targets may be in error. We may have also have recovered a false target. Before the clockmark estimates can be obtained, the targets need to be processed to ensure that invalid targets are discarded, and valid targets have target numbers fixed if in error (e.g. a damaged target number due to dirt). Two main steps are involved:
-
- Sort targets into ascending pixel order
- Locate and fix erroneous target numbers
- The first step is simple. The nature of the target retrieval means that the data should already be sorted in either ascending pixel or descending pixel. A simple swap sort ensures that if the 6 targets are already sorted correctly a maximum of 14 comparisons is made with no swaps. If the data is not sorted, 14 comparisons are made, with 3 swaps. The following pseudocode shows the sorting process:
for (i = 0; i < TargetsFound−1; i++) { oldTarget = LocatedTargets[i] bestPixel = oldTarget−>Pixel best = i j = i+1 while (j<TargetsFound) { if (LocatedTargets[j]−> Pixel < bestPixel) best = j j++ } if (best != i) // move only if necessary LocatedTargets[i] = LocatedTargets[best] LocatedTargets[best] = oldTarget } } - Locating and fixing erroneous target numbers is only slightly more complex. One by one, each of the N targets found is assumed to be correct. The other targets are compared to this “correct” target and the number of targets that require change should target N be correct is counted. If the number of changes is 0, then all the targets must already be correct. Otherwise the target that requires the fewest changes to the others is used as the base for change. A change is registered if a given target's target number and pixel position do not correlate when compared to the “correct” target's pixel position and target number. The change may mean updating a target's target number, or it may mean elimination of the target. It is possible to assume that ascending targets have pixels in ascending order (since they have already been sorted).
kPixelFactor = 1/(55 * 3) bestTarget = 0 bestChanges = TargetsFound + 1 for (i=0; i< TotalTargetsFound; i++) { numberOfChanges = 0; fromPixel = (LocatedTargets[i])−>Pixel fromTargetNumber = LocatedTargets[i].TargetNumber for (j=1; j< TotalTargetsFound; j++) { toPixel = LocatedTargets[j]−>Pixel deltaPixel = toPixel − fromPixel if (deltaPixel >= 0) deltaPixel += PIXELS_BETWEEN_TARGET_CENTRES/2 else deltaPixel −= PIXELS_BETWEEN_TARGET_CENTRES/2 targetNumber =deltaPixel * kPixelFactor targetNumber += fromTargetNumber if ( (targetNumber < 1)∥(targetNumber > 6) ∥ (targetNumber != LocatedTargets[j]−> TargetNumber) ) numberOfChanges++ } if (numberOfChanges < bestChanges) { bestTarget = i bestChanges = numberOfChanges } if (bestChanges < 2) break; } - In most cases this function will terminate with bestChanges=0, which means no changes are required. Otherwise the changes need to be applied. The functionality of applying the changes is identical to counting the changes (in the pseudocode above) until the comparison with targetNumber. The change application is:
if ((targetNumber < 1)∥(targetNumber > TARGETS_PER_BLOCK)) { LocatedTargets[j] = NULL TargetsFound−− } else { LocatedTargets[j]−> TargetNumber = targetNumber } - At the end of the change loop, the LocatedTargets list needs to be compacted and all NULL targets removed.
- At the end of this procedure, there may be fewer targets. Whatever targets remain may now be used (at least 2 targets are required) to locate the Clockmarks and the data region.
- Building Clockmark Estimates from Targets
- As shown previously in
FIG. 24 , the upper region'sfirst clockmark dot 1126 is 55 dots away from the center of the first target 1124 (which is the same as the distance between target centers). The center of the clockmark dots is a further 1 dot away, and theblack border line 1123 is a further 4 dots away from the first clockmark dot The lower region's first clockmark dot is exactly 7 targets-distance away (7×55 dots) from the upper region'sfirst clockmark dot 1126. - It cannot be assumed that
Targets - Before the continuous image can be constructed around the target's center, it is necessary to create a better estimate of the 2 target centers. The existing target centers actually are the top left coordinate of the bounding box of the target center. It is a simple process to go through each of the pixels for the area defining the center of the target, and find the pixel with the highest value. There may be more than one pixel with the same maximum pixel value, but the estimate of the center value only requires one pixel.
- The pseudocode is straightforward, and is performed for each of the 2 targets:
CENTER_WIDTH = CENTER_HEIGHT = 12 maxPixel = 0x00 for (i=0; i<CENTER_WIDTH; i++) for (j=0; j<CENTER_HEIGHT; j++) { p = GetPixel(column+i, pixel+j) if (p > maxPixel) { maxPixel = p centerColumn = column + i centerPixel = pixel + j } } Target.Column = centerColumn Target.Pixel = centerPixel - At the end of this process the target center coordinates point to the whitest pixel of the target, which should be within one pixel of the actual center. The process of building a more accurate position for the target center involves reconstructing the continuous signal for 7 scanline slices of the target, 3 to either side of the estimated target center. The 7 maximum values found (one for each of these pixel dimension slices) are then used to reconstruct a continuous signal in the column dimension and thus to locate the maximum value in that dimension.
// Given estimates column and pixel, determine a // betterColumn and betterPixel as the center of // the target for (y=0; y<7; y++) { for (x=0; x<7; x++) samples[x] = GetPixel(column−3+y, pixel−3+x) FindMax(samples, pos, maxVal) reSamples[y] = maxVal if(y == 3) betterPixel = pos + pixel } FindMax(reSamples, pos, maxVal) betterColumn = pos + column - FindMax is a function that reconstructs the original 1 dimensional signal based sample points and returns the position of the maximum as well as the maximum value found. The method of signal reconstruction/resampling used is the Lanczos3 windowed sinc function as shown in
FIG. 45 . - The Lanczos3 windowed sinc function takes 7 (pixel) samples from the dimension being reconstructed, centered around the estimated position x, i.e. at X−3, X−2, X−1, X, X+1, X+2, X+3. We reconstruct points from X−1 to X+1, each at an interval of 0.1, and determine which point is the maximum. The position that is the maximum value becomes the new center. Due to the nature of the kernel, only 6 entries are required in the convolution kernel for points between X and X+1. We use 6 points for X−1 to X, and 6 points for X to X+1, requiring 7 points overall in order to get pixel values from X−1 to X+1 since some of the pixels required are the same.
- Given accurate estimates for the upper-most target from and lower-most target to, it is possible to calculate the position of the first clockmark dot for the upper and lower regions as follows:
TARGETS_PER_BLOCK = 6 numTargetsDiff = to.TargetNum − from.TargetNum deltaPixel = (to.Pixel − from.Pixel) / numTargetsDiff deltaColumn = (to.Column − from.Column) / numTargetsDiff UpperClock.pixel = from.Pixel − (from.TargetNum*deltaPixel) UpperClock.column = from.Column−(from.TargetNum*deltaColumn) // Given the first dot of the upper clockmark, the // first dot of the lower clockmark is straightforward. LowerClock.pixel = UpperClock.pixel ((TARGETS_PER_BLOCK+1) * deltaPixel) LowerClock.column = UpperClock.column ((TARGETS_PER_BLOCK+1) * deltaColumn) - This gets us to the first clockmark dot. It is necessary move the column position a further 1 dot away from the data area to reach the center of the clockmark. It is necessary to also move the pixel position a further 4 dots away to reach the center of the border line. The pseudocode values for deltaColumn and deltaPixel are based on a 55 dot distance (the distance between targets), so these deltas must be scaled by 1/55 and 4/55 respectively before being applied to the clockmark coordinates. This is represented as:
kDeltaDotFactor=1/DOTS_BETWEEN_TARGET_CENTRES
deltaColumn*=kDeltaDotFactor
deltaPixel*=4*kDeltaDotFactor
UpperClock.pixel−=deltaPixel
UpperClock.column −=deltaColumn
LowerClock.pixel+=deltaPixel
LowerClock.column+=deltaColumn - UpperClock and LowerClock are now valid clockmark estimates for the first clockmarks directly in line with the centers of the targets.
- Setting Black and White Pixel/Dot Ranges
- Before the data can be extracted from the data area, the pixel ranges for black and white dots needs to be ascertained. The minimum and maximum pixels encountered during the search for targets were stored in WhiteMin and BlackMax respectively, but these do not represent valid values for these variables with respect to data extraction. They are merely used for storage convenience. The following pseudocode shows the method of obtaining good values for WhiteMin and BlackMax based on the min & max pixels encountered:
MinPixel=WhiteMin
MaxPixel=BlackMax
MidRange=(MinPixel+MaxPixel)/2
WhiteMin=MaxPixel−105
BlackMax=MinPixel+84
CurrentState=ExtractingBitImage - The ExtractingBitImage state is one where the data block has already been accurately located via the targets, and bit data is currently being extracted one dot column at a time and written to the alternative Artcard bit image. The following of data block clockmarks/borders gives accurate dot recovery regardless of rotation, and thus the segment bounds are ignored. Once the entire data block has been extracted (597 columns of 48 bytes each; 595 columns of data +2 orientation columns), new segment bounds are calculated for the next data block based on the current position. The state is changed to LookingForTargets.
- Processing a given dot column involves two tasks:
-
- The first task is to locate the specific dot column of data via the clockmarks.
- The second task is to run down the dot column gathering the bit values, one bit per dot.
- These two tasks can only be undertaken if the data for the column has been read off the alternative Artcard and transferred to DRAM. This can be determined by checking what
scanline Process 1 is up to, and comparing it to the clockmark columns. If the dot data is in DRAM we can update the clockmarks and then extract the data from the column before advancing the clockmarks to the estimated value for the next dot column. The process overview is given in the following pseudocode, with specific functions explained hereinafter:finishedBlock = FALSE if((UpperClock.column < Process1.CurrentScanLine) && (LowerClock.column < Process1.CurrentScanLine)) { DetermineAccurateClockMarks( ) DetermineDataInfo( ) if (CurrentDotColumn >= 0) ExtractDataFromColumn( ) AdvanceClockMarks( ) if (CurrentDotColumn == FINAL_COLUMN) { finishedBlock = TRUE currentState = LookingForTargets SetBounds(UpperClock.pixel, LowerClock.pixel) BitImage += 256KB CurrentByte = 0 TargetsFound = 0 } } return finishedBlock
Locating the Dot Column - A given dot column needs to be located before the dots can be read and the data extracted. This is accomplished by following the clockmarks/borderline along the upper and lower boundaries of the data block. A software equivalent of a phase-locked-loop is used to ensure that even if the clockmarks have been damaged, good estimations of clockmark positions will be made.
FIG. 46 illustrates an example data block's top left which corner reveals that there are clockmarks 3 dots high 1166 extending out to the target area, a white row, and then a black border line. - Initially, an estimation of the center of the first black clockmark position is provided (based on the target positions). We use the black border 1168 to achieve an accurate vertical position (pixel), and the clockmark eg. 1166 to get an accurate horizontal position (column). These are reflected in the UpperClock and LowerClock positions.
- The clockmark estimate is taken and by looking at the pixel data in its vicinity, the continuous signal is reconstructed and the exact center is determined. Since we have broken out the two dimensions into a clockmark and border, this is a simple one-dimensional process that needs to be performed twice. However, this is only done every second dot column, when there is a black clockmark to register against. For the white clockmarks we simply use the estimate and leave it at that Alternatively, we could update the pixel coordinate based on the border each dot column (since it is always present). In practice it is sufficient to update both ordinates every other column (with the black clockmarks) since the resolution being worked at is so fine. The process therefore becomes:
// Turn the estimates of the clockmarks into accurate // positions only when there is a black clockmark // (ie every 2nd dot column, starting from −8) if (Bit0(CurrentDotColumn) == 0) // even column { DetermineAccurateUpperDotCenter( ) DetermineAccurateLowerDotCenter( ) } - If there is a deviation by more than a given tolerance (MAX_CLOCKMARK_DEVIATION), the found signal is ignored and only deviation from the estimate by the maximum tolerance is allowed. In this respect the functionality is similar to that of a phase-locked loop. Thus DetermineAccurateUpperDotCenter is implemented via the following pseudocode:
// Use the estimated pixel position of // the border to determine where to look for // a more accurate clockmark center. The clockmark // is 3 dots high so even if the estimated position // of the border is wrong, it won't affect the // fixing of the clockmark position. MAX_CLOCKMARK_DEVIATION = 0.5 diff = GetAccurateColumn(UpperClock.column, UpperClock.pixel+(3*PIXELS_PER_DOT)) diff −= UpperClock.column if (diff > MAX_CLOCKMARK_DEVIATION) diff = MAX_CLOCKMARK_DEVIATION else if (diff < −MAX_CLOCKMARK_DEVIATION) diff = −MAX_CLOCKMARK_DEVIATION UpperClock.column += diff // Use the newly obtained clockmark center to // determine a more accurate border position. diff = GetAccuratePixel(UpperClock.column, UpperClock.pixel) diff −= UpperClock.pixel if (diff > MAX_CLOCKMARK_DEVIATION) diff = MAX_CLOCKMARK_DEVIATION else if (diff < −MAX_CLOCKMARK_DEVIATION) diff = −MAX_CLOCKMARK_DEVIATION UpperClock.pixel += diff - DetermineAccurateLowerDotCenter is the same, except that the direction from the border to the clockmark is in the negative direction (−3 dots rather than +3 dots).
- GetAccuratePixel and GetAccurateColumn are functions that determine an accurate dot center given a coordinate, but only from the perspective of a single dimension. Determining accurate dot centers is a process of signal reconstruction and then finding the location where the minimum signal value is found (this is different to locating a target center, which is locating the maximum value of the signal since the target center is white, not black). The method chosen for signal reconstruction/resampling for this application is the Lanczos3 windowed sinc function as previously discussed with reference to
FIG. 45 . - It may be that the clockmark or border has been damaged in some way—perhaps it has been scratched. If the new center value retrieved by the resampling differs from the estimate by more than a tolerance amount, the center value is only moved by the maximum tolerance. If it is an invalid position, it should be close enough to use for data retrieval, and future clockmarks will resynchronize the position.
- Determining the Center of the First Data Dot and the Deltas to Subsequent Dots
- Once an accurate UpperClock and LowerClock position has been determined, it is possible to calculate the center of the first data dot (CurrentDot), and the delta amounts to be added to that center position in order to advance to subsequent dots in the column (DataDelta).
- The first thing to do is calculate the deltas for the dot column. This is achieved simply by subtracting the UpperClock from the LowerClock, and then dividing by the number of dots between the two points. It is possible to actually multiply by the inverse of the number of dots since it is constant for an alternative Artcard, and multiplying is faster. It is possible to use different constants for obtaining the deltas in pixel and column dimensions. The delta in pixels is the distance between the two borders, while the delta in columns is between the centers of the two clockmarks. Thus the function DetermineDataInfo is two parts. The first is given by the pseudocode:
kDeltaColumnFactor=1/([DOTS_PER_DATA_COLUMN+2+2−1)
kDeltaPixelFactor=1/(DOTS_PER_DATA_COLUMN+5+5−1)
delta=LowerClock.column−UpperClock.column
DataDelta.column=delta*kDeltaColumnFactor
delta=LowerClock.pixel−UpperClock.pixel
DataDelta.pixel=delta*kDeltaPixelFactor - It is now possible to determine the center of the first data dot of the column. There is a distance of 2 dots from the center of the clockmark to the center of the first data dot, and 5 dots from the center of the border to the center of the first data dot Thus the second part of the function is given by the pseudocode:
CurrentDot.column=UpperClock.column+(2*DataDelta.column)
CurrentDot.pixel=UpperClock.pixel+(5*DataDelta.pixel)
Running Down a Dot Column - Since the dot column has been located from the phase-locked loop tracking the clockmarks, all that remains is to sample the dot column at the center of each dot down that column. The variable CurrentDot points is determined to the center of the first dot of the current column. We can get to the next dot of the column by simply adding DataDelta (2 additions: 1 for the column ordinate, the other for the pixel ordinate). A sample of the dot at the given coordinate (bi-linear interpolation) is taken, and a pixel value representing the center of the dot is determined. The pixel value is then used to determine the bit value for that dot. However it is possible to use the pixel value in context with the center value for the two surrounding dots on the same dot line to make a better bit judgement.
- We can be assured that all the pixels for the dots in the dot column being extracted are currently loaded in DRAM, for if the two ends of the line (clockmarks) are in DRAM, then the dots between those two clockmarks must also be in DRAM. Additionally, the data block height is short enough (only 384 dots high) to ensure that simple deltas are enough to traverse the length of the line. One of the reasons the card is divided into 8 data blocks high is that we cannot make the same rigid guarantee across the entire height of the card that we can about a single data block.
- The high level process of extracting a single line of data (48 bytes) can be seen in the following pseudocode. The dataBuffer pointer increments as each byte is stored, ensuring that consecutive bytes and columns of data are stored consecutively.
bitCount = 8 curr = 0x00 // definitely black next = GetPixel(CurrentDot) for (i=0; i < DOTS_PER_DATA_COLUMN; i++) { CurrentDot += DataDelta prev = curr curr = next next = GetPixel(CurrentDot) bit = DetermineCenterDot(prev, curr, next) byte = (byte << 1) | bit bitCount−− if (bitCount == 0) { *(BitImage | CurrentByte) = byte CurrentByte++ bitCount = 8 } } - The GetPixel function takes a dot coordinate (fixed point) and
samples 4 CCD pixels to arrive at a center pixel value via bilinear interpolation. - The DetermineCenterDot function takes the pixel values representing the dot centers to either side of the dot whose bit value is being determined, and attempts to intelligently guess the value of that center dot's bit value. From the generalized blurring curve of
FIG. 33 there are three common cases to consider: -
- The dot's center pixel value is lower than WhiteMin, and is therefore definitely a black dot. The bit value is therefore definitely 1.
- The dot's center pixel value is higher than BlackMax, and is therefore definitely a white dot The bit value is therefore definitely 0.
- The dot's center pixel value is somewhere between BlackMax and WhiteMin. The dot may be black, and it may be white. The value for the bit is therefore in question. A number of schemes can be devised to make a reasonable guess as to the value of the bit. These schemes must balance complexity against accuracy, and also take into account the fact that in some cases, there is no guaranteed solution. In those cases where we make a wrong bit decision, the bit's Reed-Solomon symbol will be in error, and must be corrected by the Reed-Solomon decoding stage in
Phase 2.
- The scheme used to determine a dot's value if the pixel value is between BlackMax and WhiteMin is not too complex, but gives good results. It uses the pixel values of the dot centers to the left and right of the dot in question, using their values to help determine a more likely value for the center dot:
-
- If the two dots to either side are on the white side of MidRange (an average dot value), then we can guess that if the center dot were white, it would likely be a “definite” white. The fact that it is in the not-sure region would indicate that the dot was black, and had been affected by the surrounding white dots to make the value less sure. The dot value is therefore assumed to be black, and hence the bit value is 1.
- If the two dots to either side are on the black side of MidRange, then we can guess that if the center dot were black, it would likely be a “definite” black. The fact that it is in the not-sure region would indicate that the dot was white, and had been affected by the surrounding black dots to make the value less sure. The dot value is therefore assumed to be white, and hence the bit value is 0.
- If one dot is on the black side of MidRange, and the other dot is on the white side of MidRange, we simply use the center dot value to decide. If the center dot is on the black side of MidRange, we choose black (bit value 1). Otherwise we choose white (bit value 0).
- The logic is represented by the following:
if (pixel < WhiteMin) //definitely black bit = 0x01 else if (pixel > BlackMax) //definitely white bit = 0x00 else if ((prev > MidRange) && (next> MidRange)) //prob black bit = 0x01 else if ((prev < MidRange) && (next < MidRange))//prob white bit = 0x00 else if (pixel < MidRange) bit = 0x01 else bit = 0x00 - From this one can see that using surrounding pixel values can give a good indication of the value of the center dot's state. The scheme described here only uses the dots from the same row, but using a single dot line history (the previous dot line) would also be straightforward as would be alternative arrangements.
- Updating Clockmarks for the Next Column
- Once the center of the first data dot for the column has been determined, the clockmark values are no longer needed. They are conveniently updated in readiness for the next column after the data has been retrieved for the column. Since the clockmark direction is perpendicular to the traversal of dots down the dot column, it is possible to use the pixel delta to update the column, and subtract the column delta to update the pixel for both clocks:
UpperClock.column+=DataDelta.pixel
LowerClock.column+=DataDelta.pixel
UpperClock.pixel−=DataDelta.column
LowerClock.pixel−=DataDelta.column - These are now the estimates for the next dot column.
- Timing
- The timing requirement will be met as long as DRAM utilization does not exceed 100%, and the addition of parallel algorithm timing multiplied by the algorithm DRAM utilization does not exceed 100%. DRAM utilization is specified relative to Process1, which writes each pixel once in a consecutive manner, consuming 9% of the DRAM bandwidth.
- The timing as described in this section, shows that the DRAM is easily able to cope with the demands of the alternative Artcard Reader algorithm. The timing bottleneck will therefore be the implementation of the algorithm in terms of logic speed, not DRAM access. The algorithms have been designed however, with simple architectures in mind, requiring a minimum number of logical operations for every memory cycle. From this point of view, as long as the implementation state machine or equivalent CPU/DSP architecture is able to perform as described in the following sub-sections, the target speed will be met.
- Locating the Targets
- Targets are located by reading pixels within the bounds of a pixel column. Each pixel is read once at most Assuming a run-length encoder that operates fast enough, the bounds on the location of targets is memory access. The accesses will therefore be no worse than the timing for
Process 1, which means a 9% utilization of the DRAM bandwidth. - The total utilization of DRAM during target location (including Process1) is therefore 18%, meaning that the target locator will always be catching up to the alternative Artcard image sensor pixel reader.
- Processing the Targets
- The timing for sorting and checking the target numbers is trivial. The finding of better estimates for each of the two target centers involves 12 sets of 12 pixel reads, taking a total of 144 reads. However the fixing of accurate target centers is not trivial, requiring 2 sets of evaluations. Adjusting each target center requires 8 sets of 20 different 6-entry convolution kernels. Thus this totals 8×20×6 multiply-accumulates=960. In addition, there are 7 sets of 7 pixels to be retrieved, requiring 49 memory accesses. The total number per target is therefore 144+960+49=1153, which is a same number of pixels in a column of pixels (1152). Thus each target evaluation consumes the time taken by otherwise processing a row of pixels. For two targets we effectively consume the time for 2 columns of pixels.
- A target is positively identified on the first pixel column after the target number. Since there are 2 dot columns before the orientation column, there are 6 pixel columns. The Target Location process effectively uses up the first of the pixel columns, but the remaining 5 pixel columns are not processed at all. Therefore the data area can be located in ⅖ of the time available without impinging on any other process time.
- The remaining ⅗ of the time available is ample for the trivial task of assigning the ranges for black and white pixels, a task that may take a couple of machine cycles at most.
- Extracting Data
- There are two parts to consider in terms of timing:
-
- Getting accurate clockmarks and border values
- Extracting dot values
- Clockmarks and border values are only gathered every second dot column. However each time a clockmark estimate is updated to become more accurate, 20 different 6-entry convolution kernels must be evaluated. On average there are 2 of these per dot column (there are 4 every 2 dot-columns). Updating the pixel ordinate based on the border only requires 7 pixels from the same pixel scanline. Updating the column ordinate however, requires 7 pixels from different columns, hence different scanlines. Assuming worst case scenario of a cache miss for each scanline entry and 2 cache misses for the pixels in the same scanline, this totals 8 cache misses.
- Extracting the dot information involves only 4 pixel reads per dot (rather than the average 9 that define the dot). Considering the data area of 1152 pixels (384 dots), at best this will save 72 cache reads by only reading 4 pixel dots instead of 9. The worst case is a rotation of 1° which is a single pixel translation every 57 pixels, which gives only slightly worse savings.
- It can then be safely said that, at worst, we will be reading fewer cache lines less than that consumed by the pixels in the data area. The accesses will therefore be no worse than the timing for
Process 1, which implies a 9% utilization of the DRAM bandwidth. - The total utilization of DRAM during data extraction (including Process1) is therefore 18%, meaning that the data extractor will always be catching up to the alternative Artcard image sensor pixel reader. This has implications for the Process Targets process in that the processing of targets can be performed by a relatively inefficient method if necessary, yet still catch up quickly during the extracting data process.
-
Phase 2—Decode Bit Image -
Phase 2 is the non-real-time phase of alternative Artcard data recovery algorithm. At the start of Phase 2 a bit image has been extracted from the alternative Artcard. It represents the bits read from the data regions of the alternative Artcard. Some of the bits will be in error, and perhaps the entire data is rotated 180° because the alternative Artcard was rotated when inserted.Phase 2 is concerned with reliably extracting the original data from this encoded bit image. There are basically 3 steps to be carried out as illustrated inFIG. 48 : -
- Reorganize the bit image, reversing it if the alternative Artcard was inserted backwards
- Unscramble the encoded data
- Reed-Solomon decode the data from the bit image
- Each of the 3 steps is defined as a separate process, and performed consecutively, since the output of one is required as the input to the next It is straightforward to combine the first two steps into a single process, but for the purposes of clarity, they are treated separately here.
- From a data/process perspective,
Phase 2 has the structure as illustrated inFIG. 49 . - The timing of
Processes Phase 2. - Reorganize the bit image, reversing it if necessary
- The bit map in DRAM now represents the retrieved data from the alternative Artcard. However the bit image is not contiguous. It is broken into 64 32 k chunks, one chunk for each data block. Each 32 k chunk contains only 28,656 useful bytes:
-
- 48 bytes from the leftmost Orientation Column
- 28560 bytes from the data region proper
- 48 bytes from the rightmost Orientation Column
- 4112 unused bytes
- The 2 MB buffer used for pixel data (stored by
Process 1 of Phase 1) can be used to hold the reorganized bit image, since pixel data is not required duringPhase 2. At the end of the reorganization, a correctly oriented contiguous bit image will be in the 2 MB pixel buffer, ready for Reed-Solomon decoding. - If the card is correctly oriented, the leftmost Orientation Column will be white and the rightmost Orientation Column will be black. If the card has been rotated 180°, then the leftmost Orientation Column will be black and the rightmost Orientation Column will be white.
- A simple method of determining whether the card is correctly oriented or not, is to go through each data block, checking the first and last 48 bytes of data until a block is found with an overwhelming ratio of black to white bits. The following pseudocode demonstrates this, returning TRUE if the card is correctly oriented, and FALSE if it is not:
totalCountL = 0 totalCountR = 0 for (i=0; i<64; i++) { blackCountL = 0 blackCountR = 0 currBuff = dataBuffer for (j=0; j<48; j++) { blackCountL += CountBits(*currBuff) currBuff++ } currBuff += 28560 for (j=0; j<48; j++) { blackCountR += CountBits(*currBuff) currBuff++ } dataBuffer += 32k if (blackCountR > (blackCountL * 4)) return TRUE if (blackCountL > (blackCountR * 4)) return FALSE totalCountL += blackCountL totalCountR += blackCountR } return (totalCountR > totalCountL) - The data must now be reorganized, based on whether the card was oriented correctly or not. The simplest case is that the card is correctly oriented. In this case the data only needs to be moved around a little to remove the orientation columns and to make the entire data contiguous. This is achieved very simply in situ, as described by the following pseudocode:
DATA_BYTES_PER_DATA_BLOCK = 28560 to = dataBuffer from = dataBuffer + 48) // left orientation column for (i=0; i<64; i++) { BlockMove(from, to, DATA_BYTES_PER_DATA_BLOCK) from += 32k to += DATA_BYTES_PER_DATA_BLOCK } - The other case is that the data actually needs to be reversed. The algorithm to reverse the data is quite simple, but for simplicity, requires a 256-byte table Reverse where the value of Reverse[N] is a bit-reversed N.
DATA_BYTES_PER_DATA_BLOCK = 28560 to = outBuffer for (i=0; i<64; i++) { from = dataBuffer + (i * 32k) from += 48 // skip orientation column from += DATA_BYTES_PER_DATA_BLOCK − 1 // end of block for (j=0; j < DATA_BYTES_PER_DATA_BLOCK; j++) { *to++ = Reverse[*from] from−− } } - The timing for either process is negligible, consuming less than 1/1000th of a second:
-
- 2 MB contiguous reads (2048/16×12 ns=1,536 ns)
- 2 MB effectively contiguous byte writes (2048/16×12 ns=1,536 ns)
Unscramble the Encoded Image
- The bit image is now 1,827,840 contiguous, correctly oriented, but scrambled bytes. The bytes must be unscrambled to create the 7,168 Reed-Solomon blocks, each 255 bytes long. The unscrambling process is quite straightforward, but requires a separate output buffer since the unscrambling cannot be performed in situ.
FIG. 49 illustrates the unscrambling process conducted memory - The following pseudocode defines how to perform the unscrambling process:
groupSize = 255 numBytes = 1827840; inBuffer = scrambledBuffer; outBuffer = unscrambledBuffer; for (i=0; i<groupSize; i++) for (j=i; j<numBytes; j+=groupSize) outBuffer[j] = *inBuffer++ - The timing for this process is negligible, consuming less than 1/1000th of a second:
-
- 2 MB contiguous reads (2048/16×12 ns=1,536 ns)
- 2 MB non-contiguous byte writes (2048×12 ns=24,576 ns)
- At the end of this process the unscrambled data is ready for Reed-Solomon decoding.
- Reed Solomon Decode
- The final part of reading an alternative Artcard is the Reed-Solomon decode process, where approximately 2 MB of unscrambled data is decoded into approximately 1 MB of valid alternative Artcard data.
- The algorithm performs the decoding one Reed-Solomon block at a time, and can (if desired) be performed in situ, since the encoded block is larger than the decoded block, and the redundancy bytes are stored after the data bytes.
- The first 2 Reed-Solomon blocks are control blocks, containing information about the size of the data to be extracted from the bit image. This meta-information must be decoded first, and the resultant information used to decode the data proper. The decoding of the data proper is simply a case of decoding the data blocks one at a time. Duplicate data blocks can be used if a particular block fails to decode.
- The highest level of the Reed-Solomon decode is set out in pseudocode:
// Constants for Reed Solomon decode sourceBlockLength = 255; destBlockLength = 127; numControlBlocks = 2; // Decode the control information if (! GetControlData(source, destBlocks, lastBlock)) return error destBytes = ((destBlocks−1) * destBlockLength) + lastBlock offsetToNextDuplicate = destBlocks * sourceBlockLength // Skip the control blocks and position at data source += numControlBlocks * sourceBlockLength // Decode each of the data blocks, trying // duplicates as necessary blocksInError = 0; for (i=0; i<destBlocks; i++) { found = DecodeBlock(source, dest); if (! found) { duplicate = source + offsetToNextDuplicate while ((! found) && (duplicate<sourceEnd)) { found = DecodeBlock(duplicate, dest) duplicate += offsetToNextDuplicate } } if (! found) blocksInError++ source += sourceBlockLength dest += destBlockLength } return destBytes and blocksInError - DecodeBlock is a standard Reed Solomon block decoder using m=8 and t=64.
- The GetControlData function is straightforward as long as there are no decoding errors. The function simply calls DecodeBlock to decode one control block at a time until successful. The control parameters can then be extracted from the first 3 bytes of the decoded data (destBlocks is stored in the
bytes - The time taken to Reed-Solomon decode depends on the implementation. While it is possible to use a dedicated core to perform the Reed-Solomon decoding process (such as LSI Logic's L64712), it is preferable to select a CPU/DSP combination that can be more generally used throughout the embedded system (usually to do something with the decoded data) depending on the application. Of course decoding time must be fast enough with the CPU/DSP combination.
- The L64712 has a throughput of 50 Mbits per second (around 6.25 MB per second), so the time is bound by the speed of the Reed-Solomon decoder rather than the maximum 2 MB read and 1 MB write memory access time. The time taken in the worst case (all 2 MB requires decoding) is thus 2/6.25 s=approximately 0.32 seconds. Of course, many further refinements are possible including the following:
- The blurrier the reading environment, the more a given dot is influenced by the surrounding dots. The current reading algorithm of the preferred embodiment has the ability to use the surrounding dots in the same column in order to make a better decision about a dot's value. Since the previous column's dots have already been decoded, a previous column dot history could be useful in determining the value of those dots whose pixel values are in the not-sure range.
- A different possibility with regard to the initial stage is to remove it entirely, make the initial bounds of the data blocks larger than necessary and place greater intelligence into the ProcessingTargets functions. This may reduce overall complexity. Care must be taken to maintain data block independence.
- Further the control block mechanism can be made more robust:
-
- The control block could be the first and last blocks rather than make them contiguous (as is the case now). This may give greater protection against certain pathological damage scenarios.
- The second refinement is to place an additional level of redundancy/error detection into the control block structure to be used if the Reed-Solomon decode step fails. Something as simple as parity might improve the likelihood of control information if the Reed-Solomon stage fails.
Data Card Reader
-
FIG. 51 , there is illustrated one form of card reader 500 which allows for the insertion ofArtcards 9 for reading.FIG. 50 shows an exploded perspective of the reader ofFIG. 51 . Cardreader is interconnected to a computer system and includes aCCD reading mechanism 35. The cardreader includespinch rollers Artcard 9. One of the roller e.g. 506 is driven by anArtcard motor 37 for the advancement of thecard 9 between the tworollers 506 and a uniformed speed. TheArtcard 9 is passed over a series ofLED lights 512 which are encased within aclear plastic mould 514 having a semi circular cross section. The cross section focuses the light from the LEDs eg 512 onto the surface of thecard 9 as it passes by theLEDs 512. From the surface it is reflected to a high resolutionlinear CCD 34 which is constructed to a resolution of approximately 480 dpi. The surface of theArtcard 9 is encoded to the level of approximately 1600 dpi hence, thelinear CCD 34 supersamples the Artcard surface with an approximately three times multiplier. TheArtcard 9 is further driven at a speed such that thelinear CCD 34 is able to supersample in the direction of Artcard movement at a rate of approximately 4800 readings per inch. The scanned Artcard CCD data is forwarded from the Artcard reader toACP 31 for processing. Asensor 49, which can comprise a light sensor acts to detect of the presence of thecard 13. - The CCD reader includes a
bottom substrate 516, atop substrate 514 which comprises a transparent molded plastic. In between the two substrates is inserted thelinear CCD array 34 which comprises a thin long linear CCD array constructed by means of semi-conductor manufacturing processes. - Turning to
FIG. 52 , there is illustrated a side perspective view, partly in section, of an example construction of the CCD reader unit. The series of LEDs eg. 512 are operated to emit light when acard 9 is passing across the surface of theCCD reader 34. The emitted light is transmitted through a portion of thetop substrate 523. The substrate includes a portion eg. 529 having a curved circumference so as to focus light emitted fromLED 512 to a point eg. 532 on the surface of thecard 9. The focused light is reflected from thepoint 532 towards theCCD array 34. A series of microlenses eg. 534, shown in exaggerated form, are formed on the surface of thetop substrate 523. Themicrolenses 523 act to focus light received across the surface to the focused down to apoint 536 which corresponds to point on the surface of theCCD reader 34 for sensing of light falling on the light sensing portion of theCCD array 34. - A number of refinements of the above arrangement are possible. For example, the sensing devices on the
linear CCD 34 may be staggered. The correspondingmicrolenses 34 can also be correspondingly formed as to focus light into a staggered series of spots so as to correspond to the staggered CCD sensors. - To assist reading, the data surface area of the
Artcard 9 is modulated with a checkerboard pattern as previously discussed with reference toFIG. 5 . Other forms of high frequency modulation may be possible however. - It will be evident that an Artcard printer can be provided as for the printing out of data on storage Artcard. Hence, the Artcard system can be utilized as a general form of information distribution outside of the Artcam device. An Artcard printer can prints out Artcards on high quality print surfaces and multiple Artcards can be printed on same sheets and later separated. On a second surface of the
Artcard 9 can be printed information relating to the files etc. stored on theArtcard 9 for subsequent storage. - Hence, the Artcard system allows for a simplified form of storage which is suitable for use in place of other forms of storage such as CD ROMs, magnetic disks etc. The
Artcards 9 can also be mass produced and thereby produced in a substantially inexpensive form for redistribution. - Print Rolls
- Turning to
FIG. 54 , there is illustrated theprint roll 42 and print-head portions of the Artcam. The paper/film 611 is fed in a continuous “web-like” process to aprinting mechanism 15 which includes further pinch rollers 616-619 and aprint head 44 - The
pinch roller 613 is connected to a drive mechanism (not shown) and upon rotation of theprint roller 613, “paper” in the form offilm 611 is forced through theprinting mechanism 615 and out of thepicture output slot 6. A rotary guillotine mechanism (not shown) is utilised to cut the roll ofpaper 611 at required photo sizes. - It is therefore evident that the
printer roll 42 is responsible for supplying “paper” 611 to theprint mechanism 615 for printing of photographically imaged pictures. - In
FIG. 55 , there is shown an exploded perspective of theprint roll 42. Theprinter roll 42 includesoutput printer paper 611 which is output under the operation of pinchingrollers - Referring now to
FIG. 56 , there is illustrated a more fully exploded perspective view, of theprint roll 42 ofFIG. 55 without the “paper” film roll. Theprint roll 42 includes three main parts comprisingink reservoir section 620,paper roll sections outer casing sections - Turning first to the
ink reservoir section 620, which includes the ink reservoir orink supply sections 633. The ink for printing is contained within three bladder type containers 630-632. Theprinter roll 42 is assumed to provide full color output inks. Hence, a first ink reservoir orbladder container 630 contains cyan colored ink. Asecond reservoir 631 contains magenta colored ink and athird reservoir 632 contains yellow ink. Each of the reservoirs 630-632, although having different volumetric dimensions, are designed to have substantially the same volumetric size. - The
ink reservoir sections ink reservoir 632 havingink channel 641, andoutput port 637, theink reservoir 631 havingink channel 640 andoutput port 636, and theink reservoir 630 havingink channel 639 andoutput port 637. - In operation, the ink reservoirs 630-632 can be filled with corresponding ink and the
section 633 joined to thesection 621. The ink reservoir sections 630-632, being collapsible bladders, allow for ink to traverse ink channels 639-641 and therefore be in fluid communication with the ink output ports 635-637. Further, if required, an air inlet port can also be provided to allow the pressure associated with ink channel reservoirs 630-632 to be maintained as required. - The
cap 624 can be joined to theink reservoir section 620 so as to form a pressurized cavity, accessible by the air pressure inlet port. - The
ink reservoir sections printer roll sections printer roll sections paper roll sections sections print roll sections 622, 625 as required. - As noted previously, the
ink reservoir sections paper roll sections printer roll sections ink reservoir sections - The
outer casing sections print roller sections cover roller 613 being driven externally (not shown) to feed the print film and out of the print roll. - Finally, a
cavity 677 can be provided in theink reservoir sections circuit type device 53 for the storage of information associated with theprint roll 42. - As shown in
FIG. 56 , theprint roll 42 is designed to be inserted into the Artcam camera device so as to couple with acoupling unit 680 which includesconnector pads 681 for providing a connection with thesilicon chip 53. Further, theconnector 680 includes end connectors of four connecting with ink supply ports 635-637. The ink supply ports are in turn to connect to ink supply lines eg 682 which are in turn interconnected to printheads supply ports eg. 687 for the flow of ink to print-head 44 in accordance with requirements. - The “media” 611 utilised to form the roll can comprise many different materials on which it is designed to print suitable images. For example, opaque rollable plastic material may be utilized, transparencies may be used by using transparent plastic sheets, metallic printing can take place via utilization of a metallic sheet film. Further, fabrics could be utilised within the
printer roll 42 for printing images on fabric, although care must be taken that only fabrics having a suitable stiffness or suitable backing material are utilised. - When the print media is plastic, it can be coated with a layer which fixes and absorbs the ink. Further, several types of print media may be used, for example, opaque white matte, opaque white gloss, transparent film, frosted transparent film, lenticular array film for stereoscopic 3D prints, metallised film, film with the embossed optical variable devices such as gratings or holograms, media which is pre-printed on the reverse side, and media which includes a magnetic recording layer. When utilising a metallic foil, the metallic foil can have a polymer base, coated with a thin (several micron) evaporated layer of aluminum or other metal and then coated with a clear protective layer adapted to receive the ink via the ink printer mechanism.
- In use the
print roll 42 is obviously designed to be inserted inside a camera device so as to provide ink and paper for the printing of images on demand. The ink output ports 635-637 meet with corresponding ports within the camera device and the pinch rollers 672, 673 are operated to allow the supply of paper to the camera device under the control of the camera device. - As illustrated in
FIG. 56 , a mountedsilicon chip 53 is insert in one end of theprint roll 42. InFIG. 57 theauthentication chip 53 is shown in more detail and includes four communications leads 680-683 for communicating details from thechip 53 to the corresponding camera to which it is inserted. - Turning to
FIG. 57 , the chip can be separately created by means of encasing a smallintegrated circuit 687 in epoxy and running bonding leads eg. 688 to the external communications leads 680-683. Theintegrated chip 687 being approximately 400 microns square with a 100 micron scribe boundary. Subsequently, the chip can be glued to an appropriate surface of the cavity of theprint roll 42. InFIG. 58 , there is illustrated theintegrated circuit 687 interconnected tobonding pads FIG. 57 . Artcards can, of course, be used in many other environments. For example ArtCards can be used in both embedded and personal computer (PC) applications, providing a user-friendly interface to large amounts of data or configuration information. - This leads to a large number of possible applications. For example, a ArtCards reader can be attached to a PC. The applications for PCs are many and varied. The simplest application is as a low cost read-only distribution medium. Since ArtCards are printed, they provide an audit trail if used for data distribution within a company.
- Further, many times a PC is used as the basis for a closed system, yet a number of configuration options may exist. Rather than rely on a complex operating system interface for users, the simple insertion of a ArtCards into the ArtCards reader can provide all the configuration requirements.
- While the back side of a ArtCards has the same visual appearance regardless of the application (since it stores the data), the front of a ArtCards is application dependent It must make sense to the user in the context of the application.
- It can therefore be seen that the arrangement of
FIG. 59 provides for an efficient distribution of information in the forms of books, newspapers, magazines, technical manuals, etc. - In a further application, as illustrated in
FIG. 60 , the front side of a ArtCards 80 can show an image that includes an artistic effect to be applied to a sampled image. A camera system 81 can be provided which includes a cardreader 82 for reading the programmed data on the back of the card 80 and applying the algorithmic data to a sampled image 83 so as to produce an output image 84. The camera unit 81 including an on board inkjet printer and sufficient processing means for processing the sampled image data. A further application of the ArtCards concept, hereinafter called “BizCard” is to store company information on business cards. BizCard is a new concept in company information. The front side of a bizCard as illustrated inFIG. 61 and looks and functions exactly as today's normal business card. It includes a photograph and contact information, with as many varied card styles as there are business cards. However, the back of each bizCard contains a printed array of black and white dots that holds 1-2 megabytes of data about the company. The result is similar to having the storage of a 3.5″ disk attached to each business card. - The information could be company information, specific product sheets, web-site pointers, e-mail addresses, a resume . . . in short, whatever the bizCard holder wants it to. BizCards can be read by any ArtCards reader such as an attached PC card reader, which can be connected to a standard PC by a USB port. BizCards can also be displayed as documents on specific embedded devices. In the case of a PC, a user simply inserts the bizCard into their reader. The bizCard is then preferably navigated just like a web-site using a regular web browser.
- Simply by containing the owner's photograph and digital signature as well as a pointer to the company's public key, each bizCard can be used to electronically verify that the person is in fact who they claim to be and does actually work for the specified company. In addition by pointing to the company's public key, a bizCard permits simple initiation of secure communications.
- A further application, hereinafter known as “TourCard” is an application of the ArtCards which contains information for tourists and visitors to a city. When a tourCard is inserted into the ArtCards book reader, information can be in the form of:
-
- Maps
- Public Transport Timetables
- Places of Interest
- Local history
- Events and Exhibitions
- Restaurant locations
- Shopping Centres
- TourCard is a low cost alternative to tourist brochures, guide books and street directories. With a manufacturing cost of just one cent per card, tourCards could be distributed at tourist information centres, hotels and tourist attractions, at a minimum cost, or free if sponsored by advertising. The portability of the bookreader makes it the perfect solution for tourists. TourCards can also be used at information kiosk's, where a computer equipped with the ArtCards reader can decode the information encoded into the tourCard on any web browser.
- It is interactivity of the bookreader that makes the tourCard so versatile. For example, Hypertext links contained on the map can be selected to show historical narratives of the feature buildings. In this way the tourist can embark on a guided tour of the city, with relevant transportation routes and timetables available at any time. The tourCard eliminates the need for separate maps, guide books, timetables and restaurant guides and creates a simple solution for the independent traveller.
- Of course, many other utilizations of the data cards are possible. For example, newspapers, study guides, pop group cards, baseball cards, timetables, music data files, product parts, advertising, TV guides, movie guides, trade show information, tear off cards in magazines, recipes, classified ads, medical information, programmes and software, horse racing form guides, electronic forms, annual reports, restaurant, hotel and vacation guides, translation programmes, golf course information, news broadcast, comics, weather details etc.
- For example, the ArtCards could include a book's contents or a newspaper's contents. An example of such a system is as illustrated in
FIG. 59 wherein theArtCards 70 includes a book title on one surface with the second surface having the encoded contents of the book printed thereon. Thecard 70 is inserted in the reader 72 which can include a flexible display 73 which allows for the folding up of card reader 72. The card reader 72 can include display controls 74 which allow for paging forward and back and other controls of the card reader 72.
Claims (8)
1. A data storage device which comprises
a data carrier having at least one planar surface; and
an array of detectable items positioned on the planar surface and detectable with a sensing device, the array being configured to represent a two-dimensional code that defines at least executable instructions and redundancy encoding to impart fault tolerant characteristics to the code, the executable instructions including image processing algorithms.
2. A data storage device as claimed in claim 1 , in which the data carrier is a card such that the array of detectable items are positioned on a first surface of the card and a visual depiction representing the code is positioned on a second opposite surface of the card.
3. A data storage device as claimed in claim 2 , in which the card is of a plastics material that is coated with a hydrophilic dye-fixing layer.
4. A data storage device as claimed in claim 2 , in which the detectable items are in the form of dots printed on the first surface of the card.
5. A data storage device as claimed in claim 4 , in which the redundancy encoding includes reed-solomon fault correction encoding.
6. A data storage device as claimed in claim 4 in which the array of dots are printed with a 1600 dpi resolution.
7. A data storage device as claimed in claim 4 , in which the dots define at least one target which is detectable by the sensor, the target being associated with at least one data area defined by the dots.
8. A data storage device as claimed in claim 7 , in which the targets are oriented to permit reading of the card in at least two directions.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/962,404 US20050150963A1 (en) | 1997-03-16 | 2004-10-13 | Data storage device incorporating a two-dimensional code |
US11/039,850 US20050127191A1 (en) | 1997-03-16 | 2005-01-24 | Data storage device incorporating a two-dimensional code |
Applications Claiming Priority (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AUPP237097 | 1997-03-16 | ||
AUPO7991 | 1997-07-15 | ||
AUPO7991A AUPO799197A0 (en) | 1997-07-15 | 1997-07-15 | Image processing method and apparatus (ART01) |
AUPP2370 | 1998-03-16 | ||
US10/269,998 US6827282B2 (en) | 1997-03-16 | 2002-10-15 | Identifying card |
US10/962,404 US20050150963A1 (en) | 1997-03-16 | 2004-10-13 | Data storage device incorporating a two-dimensional code |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/269,998 Continuation US6827282B2 (en) | 1997-03-16 | 2002-10-15 | Identifying card |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/039,850 Continuation US20050127191A1 (en) | 1997-03-16 | 2005-01-24 | Data storage device incorporating a two-dimensional code |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050150963A1 true US20050150963A1 (en) | 2005-07-14 |
Family
ID=3802281
Family Applications (27)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/112,737 Expired - Lifetime US6331946B1 (en) | 1997-07-15 | 1998-07-10 | Method for protecting on-chip memory (flash and RAM) against attacks |
US09/113,223 Expired - Lifetime US6442525B1 (en) | 1997-07-15 | 1998-07-10 | System for authenticating physical objects |
US09/516,869 Expired - Lifetime US6374354B1 (en) | 1997-07-15 | 2000-03-02 | Consumable authentication protocol and system |
US09/517,380 Expired - Lifetime US6334190B1 (en) | 1997-07-15 | 2000-03-02 | System for the manipulation of secure data |
US10/269,998 Expired - Lifetime US6827282B2 (en) | 1997-03-16 | 2002-10-15 | Identifying card |
US10/302,604 Expired - Fee Related US6787051B2 (en) | 1997-07-15 | 2002-11-23 | Method of manufacturing a micro-electromechanical fluid ejecting device |
US10/780,624 Expired - Fee Related US7454617B2 (en) | 1997-07-15 | 2004-02-19 | Apparatus for validating the presence of an authorized accessory |
US10/882,772 Expired - Fee Related US6938990B2 (en) | 1997-07-15 | 2004-07-02 | Fluid ejecting actuator for multiple nozzles of a printhead |
US10/884,886 Abandoned US20050092849A1 (en) | 1997-07-15 | 2004-07-06 | Information card with fault tolerant printing of encoded information |
US10/962,404 Abandoned US20050150963A1 (en) | 1997-03-16 | 2004-10-13 | Data storage device incorporating a two-dimensional code |
US10/963,542 Expired - Fee Related US7093762B2 (en) | 1997-03-16 | 2004-10-14 | Image processing and printing apparatus |
US11/001,144 Expired - Fee Related US7234645B2 (en) | 1997-03-16 | 2004-12-02 | Document having an encoded data structure |
US11/039,850 Abandoned US20050127191A1 (en) | 1997-03-16 | 2005-01-24 | Data storage device incorporating a two-dimensional code |
US11/107,792 Expired - Fee Related US7222799B2 (en) | 1997-03-16 | 2005-04-18 | Data storage device incorporating a two-dimensional code |
US11/144,799 Expired - Fee Related US7416282B2 (en) | 1997-07-15 | 2005-06-06 | Printhead having common actuator for inkjet nozzles |
US11/584,619 Expired - Fee Related US7278711B2 (en) | 1997-07-15 | 2006-10-23 | Nozzle arrangement incorporating a lever based ink displacement mechanism |
US11/672,878 Abandoned US20070126880A1 (en) | 1997-07-15 | 2007-02-08 | Handheld device with image sensor and printer |
US11/739,071 Expired - Fee Related US7703910B2 (en) | 1997-03-16 | 2007-04-23 | Print roll unit incorporating pinch rollers |
US11/744,214 Expired - Fee Related US7373083B2 (en) | 1997-03-16 | 2007-05-03 | Camera incorporating a releasable print roll unit |
US11/744,218 Expired - Fee Related US7362971B2 (en) | 1997-03-16 | 2007-05-04 | Camera unit incorporating a lidded printhead unit |
US11/860,420 Expired - Fee Related US7506965B2 (en) | 1997-07-15 | 2007-09-24 | Inkjet printhead integrated circuit with work transmitting structures |
US12/056,217 Expired - Fee Related US7631966B2 (en) | 1997-07-15 | 2008-03-26 | Print roll for a camera having an internal printer |
US12/056,228 Expired - Fee Related US7654626B2 (en) | 1997-07-15 | 2008-03-26 | Camera device incorporating a color printer with ink validation apparatus |
US12/143,821 Expired - Fee Related US7773113B2 (en) | 1997-07-15 | 2008-06-22 | Card based image manipulation method for camera |
US12/170,399 Expired - Fee Related US7845764B2 (en) | 1997-07-15 | 2008-07-09 | Inkjet printhead having nozzle arrangements with actuator pivot anchors |
US12/368,993 Expired - Fee Related US7866797B2 (en) | 1997-07-15 | 2009-02-10 | Inkjet printhead integrated circuit |
US12/941,793 Expired - Fee Related US7980670B2 (en) | 1997-07-15 | 2010-11-08 | Inkjet printhead having selectively actuable nozzles arranged in nozzle pairs |
Family Applications Before (9)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/112,737 Expired - Lifetime US6331946B1 (en) | 1997-07-15 | 1998-07-10 | Method for protecting on-chip memory (flash and RAM) against attacks |
US09/113,223 Expired - Lifetime US6442525B1 (en) | 1997-07-15 | 1998-07-10 | System for authenticating physical objects |
US09/516,869 Expired - Lifetime US6374354B1 (en) | 1997-07-15 | 2000-03-02 | Consumable authentication protocol and system |
US09/517,380 Expired - Lifetime US6334190B1 (en) | 1997-07-15 | 2000-03-02 | System for the manipulation of secure data |
US10/269,998 Expired - Lifetime US6827282B2 (en) | 1997-03-16 | 2002-10-15 | Identifying card |
US10/302,604 Expired - Fee Related US6787051B2 (en) | 1997-07-15 | 2002-11-23 | Method of manufacturing a micro-electromechanical fluid ejecting device |
US10/780,624 Expired - Fee Related US7454617B2 (en) | 1997-07-15 | 2004-02-19 | Apparatus for validating the presence of an authorized accessory |
US10/882,772 Expired - Fee Related US6938990B2 (en) | 1997-07-15 | 2004-07-02 | Fluid ejecting actuator for multiple nozzles of a printhead |
US10/884,886 Abandoned US20050092849A1 (en) | 1997-07-15 | 2004-07-06 | Information card with fault tolerant printing of encoded information |
Family Applications After (17)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/963,542 Expired - Fee Related US7093762B2 (en) | 1997-03-16 | 2004-10-14 | Image processing and printing apparatus |
US11/001,144 Expired - Fee Related US7234645B2 (en) | 1997-03-16 | 2004-12-02 | Document having an encoded data structure |
US11/039,850 Abandoned US20050127191A1 (en) | 1997-03-16 | 2005-01-24 | Data storage device incorporating a two-dimensional code |
US11/107,792 Expired - Fee Related US7222799B2 (en) | 1997-03-16 | 2005-04-18 | Data storage device incorporating a two-dimensional code |
US11/144,799 Expired - Fee Related US7416282B2 (en) | 1997-07-15 | 2005-06-06 | Printhead having common actuator for inkjet nozzles |
US11/584,619 Expired - Fee Related US7278711B2 (en) | 1997-07-15 | 2006-10-23 | Nozzle arrangement incorporating a lever based ink displacement mechanism |
US11/672,878 Abandoned US20070126880A1 (en) | 1997-07-15 | 2007-02-08 | Handheld device with image sensor and printer |
US11/739,071 Expired - Fee Related US7703910B2 (en) | 1997-03-16 | 2007-04-23 | Print roll unit incorporating pinch rollers |
US11/744,214 Expired - Fee Related US7373083B2 (en) | 1997-03-16 | 2007-05-03 | Camera incorporating a releasable print roll unit |
US11/744,218 Expired - Fee Related US7362971B2 (en) | 1997-03-16 | 2007-05-04 | Camera unit incorporating a lidded printhead unit |
US11/860,420 Expired - Fee Related US7506965B2 (en) | 1997-07-15 | 2007-09-24 | Inkjet printhead integrated circuit with work transmitting structures |
US12/056,217 Expired - Fee Related US7631966B2 (en) | 1997-07-15 | 2008-03-26 | Print roll for a camera having an internal printer |
US12/056,228 Expired - Fee Related US7654626B2 (en) | 1997-07-15 | 2008-03-26 | Camera device incorporating a color printer with ink validation apparatus |
US12/143,821 Expired - Fee Related US7773113B2 (en) | 1997-07-15 | 2008-06-22 | Card based image manipulation method for camera |
US12/170,399 Expired - Fee Related US7845764B2 (en) | 1997-07-15 | 2008-07-09 | Inkjet printhead having nozzle arrangements with actuator pivot anchors |
US12/368,993 Expired - Fee Related US7866797B2 (en) | 1997-07-15 | 2009-02-10 | Inkjet printhead integrated circuit |
US12/941,793 Expired - Fee Related US7980670B2 (en) | 1997-07-15 | 2010-11-08 | Inkjet printhead having selectively actuable nozzles arranged in nozzle pairs |
Country Status (2)
Country | Link |
---|---|
US (27) | US6331946B1 (en) |
AU (1) | AUPO799197A0 (en) |
Families Citing this family (417)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8352400B2 (en) | 1991-12-23 | 2013-01-08 | Hoffberg Steven M | Adaptive pattern recognition based controller apparatus and method and human-factored interface therefore |
US7343357B1 (en) * | 1995-10-11 | 2008-03-11 | Stamps.Com Inc. | System and method for printing multiple postage indicia |
US6676127B2 (en) | 1997-03-13 | 2004-01-13 | Shuffle Master, Inc. | Collating and sorting apparatus |
US6786420B1 (en) | 1997-07-15 | 2004-09-07 | Silverbrook Research Pty. Ltd. | Data distribution mechanism in the form of ink dots on cards |
AUPO799197A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image processing method and apparatus (ART01) |
US6803989B2 (en) * | 1997-07-15 | 2004-10-12 | Silverbrook Research Pty Ltd | Image printing apparatus including a microcontroller |
US6618117B2 (en) | 1997-07-12 | 2003-09-09 | Silverbrook Research Pty Ltd | Image sensing apparatus including a microcontroller |
US6702417B2 (en) * | 1997-07-12 | 2004-03-09 | Silverbrook Research Pty Ltd | Printing cartridge with capacitive sensor identification |
US6547364B2 (en) * | 1997-07-12 | 2003-04-15 | Silverbrook Research Pty Ltd | Printing cartridge with an integrated circuit device |
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 |
US7702926B2 (en) * | 1997-07-15 | 2010-04-20 | Silverbrook Research Pty Ltd | Decoy device in an integrated circuit |
US6820968B2 (en) * | 1997-07-15 | 2004-11-23 | Silverbrook Research Pty Ltd | Fluid-dispensing chip |
US20110228008A1 (en) * | 1997-07-15 | 2011-09-22 | Silverbrook Research Pty Ltd | Printhead having relatively sized fluid ducts and nozzles |
AUPO801997A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Media processing method and apparatus (ART21) |
US7527357B2 (en) | 1997-07-15 | 2009-05-05 | Silverbrook Research Pty Ltd | Inkjet nozzle array with individual feed channel for each nozzle |
US6557977B1 (en) * | 1997-07-15 | 2003-05-06 | Silverbrook Research Pty Ltd | Shape memory alloy ink jet printing mechanism |
US7195339B2 (en) * | 1997-07-15 | 2007-03-27 | Silverbrook Research Pty Ltd | Ink jet nozzle assembly with a thermal bend actuator |
US20040130599A1 (en) * | 1997-07-15 | 2004-07-08 | Silverbrook Research Pty Ltd | Ink jet printhead with amorphous ceramic chamber |
US6918654B2 (en) * | 1997-07-15 | 2005-07-19 | Silverbrook Research Pty Ltd | Ink distribution assembly for an ink jet printhead |
US6935724B2 (en) | 1997-07-15 | 2005-08-30 | Silverbrook Research Pty Ltd | Ink jet nozzle having actuator with anchor positioned between nozzle chamber and actuator connection point |
US7556356B1 (en) | 1997-07-15 | 2009-07-07 | Silverbrook Research Pty Ltd | Inkjet printhead integrated circuit with ink spread prevention |
AUPP653998A0 (en) * | 1998-10-16 | 1998-11-05 | Silverbrook Research Pty Ltd | Micromechanical device and method (ij46B) |
US7401884B2 (en) * | 1997-07-15 | 2008-07-22 | Silverbrook Research Pty Ltd | Inkjet printhead with integral nozzle plate |
US7465030B2 (en) | 1997-07-15 | 2008-12-16 | Silverbrook Research Pty Ltd | Nozzle arrangement with a magnetic field generator |
US6727948B1 (en) * | 1997-07-15 | 2004-04-27 | Silverbrook Research Pty Ltd | Utilizing autofocus information for image processing in a digital camera |
US7246098B1 (en) * | 1997-07-15 | 2007-07-17 | Silverbrook Research Pty Ltd | Consumable authentication protocol and system |
US7628468B2 (en) * | 1997-07-15 | 2009-12-08 | Silverbrook Research Pty Ltd | Nozzle with reciprocating plunger |
US7050143B1 (en) * | 1998-07-10 | 2006-05-23 | Silverbrook Research Pty Ltd | Camera system with computer language interpreter |
US7044589B2 (en) | 1997-07-15 | 2006-05-16 | Silverbrook Res Pty Ltd | Printing cartridge with barcode identification |
US7468139B2 (en) | 1997-07-15 | 2008-12-23 | Silverbrook Research Pty Ltd | Method of depositing heater material over a photoresist scaffold |
US6624848B1 (en) | 1997-07-15 | 2003-09-23 | Silverbrook Research Pty Ltd | Cascading image modification using multiple digital cameras incorporating image processing |
US7249109B1 (en) * | 1997-07-15 | 2007-07-24 | Silverbrook Research Pty Ltd | Shielding manipulations of secret data |
US7337532B2 (en) * | 1997-07-15 | 2008-03-04 | Silverbrook Research Pty Ltd | Method of manufacturing micro-electromechanical device having motion-transmitting structure |
US7110024B1 (en) | 1997-07-15 | 2006-09-19 | Silverbrook Research Pty Ltd | Digital camera system having motion deblurring means |
US20100277531A1 (en) * | 1997-07-15 | 2010-11-04 | Silverbrook Research Pty Ltd | Printer having processor for high volume printing |
US6712453B2 (en) | 1997-07-15 | 2004-03-30 | Silverbrook Research Pty Ltd. | Ink jet nozzle rim |
AUPO797897A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Media device (ART18) |
US7716098B2 (en) * | 1997-07-15 | 2010-05-11 | Silverbrook Research Pty Ltd. | Method and apparatus for reducing optical emissions in an integrated circuit |
AUPO798697A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Data processing method and apparatus (ART51) |
AUPO802797A0 (en) | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image processing method and apparatus (ART54) |
AUPO850597A0 (en) * | 1997-08-11 | 1997-09-04 | Silverbrook Research Pty Ltd | Image processing method and apparatus (art01a) |
US6513908B2 (en) * | 1997-07-15 | 2003-02-04 | Silverbrook Research Pty Ltd | Pusher actuation in a printhead chip for an inkjet printhead |
US7705891B2 (en) * | 1997-07-15 | 2010-04-27 | Silverbrook Research Pty Ltd | Correction of distortions in digital images |
US7743262B2 (en) * | 1997-07-15 | 2010-06-22 | Silverbrook Research Pty Ltd | Integrated circuit incorporating protection from power supply attacks |
AUPO850097A0 (en) * | 1997-08-11 | 1997-09-04 | Silverbrook Research Pty Ltd | Image processing method and apparatus (art31) |
US6985207B2 (en) | 1997-07-15 | 2006-01-10 | Silverbrook Research Pty Ltd | Photographic prints having magnetically recordable media |
US6682174B2 (en) | 1998-03-25 | 2004-01-27 | Silverbrook Research Pty Ltd | Ink jet nozzle arrangement configuration |
US6690419B1 (en) | 1997-07-15 | 2004-02-10 | Silverbrook Research Pty Ltd | Utilising eye detection methods for image processing in a digital image camera |
AUPP398798A0 (en) * | 1998-06-09 | 1998-07-02 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ij43) |
US7346586B1 (en) | 1997-07-15 | 2008-03-18 | Silverbrook Research Pty Ltd | Validation protocol and system |
US7401900B2 (en) * | 1997-07-15 | 2008-07-22 | Silverbrook Research Pty Ltd | Inkjet nozzle with long ink supply channel |
US6648453B2 (en) | 1997-07-15 | 2003-11-18 | Silverbrook Research Pty Ltd | Ink jet printhead chip with predetermined micro-electromechanical systems height |
US7011390B2 (en) * | 1997-07-15 | 2006-03-14 | Silverbrook Research Pty Ltd | Printing mechanism having wide format printing zone |
US7578582B2 (en) * | 1997-07-15 | 2009-08-25 | Silverbrook Research Pty Ltd | Inkjet nozzle chamber holding two fluids |
US7249108B1 (en) * | 1997-07-15 | 2007-07-24 | Silverbrook Research Pty Ltd | Validation protocol and system |
US7284843B2 (en) * | 1997-07-15 | 2007-10-23 | Silverbrook Research Pty Ltd | Ink distribution assembly for an ink jet printhead |
US6855264B1 (en) | 1997-07-15 | 2005-02-15 | Kia Silverbrook | Method of manufacture of an ink jet printer having a thermal actuator comprising an external coil spring |
US6879341B1 (en) | 1997-07-15 | 2005-04-12 | Silverbrook Research Pty Ltd | Digital camera system containing a VLIW vector processor |
US6582059B2 (en) * | 1997-07-15 | 2003-06-24 | Silverbrook Research Pty Ltd | Discrete air and nozzle chambers in a printhead chip for an inkjet printhead |
EP1050133B2 (en) * | 1998-01-02 | 2009-05-27 | Cryptography Research Inc. | Leak-resistant cryptographic method and apparatus |
US7587044B2 (en) | 1998-01-02 | 2009-09-08 | Cryptography Research, Inc. | Differential power analysis method and apparatus |
US6655684B2 (en) | 1998-04-15 | 2003-12-02 | Shuffle Master, Inc. | Device and method for forming and delivering hands from randomly arranged decks of playing cards |
US6254096B1 (en) | 1998-04-15 | 2001-07-03 | Shuffle Master, Inc. | Device and method for continuously shuffling cards |
WO1999067919A2 (en) | 1998-06-03 | 1999-12-29 | Cryptography Research, Inc. | Improved des and other cryptographic processes with leak minimization for smartcards and other cryptosystems |
US7460534B1 (en) * | 1998-06-03 | 2008-12-02 | 3Com Corporation | Method for statistical switching |
US6539092B1 (en) | 1998-07-02 | 2003-03-25 | Cryptography Research, Inc. | Leak-resistant cryptographic indexed key update |
US6816968B1 (en) * | 1998-07-10 | 2004-11-09 | Silverbrook Research Pty Ltd | Consumable authentication protocol and system |
US6760997B1 (en) * | 1998-08-04 | 2004-07-13 | Allen Dean Mammel | No-tie fishing system and method |
US7346580B2 (en) * | 1998-08-13 | 2008-03-18 | International Business Machines Corporation | Method and system of preventing unauthorized rerecording of multimedia content |
AUPP702098A0 (en) | 1998-11-09 | 1998-12-03 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ART73) |
DE19901277A1 (en) * | 1999-01-15 | 2000-07-20 | Bayerische Motoren Werke Ag | Method of authenticating a replacement key for using a vehicle |
US7966078B2 (en) | 1999-02-01 | 2011-06-21 | Steven Hoffberg | Network media appliance system and method |
US7319759B1 (en) * | 1999-03-27 | 2008-01-15 | Microsoft Corporation | Producing a new black box for a digital rights management (DRM) system |
US6829708B1 (en) * | 1999-03-27 | 2004-12-07 | Microsoft Corporation | Specifying security for an element by assigning a scaled value representative of the relative security thereof |
ES2230110T3 (en) * | 1999-05-06 | 2005-05-01 | Assa Abloy Ab | WRENCH AND LOCK DEVICE. |
AUPQ056099A0 (en) | 1999-05-25 | 1999-06-17 | Silverbrook Research Pty Ltd | A method and apparatus (pprint01) |
FR2794592B1 (en) * | 1999-06-04 | 2001-08-24 | France Telecom | BIT GENERATOR FOR ESTABLISHING A SECRET ENCRYPTION KEY AND CORRESPONDING METHOD |
US6529487B1 (en) * | 1999-07-09 | 2003-03-04 | Qualcomm Incorporated | Method and apparatus for securely transmitting distributed RAND for use in mobile station authentication |
DE19958941B4 (en) * | 1999-11-26 | 2006-11-09 | Francotyp-Postalia Gmbh | Method for protecting a device from being operated with improper consumables |
US7356498B2 (en) * | 1999-12-30 | 2008-04-08 | Chicago Board Options Exchange, Incorporated | Automated trading exchange system having integrated quote risk monitoring and integrated quote modification services |
US9727916B1 (en) | 1999-12-30 | 2017-08-08 | Chicago Board Options Exchange, Incorporated | Automated trading exchange system having integrated quote risk monitoring and integrated quote modification services |
US6631482B1 (en) * | 2000-01-11 | 2003-10-07 | International Business Machines Corporation | Method and system for providing data output for analysis |
AU2000269232A1 (en) * | 2000-01-14 | 2001-07-24 | Microsoft Corporation | Specifying security for an element by assigning a scaled value representative ofthe relative security thereof |
US6510992B2 (en) * | 2000-02-02 | 2003-01-28 | Thomas R. Wells | In-line verification, reporting and tracking apparatus and method for mail pieces |
US7104383B1 (en) * | 2000-02-14 | 2006-09-12 | Leon Saltsov | Validator with removable flash memory |
US7685423B1 (en) | 2000-02-15 | 2010-03-23 | Silverbrook Research Pty Ltd | Validation protocol and system |
US6757832B1 (en) * | 2000-02-15 | 2004-06-29 | Silverbrook Research Pty Ltd | Unauthorized modification of values in flash memory |
EP1260053B1 (en) * | 2000-02-15 | 2006-05-31 | Silverbrook Research Pty. Limited | Consumable authentication protocol and system |
US8590896B2 (en) | 2000-04-12 | 2013-11-26 | Shuffle Master Gmbh & Co Kg | Card-handling devices and systems |
US7177421B2 (en) * | 2000-04-13 | 2007-02-13 | Broadcom Corporation | Authentication engine architecture and method |
JP4443088B2 (en) * | 2000-05-01 | 2010-03-31 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Improved DES hardware throughput for short operations |
DE10026326B4 (en) * | 2000-05-26 | 2016-02-04 | Ipcom Gmbh & Co. Kg | A method of cryptographically verifying a physical entity in an open wireless telecommunications network |
KR100377172B1 (en) * | 2000-06-13 | 2003-03-26 | 주식회사 하이닉스반도체 | Key Scheduller of encryption device using data encryption standard algorithm |
JP4409056B2 (en) * | 2000-06-30 | 2010-02-03 | 富士通株式会社 | LSI, LSI mounted electronic device, debugging method, LSI debugging device |
US6980964B1 (en) * | 2000-07-27 | 2005-12-27 | Canon Kabushiki Kaisha | Virtual print market place |
US6941284B2 (en) * | 2000-11-30 | 2005-09-06 | Pitney Bowes Inc. | Method for dynamically using cryptographic keys in a postage meter |
US6986764B2 (en) * | 2000-12-15 | 2006-01-17 | Laserscope | Method and system for photoselective vaporization of the prostate, and other tissue |
EP1360795B1 (en) * | 2001-01-12 | 2006-08-09 | Broadcom Corporation | Implentation of the SHA1 algorithm |
FR2823398B1 (en) * | 2001-04-04 | 2003-08-15 | St Microelectronics Sa | EXTRACTION OF PRIVATE DATA FOR AUTHENTICATION OF AN INTEGRATED CIRCUIT |
EP1382056A4 (en) * | 2001-04-07 | 2007-06-20 | Telehublink Corp | Methods and systems for securing information communicated between communication devices |
US7110858B2 (en) * | 2001-04-09 | 2006-09-19 | Koninklijke Philips Electronics N.V. | Object identification uses prediction of data in distributed network |
FR2825873A1 (en) * | 2001-06-11 | 2002-12-13 | St Microelectronics Sa | PROTECTED STORAGE OF DATA IN AN INTEGRATED CIRCUIT |
DE10128305A1 (en) * | 2001-06-12 | 2002-12-19 | Giesecke & Devrient Gmbh | Control unit for appliances and machines, e.g. motor vehicles, has monitoring unit for verifying write- and read-access to programmable store |
US8326851B2 (en) * | 2001-06-29 | 2012-12-04 | Grune Guerry L | Simultaneous intellectual property search and valuation system and methodology (SIPS-VSM) |
US20030035646A1 (en) * | 2001-08-20 | 2003-02-20 | Vat 19, Llc | Digital video device having a verification code thereon and method of generating a verification code |
JP4787434B2 (en) * | 2001-08-24 | 2011-10-05 | 富士通コンポーネント株式会社 | ENCRYPTION METHOD, COMMUNICATION SYSTEM, DATA INPUT DEVICE |
US7197142B2 (en) * | 2001-08-24 | 2007-03-27 | Alten Alexander I | System and methods for a vernam stream cipher |
US7409562B2 (en) * | 2001-09-21 | 2008-08-05 | The Directv Group, Inc. | Method and apparatus for encrypting media programs for later purchase and viewing |
US20030061488A1 (en) * | 2001-09-25 | 2003-03-27 | Michael Huebler | Cloning protection for electronic equipment |
US8616552B2 (en) | 2001-09-28 | 2013-12-31 | Shfl Entertainment, Inc. | Methods and apparatuses for an automatic card handling device and communication networks including same |
US8337296B2 (en) | 2001-09-28 | 2012-12-25 | SHFL entertaiment, Inc. | Method and apparatus for using upstream communication in a card shuffler |
US8011661B2 (en) | 2001-09-28 | 2011-09-06 | Shuffle Master, Inc. | Shuffler with shuffling completion indicator |
US7753373B2 (en) | 2001-09-28 | 2010-07-13 | Shuffle Master, Inc. | Multiple mode card shuffler and card reading device |
US7677565B2 (en) | 2001-09-28 | 2010-03-16 | Shuffle Master, Inc | Card shuffler with card rank and value reading capability |
US6993393B2 (en) | 2001-12-19 | 2006-01-31 | Cardiac Pacemakers, Inc. | Telemetry duty cycle management system for an implantable medical device |
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 |
US7257630B2 (en) | 2002-01-15 | 2007-08-14 | Mcafee, Inc. | System and method for network vulnerability detection and reporting |
US7243148B2 (en) | 2002-01-15 | 2007-07-10 | Mcafee, Inc. | System and method for network vulnerability detection and reporting |
US7543056B2 (en) | 2002-01-15 | 2009-06-02 | Mcafee, Inc. | System and method for network vulnerability detection and reporting |
US7076059B1 (en) * | 2002-01-17 | 2006-07-11 | Cavium Networks | Method and apparatus to implement the data encryption standard algorithm |
US6985773B2 (en) | 2002-02-07 | 2006-01-10 | Cardiac Pacemakers, Inc. | Methods and apparatuses for implantable medical device telemetry power management |
US6886829B2 (en) | 2002-02-08 | 2005-05-03 | Vendingdata Corporation | Image capturing card shuffler |
US6988204B2 (en) * | 2002-04-16 | 2006-01-17 | Nokia Corporation | System and method for key distribution and network connectivity |
US6718536B2 (en) * | 2002-06-21 | 2004-04-06 | Atmel Corporation | Computer-implemented method for fast generation and testing of probable prime numbers for cryptographic applications |
US7430003B2 (en) * | 2002-08-23 | 2008-09-30 | Candid Color Systems, Inc. | Digital camera/computer synchronization method |
US7752115B2 (en) * | 2002-10-02 | 2010-07-06 | Trading Technologies International, Inc. | Method and apparatus for a fair exchange |
MXPA05003984A (en) * | 2002-10-15 | 2005-06-22 | Digimarc Corp | Identification document and related methods. |
US7076666B2 (en) * | 2002-10-17 | 2006-07-11 | Sony Corporation | Hard disk drive authentication for personal video recorder |
US7133563B2 (en) | 2002-10-31 | 2006-11-07 | Microsoft Corporation | Passive embedded interaction code |
US7599976B1 (en) * | 2002-11-13 | 2009-10-06 | Metrowerks Corporation | System and method for cryptographic key generation |
US7707621B2 (en) * | 2002-12-02 | 2010-04-27 | Silverbrook Research Pty Ltd | Creation and usage of mutually exclusive messages |
US7188359B2 (en) | 2002-12-18 | 2007-03-06 | America Online, Inc. | Optimizing authentication service availability and responsiveness via client-side routing |
US7044574B2 (en) * | 2002-12-30 | 2006-05-16 | Lexmark International, Inc. | Method and apparatus for generating and assigning a cartridge identification number to an imaging cartridge |
JP2004226605A (en) * | 2003-01-22 | 2004-08-12 | Fuji Photo Film Co Ltd | Image forming device |
US6984261B2 (en) | 2003-02-05 | 2006-01-10 | 3M Innovative Properties Company | Use of ceramics in dental and orthodontic applications |
US7536456B2 (en) | 2003-02-14 | 2009-05-19 | Preventsys, Inc. | System and method for applying a machine-processable policy rule to information gathered about a network |
US7627891B2 (en) | 2003-02-14 | 2009-12-01 | Preventsys, Inc. | Network audit and policy assurance system |
US7370212B2 (en) | 2003-02-25 | 2008-05-06 | Microsoft Corporation | Issuing a publisher use license off-line in a digital rights management (DRM) system |
US20090267747A1 (en) * | 2003-03-31 | 2009-10-29 | Rivest Ronald L | Security and Data Collision Systems and Related Techniques for Use With Radio Frequency Identification Systems |
ATE491190T1 (en) | 2003-04-16 | 2010-12-15 | L 1 Secure Credentialing Inc | THREE-DIMENSIONAL DATA STORAGE |
US6880752B2 (en) * | 2003-04-16 | 2005-04-19 | George V. Tarnovsky | System for testing, verifying legitimacy of smart card in-situ and for storing data therein |
US7134341B2 (en) * | 2003-04-28 | 2006-11-14 | Zuli Holdings Ltd | Methods and devices for determining the resonance frequency of passive mechanical resonators |
US7240995B2 (en) * | 2003-05-06 | 2007-07-10 | Lexmark International, Inc. | Method of authenticating a consumable |
TWI227328B (en) * | 2003-06-19 | 2005-02-01 | Yan-Fu Liou | Method and system for accelerating inspection speed of semiconductor products |
US7155290B2 (en) * | 2003-06-23 | 2006-12-26 | Cardiac Pacemakers, Inc. | Secure long-range telemetry for implantable medical device |
US7469107B2 (en) * | 2003-07-23 | 2008-12-23 | Lexmark International, Inc. | Method for providing imaging substance for use in an imaging device via a virtual replenishment |
US11037151B1 (en) | 2003-08-19 | 2021-06-15 | Stamps.Com Inc. | System and method for dynamically partitioning a postage evidencing system |
US8162839B2 (en) * | 2003-08-27 | 2012-04-24 | Microtech Medical Technologies Ltd. | Protected passive resonating sensors |
US7415883B2 (en) * | 2004-06-28 | 2008-08-26 | Zuli Holdings Ltd | Method for protecting resonating sensors and open protected resonating sensors |
US7934494B1 (en) * | 2003-10-10 | 2011-05-03 | Donna Gail Schneider | Collapsible heating apparatus |
WO2005038634A2 (en) | 2003-10-17 | 2005-04-28 | International Business Machines Corporation | Maintaining privacy for transactions performable by a user device having a security module |
US8165297B2 (en) * | 2003-11-21 | 2012-04-24 | Finisar Corporation | Transceiver with controller for authentication |
JP4150923B2 (en) * | 2003-12-09 | 2008-09-17 | 富士ゼロックス株式会社 | Data output system and method |
US7340496B2 (en) * | 2003-12-17 | 2008-03-04 | International Business Machines Corporation | System and method for determining the Nth state of linear feedback shift registers |
DE102004001212A1 (en) * | 2004-01-06 | 2005-07-28 | Deutsche Thomson-Brandt Gmbh | Process and facility employs two search steps in order to shorten the search time when searching a database |
US7707039B2 (en) | 2004-02-15 | 2010-04-27 | Exbiblio B.V. | Automatic modification of web pages |
US8442331B2 (en) | 2004-02-15 | 2013-05-14 | Google Inc. | Capturing text from rendered documents using supplemental information |
JP3937341B2 (en) * | 2004-01-30 | 2007-06-27 | 日本電気株式会社 | Transaction profile generation system for computer system performance measurement analysis, its generation method and program |
US20060041484A1 (en) | 2004-04-01 | 2006-02-23 | King Martin T | Methods and systems for initiating application processes by data capture from rendered documents |
US8799303B2 (en) | 2004-02-15 | 2014-08-05 | Google Inc. | Establishing an interactive environment for rendered documents |
US10635723B2 (en) | 2004-02-15 | 2020-04-28 | Google Llc | Search engines and systems with handheld document data capture devices |
US7812860B2 (en) | 2004-04-01 | 2010-10-12 | Exbiblio B.V. | Handheld device for capturing text from both a document printed on paper and a document displayed on a dynamic display device |
JP2005250376A (en) * | 2004-03-08 | 2005-09-15 | Seiko Epson Corp | Optical modulator and method of manufacturing optical modulator |
US20050203843A1 (en) * | 2004-03-12 | 2005-09-15 | Wood George L. | Internet debit system |
US7228182B2 (en) * | 2004-03-15 | 2007-06-05 | Cardiac Pacemakers, Inc. | Cryptographic authentication for telemetry with an implantable medical device |
US8127137B2 (en) | 2004-03-18 | 2012-02-28 | Digimarc Corporation | Watermark payload encryption for media including multiple watermarks |
US8201257B1 (en) | 2004-03-31 | 2012-06-12 | Mcafee, Inc. | System and method of managing network security risks |
US20080313172A1 (en) | 2004-12-03 | 2008-12-18 | King Martin T | Determining actions involving captured information and electronic content associated with rendered documents |
US9143638B2 (en) | 2004-04-01 | 2015-09-22 | Google Inc. | Data capture from rendered documents using handheld device |
WO2008028674A2 (en) | 2006-09-08 | 2008-03-13 | Exbiblio B.V. | Optical scanners, such as hand-held optical scanners |
US9116890B2 (en) | 2004-04-01 | 2015-08-25 | Google Inc. | Triggering actions in response to optically or acoustically capturing keywords from a rendered document |
US8793162B2 (en) | 2004-04-01 | 2014-07-29 | Google Inc. | Adding information or functionality to a rendered document via association with an electronic counterpart |
US7990556B2 (en) | 2004-12-03 | 2011-08-02 | Google Inc. | Association of a portable scanner with input/output and storage devices |
US20060098900A1 (en) | 2004-09-27 | 2006-05-11 | King Martin T | Secure data gathering from rendered documents |
US8146156B2 (en) | 2004-04-01 | 2012-03-27 | Google Inc. | Archive of text captures from rendered documents |
US8621349B2 (en) | 2004-04-01 | 2013-12-31 | Google Inc. | Publishing techniques for adding value to a rendered document |
US8081849B2 (en) * | 2004-12-03 | 2011-12-20 | Google Inc. | Portable scanning and memory device |
US20070300142A1 (en) | 2005-04-01 | 2007-12-27 | King Martin T | Contextual dynamic advertising based upon captured rendered text |
US7894670B2 (en) | 2004-04-01 | 2011-02-22 | Exbiblio B.V. | Triggering actions in response to optically or acoustically capturing keywords from a rendered document |
US20060081714A1 (en) | 2004-08-23 | 2006-04-20 | King Martin T | Portable scanning device |
WO2005099817A1 (en) | 2004-04-07 | 2005-10-27 | Cardiac Pacemakers, Inc. | Rf wake-up of implantable medical device |
US7519954B1 (en) | 2004-04-08 | 2009-04-14 | Mcafee, Inc. | System and method of operating system identification |
US8713418B2 (en) | 2004-04-12 | 2014-04-29 | Google Inc. | Adding value to a rendered document |
GB0408328D0 (en) * | 2004-04-14 | 2004-05-19 | Imp College Innovations Ltd | Method of processing image data |
US8620083B2 (en) | 2004-12-03 | 2013-12-31 | Google Inc. | Method and system for character recognition |
US8489624B2 (en) | 2004-05-17 | 2013-07-16 | Google, Inc. | Processing techniques for text capture from a rendered document |
US8874504B2 (en) | 2004-12-03 | 2014-10-28 | Google Inc. | Processing techniques for visual capture data from a rendered document |
US9460346B2 (en) | 2004-04-19 | 2016-10-04 | Google Inc. | Handheld device for capturing text from both a document printed on paper and a document displayed on a dynamic display device |
US7551752B2 (en) * | 2004-04-26 | 2009-06-23 | Graphic Security Systems Corporation | Systems and methods for authenticating objects using multiple-level image encoding and decoding |
US20050243118A1 (en) * | 2004-04-29 | 2005-11-03 | Ward Jefferson P | Consumable cartridge theft deterrence apparatus and methods |
US7609407B2 (en) * | 2004-06-14 | 2009-10-27 | Chinwala Mukhtar A | Thermal printing system and method |
US8099791B1 (en) * | 2004-06-25 | 2012-01-17 | Lexmark International, Inc. | Method of authenticating a consumable in an imaging device |
US8346620B2 (en) | 2004-07-19 | 2013-01-01 | Google Inc. | Automatic modification of web pages |
US7243842B1 (en) | 2004-07-27 | 2007-07-17 | Stamps.Com Inc. | Computer-based value-bearing item customization security |
US7979358B1 (en) | 2004-07-27 | 2011-07-12 | Stamps.Com Inc. | Quality assurance of image-customization of computer-based value-bearing items |
US8065239B1 (en) | 2004-07-27 | 2011-11-22 | Stamps.Com Inc. | Customized computer-based value-bearing item quality assurance |
US8805745B1 (en) | 2004-07-27 | 2014-08-12 | Stamps.Com Inc. | Printing of computer-based value-bearing items |
US7933845B1 (en) | 2004-07-27 | 2011-04-26 | Stamps.Com Inc. | Image-customization of computer-based value-bearing items |
US7890180B2 (en) * | 2004-08-09 | 2011-02-15 | Cardiac Pacemakers, Inc. | Secure remote access for an implantable medical device |
US7343496B1 (en) | 2004-08-13 | 2008-03-11 | Zilog, Inc. | Secure transaction microcontroller with secure boot loader |
US20060066048A1 (en) | 2004-09-14 | 2006-03-30 | Shuffle Master, Inc. | Magnetic jam detection in a card shuffler |
EP1643710A1 (en) * | 2004-09-30 | 2006-04-05 | Nagravision S.A. | Method of updating a lookup table of addresses and identification numbers |
US8117452B2 (en) * | 2004-11-03 | 2012-02-14 | Cisco Technology, Inc. | System and method for establishing a secure association between a dedicated appliance and a computing platform |
US20060098818A1 (en) * | 2004-11-10 | 2006-05-11 | International Business Machines (Ibm) Corporation | Encryption technique for asynchronous control commands and data |
US20060117004A1 (en) * | 2004-11-30 | 2006-06-01 | Hunt Charles L | System and method for contextually understanding and analyzing system use and misuse |
US8155306B2 (en) * | 2004-12-09 | 2012-04-10 | Intel Corporation | Method and apparatus for increasing the speed of cryptographic processing |
DE202005009860U1 (en) * | 2004-12-17 | 2006-04-20 | Alfit Ag | Closing and opening device for drawers |
JP4266939B2 (en) * | 2005-02-10 | 2009-05-27 | 株式会社ソニー・コンピュータエンタテインメント | Drawing processing apparatus and drawing data compression method |
US7278163B2 (en) * | 2005-02-22 | 2007-10-02 | Mcafee, Inc. | Security risk analysis system and method |
US7826074B1 (en) | 2005-02-25 | 2010-11-02 | Microsoft Corporation | Fast embedded interaction code printing with custom postscript commands |
US20060203106A1 (en) * | 2005-03-14 | 2006-09-14 | Lawrence Joseph P | Methods and apparatus for retrieving data captured by a media device |
US8666900B1 (en) * | 2005-03-30 | 2014-03-04 | Intuit Inc. | Secure product enablement over channels with narrow bandwidth |
US7788490B2 (en) * | 2005-04-01 | 2010-08-31 | Lexmark International, Inc. | Methods for authenticating an identity of an article in electrical communication with a verifier system |
US8725646B2 (en) | 2005-04-15 | 2014-05-13 | Microsoft Corporation | Output protection levels |
US7421439B2 (en) * | 2005-04-22 | 2008-09-02 | Microsoft Corporation | Global metadata embedding and decoding |
US7542976B2 (en) * | 2005-04-22 | 2009-06-02 | Microsoft Corporation | Local metadata embedding and decoding |
US20060265758A1 (en) | 2005-05-20 | 2006-11-23 | Microsoft Corporation | Extensible media rights |
EP1883366B1 (en) | 2005-05-20 | 2016-11-23 | Boston Scientific Scimed Inc. | System and delivery device operation logging method |
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 |
US7764836B2 (en) | 2005-06-13 | 2010-07-27 | Shuffle Master, Inc. | Card shuffler with card rank and value reading capability using CMOS sensor |
JP2007013235A (en) * | 2005-06-28 | 2007-01-18 | Canon Inc | Image compositing apparatus, control method and program of image processor |
US9325944B2 (en) | 2005-08-11 | 2016-04-26 | The Directv Group, Inc. | Secure delivery of program content via a removable storage medium |
US7817816B2 (en) | 2005-08-17 | 2010-10-19 | Microsoft Corporation | Embedded interaction code enabled surface type identification |
TWI271684B (en) * | 2005-10-11 | 2007-01-21 | Delta Electronics Inc | Display device, keypad thereof and method for activating display device |
TWI258392B (en) * | 2005-11-30 | 2006-07-21 | Benq Corp | Droplet generators |
US9148795B2 (en) * | 2005-12-22 | 2015-09-29 | Qualcomm Incorporated | Methods and apparatus for flexible reporting of control information |
US20070162759A1 (en) * | 2005-12-28 | 2007-07-12 | Motorola, Inc. | Protected port for electronic access to an embedded device |
US8285651B1 (en) | 2005-12-30 | 2012-10-09 | Stamps.Com Inc. | High speed printing |
WO2007076610A1 (en) * | 2006-01-06 | 2007-07-12 | Verichk Global Technologies Inc. | Secure access to information associated with a value item |
US7499552B2 (en) * | 2006-01-11 | 2009-03-03 | International Business Machines Corporation | Cipher method and system for verifying a decryption of an encrypted user data key |
DE102006005202A1 (en) * | 2006-02-02 | 2007-08-09 | Hochschule Darmstadt University Of Applied Sciences | Method for decoding information |
KR20090013763A (en) * | 2006-03-23 | 2009-02-05 | 기린 파마 가부시끼가이샤 | Agonistic antibody directed against human thrombopoietin receptor |
US7556266B2 (en) | 2006-03-24 | 2009-07-07 | Shuffle Master Gmbh & Co Kg | Card shuffler with gravity feed system for playing cards |
JP2007279786A (en) * | 2006-04-03 | 2007-10-25 | Fuji Xerox Co Ltd | Information terminal device and program |
US8150163B2 (en) * | 2006-04-12 | 2012-04-03 | Scanbuy, Inc. | System and method for recovering image detail from multiple image frames in real-time |
US8775319B2 (en) | 2006-05-15 | 2014-07-08 | The Directv Group, Inc. | Secure content transfer systems and methods to operate the same |
US8095466B2 (en) | 2006-05-15 | 2012-01-10 | The Directv Group, Inc. | Methods and apparatus to conditionally authorize content delivery at content servers in pay delivery systems |
US8996421B2 (en) | 2006-05-15 | 2015-03-31 | The Directv Group, Inc. | Methods and apparatus to conditionally authorize content delivery at broadcast headends in pay delivery systems |
US8001565B2 (en) | 2006-05-15 | 2011-08-16 | The Directv Group, Inc. | Methods and apparatus to conditionally authorize content delivery at receivers in pay delivery systems |
US7992175B2 (en) | 2006-05-15 | 2011-08-02 | The Directv Group, Inc. | Methods and apparatus to provide content on demand in content broadcast systems |
US7874593B1 (en) | 2006-05-16 | 2011-01-25 | Stamps.Com Inc. | Rolls of image-customized value-bearing items and systems and methods for providing rolls of image-customized value-bearing items |
US8353513B2 (en) | 2006-05-31 | 2013-01-15 | Shfl Entertainment, Inc. | Card weight for gravity feed input for playing card shuffler |
US8342525B2 (en) | 2006-07-05 | 2013-01-01 | Shfl Entertainment, Inc. | Card shuffler with adjacent card infeed and card output compartments |
US8579289B2 (en) | 2006-05-31 | 2013-11-12 | Shfl Entertainment, Inc. | Automatic system and methods for accurate card handling |
US10839332B1 (en) | 2006-06-26 | 2020-11-17 | Stamps.Com | Image-customized labels adapted for bearing computer-based, generic, value-bearing items, and systems and methods for providing image-customized labels |
US8070574B2 (en) | 2007-06-06 | 2011-12-06 | Shuffle Master, Inc. | Apparatus, system, method, and computer-readable medium for casino card handling with multiple hand recall feature |
US20080010388A1 (en) * | 2006-07-07 | 2008-01-10 | Bryce Allen Curtis | Method and apparatus for server wiring model |
US8196039B2 (en) * | 2006-07-07 | 2012-06-05 | International Business Machines Corporation | Relevant term extraction and classification for Wiki content |
US8560956B2 (en) * | 2006-07-07 | 2013-10-15 | International Business Machines Corporation | Processing model of an application wiki |
US20080040661A1 (en) * | 2006-07-07 | 2008-02-14 | Bryce Allen Curtis | Method for inheriting a Wiki page layout for a Wiki page |
US8219900B2 (en) * | 2006-07-07 | 2012-07-10 | International Business Machines Corporation | Programmatically hiding and displaying Wiki page layout sections |
US8775930B2 (en) * | 2006-07-07 | 2014-07-08 | International Business Machines Corporation | Generic frequency weighted visualization component |
US7954052B2 (en) * | 2006-07-07 | 2011-05-31 | International Business Machines Corporation | Method for processing a web page for display in a wiki environment |
US8127413B2 (en) * | 2006-07-11 | 2012-03-06 | Georgia Tech Research Corporation | System and method for preventing race condition vulnerability |
US8997255B2 (en) | 2006-07-31 | 2015-03-31 | Inside Secure | Verifying data integrity in a data storage device |
US9225761B2 (en) | 2006-08-04 | 2015-12-29 | The Directv Group, Inc. | Distributed media-aggregation systems and methods to operate the same |
US9178693B2 (en) | 2006-08-04 | 2015-11-03 | The Directv Group, Inc. | Distributed media-protection systems and methods to operate the same |
US20080043406A1 (en) * | 2006-08-16 | 2008-02-21 | Secure Computing Corporation | Portable computer security device that includes a clip |
US9794247B2 (en) | 2006-08-22 | 2017-10-17 | Stmicroelectronics, Inc. | Method to prevent cloning of electronic components using public key infrastructure secure hardware device |
US8191131B2 (en) * | 2006-08-23 | 2012-05-29 | International Business Machines Corporation | Obscuring authentication data of remote user |
US8352752B2 (en) * | 2006-09-01 | 2013-01-08 | Inside Secure | Detecting radiation-based attacks |
JP4019114B1 (en) | 2006-09-04 | 2007-12-12 | 株式会社I・Pソリューションズ | Information output device |
US8125667B2 (en) * | 2006-09-15 | 2012-02-28 | Avery Levy | System and method for enabling transactions by means of print media that incorporate electronic recording and transmission means |
US8919775B2 (en) | 2006-11-10 | 2014-12-30 | Bally Gaming, Inc. | System for billing usage of an automatic card handling device |
WO2008072166A1 (en) * | 2006-12-12 | 2008-06-19 | Koninklijke Philips Electronics N.V. | Method and apparatus for cell analysis |
US8505978B1 (en) | 2006-12-20 | 2013-08-13 | Stamps.Com Inc. | Systems and methods for creating and providing shape-customized, computer-based, value-bearing items |
US7953987B2 (en) * | 2007-03-06 | 2011-05-31 | International Business Machines Corporation | Protection of secure electronic modules against attacks |
US20080228056A1 (en) | 2007-03-13 | 2008-09-18 | Michael Blomquist | Basal rate testing using frequent blood glucose input |
CN101272240B (en) * | 2007-03-21 | 2013-01-23 | 华为技术有限公司 | Conversation cryptographic key generation method, system and communication equipment |
US7735952B2 (en) * | 2007-04-12 | 2010-06-15 | Lexmark International, Inc. | Method of bonding a micro-fluid ejection head to a support substrate |
US8156174B2 (en) * | 2007-04-13 | 2012-04-10 | Platform Computing Corporation | Method and system for information exchange utilizing an asynchronous persistent store protocol |
KR100875979B1 (en) * | 2007-04-19 | 2008-12-24 | 삼성전자주식회사 | Nonvolatile memory device, memory system including it and its read method |
US7943273B2 (en) * | 2007-04-20 | 2011-05-17 | Photronics, Inc. | Photomask with detector for optimizing an integrated circuit production process and method of manufacturing an integrated circuit using the same |
US7790340B2 (en) * | 2007-04-20 | 2010-09-07 | Photronics, Inc. | Photomask with detector for optimizing an integrated circuit production process and method of manufacturing an integrated circuit using the same |
US7851110B2 (en) * | 2007-04-20 | 2010-12-14 | Photronics, Inc. | Secure photomask with blocking aperture |
US8762714B2 (en) * | 2007-04-24 | 2014-06-24 | Finisar Corporation | Protecting against counterfeit electronics devices |
US7751907B2 (en) | 2007-05-24 | 2010-07-06 | Smiths Medical Asd, Inc. | Expert system for insulin pump therapy |
US8221345B2 (en) | 2007-05-30 | 2012-07-17 | Smiths Medical Asd, Inc. | Insulin pump based expert system |
US8638363B2 (en) | 2009-02-18 | 2014-01-28 | Google Inc. | Automatically capturing information, such as capturing information using a document-aware device |
US9148286B2 (en) * | 2007-10-15 | 2015-09-29 | Finisar Corporation | Protecting against counterfeit electronic devices |
NL1036049A1 (en) * | 2007-10-16 | 2009-04-20 | Asml Holding Nv | Securing authenticity or integrated circuit chips. |
US20090240945A1 (en) * | 2007-11-02 | 2009-09-24 | Finisar Corporation | Anticounterfeiting means for optical communication components |
US8819423B2 (en) * | 2007-11-27 | 2014-08-26 | Finisar Corporation | Optical transceiver with vendor authentication |
US8986253B2 (en) | 2008-01-25 | 2015-03-24 | Tandem Diabetes Care, Inc. | Two chamber pumps and related methods |
GB2457018B (en) * | 2008-01-29 | 2012-04-04 | Hewlett Packard Development Co | Pattern for identifying a location on a surface |
US10373398B1 (en) | 2008-02-13 | 2019-08-06 | Stamps.Com Inc. | Systems and methods for distributed activation of postage |
US9978185B1 (en) | 2008-04-15 | 2018-05-22 | Stamps.Com Inc. | Systems and methods for activation of postage indicia at point of sale |
US8133197B2 (en) | 2008-05-02 | 2012-03-13 | Smiths Medical Asd, Inc. | Display for pump |
FR2933514B1 (en) * | 2008-07-02 | 2012-10-19 | Canon Kk | SIMILARITY ENCODING AND DECODING METHODS AND DEVICES FOR XML TYPE DOCUMENTS |
US8918657B2 (en) | 2008-09-08 | 2014-12-23 | Virginia Tech Intellectual Properties | Systems, devices, and/or methods for managing energy usage |
WO2010030777A1 (en) * | 2008-09-12 | 2010-03-18 | The Penn State Research Foundation | An adaptive signal averaging method which enhances the sensitivity of continuous wave magnetic resonance and other analytical measurements |
US8408421B2 (en) | 2008-09-16 | 2013-04-02 | Tandem Diabetes Care, Inc. | Flow regulating stopcocks and related methods |
US8650937B2 (en) | 2008-09-19 | 2014-02-18 | Tandem Diabetes Care, Inc. | Solute concentration measurement device and related methods |
FR2937212B1 (en) * | 2008-10-15 | 2011-05-20 | Sagem Defense Securite | SECURE COMMUNICATION DEVICE. |
US7841702B2 (en) * | 2008-11-05 | 2010-11-30 | Lexmark International, Inc. | Heater stack and method for making heater stack with heater element decoupled from substrate |
DE102008057681B3 (en) * | 2008-11-17 | 2009-12-10 | Giesecke & Devrient Gmbh | Method for the secure storage of data in a memory of a portable data carrier |
US9911246B1 (en) | 2008-12-24 | 2018-03-06 | Stamps.Com Inc. | Systems and methods utilizing gravity feed for postage metering |
RU2491627C2 (en) * | 2008-12-24 | 2013-08-27 | Общество с ограниченной ответственностью "Оригинал" | Method of tying descriptive properties of product to identification labels for recording sales |
US8860197B2 (en) * | 2008-12-31 | 2014-10-14 | Arizona Board Of Regents, A Body Corporate Of The State Of Arizona Acting For And On Behalf Of Arizona State University | Integrated circuits secure from invasion and methods of manufacturing the same |
KR101685633B1 (en) * | 2009-01-05 | 2016-12-12 | 삼성전자주식회사 | Memory system |
US7916539B2 (en) * | 2009-01-23 | 2011-03-29 | Analog Devices, Inc. | Differential, level-shifted EEPROM structures |
US8549260B2 (en) * | 2009-01-29 | 2013-10-01 | Infineon Technologies Ag | Apparatus for processing data and method for generating manipulated and re-manipulated configuration data for processor |
US8447066B2 (en) | 2009-03-12 | 2013-05-21 | Google Inc. | Performing actions based on capturing information from rendered documents, such as documents under copyright |
WO2010105246A2 (en) | 2009-03-12 | 2010-09-16 | Exbiblio B.V. | Accessing resources based on capturing information from a rendered document |
US8877648B2 (en) * | 2009-03-26 | 2014-11-04 | Semprius, Inc. | Methods of forming printable integrated circuit devices by selective etching to suspend the devices from a handling substrate and devices formed thereby |
US8967621B2 (en) | 2009-04-07 | 2015-03-03 | Bally Gaming, Inc. | Card shuffling apparatuses and related methods |
US7988152B2 (en) | 2009-04-07 | 2011-08-02 | Shuffle Master, Inc. | Playing card shuffler |
CA2769030C (en) | 2009-07-30 | 2016-05-10 | Tandem Diabetes Care, Inc. | Infusion pump system with disposable cartridge having pressure venting and pressure feedback |
EP2290463A3 (en) * | 2009-08-24 | 2014-07-02 | Kabushiki Kaisha Toshiba | Image forming apparatus for managing replacement components |
WO2011027227A1 (en) * | 2009-09-02 | 2011-03-10 | Image Holdings | Method and system for displaying, managing and selling digital images |
WO2011033386A1 (en) * | 2009-09-16 | 2011-03-24 | Image Holdings | Method and system of displaying, managing and selling images in an event photography environment |
US8817031B2 (en) * | 2009-10-02 | 2014-08-26 | Nvidia Corporation | Distributed stream output in a parallel processing unit |
US8430301B2 (en) * | 2009-11-23 | 2013-04-30 | Konica Minolta Laboratory U.S.A., Inc. | Document authentication using hierarchical barcode stamps to detect alterations of barcode |
KR101646705B1 (en) * | 2009-12-01 | 2016-08-09 | 삼성전자주식회사 | Cryptographic device for implementing s-box |
US9081799B2 (en) | 2009-12-04 | 2015-07-14 | Google Inc. | Using gestalt information to identify locations in printed information |
US8882701B2 (en) | 2009-12-04 | 2014-11-11 | Smiths Medical Asd, Inc. | Advanced step therapy delivery for an ambulatory infusion pump and system |
US9323784B2 (en) | 2009-12-09 | 2016-04-26 | Google Inc. | Image search using text-based elements within the contents of images |
US20110161232A1 (en) * | 2009-12-28 | 2011-06-30 | Brown Kerry D | Virtualization of authentication token for secure applications |
US10089797B1 (en) | 2010-02-25 | 2018-10-02 | Stamps.Com Inc. | Systems and methods for providing localized functionality in browser based postage transactions |
US9842308B1 (en) | 2010-02-25 | 2017-12-12 | Stamps.Com Inc. | Systems and methods for rules based shipping |
US8625802B2 (en) * | 2010-06-16 | 2014-01-07 | Porticor Ltd. | Methods, devices, and media for secure key management in a non-secured, distributed, virtualized environment with applications to cloud-computing security and management |
US8782434B1 (en) | 2010-07-15 | 2014-07-15 | The Research Foundation For The State University Of New York | System and method for validating program execution at run-time |
US9424930B2 (en) * | 2010-09-15 | 2016-08-23 | Sandisk Technologies Llc | Apparatus, system, and method for non-volatile storage element programming |
KR20140030099A (en) | 2010-10-11 | 2014-03-11 | 그래픽 시큐리티 시스템즈 코포레이션 | Method for constructing a composite image incorporating a hidden authentication image |
US8800993B2 (en) | 2010-10-14 | 2014-08-12 | Shuffle Master Gmbh & Co Kg | Card handling systems, devices for use in card handling systems and related methods |
RU2447502C1 (en) * | 2010-10-18 | 2012-04-10 | Российская Федерация, от имени которой выступает Государственная корпорация по атомной энергии "Росатом" - Госкорпорация "Росатом" | Changeable code unit |
US20120091121A1 (en) * | 2010-10-19 | 2012-04-19 | Zachary Justin Reitmeier | Heater stack for inkjet printheads |
WO2012109139A1 (en) * | 2011-02-08 | 2012-08-16 | Telcordia Technologies, Inc. | Method and apparatus for secure data representation allowing efficient collection, search and retrieval |
JP2012174195A (en) * | 2011-02-24 | 2012-09-10 | Renesas Electronics Corp | Authentication system |
JP5292601B2 (en) * | 2011-04-05 | 2013-09-18 | コニカミノルタ株式会社 | Inkjet recording device |
US9914320B1 (en) | 2011-04-21 | 2018-03-13 | Stamps.Com Inc. | Secure value bearing indicia using clear media |
US10713634B1 (en) | 2011-05-18 | 2020-07-14 | Stamps.Com Inc. | Systems and methods using mobile communication handsets for providing postage |
US20120298738A1 (en) * | 2011-05-25 | 2012-11-29 | Nukotoys, Inc. | Cards with geometrically defined card use and mechanics |
CN103619769A (en) | 2011-06-28 | 2014-03-05 | 3M创新有限公司 | Glass-ceramics and methods of making the same |
US9731190B2 (en) | 2011-07-29 | 2017-08-15 | Bally Gaming, Inc. | Method and apparatus for shuffling and handling cards |
US8485527B2 (en) | 2011-07-29 | 2013-07-16 | Savant Shuffler LLC | Card shuffler |
US10373216B1 (en) | 2011-10-12 | 2019-08-06 | Stamps.Com Inc. | Parasitic postage indicia |
US10846650B1 (en) | 2011-11-01 | 2020-11-24 | Stamps.Com Inc. | Perpetual value bearing shipping labels |
US9147505B2 (en) | 2011-11-02 | 2015-09-29 | Ut-Battelle, Llc | Large area controlled assembly of transparent conductive networks |
WO2013103971A1 (en) * | 2012-01-06 | 2013-07-11 | University Of New Hampshire | Systems and methods for chaotic entanglement using cupolets |
US10922641B1 (en) | 2012-01-24 | 2021-02-16 | Stamps.Com Inc. | Systems and methods providing known shipper information for shipping indicia |
DE102012206272A1 (en) * | 2012-04-17 | 2013-10-17 | Beckhoff Automation Gmbh | Fieldbus communication |
WO2013165335A1 (en) | 2012-04-29 | 2013-11-07 | Hewlett-Packard Development Company, L.P. | Piezoelectric inkjet die stack |
ES2638497T5 (en) | 2012-04-30 | 2022-06-30 | Hewlett Packard Development Co | Flexible substrate with integrated circuit |
US9180242B2 (en) | 2012-05-17 | 2015-11-10 | Tandem Diabetes Care, Inc. | Methods and devices for multiple fluid transfer |
US8960674B2 (en) | 2012-07-27 | 2015-02-24 | Bally Gaming, Inc. | Batch card shuffling apparatuses including multi-card storage compartments, and related methods |
US9122873B2 (en) | 2012-09-14 | 2015-09-01 | The Research Foundation For The State University Of New York | Continuous run-time validation of program execution: a practical approach |
US9378766B2 (en) | 2012-09-28 | 2016-06-28 | Bally Gaming, Inc. | Card recognition system, card handling device, and method for tuning a card handling device |
US9511274B2 (en) * | 2012-09-28 | 2016-12-06 | Bally Gaming Inc. | Methods for automatically generating a card deck library and master images for a deck of cards, and a related card processing apparatus |
US9181086B1 (en) | 2012-10-01 | 2015-11-10 | The Research Foundation For The State University Of New York | Hinged MEMS diaphragm and method of manufacture therof |
US9317721B2 (en) | 2012-10-31 | 2016-04-19 | Google Inc. | Privacy aware camera and device status indicator system |
US9201629B2 (en) | 2013-03-14 | 2015-12-01 | International Business Machines Corporation | Instruction for performing a pseudorandom number seed operation |
US9173998B2 (en) | 2013-03-14 | 2015-11-03 | Tandem Diabetes Care, Inc. | System and method for detecting occlusions in an infusion pump |
US8873750B2 (en) | 2013-03-14 | 2014-10-28 | International Business Machines Corporation | Instruction for performing a pseudorandom number generate operation |
US9242043B2 (en) | 2013-03-15 | 2016-01-26 | Tandem Diabetes Care, Inc. | Field update of an ambulatory infusion pump system |
KR102225922B1 (en) * | 2013-03-15 | 2021-03-10 | 비데리 인코포레이티드 | Display device for displaying digital imaging |
KR102036895B1 (en) * | 2013-04-23 | 2019-10-25 | 삼성전자주식회사 | Camera assembly and image acquiring method using the same |
GB2514611A (en) * | 2013-05-31 | 2014-12-03 | Ibm | Storage integrity validator |
US9340023B2 (en) | 2013-05-31 | 2016-05-17 | Stmicroelectronics, Inc. | Methods of making inkjet print heads using a sacrificial substrate layer |
US9036427B2 (en) * | 2013-06-12 | 2015-05-19 | Arm Limited | Apparatus and a method for erasing data stored in a memory device |
WO2015011526A1 (en) * | 2013-07-24 | 2015-01-29 | Freescale Semiconductor, Inc. | Data processing device and method for protecting a data processing device against tampering |
CN104424492B (en) | 2013-09-02 | 2017-12-05 | 阿里巴巴集团控股有限公司 | A kind of data processing method and device based on Quick Response Code |
CN103501398B (en) * | 2013-09-24 | 2016-08-31 | 珠海艾派克微电子有限公司 | Chip, imaging cartridge and chip and the means of communication of imaging device |
US9630400B2 (en) * | 2013-10-15 | 2017-04-25 | Hewlett-Packard Development Company, L.P. | Authentication value for print head die based on analog device electrical characteristics |
CN106457036B (en) | 2014-04-11 | 2019-11-22 | 巴利游戏公司 | Method and apparatus for shuffling and handling board |
US9474957B2 (en) | 2014-05-15 | 2016-10-25 | Bally Gaming, Inc. | Playing card handling devices, systems, and methods for verifying sets of cards |
DE102014210988A1 (en) * | 2014-06-10 | 2015-12-17 | Robert Bosch Gmbh | Micromechanical structure |
KR20160014464A (en) * | 2014-07-29 | 2016-02-11 | 삼성전자주식회사 | Memory system and data protecting method thereof |
US9566501B2 (en) | 2014-08-01 | 2017-02-14 | Bally Gaming, Inc. | Hand-forming card shuffling apparatuses including multi-card storage compartments, and related methods |
USD764599S1 (en) | 2014-08-01 | 2016-08-23 | Bally Gaming, Inc. | Card shuffler device |
US9933812B2 (en) * | 2014-09-05 | 2018-04-03 | Semiconductor Energy Laboratory Co., Ltd. | Display panel, input/output device, and data processor |
US9504905B2 (en) | 2014-09-19 | 2016-11-29 | Bally Gaming, Inc. | Card shuffling device and calibration method |
JP6098611B2 (en) * | 2014-10-28 | 2017-03-22 | コニカミノルタ株式会社 | Image processing device, terminal device, processing method, and control program |
KR20160082794A (en) * | 2014-12-29 | 2016-07-11 | 삼성디스플레이 주식회사 | Timing controller and display apparatus including the same |
CN104751896B (en) * | 2015-04-17 | 2017-10-27 | 上海华虹宏力半导体制造有限公司 | Built-in self-test circuit |
US9993595B2 (en) | 2015-05-18 | 2018-06-12 | Tandem Diabetes Care, Inc. | Patch pump cartridge attachment |
EP3337534B1 (en) | 2015-08-20 | 2022-08-31 | Tandem Diabetes Care, Inc. | Drive mechanism for infusion pump |
CN105099712B (en) * | 2015-09-17 | 2018-11-20 | 深圳三元色数码科技有限公司 | A kind of data ciphering method based on Dicode verification |
US9756024B2 (en) | 2015-09-18 | 2017-09-05 | Trillium Incorporated | Computer-implemented cryptographic method for improving a computer network, and terminal, system and computer-readable medium for the same |
KR102370169B1 (en) * | 2015-10-13 | 2022-03-04 | 엘지전자 주식회사 | Flexible display device and operating method thereof |
US9993719B2 (en) | 2015-12-04 | 2018-06-12 | Shuffle Master Gmbh & Co Kg | Card handling devices and related assemblies and components |
US10063727B2 (en) * | 2015-12-29 | 2018-08-28 | Kabushiki Kaisha Toshiba | Marking apparatus and decoloring apparatus |
US10569016B2 (en) | 2015-12-29 | 2020-02-25 | Tandem Diabetes Care, Inc. | System and method for switching between closed loop and open loop control of an ambulatory infusion pump |
US9786039B2 (en) * | 2016-01-26 | 2017-10-10 | Wipro Limited | Method and system for processing an image extracted from a document |
US10541987B2 (en) | 2016-02-26 | 2020-01-21 | Tandem Diabetes Care, Inc. | Web browser-based device communication workflow |
CN106355782A (en) * | 2016-08-31 | 2017-01-25 | 陕西省人民医院 | Self-help printing management system for reports and films |
US10235336B1 (en) | 2016-09-14 | 2019-03-19 | Compellon Incorporated | Prescriptive analytics platform and polarity analysis engine |
US10933300B2 (en) | 2016-09-26 | 2021-03-02 | Shuffle Master Gmbh & Co Kg | Card handling devices and related assemblies and components |
US10339765B2 (en) | 2016-09-26 | 2019-07-02 | Shuffle Master Gmbh & Co Kg | Devices, systems, and related methods for real-time monitoring and display of related data for casino gaming devices |
CN108073818B (en) * | 2016-11-14 | 2021-07-09 | 华为技术有限公司 | Data protection circuit of chip, chip and electronic equipment |
CN106845573A (en) * | 2016-12-31 | 2017-06-13 | 广州中大微电子有限公司 | A kind of contact IC card reader-writer of integrated GPRS |
GB201712726D0 (en) | 2017-08-08 | 2017-09-20 | Landa Labs (2012) Ltd | Electric current and heat mitigation in a printing machine writing module |
CN107958857B (en) * | 2017-11-28 | 2024-03-19 | 北方电子研究院安徽有限公司 | Briquetting trigger device and epoxy resin vacuum low-pressure packaging process method |
FR3076923A1 (en) | 2018-01-16 | 2019-07-19 | Stmicroelectronics (Rousset) Sas | METHOD AND AUTHENTICATION CIRCUIT |
US11458246B2 (en) | 2018-02-05 | 2022-10-04 | Tandem Diabetes Care, Inc. | Methods and systems for detecting infusion pump conditions |
US11089180B2 (en) | 2018-03-20 | 2021-08-10 | Hewlett-Packard Development Company, L.P. | Encoding dot patterns into printed images based on source pixel color |
CN108710720B (en) * | 2018-04-03 | 2021-11-23 | 合肥通用机械研究院有限公司 | Analysis design method for bolt flange connection structure based on leakage rate |
US10866809B2 (en) * | 2018-07-05 | 2020-12-15 | Qualcomm Incorporated | Method, apparatus, and system for acceleration of inversion of injective operations |
US11896891B2 (en) | 2018-09-14 | 2024-02-13 | Sg Gaming, Inc. | Card-handling devices and related methods, assemblies, and components |
US11376489B2 (en) | 2018-09-14 | 2022-07-05 | Sg Gaming, Inc. | Card-handling devices and related methods, assemblies, and components |
KR102520412B1 (en) * | 2018-09-19 | 2023-04-12 | 에스케이하이닉스 주식회사 | Memory system and operation method thereof |
US11338194B2 (en) | 2018-09-28 | 2022-05-24 | Sg Gaming, Inc. | Automatic card shufflers and related methods of automatic jam recovery |
CN109949256B (en) * | 2019-01-14 | 2023-04-07 | 昆明理工大学 | Astronomical image fusion method based on Fourier transform |
FR3098949B1 (en) | 2019-07-15 | 2023-10-06 | St Microelectronics Rousset | One-way function |
US11068758B1 (en) * | 2019-08-14 | 2021-07-20 | Compellon Incorporated | Polarity semantics engine analytics platform |
PH12020050309A1 (en) | 2019-09-10 | 2021-03-22 | Shuffle Master Gmbh And Co Kg | Card-handling devices with defect detection and related methods |
US11173383B2 (en) | 2019-10-07 | 2021-11-16 | Sg Gaming, Inc. | Card-handling devices and related methods, assemblies, and components |
CN111209580B (en) * | 2020-01-03 | 2022-08-02 | 湖南麒麟信安科技股份有限公司 | Method, system and medium for isolating shared user environment based on mandatory access control |
CN111524660B (en) * | 2020-03-13 | 2022-05-17 | 乐庭电线工业(惠州)有限公司 | Cable code spraying control method and system based on network and storage medium |
US11488066B2 (en) * | 2020-04-21 | 2022-11-01 | SiMa Technologies, Inc. | Efficient convolution of multi-channel input samples with multiple kernels |
US20220012201A1 (en) * | 2020-07-07 | 2022-01-13 | Apple Inc. | Scatter and Gather Streaming Data through a Circular FIFO |
CN112738219B (en) * | 2020-12-28 | 2022-06-10 | 中国第一汽车股份有限公司 | Program running method, program running device, vehicle and storage medium |
CN114048421B (en) * | 2021-03-26 | 2023-05-05 | 南京理工大学 | Fragment penetration target plate data processing method |
US11652941B1 (en) * | 2022-04-11 | 2023-05-16 | Xerox Corporation | Methods and systems for securing confidential content of a document while printing and/or generating a copy of the document |
CN115292723B (en) * | 2022-10-09 | 2023-03-24 | 支付宝(杭州)信息技术有限公司 | Method and device for detecting side channel loophole |
CN115756613B (en) * | 2022-11-29 | 2023-08-29 | 中国科学院空天信息创新研究院 | Sine interpolation method and device based on vectorization processing and SAR radar |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3914877A (en) * | 1974-04-08 | 1975-10-28 | Marion E Hines | Image scrambling technique |
US4544184A (en) * | 1983-07-07 | 1985-10-01 | Freund Precision, Inc. | Tamper-proof identification card and identification system |
US5825947A (en) * | 1995-09-01 | 1998-10-20 | Olympus Optical Co., Ltd. | Optical reproducing system for multimedia information recorded with code data having function for correcting image reading distortion |
US5874718A (en) * | 1995-10-23 | 1999-02-23 | Olympus Optical Co., Ltd. | Information recording medium |
US5913542A (en) * | 1993-09-17 | 1999-06-22 | Bell Data Software Corporation | System for producing a personal ID card |
US6182901B1 (en) * | 1993-12-22 | 2001-02-06 | Xerox Corporation | Orientational disambiguation for self-clocking glyph codes |
Family Cites Families (282)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US566141A (en) * | 1896-08-18 | Buggy-seat | ||
GB792145A (en) | 1953-05-20 | 1958-03-19 | Technograph Printed Circuits L | Improvements in and relating to devices for obtaining a mechanical movement from theaction of an electric current |
US4991205A (en) | 1962-08-27 | 1991-02-05 | Lemelson Jerome H | Personal identification system and method |
DE1648322A1 (en) | 1967-07-20 | 1971-03-25 | Vdo Schindling | Measuring or switching element made of bimetal |
US3845657A (en) * | 1972-02-04 | 1974-11-05 | Westinghouse Electric Corp | Surveillance system including means for detecting impending failure in high pressure, high temperature fluid conducting pipes |
FR2188389B1 (en) | 1972-06-08 | 1975-06-13 | Cibie Projecteurs | |
US3866217A (en) | 1972-12-26 | 1975-02-11 | Currier Smith Corp | Monitoring transmission link by comparing pseudorandom signals |
FR2231076A2 (en) | 1973-05-24 | 1974-12-20 | Electricite De France | Driving organ operated by thermal means - esp. for use in corrosive or dangerous environments formed by two metal strips |
US4001777A (en) * | 1973-06-21 | 1977-01-04 | Elmore Alexander | Taximeter protection system |
US3893173A (en) | 1974-01-11 | 1975-07-01 | Hewlett Packard Co | Miniaturized magnetic card reader/recorder for use in hand-held calculator |
US4074324B1 (en) * | 1975-07-14 | 1994-01-11 | S. Barrett Jon | Instant electronic camera |
US4123782A (en) | 1975-07-18 | 1978-10-31 | Canon Kabushiki Kaisha | Control device for television camera |
US4023149A (en) * | 1975-10-28 | 1977-05-10 | Motorola, Inc. | Static storage technique for four transistor IGFET memory cell |
US4092654A (en) | 1976-09-13 | 1978-05-30 | Alasia Alfred Victor | Encoding system |
US4139910A (en) * | 1976-12-06 | 1979-02-13 | International Business Machines Corporation | Charge coupled device memory with method of doubled storage capacity and independent of process parameters and temperature |
GB1595797A (en) | 1978-04-21 | 1981-08-19 | Pushman Hugh John | Security systems |
US4262284A (en) | 1978-06-26 | 1981-04-14 | Stieff Lorin R | Self-monitoring seal |
DE2905063A1 (en) | 1979-02-10 | 1980-08-14 | Olympia Werke Ag | Ink nozzle air intake avoidance system - has vibratory pressure generator shutting bore in membrane in rest position |
US4300210A (en) * | 1979-12-27 | 1981-11-10 | International Business Machines Corp. | Calibrated sensing system |
US5241165A (en) | 1981-02-27 | 1993-08-31 | Drexler Technology Corporation | Erasable optical wallet-size data card |
JPS58112747A (en) | 1981-12-26 | 1983-07-05 | Fujitsu Ltd | Ink jet recording device |
JPS58116165A (en) | 1981-12-29 | 1983-07-11 | Canon Inc | Ink injection head |
US4611219A (en) * | 1981-12-29 | 1986-09-09 | Canon Kabushiki Kaisha | Liquid-jetting head |
DE3214791A1 (en) | 1982-04-21 | 1983-10-27 | Siemens AG, 1000 Berlin und 8000 München | WRITING DEVICE WORKING WITH LIQUID DROPS |
JPS58225743A (en) * | 1982-06-23 | 1983-12-27 | Toshiba Corp | Radio telephone equipment |
US4423401A (en) * | 1982-07-21 | 1983-12-27 | Tektronix, Inc. | Thin-film electrothermal device |
DE3245283A1 (en) | 1982-12-07 | 1984-06-07 | Siemens AG, 1000 Berlin und 8000 München | Arrangement for expelling liquid droplets |
US4590470A (en) * | 1983-07-11 | 1986-05-20 | At&T Bell Laboratories | User authentication system employing encryption functions |
US4553393A (en) | 1983-08-26 | 1985-11-19 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Memory metal actuator |
JPS60192668A (en) * | 1984-03-14 | 1985-10-01 | Toshiba Corp | Image former |
JPS6125849A (en) | 1984-07-17 | 1986-02-04 | Canon Inc | Ink jet recording device |
DE3430155A1 (en) | 1984-08-16 | 1986-02-27 | Siemens AG, 1000 Berlin und 8000 München | Indirectly heated bimetal |
JPS61106259A (en) | 1984-10-31 | 1986-05-24 | Hitachi Ltd | Ink droplet jet discharging device |
SE447222B (en) | 1984-12-21 | 1986-11-03 | Swedot System Ab | ELECTROMAGNETIC MANOVERABLE VALVE DEVICE, SPECIFICALLY FOR GENERATING DROPS IN A HYDRAULIC PRINTER |
US4736423A (en) * | 1985-04-30 | 1988-04-05 | International Business Machines Corporation | Technique for reducing RSA Crypto variable storage |
JPS61268453A (en) | 1985-05-23 | 1986-11-27 | Olympus Optical Co Ltd | Ink jet printer head |
US4799061A (en) * | 1985-11-18 | 1989-01-17 | International Business Machines Corporation | Secure component authentication system |
US5258774A (en) | 1985-11-26 | 1993-11-02 | Dataproducts Corporation | Compensation for aerodynamic influences in ink jet apparatuses having ink jet chambers utilizing a plurality of orifices |
US4901093A (en) * | 1985-11-26 | 1990-02-13 | Dataproducts Corporation | Method and apparatus for printing with ink jet chambers utilizing a plurality of orifices |
US4728978A (en) | 1986-03-07 | 1988-03-01 | Minolta Camera Kabushiki Kaisha | Photographic camera |
EP0237940B1 (en) | 1986-03-19 | 1993-09-08 | Sharp Kabushiki Kaisha | Manual copying apparatus |
US4724307A (en) | 1986-04-29 | 1988-02-09 | Gtech Corporation | Marked card reader |
US4801935A (en) * | 1986-11-17 | 1989-01-31 | Computer Security Corporation | Apparatus and method for security of electric and electronic devices |
US4897719A (en) | 1987-03-19 | 1990-01-30 | Hugh Griffin | Image pre-processing sub-system |
US4914452A (en) * | 1987-05-08 | 1990-04-03 | Ricoh Company, Ltd. | Ink sheet/recording paper cassette |
DE3716996A1 (en) | 1987-05-21 | 1988-12-08 | Vdo Schindling | Deformation element |
JPH01105746A (en) | 1987-10-19 | 1989-04-24 | Ricoh Co Ltd | Ink jet head |
JPH01115639A (en) | 1987-10-30 | 1989-05-08 | Ricoh Co Ltd | Ink jet recording head |
JPH01128839A (en) | 1987-11-13 | 1989-05-22 | Ricoh Co Ltd | Inkjet recording head |
JPH01148587A (en) | 1987-12-04 | 1989-06-09 | Mitsubishi Paper Mills Ltd | Image receiving sheet |
US5233414A (en) * | 1987-12-08 | 1993-08-03 | Canon Kabushiki Kaisha | Color image processing apparatus |
JPH01257058A (en) | 1988-04-07 | 1989-10-13 | Seiko Epson Corp | Ink jet head |
DE3814150A1 (en) | 1988-04-27 | 1989-11-09 | Draegerwerk Ag | VALVE ARRANGEMENT MADE FROM MICROSTRUCTURED COMPONENTS |
JPH01306254A (en) | 1988-06-03 | 1989-12-11 | Seiko Epson Corp | Ink jet head |
US5051838A (en) * | 1988-06-22 | 1991-09-24 | Fuji Photo Film Co., Ltd. | Portable electronic copying machine |
JPH0250841A (en) | 1988-08-12 | 1990-02-20 | Seiko Epson Corp | Ink jet head |
GB2222045B (en) * | 1988-08-19 | 1993-04-07 | Motorola Inc | Transistor breakdown protection circuit |
JP2653118B2 (en) | 1988-08-23 | 1997-09-10 | ソニー株式会社 | Camera-integrated video recorder |
US5243370A (en) | 1988-08-30 | 1993-09-07 | Dan Slater | Camera stabilizer |
JPH0292643A (en) | 1988-09-30 | 1990-04-03 | Seiko Epson Corp | Ink jet head |
GB2225687B (en) * | 1988-10-04 | 1993-11-03 | Asahi Optical Co Ltd | Mode changing device for a still video camera |
IT1229927B (en) | 1988-10-14 | 1991-09-16 | Cipelletti Alberto Cae | VANE PUMP. |
JPH02108544A (en) | 1988-10-19 | 1990-04-20 | Seiko Epson Corp | Inkjet printing head |
US4864824A (en) | 1988-10-31 | 1989-09-12 | American Telephone And Telegraph Company, At&T Bell Laboratories | Thin film shape memory alloy and method for producing |
JP2697041B2 (en) | 1988-12-10 | 1998-01-14 | ミノルタ株式会社 | Inkjet printer |
JPH02162049A (en) | 1988-12-16 | 1990-06-21 | Seiko Epson Corp | Printer head |
US4937676A (en) | 1989-02-10 | 1990-06-26 | Polariod Corporation | Electronic camera system with detachable printer |
JPH041051A (en) | 1989-02-22 | 1992-01-06 | Ricoh Co Ltd | Ink-jet recording device |
JPH02265752A (en) | 1989-04-05 | 1990-10-30 | Matsushita Electric Ind Co Ltd | Ink-jet recording head |
EP0398031A1 (en) | 1989-04-19 | 1990-11-22 | Seiko Epson Corporation | Ink jet head |
US5016107A (en) * | 1989-05-09 | 1991-05-14 | Eastman Kodak Company | Electronic still camera utilizing image compression and digital storage |
DE69028038T2 (en) | 1989-05-17 | 1997-01-30 | Minolta Camera Kk | Recording and repro camera |
US5153532A (en) | 1989-05-24 | 1992-10-06 | Honeywell Inc. | Noise generator using combined outputs of two pseudo-random sequence generators |
US5035325A (en) * | 1989-07-18 | 1991-07-30 | Dai Nippon Insatsu Kabushiki Kaisha | Cassette for thermal transfer printing film |
JPH0365348A (en) | 1989-08-04 | 1991-03-20 | Matsushita Electric Ind Co Ltd | Ink jet head |
JP2746703B2 (en) | 1989-11-09 | 1998-05-06 | 松下電器産業株式会社 | Ink jet head device and method of manufacturing the same |
JPH03112662A (en) | 1989-09-27 | 1991-05-14 | Seiko Epson Corp | Ink jet printer |
JP2964618B2 (en) | 1989-11-10 | 1999-10-18 | セイコーエプソン株式会社 | Head for inkjet printer |
JPH03180350A (en) | 1989-12-08 | 1991-08-06 | Seiko Epson Corp | Ink jet head |
US5365466A (en) * | 1989-12-19 | 1994-11-15 | Bull Cp8 | Method for generating a random number in a system with portable electronic objects, and system for implementing the method |
US5216521A (en) * | 1990-01-10 | 1993-06-01 | Agfa-Gevaert Aktiengesellschaft | Reproduction of photographic originals with scattered light correction |
US5245365A (en) * | 1990-02-28 | 1993-09-14 | Compaq Computer Corporation | Ink-jet printer with user replaceable printing system cartridge |
US5189511A (en) * | 1990-03-19 | 1993-02-23 | Eastman Kodak Company | Method and apparatus for improving the color rendition of hardcopy images from electronic cameras |
US5063655A (en) | 1990-04-02 | 1991-11-12 | International Business Machines Corp. | Method to integrate drive/control devices and ink jet on demand devices in a single printhead chip |
US5124692A (en) | 1990-04-13 | 1992-06-23 | Eastman Kodak Company | Method and apparatus for providing rotation of digital image data |
US5036461A (en) * | 1990-05-16 | 1991-07-30 | Elliott John C | Two-way authentication system between user's smart card and issuer-specific plug-in application modules in multi-issued transaction device |
GB2244622B (en) | 1990-05-30 | 1994-06-15 | Sony Corp | Image signal processing |
DE69133502T2 (en) * | 1990-06-01 | 2006-09-14 | Kabushiki Kaisha Toshiba, Kawasaki | Secret transmission method and device |
JPH04118241A (en) | 1990-09-10 | 1992-04-20 | Seiko Epson Corp | Amplitude conversion actuator for ink jet printer head |
EP0477080B1 (en) | 1990-09-17 | 1998-06-03 | Canon Kabushiki Kaisha | Data communication apparatus |
JPH04126255A (en) | 1990-09-18 | 1992-04-27 | Seiko Epson Corp | Ink jet head |
US6278486B1 (en) | 1990-09-18 | 2001-08-21 | Canon Kabushiki Kaisha | Information signal controlling system |
JPH04141429A (en) | 1990-10-03 | 1992-05-14 | Seiko Epson Corp | Ink jet head |
DE4031248A1 (en) | 1990-10-04 | 1992-04-09 | Kernforschungsz Karlsruhe | MICROMECHANICAL ELEMENT |
US5196840A (en) * | 1990-11-05 | 1993-03-23 | International Business Machines Corporation | Secure communications system for remotely located computers |
JP2573416B2 (en) * | 1990-11-28 | 1997-01-22 | 株式会社東芝 | Semiconductor storage device |
US5493409A (en) * | 1990-11-29 | 1996-02-20 | Minolta Camera Kabushiki Kaisha | Still video camera having a printer capable of printing a photographed image in a plurality of printing modes |
JP3255409B2 (en) * | 1990-11-29 | 2002-02-12 | キヤノン株式会社 | Image forming device |
JP3115660B2 (en) * | 1990-12-07 | 2000-12-11 | キヤノン株式会社 | Ink jet head cartridge and ink tank cartridge using decomposable plastic as a part of the structure, and an ink jet apparatus having a mounting portion for mounting these cartridges |
JP2719237B2 (en) * | 1990-12-20 | 1998-02-25 | シャープ株式会社 | Dynamic semiconductor memory device |
US5861897A (en) * | 1991-01-19 | 1999-01-19 | Canon Kabushiki Kaisha | Inkjet recording apparatus with a memory device disposed substantially within boundaries if a recording head unit |
US5115888A (en) | 1991-02-04 | 1992-05-26 | Howard Schneider | Self-serve checkout system |
US5218569A (en) * | 1991-02-08 | 1993-06-08 | Banks Gerald J | Electrically alterable non-volatile memory with n-bits per memory cell |
US5126755A (en) | 1991-03-26 | 1992-06-30 | Videojet Systems International, Inc. | Print head assembly for ink jet printer |
US5164740A (en) | 1991-04-24 | 1992-11-17 | Yehuda Ivri | High frequency printing mechanism |
US5121139A (en) * | 1991-04-29 | 1992-06-09 | Tektronix, Inc. | Compact ink jet printer having a drum drive mechanism |
JPH04353458A (en) | 1991-05-31 | 1992-12-08 | Brother Ind Ltd | Ink jet head |
JPH04368851A (en) | 1991-06-17 | 1992-12-21 | Seiko Epson Corp | Magnetic field generating substrate and ink jet head equipped therewith |
JP2671649B2 (en) * | 1991-07-08 | 1997-10-29 | 三菱電機株式会社 | Authentication method |
US5239575A (en) * | 1991-07-09 | 1993-08-24 | Schlumberger Industries, Inc. | Telephone dial-inbound data acquisition system with demand reading capability |
WO1993004425A1 (en) | 1991-08-13 | 1993-03-04 | Universal Photonix, Inc. | System for remotely validating the identity of indivuals and determining their locations |
GB9121851D0 (en) | 1991-10-15 | 1991-11-27 | Willett Int Ltd | Device |
US5211806A (en) | 1991-12-24 | 1993-05-18 | Xerox Corporation | Monolithic inkjet printhead |
JP3450349B2 (en) | 1992-03-31 | 2003-09-22 | キヤノン株式会社 | Cantilever probe |
DE4310727C2 (en) * | 1992-04-06 | 1996-07-11 | Hell Ag Linotype | Method and device for analyzing image templates |
JPH05318724A (en) | 1992-05-19 | 1993-12-03 | Seikosha Co Ltd | Ink jet recorder |
US5278585A (en) | 1992-05-28 | 1994-01-11 | Xerox Corporation | Ink jet printhead with ink flow directing valves |
JPH07325934A (en) | 1992-07-10 | 1995-12-12 | Walt Disney Co:The | Method and equipment for provision of graphics enhanced to virtual world |
US5398131A (en) | 1992-08-13 | 1995-03-14 | Hall; Dennis R. | Stereoscopic hardcopy methods |
US5231455A (en) * | 1992-08-17 | 1993-07-27 | Phoenix Precision Graphics, Inc. | Air jet cleaner for one pump color imager |
JP2615319B2 (en) | 1992-09-17 | 1997-05-28 | セイコープレシジョン株式会社 | Inkjet head |
JPH0691865A (en) | 1992-09-17 | 1994-04-05 | Seikosha Co Ltd | Ink jet head |
IL107120A (en) * | 1992-09-29 | 1997-09-30 | Boehringer Ingelheim Int | Atomising nozzle and filter and spray generating device |
JPH06149051A (en) | 1992-11-08 | 1994-05-27 | Ricoh Co Ltd | Developer container, processing cartridge, judgement device for recycling of such container or cartridge and image forming device |
DE4243888A1 (en) * | 1992-12-23 | 1994-06-30 | Gao Ges Automation Org | Data carrier and method for checking the authenticity of a data carrier |
AU6083394A (en) * | 1993-01-06 | 1994-08-15 | Image Technology International, Inc. | A filmless method and apparatus for producing 3-d photographs |
GB9302170D0 (en) | 1993-02-04 | 1993-03-24 | Domino Printing Sciences Plc | Ink jet printer |
US5408746A (en) * | 1993-04-30 | 1995-04-25 | Hewlett-Packard Company | Datum formation for improved alignment of multiple nozzle members in a printer |
FR2705810B1 (en) * | 1993-05-26 | 1995-06-30 | Gemplus Card Int | Chip card chip provided with a means of limiting the number of authentications. |
IT1270861B (en) | 1993-05-31 | 1997-05-13 | Olivetti Canon Ind Spa | IMPROVED INK JET HEAD FOR A POINT PRINTER |
US5363448A (en) * | 1993-06-30 | 1994-11-08 | United Technologies Automotive, Inc. | Pseudorandom number generation and cryptographic authentication |
US5666141A (en) | 1993-07-13 | 1997-09-09 | Sharp Kabushiki Kaisha | Ink jet head and a method of manufacturing thereof |
US5322594A (en) * | 1993-07-20 | 1994-06-21 | Xerox Corporation | Manufacture of a one piece full width ink jet printing bar |
DE4328433A1 (en) | 1993-08-24 | 1995-03-02 | Heidelberger Druckmasch Ag | Ink jet spray method, and ink jet spray device |
US5801773A (en) * | 1993-10-29 | 1998-09-01 | Canon Kabushiki Kaisha | Image data processing apparatus for processing combined image signals in order to extend dynamic range |
US5499294A (en) * | 1993-11-24 | 1996-03-12 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Digital camera with apparatus for authentication of images produced from an image file |
GB9325076D0 (en) | 1993-12-07 | 1994-02-02 | The Technology Partnership Plc | Electronic camera |
FR2714780B1 (en) * | 1993-12-30 | 1996-01-26 | Stern Jacques | Method for authenticating at least one identification device by a verification device. |
US6095418A (en) * | 1994-01-27 | 2000-08-01 | Symbol Technologies, Inc. | Apparatus for processing symbol-encoded document information |
FR2717286B1 (en) * | 1994-03-09 | 1996-04-05 | Bull Cp8 | Method and device for authenticating a data medium intended to allow a transaction or access to a service or a place, and corresponding medium. |
US5477264A (en) | 1994-03-29 | 1995-12-19 | Eastman Kodak Company | Electronic imaging system using a removable software-enhanced storage device |
US5621868A (en) | 1994-04-15 | 1997-04-15 | Sony Corporation | Generating imitation custom artwork by simulating brush strokes and enhancing edges |
US5635968A (en) * | 1994-04-29 | 1997-06-03 | Hewlett-Packard Company | Thermal inkjet printer printhead with offset heater resistors |
DE19516997C2 (en) | 1994-05-10 | 1998-02-26 | Sharp Kk | Ink jet head and method of manufacturing the same |
US5515441A (en) * | 1994-05-12 | 1996-05-07 | At&T Corp. | Secure communication method and apparatus |
JPH07314665A (en) | 1994-05-27 | 1995-12-05 | Canon Inc | Ink jet recording head, recorder using the same and recording method therefor |
JPH07314673A (en) | 1994-05-27 | 1995-12-05 | Sharp Corp | Ink-jet head |
US5539690A (en) * | 1994-06-02 | 1996-07-23 | Intel Corporation | Write verify schemes for flash memory with multilevel cells |
US5506905A (en) * | 1994-06-10 | 1996-04-09 | Delco Electronics Corp. | Authentication method for keyless entry system |
AU2829795A (en) | 1994-06-21 | 1996-01-15 | Renee Keller | Modular optical memory card image display point of sale terminal |
US5907149A (en) * | 1994-06-27 | 1999-05-25 | Polaroid Corporation | Identification card with delimited usage |
JPH0890769A (en) | 1994-09-27 | 1996-04-09 | Sharp Corp | Gusseted diaphragm type ink-jet head |
JP3525353B2 (en) | 1994-09-28 | 2004-05-10 | 株式会社リコー | Digital electronic still camera |
JPH08142323A (en) | 1994-11-24 | 1996-06-04 | Sharp Corp | Ink jet head and manufacture thereof |
CH688960A5 (en) * | 1994-11-24 | 1998-06-30 | Pelikan Produktions Ag | Droplet generator for microdroplets, especially for an inkjet printer. |
KR100337682B1 (en) * | 1994-12-28 | 2002-12-06 | 오끼 덴끼 고오교 가부시끼가이샤 | IC card control circuit and IC card control system |
DE69636695T2 (en) | 1995-02-02 | 2007-03-01 | Matsushita Electric Industrial Co., Ltd., Kadoma | Image processing device |
US5909227A (en) | 1995-04-12 | 1999-06-01 | Eastman Kodak Company | Photograph processing and copying system using coincident force drop-on-demand ink jet printing |
EP0765226A1 (en) | 1995-04-12 | 1997-04-02 | Eastman Kodak Company | Color video printer and a photo-cd system with integrated printer |
JP3706671B2 (en) | 1995-04-14 | 2005-10-12 | キヤノン株式会社 | Liquid ejection head, head cartridge using liquid ejection head, liquid ejection apparatus, and liquid ejection method |
US6007187A (en) * | 1995-04-26 | 1999-12-28 | Canon Kabushiki Kaisha | Liquid ejecting head, liquid ejecting device and liquid ejecting method |
US5619571A (en) * | 1995-06-01 | 1997-04-08 | Sandstrom; Brent B. | Method for securely storing electronic records |
JPH08336965A (en) | 1995-06-14 | 1996-12-24 | Sharp Corp | Ink-jet head |
US5815181A (en) | 1995-06-28 | 1998-09-29 | Canon Kabushiki Kaisha | Micromachine, liquid jet recording head using such micromachine, and liquid jet recording apparatus having such liquid jet recording headmounted thereon |
JP3361916B2 (en) * | 1995-06-28 | 2003-01-07 | シャープ株式会社 | Method of forming microstructure |
US5999203A (en) * | 1995-08-18 | 1999-12-07 | Ttp Group, Plc | Printer assembly with easily loaded paper cartridge |
JPH09116843A (en) | 1995-10-20 | 1997-05-02 | Canon Inc | Image pickup device with printer |
US5847836A (en) * | 1995-08-29 | 1998-12-08 | Canon Kabushiki Kaisha | Printer-built-in image-sensing apparatus and using strobe-light means electric-consumption control method thereof |
JPH0971015A (en) | 1995-09-05 | 1997-03-18 | Ricoh Co Ltd | Recording device and image communication device |
JP3313952B2 (en) * | 1995-09-14 | 2002-08-12 | キヤノン株式会社 | Ink jet recording device |
EP0763930B1 (en) | 1995-09-15 | 2002-10-16 | Agfa-Gevaert | Method for calculating color gamuts |
US5828394A (en) | 1995-09-20 | 1998-10-27 | The Board Of Trustees Of The Leland Stanford Junior University | Fluid drop ejector and method |
JP3541522B2 (en) * | 1995-10-09 | 2004-07-14 | 松下電器産業株式会社 | Communication protection system and equipment between devices |
JPH09104109A (en) | 1995-10-12 | 1997-04-22 | Sharp Corp | Ink jet head and production thereof |
US5896176A (en) | 1995-10-27 | 1999-04-20 | Texas Instruments Incorporated | Content-based video compression |
CA2189109A1 (en) | 1995-10-30 | 1997-05-01 | Kenji Mitsui | Keying system and composite image producing method |
JPH09128507A (en) * | 1995-11-02 | 1997-05-16 | Oki Electric Ind Co Ltd | Mutual certifying method |
US5884013A (en) | 1995-11-17 | 1999-03-16 | Agfa-Gevaert | Autotypical screening with optimised dotshape |
US5706049A (en) | 1995-11-30 | 1998-01-06 | Eastman Kodak Company | Camera that records an active image area identifier with an image |
US5633932A (en) * | 1995-12-19 | 1997-05-27 | Intel Corporation | Apparatus and method for preventing disclosure through user-authentication at a printing node |
US6000621A (en) * | 1995-12-21 | 1999-12-14 | Xerox Corporation | Tilings of mono-code and dual-code embedded data pattern strips for robust asynchronous capture |
JP3303255B2 (en) | 1995-12-28 | 2002-07-15 | 富士写真光機株式会社 | Driving device for zoom lens |
WO1997030375A1 (en) | 1996-02-13 | 1997-08-21 | Obsidian Imaging, Inc. | Method and apparatus for configuring a camera through external means |
US5668596A (en) * | 1996-02-29 | 1997-09-16 | Eastman Kodak Company | Digital imaging device optimized for color performance |
US5887065A (en) * | 1996-03-22 | 1999-03-23 | Activcard | System and method for user authentication having clock synchronization |
US6052648A (en) | 1996-04-12 | 2000-04-18 | Earthwatch Communications, Inc. | Method and system for display of weather-related information |
JP3200012B2 (en) * | 1996-04-19 | 2001-08-20 | 株式会社東芝 | Storage system |
US6020931A (en) | 1996-04-25 | 2000-02-01 | George S. Sheng | Video composition and position system and media signal communication system |
US5815186A (en) * | 1996-04-29 | 1998-09-29 | Hewlett-Packard Company | Removable roll-feed apparatus and method |
JP3037140B2 (en) | 1996-06-13 | 2000-04-24 | 日本電気オフィスシステム株式会社 | Digital camera |
US5966134A (en) | 1996-06-28 | 1999-10-12 | Softimage | Simulating cel animation and shading |
US5790365A (en) | 1996-07-31 | 1998-08-04 | Applied Materials, Inc. | Method and apparatus for releasing a workpiece from and electrostatic chuck |
JPH1056604A (en) * | 1996-08-07 | 1998-02-24 | Olympus Optical Co Ltd | Electronic camera with built-in printer and medium to be recorded |
US5894326A (en) * | 1996-08-26 | 1999-04-13 | Eastman Kodak Company | Electronic camera having a printer |
US5914748A (en) | 1996-08-30 | 1999-06-22 | Eastman Kodak Company | Method and apparatus for generating a composite image using the difference of two images |
US5878283A (en) * | 1996-09-05 | 1999-03-02 | Eastman Kodak Company | Single-use camera with motion sensor |
JPH1098176A (en) * | 1996-09-19 | 1998-04-14 | Toshiba Corp | Solid-state image pickup device |
US5810146A (en) * | 1996-10-31 | 1998-09-22 | Authentication Technologies, Inc. | Wide edge lead currency thread detection system |
US5917913A (en) * | 1996-12-04 | 1999-06-29 | Wang; Ynjiun Paul | Portable electronic authorization devices and methods therefor |
US5715234A (en) * | 1996-12-16 | 1998-02-03 | Eastman Kodak Company | Electronic camera and associated printer which uses a display image |
US5757388A (en) * | 1996-12-16 | 1998-05-26 | Eastman Kodak Company | Electronic camera and integral ink jet printer |
US6192473B1 (en) * | 1996-12-24 | 2001-02-20 | Pitney Bowes Inc. | System and method for mutual authentication and secure communications between a postage security device and a meter server |
US6002434A (en) * | 1997-01-14 | 1999-12-14 | Matsushita Electric Industrial Co., Ltd. | Registration correction waveform determination method and system for a television camera |
US5909248A (en) | 1997-01-31 | 1999-06-01 | Eastman Kodak Company | Exposure control of camera attached to printer electronic camera |
US5740480A (en) * | 1997-02-20 | 1998-04-14 | Eastman Kodak Company | Camera with movable first lens cover which supports movable second lens cover which opens during movement of first lens cover |
AUPO799197A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image processing method and apparatus (ART01) |
JPH10285610A (en) * | 1997-04-01 | 1998-10-23 | Sony Corp | Color correction device and color correction controller |
US5999190A (en) | 1997-04-04 | 1999-12-07 | Avid Technology, Inc. | Computer imaging using graphics components |
US5963076A (en) * | 1997-04-14 | 1999-10-05 | Motorola, Inc. | Circuit with hot-electron protection and method |
AUPP087397A0 (en) * | 1997-12-12 | 1998-01-08 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ36) |
US6824251B2 (en) * | 1997-07-15 | 2004-11-30 | Silverbrook Research Pty Ltd | Micro-electromechanical assembly that incorporates a covering formation for a micro-electromechanical device |
AUPO806497A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ30) |
US7111925B2 (en) * | 1997-07-15 | 2006-09-26 | Silverbrook Research Pty Ltd | Inkjet printhead integrated circuit |
AUPO804897A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ14) |
AUPP398398A0 (en) * | 1998-06-09 | 1998-07-02 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ij45) |
US6239821B1 (en) * | 1997-07-15 | 2001-05-29 | Silverbrook Research Pty Ltd | Direct firing thermal bend actuator ink jet printing mechanism |
AUPP653998A0 (en) * | 1998-10-16 | 1998-11-05 | Silverbrook Research Pty Ltd | Micromechanical device and method (ij46B) |
US6247792B1 (en) * | 1997-07-15 | 2001-06-19 | Silverbrook Research Pty Ltd | PTFE surface shooting shuttered oscillating pressure ink jet printing mechanism |
US6264307B1 (en) * | 1997-07-15 | 2001-07-24 | Silverbrook Research Pty Ltd | Buckle grill oscillating pressure ink jet printing mechanism |
US6582059B2 (en) * | 1997-07-15 | 2003-06-24 | Silverbrook Research Pty Ltd | Discrete air and nozzle chambers in a printhead chip for an inkjet printhead |
AUPO798697A0 (en) | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Data processing method and apparatus (ART51) |
AUPO803597A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ06) |
US6338547B1 (en) * | 1997-07-15 | 2002-01-15 | Silverbrook Research Pty Ltd | Conductive PTFE bend actuator vented ink jet printing mechanism |
US6317192B1 (en) | 1997-07-15 | 2001-11-13 | Silverbrook Research Pty Ltd | Utilization of image tiling effects in photographs |
US6213589B1 (en) * | 1997-07-15 | 2001-04-10 | Silverbrook Research Pty Ltd. | Planar thermoelastic bend actuator ink jet printing mechanism |
AUPP089397A0 (en) * | 1997-12-12 | 1998-01-08 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ37) |
US6855264B1 (en) * | 1997-07-15 | 2005-02-15 | Kia Silverbrook | Method of manufacture of an ink jet printer having a thermal actuator comprising an external coil spring |
US6416168B1 (en) * | 1997-07-15 | 2002-07-09 | Silverbrook Research Pty Ltd | Pump action refill ink jet printing mechanism |
US6213588B1 (en) * | 1997-07-15 | 2001-04-10 | Silverbrook Research Pty Ltd | Electrostatic ink jet printing mechanism |
US6227653B1 (en) * | 1997-07-15 | 2001-05-08 | Silverbrook Research Pty Ltd | Bend actuator direct ink supply ink jet printing mechanism |
US7472984B2 (en) * | 1997-07-15 | 2009-01-06 | Silverbrook Research Pty Ltd | Inkjet chamber with plurality of nozzles |
US6180427B1 (en) | 1997-07-15 | 2001-01-30 | Silverbrook Research Pty. Ltd. | Method of manufacture of a thermally actuated ink jet including a tapered heater element |
US6241342B1 (en) * | 1997-07-15 | 2001-06-05 | Silverbrook Research Pty Ltd. | Lorentz diaphragm electromagnetic ink jet printing mechanism |
AUPP399198A0 (en) * | 1998-06-09 | 1998-07-02 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ij42) |
AUPO803797A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ27) |
US7578582B2 (en) * | 1997-07-15 | 2009-08-25 | Silverbrook Research Pty Ltd | Inkjet nozzle chamber holding two fluids |
US6491833B1 (en) * | 1997-07-15 | 2002-12-10 | Silverbrook Research Pty Ltd | Method of manufacture of a dual chamber single vertical actuator ink jet printer |
US6234609B1 (en) * | 1997-07-15 | 2001-05-22 | Silverbrook Research Pty Ltd | High Young's modulus thermoelastic ink jet printing mechanism |
US6254220B1 (en) * | 1997-07-15 | 2001-07-03 | Silverbrook Research Pty Ltd | Shutter based ink jet printing mechanism |
US6416167B1 (en) * | 1997-07-15 | 2002-07-09 | Silverbrook Research Pty Ltd | Thermally actuated ink jet printing mechanism having a series of thermal actuator units |
US6257704B1 (en) * | 1997-07-15 | 2001-07-10 | Silverbrook Research Pty Ltd | Planar swing grill electromagnetic ink jet printing mechanism |
US6231163B1 (en) * | 1997-07-15 | 2001-05-15 | Silverbrook Research Pty Ltd | Stacked electrostatic ink jet printing mechanism |
US6247796B1 (en) * | 1997-07-15 | 2001-06-19 | Silverbrook Research Pty Ltd | Magnetostrictive ink jet printing mechanism |
AUPO804797A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ05) |
US6217165B1 (en) * | 1997-07-15 | 2001-04-17 | Silverbrook Research Pty. Ltd. | Ink and media cartridge with axial ink chambers |
AUPO804297A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ29) |
US6336710B1 (en) * | 1997-07-15 | 2002-01-08 | Silverbrook Research Pty Ltd | Dual nozzle single horizontal actuator ink jet printing mechanism |
US7004566B2 (en) * | 1997-07-15 | 2006-02-28 | Silverbrook Research Pty Ltd | Inkjet printhead chip that incorporates micro-mechanical lever mechanisms |
US6257705B1 (en) * | 1997-07-15 | 2001-07-10 | Silverbrook Research Pty Ltd | Two plate reverse firing electromagnetic ink jet printing mechanism |
AUPP259398A0 (en) * | 1998-03-25 | 1998-04-23 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ41) |
US6834939B2 (en) * | 2002-11-23 | 2004-12-28 | Silverbrook Research Pty Ltd | Micro-electromechanical device that incorporates covering formations for actuators of the device |
AUPP398798A0 (en) | 1998-06-09 | 1998-07-02 | Silverbrook Research Pty Ltd | Image creation method and apparatus (ij43) |
US6283582B1 (en) * | 1997-07-15 | 2001-09-04 | Silverbrook Research Pty Ltd | Iris motion ink jet printing mechanism |
US6217153B1 (en) * | 1997-07-15 | 2001-04-17 | Silverbrook Research Pty Ltd | Single bend actuator cupped paddle ink jet printing mechanism |
US6220694B1 (en) * | 1997-07-15 | 2001-04-24 | Silverbrook Research Pty Ltd. | Pulsed magnetic field ink jet printing mechanism |
US6264306B1 (en) * | 1997-07-15 | 2001-07-24 | Silverbrook Research Pty Ltd | Linear spring electromagnetic grill ink jet printing mechanism |
US6260953B1 (en) * | 1997-07-15 | 2001-07-17 | Silverbrook Research Pty Ltd | Surface bend actuator vented ink supply ink jet printing mechanism |
US6245246B1 (en) * | 1997-07-15 | 2001-06-12 | Silverbrook Research Pty Ltd | Method of manufacture of a thermally actuated slotted chamber wall ink jet printer |
US7011390B2 (en) * | 1997-07-15 | 2006-03-14 | Silverbrook Research Pty Ltd | Printing mechanism having wide format printing zone |
AUPO806697A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ01) |
AUPP095997A0 (en) * | 1997-12-16 | 1998-01-15 | Silverbrook Research Pty Ltd | A data processing method and apparatus (art 68) |
AUPO803697A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ13) |
AUPO804497A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ07) |
US6425651B1 (en) | 1997-07-15 | 2002-07-30 | Silverbrook Research Pty Ltd | High-density inkjet nozzle array for an inkjet printhead |
AUPO804397A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ28) |
AUPO800297A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ20) |
US7465030B2 (en) * | 1997-07-15 | 2008-12-16 | Silverbrook Research Pty Ltd | Nozzle arrangement with a magnetic field generator |
AUPO804997A0 (en) * | 1997-07-15 | 1997-08-07 | Silverbrook Research Pty Ltd | Image creation method and apparatus (IJ12) |
US6471336B2 (en) * | 1997-07-15 | 2002-10-29 | Silverbrook Research Pty Ltd. | Nozzle arrangement that incorporates a reversible actuating mechanism |
US6557977B1 (en) * | 1997-07-15 | 2003-05-06 | Silverbrook Research Pty Ltd | Shape memory alloy ink jet printing mechanism |
US6229565B1 (en) * | 1997-08-15 | 2001-05-08 | Howard H. Bobry | Hand-held electronic camera with integral printer |
US6628333B1 (en) * | 1997-11-12 | 2003-09-30 | International Business Machines Corporation | Digital instant camera having a printer |
US6102505A (en) * | 1997-12-18 | 2000-08-15 | Eastman Kodak Company | Recording audio and electronic images |
US6011923A (en) * | 1998-01-26 | 2000-01-04 | Eastman Kodak Company | Single use camera having flexure of a front cover constrained by an exposed-film door |
US6652074B2 (en) * | 1998-03-25 | 2003-11-25 | Silverbrook Research Pty Ltd | Ink jet nozzle assembly including displaceable ink pusher |
US6011536A (en) | 1998-04-17 | 2000-01-04 | New York University | Method and system for generating an image having a hand-painted appearance |
US6019449A (en) * | 1998-06-05 | 2000-02-01 | Hewlett-Packard Company | Apparatus controlled by data from consumable parts with incorporated memory devices |
US6831755B1 (en) * | 1998-06-26 | 2004-12-14 | Sony Corporation | Printer having image correcting capability |
WO2000023279A1 (en) | 1998-10-16 | 2000-04-27 | Silverbrook Research Pty. Limited | Improvements relating to inkjet printers |
US6805435B2 (en) * | 1998-10-16 | 2004-10-19 | Silverbrook Research Pty Ltd | Printhead assembly with an ink distribution arrangement |
US6398343B2 (en) * | 2000-05-23 | 2002-06-04 | Silverbrook Research Pty Ltd | Residue guard for nozzle groups of an ink jet printhead |
ATE362847T1 (en) | 2000-05-24 | 2007-06-15 | Silverbrook Res Pty Ltd | INKJET PRINT HEAD WITH MOVING NOZZLE AND EXTERNAL ACTUATOR |
-
1997
- 1997-07-15 AU AUPO7991A patent/AUPO799197A0/en not_active Abandoned
-
1998
- 1998-07-10 US US09/112,737 patent/US6331946B1/en not_active Expired - Lifetime
- 1998-07-10 US US09/113,223 patent/US6442525B1/en not_active Expired - Lifetime
-
2000
- 2000-03-02 US US09/516,869 patent/US6374354B1/en not_active Expired - Lifetime
- 2000-03-02 US US09/517,380 patent/US6334190B1/en not_active Expired - Lifetime
-
2002
- 2002-10-15 US US10/269,998 patent/US6827282B2/en not_active Expired - Lifetime
- 2002-11-23 US US10/302,604 patent/US6787051B2/en not_active Expired - Fee Related
-
2004
- 2004-02-19 US US10/780,624 patent/US7454617B2/en not_active Expired - Fee Related
- 2004-07-02 US US10/882,772 patent/US6938990B2/en not_active Expired - Fee Related
- 2004-07-06 US US10/884,886 patent/US20050092849A1/en not_active Abandoned
- 2004-10-13 US US10/962,404 patent/US20050150963A1/en not_active Abandoned
- 2004-10-14 US US10/963,542 patent/US7093762B2/en not_active Expired - Fee Related
- 2004-12-02 US US11/001,144 patent/US7234645B2/en not_active Expired - Fee Related
-
2005
- 2005-01-24 US US11/039,850 patent/US20050127191A1/en not_active Abandoned
- 2005-04-18 US US11/107,792 patent/US7222799B2/en not_active Expired - Fee Related
- 2005-06-06 US US11/144,799 patent/US7416282B2/en not_active Expired - Fee Related
-
2006
- 2006-10-23 US US11/584,619 patent/US7278711B2/en not_active Expired - Fee Related
-
2007
- 2007-02-08 US US11/672,878 patent/US20070126880A1/en not_active Abandoned
- 2007-04-23 US US11/739,071 patent/US7703910B2/en not_active Expired - Fee Related
- 2007-05-03 US US11/744,214 patent/US7373083B2/en not_active Expired - Fee Related
- 2007-05-04 US US11/744,218 patent/US7362971B2/en not_active Expired - Fee Related
- 2007-09-24 US US11/860,420 patent/US7506965B2/en not_active Expired - Fee Related
-
2008
- 2008-03-26 US US12/056,217 patent/US7631966B2/en not_active Expired - Fee Related
- 2008-03-26 US US12/056,228 patent/US7654626B2/en not_active Expired - Fee Related
- 2008-06-22 US US12/143,821 patent/US7773113B2/en not_active Expired - Fee Related
- 2008-07-09 US US12/170,399 patent/US7845764B2/en not_active Expired - Fee Related
-
2009
- 2009-02-10 US US12/368,993 patent/US7866797B2/en not_active Expired - Fee Related
-
2010
- 2010-11-08 US US12/941,793 patent/US7980670B2/en not_active Expired - Fee Related
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3914877A (en) * | 1974-04-08 | 1975-10-28 | Marion E Hines | Image scrambling technique |
US4544184A (en) * | 1983-07-07 | 1985-10-01 | Freund Precision, Inc. | Tamper-proof identification card and identification system |
US5913542A (en) * | 1993-09-17 | 1999-06-22 | Bell Data Software Corporation | System for producing a personal ID card |
US6182901B1 (en) * | 1993-12-22 | 2001-02-06 | Xerox Corporation | Orientational disambiguation for self-clocking glyph codes |
US5825947A (en) * | 1995-09-01 | 1998-10-20 | Olympus Optical Co., Ltd. | Optical reproducing system for multimedia information recorded with code data having function for correcting image reading distortion |
US5874718A (en) * | 1995-10-23 | 1999-02-23 | Olympus Optical Co., Ltd. | Information recording medium |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7093762B2 (en) | Image processing and printing apparatus | |
US7119836B2 (en) | Print roll for use in a camera imaging system | |
US7050143B1 (en) | Camera system with computer language interpreter | |
US6362868B1 (en) | Print media roll and ink replaceable cartridge | |
US8328101B2 (en) | Camera unit incoporating program script scanner | |
US6317192B1 (en) | Utilization of image tiling effects in photographs | |
US8077207B2 (en) | Camera unit incorporating a printer configured to print distorted images | |
US7083108B2 (en) | Redundantly encoded data structure for encoding a surface | |
US7092011B2 (en) | Camera for printing on media provided on print roll | |
US6750901B1 (en) | Digital instant printing camera with image processing capability | |
US6431669B1 (en) | Method and apparatus for information storage in a portable print roll | |
US6542645B1 (en) | Adaptive tracking of dots in optical storage system using ink dots | |
US6356715B1 (en) | Prints remaining indicating for camera with variable length print capability |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SILVERBROOK RESEARCH PTY. LTD., AUSTRALIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SILVERBROOK, KIA;REEL/FRAME:015892/0878 Effective date: 20041006 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |