Method and system for generating characterizing information descriptive of printed material such as address blocks and generating postal indicia or the like incorporating such characterizing information
Abstract
A method and system for generating and printing an indicium, such as a postal indicium, on an object such as a mail piece. A digital image of other printed material, such as an address block, on the object is obtained, and the image is processed to abstract characterizing information descriptive aspects of the other printed material. The characterizing information is combined with other information, such as postal information, and the combined information is then cryptographically authenticated with a digital signature or the like. An indicium representative of the authenticated information is then printed on the object. The object's relationship to the indicium can be verified by regenerating the characterizing information from the other printed material and comparing the regenerated characterizing information with characterizing information recovered from the indicium.

Term
Term ended
Projected expiry passed 17 November 2024, 1.9 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
10 claims: 4 independent, 6 dependent
- 1A method for generating and printing an indicium (I) on an object (E), said object (E) having other material printed thereon, said method comprising the steps of:a) obtaining a digital image of said other printed material and generating characterizing information descriptive of aspects of said image, said aspects being selected from the group consisting of, lengths of elements of said image, numbers of outliers in said image, and shapes of said image or of elements of said image, said characterizing information being selected to fit within said indicium (I);b) cryptographically authenticating said characterizing information and other information;c) generating said indicium to be representative of said cryptographically authenticated information;d) printing said indicium (I) on said object (E);and whereby e) said object's (E) relationship to said indicium (I) can be verified by regenerating said characterizing information from said other printed material and comparing said regenerated characterizing information with characterizing information recovered from said indicium (I), and copies of said indicium (I) cannot easily be used without detection on other objects (E) which do not include said other printed material.
- 2A method as described in Claim 1 where said indicium (I) is a postal indicium and said object (E) is a mail piece.
- 5A method as described in any preceding claim, where said other printed material is an address block (A) and said characterizing information comprises information which is descriptive of the shape of said address block (A), or of lines, or of words comprised in said address block (A).
- 6A secure indicia printing system for generating and printing an indicium (I) on an object, said object (E) having other material printed thereon, comprising:a) a printer (20) for printing said indicium (I);b) a processor (26) for receiving a digital image of said other printed material, and for processing said image to abstract characterizing information descriptive of aspects of said image from said image, said aspects being selected from the group consisting of, lengths of elements of said image, numbers of outliers in said image, and shapes of said image or of elements of said image, said characterizing information being selected to fit within said indicium (I);and c) a meter (16), said meter communicating with said processor (26) to receive said characterizing information, and having a communications link for receiving other information from another information source, and communicating with said printer (20), for;c1) cryptographically authenticating said characterizing information and other information;c2) generating (70) said indicium (I) to be representative of said cryptographically authenticated information;and c3) controlling (72) said printer (20) to print said indicium (I) on said object (E);and wherein d) said object's (E) relationship to said indicium (I) can be verified by regenerating said characterizing information from said other printed material and comparing said regenerated characterizing information with characterizing information recovered from said indicium (I), and copies of said indicium (I) cannot easily be used without detection on other objects which do not include said other printed material.
- 7A system as described in Claim 6 where said indicium (I) is a postal indicium, and said object (E) is a mail piece, said meter (16) accounting for postal value represented by said indicium (I).
- 10A system as described in any one of Claims 6 to 9 where said other printed material is an address block, and said processor abstracts information which is descriptive of the shape of said address block, or of lines, or of words comprised in said address block to generate said characterizing information.
Independent claims10
44 paragraphs, as filed
0001The present application relates to similar subject matter as, and shares elements of disclosure with, commonly assigned EP Patent Application of even date corresponding to U.S. patent application number 10/719,050, entitled "Method and System for Generating Postal Indicia Or The Like" filed on November 21, 2003.
0002The subject invention relates to the problem of providing a robust, compact characterization of a block of printed text which will distinguish the block of text from other such blocks. More particularly, it relates to the problem of providing an image-based characterization of a printed address block which can be incorporated into a digital postal indicium.
0003Postage metering systems account for postage and other values such as parcel delivery service charges and tax stamps, and print indicia representative of such values as proof of payment. To protect against counterfeiting of indicia modern digital postage metering systems use encryption technology. The postage value and other information relating to an indicium are preferably digitally signed, or otherwise cryptographically authenticated, and the information and signature are incorporated into the digital postal indicium.
0004Digital postal indicia using encryption technologies are extremely secure. In general, without knowledge of the proper encryption keys, it is essentially impossible to produce a counterfeit digital indicium. However, digital indicia are subject, as are all postal indicia, to "rubber-stamp" counterfeiting where a valid indicium is scanned and reproduced on multiple mail pieces. To prevent such "rubber-stamp" counterfeiting it is known to incorporate information from the address block of the mail piece into the postal indicium. Because space on an envelope is limited, typically only a small portion of the information in the address block will be incorporated into the indicium.
0005In Figure 1, typical prior art mailing system 10 includes address printer controller 12, address printer 14, postage meter 16, and indicia printer 20. Address printer controller 12 receives address information from a data processing system (not envelope E. Meter 16 receives postage information, and other information, from the data processing system. Meter 16 also receives characterizing information descriptive of block A from address printer controller 12. The information received can be either text-based or image-based. Text-based information is descriptive of the words or characters making up to the address, (e.g., ASCII code) while image-based information is descriptive of the actual printed image in the address block. Meter 16 combines the characterizing information with the postage value and other information, typically digitally signs the combination, generates a bitmap representative of an indicium including the digitally signed combination, and controls indicia printer 20 to print indicium I on envelope E. When the mail piece is received by a postal service, the address block can be scanned again, and the information regenerated from the scanned address block compared to information recovered from indicium I; thus tying indicium I to the particular mail piece. (Note that since the indicium is cryptographically linked to the address on the mail piece, printer 20 need not be a secure printer; but can be a general purpose printer which can be controlled by other devices for other uses.) Commonly assigned, U.S. patent application number 10/456,416 published on July 01, 2004 under publication number 2004/0128254 entitled System And Method For Mail Destination Address Information Encoding Protection And Recovery In Postal Payment", discloses a system similar to that of the Figure 1 using text-based characterizations of the address block.
0006While useful for its intended purpose, system of Figure 1 and similarly systems still have problems. It has proven difficult to reliably recover textual information from address blocks during the validation process using available optical character recognition (OCR) techniques. Attempts to increase the robustness of text-based systems by incorporation of additional information and/or the use of error correcting codes has resulted in undesirable increases in indicia size and computational complexity. Thus, it is an object of the present invention to provide a method and system for providing descriptive information which will substantially uniquely identify a block of text in a robust and compact manner. (By "robust and compact" herein is meant information which is small enough in quantity to be incorporated into postal indicia yet will identify a text block, and distinguish among text blocks, with sufficient reliability to deter "rubber stamp" counterfeiting, despite errors introduced by the printing and/or scanning processes.)
0007The above objective is achieved and the disadvantages of the prior art are overcome in accordance with the subject invention by a method and system for generating and printing an indicium on an object. Other information is printed on the object and the system is controlled in accordance with the method to obtain a digital image of the other printed material and generate characterizing information descriptive of aspects of the image, the aspects being selected from the group consisting of, lengths of elements of the image, numbers of outliers in the image, and shapes of the image or of elements of the image, the characterizing information being selected to fit within the indicium; cryptographically authenticate the characterizing information and other information; generate the indicium to be representative of the cryptographically authenticated information; and print the indicium on the object. Thus, the object's relationship to the indicium can be verified by regenerating the characterizing information from the other printed material and comparing the regenerated characterizing information with characterizing information recovered from the indicium, and copies of said indicium cannot easily be used without detection on other objects which do not include said other printed material.
0008In accordance with one aspect of the subject invention, the indicium is a postal indicium and the object is a mail piece.
0009In accordance with another aspect of the subject invention, the other printed material is an address block and the characterizing information includes measurements of word lengths of words comprised in the address block.
0010In accordance with another aspect of the subject invention the other printed material is an address block and the characterizing information includes a count of outliers in the address block.
0011In accordance with another aspect of the subject invention the other printed material is an address block and the characterizing information includes information which is descriptive of the shape of the address block, or of lines, or of words comprised in the address block.
0012Other objects and advantages of the present invention will be apparent to those skilled in the art from consideration of the detailed description set forth below and the attached drawings.
0013The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
0014Figure 1 shows a schematic block diagram of a prior art mailing system.
0015Figure 2 shows a schematic block diagram of a mailing system in accordance with the subject invention.
0016Figure 3 illustrates a method for abstracting characterizing information descriptive of an address block from an image of the address block in accordance with one embodiment of the subject invention.
0017Figure 4 illustrates a method for abstracting characterizing information descriptive of an address block from an image of the address block in accordance with another embodiment of the subject invention.
0018Figure 5 illustrates a method for abstracting characterizing information descriptive of an address block from an image of the address block in accordance with another embodiment of the subject invention.
0019Figure 6 shows a flow diagram of the operation of a secure postal indicia printing system, shown in Figure 2.
0020In Figure 2, mailing system 22 includes address printer controller 12, address printer 14, Postage meter 16, and indicia printer 20, which are substantially similar to the corresponding prior art elements shown in Figure 1. System 22 differs in that scanner 24 scans address block A and scanned data processor 26 generates the characterizing information provided to meter 16 from the scanned image. (In another embodiment of the subject invention, printer controller 12 communicates the bit map used to drive printer 14 to processor 26 (as shown by dotted line connection 13 in Figure 2). Processor 26 then generates the characterizing information from the bit map in the same manner as from the scanned image. In this embodiment, scanner 24 is used for pre-printed addresses, where a bit map is not available; or can be eliminated. Together meter 16, printer 20, scanner 24 (if present), and processor 26 form secure postal indicia printing system 30. Preferably, scanner 24 scans address A to generate a bit map which is processed by processor 26 to generate the characterizing confirmation, as will be described below; however, any convenient combination of scanning and processing techniques which provides a digital image and from which suitable characterizing information can be generated can be used. Use of a separate processor 26 is preferred since it allows the subject invention to be used with an existing postage meter; however, it will be apparent to those skilled in art that postage meter 16, or controller 12, can be programmed to implement the functions of processor 26. Similarly, a single processor can be programmed to manage both control of scanner 24 and processing of the scanned image.) It is believed that more robust results are obtained when the regenerated characterizing information, generated from a scanned image of address block A is compared to characterizing information recovered from indicium I where the recovered information was also generated from a scanned image, rather than from a pristine bit map; and thus includes the inaccuracies and errors introduced into the image by the printing and scanning processes.
0021A group of three methods for generation of image-based characterizing information, which are believed to provide improved compactness and robustness in accordance with the above object of the invention, have been found. Each of these methods is believed to provide a sufficiently high likelihood of detection to deter "rubber stamp" counterfeiting, particularly by large scale mailers, while having a sufficiently low rate of false positives that it will not unduly delay mail processing. It is believed that each of these methods, in general, will provide characterizing information which can be specified by a bit stream of approximately 6 to 12 bytes.
0022An embodiment of the subject invention where the characterizing information comprises measurements of the lengths of the individual words which make up address A, is shown in Figure 3. Address block A is parsed to identify individual words by first identifying line spaces /s by determining the occurrence of large amounts of horizontal white space between blocks of printed text, and then identifying word spaces ws by determining the occurrence of large amounts of vertical white space between blocks of printed text (as shown with respect the first line of address A). Word lengths /1 through /9 are then determined for address A. Preferably, word lengths are taken (measured in pixels) from the edges of word spaces ws (or the address edges) as shown, but can be taken in any convenient manner, such as along the midline of the words.
0023As noted, the amount of space available in the indicium is limited. Assuming that eight bytes, 64 bits, can be allocated to incorporate the characterizing information, and allowing up to four bits for codes, 60 bits are available to include the characterizing information. (The actual number of bits which can be allocated to express the characterizing information is determined by the size and shape of the postal indicium and the resolution with which the indicium can be printed and scanned.) Table 1 shows the relationship between the number of bits used to encode each word, the number of words which can be encoded, and the granularity (i.e., the number of lengths which can be distinguished) with which the word lengths can be measured. <tables id="tabl0001" num="0001"><table frame="all"><title>Table 1</title><tgroup cols="8" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="19.68mm" /><colspec colnum="2" colname="col2" colwidth="19.68mm" /><colspec colnum="3" colname="col3" colwidth="19.68mm" /><colspec colnum="4" colname="col4" colwidth="19.68mm" /><colspec colnum="5" colname="col5" colwidth="19.68mm" /><colspec colnum="6" colname="col6" colwidth="19.68mm" /><colspec colnum="7" colname="col7" colwidth="19.68mm" /><colspec colnum="8" colname="col8" colwidth="19.68mm" /><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left"><b>Bits/Word</b></entry><entry namest="col2" nameend="col2" align="right">2</entry><entry namest="col3" nameend="col3" align="right">3</entry><entry namest="col4" nameend="col4" align="right">4</entry><entry namest="col5" nameend="col5" align="right">5</entry><entry namest="col6" nameend="col6" align="right">6</entry><entry namest="col7" nameend="col7" align="right">7</entry><entry namest="col8" nameend="col8" align="right">8</entry></row><row><entry namest="col1" nameend="col1" align="left"><b>Number of Encodable Words</b></entry><entry namest="col2" nameend="col2" align="right">30</entry><entry namest="col3" nameend="col3" align="right">20</entry><entry namest="col4" nameend="col4" align="right">15</entry><entry namest="col5" nameend="col5" align="right">12</entry><entry namest="col6" nameend="col6" align="right">10</entry><entry namest="col7" nameend="col7" align="right">8</entry><entry namest="col8" nameend="col8" align="right">7</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left"><b>Granularity</b></entry><entry namest="col2" nameend="col2" align="right">4</entry><entry namest="col3" nameend="col3" align="right">8</entry><entry namest="col4" nameend="col4" align="right">16</entry><entry namest="col5" nameend="col5" align="right">32</entry><entry namest="col6" nameend="col6" align="right">64</entry><entry namest="col7" nameend="col7" align="right">128</entry><entry namest="col8" nameend="col8" align="right">256</entry></row></tbody></tgroup></table></tables>
0024It is believed that using four or fewer bits per word would not be useful in postal applications. Thus, in a preferred embodiment, the number of bits used can be selected to encode all words in the address and two control bits will be sufficient to indicate selection of five to eight bits per word to encode the length of the word. In other embodiments a fixed number of words in the address, for example the first eight, can be scanned at a fixed number of bits per word; eight in this case, since control bits would not be needed to specify the number of bits per word.
Example
0025An address such as shown in Figures 3 - 5 may, depending on the print font selected, etc., produce the following results using six bits per word: <tables id="tabl0002" num="0002"><table frame="all"><tgroup cols="10" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15.75mm" /><colspec colnum="2" colname="col2" colwidth="15.75mm" /><colspec colnum="3" colname="col3" colwidth="15.75mm" /><colspec colnum="4" colname="col4" colwidth="15.75mm" /><colspec colnum="5" colname="col5" colwidth="15.75mm" /><colspec colnum="6" colname="col6" colwidth="15.75mm" /><colspec colnum="7" colname="col7" colwidth="15.75mm" /><colspec colnum="8" colname="col8" colwidth="15.75mm" /><colspec colnum="9" colname="col9" colwidth="15.75mm" /><colspec colnum="10" colname="col10" colwidth="15.75mm" /><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left"><b>Word#</b></entry><entry namest="col2" nameend="col2" align="left">1</entry><entry namest="col3" nameend="col3" align="left">2</entry><entry namest="col4" nameend="col4" align="left">3</entry><entry namest="col5" nameend="col5" align="left">4</entry><entry namest="col6" nameend="col6" align="left">5</entry><entry namest="col7" nameend="col7" align="left">6</entry><entry namest="col8" nameend="col8" align="left">7</entry><entry namest="col9" nameend="col9" align="left">8</entry><entry namest="col10" nameend="col10" align="left">9</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left"><b>Length(pixels)</b></entry><entry namest="col2" nameend="col2" align="left">173</entry><entry namest="col3" nameend="col3" align="left">45</entry><entry namest="col4" nameend="col4" align="left">150</entry><entry namest="col5" nameend="col5" align="left">60</entry><entry namest="col6" nameend="col6" align="left">154</entry><entry namest="col7" nameend="col7" align="left">103</entry><entry namest="col8" nameend="col8" align="left">168</entry><entry namest="col9" nameend="col9" align="left">68</entry><entry namest="col10" nameend="col10" align="left">189</entry></row></tbody></tgroup></table></tables>
0026Preferably the absolute lengths are then normalized to the range 1 - 63, i.e. 2° - (2<sup>6</sup> -1), so that the smallest value (45) is mapped to 1 and the largest (189) is mapped to 63 by the relationship:<maths id="math0001" num=""><math display="block"><mrow><mtext>Normalized length = (63 - 1)/ (189 - 45)*(length in pixels) -18.375 ≈</mtext><mspace linebreak="newline" /><mtext> 0.43*(length in pixels) -18.375, yielding:</mtext></mrow></math><img file="EP1533758A2_D0001.tif" /></maths><tables id="tabl0003" num="0003"><table frame="all"><tgroup cols="10" colsep="1" rowsep="1"><colspec colnum="1" colname="col1" colwidth="15.75mm" /><colspec colnum="2" colname="col2" colwidth="15.75mm" /><colspec colnum="3" colname="col3" colwidth="15.75mm" /><colspec colnum="4" colname="col4" colwidth="15.75mm" /><colspec colnum="5" colname="col5" colwidth="15.75mm" /><colspec colnum="6" colname="col6" colwidth="15.75mm" /><colspec colnum="7" colname="col7" colwidth="15.75mm" /><colspec colnum="8" colname="col8" colwidth="15.75mm" /><colspec colnum="9" colname="col9" colwidth="15.75mm" /><colspec colnum="10" colname="col10" colwidth="15.75mm" /><tbody valign="top"><row><entry namest="col1" nameend="col1" align="left"><b>Word#</b></entry><entry namest="col2" nameend="col2" align="left">1</entry><entry namest="col3" nameend="col3" align="left">2</entry><entry namest="col4" nameend="col4" align="left">3</entry><entry namest="col5" nameend="col5" align="left">4</entry><entry namest="col6" nameend="col6" align="left">5</entry><entry namest="col7" nameend="col7" align="left">6</entry><entry namest="col8" nameend="col8" align="left">7</entry><entry namest="col9" nameend="col9" align="left">8</entry><entry namest="col10" nameend="col10" align="left">9</entry></row><row rowsep="1"><entry namest="col1" nameend="col1" align="left"><b>Length(normalized)</b></entry><entry namest="col2" nameend="col2" align="left">56</entry><entry namest="col3" nameend="col3" align="left">1</entry><entry namest="col4" nameend="col4" align="left">46</entry><entry namest="col5" nameend="col5" align="left">7</entry><entry namest="col6" nameend="col6" align="left">48</entry><entry namest="col7" nameend="col7" align="left">26</entry><entry namest="col8" nameend="col8" align="left">54</entry><entry namest="col9" nameend="col9" align="left">11</entry><entry namest="col10" nameend="col10" align="left">63</entry></row></tbody></tgroup></table></tables>
0027The normalized lengths are then encoded into a bit stream, where code 01 indicates six bits per word: <tables id="tabl0004" num="0004"><img file="EP1533758A2_D0002.tif" /></tables>
0028This bit stream is then incorporated into the indicium to provide a robust and compact characterization of address block A; and, when the indicium is then digitally signed in a conventional manner, will cryptographically link the indicium to the address and associated mail piece. (Note that only bits are included in the actual bit streams of this and other embodiments, and other typographic markings are included only for clarity.)
0029Another embodiment of the subject invention, where the characterizing information comprises measurements of the number of "outliers" in each word (or each line) which make up address A, is shown in Figure 4. (By "outliers" herein is meant ascenders or descenders and portions capitals of which project beyond thresholds, which are preferably determined by the upper and lower bounds of lower case letters without ascenders or descenders, such as "a", "c", "e", etc.) Address A is parsed to identify individual words, if necessary, by first identifying line spaces Is by determining the occurrence of large amounts of horizontal white space between blocks of printed text, and then identifying word spaces ws by determining the occurrence of large amounts of vertical white space between blocks of printed text (as shown with respect the first line of address A). Otherwise only the lines need be identified.
0030Again assuming six bits are allocated per word, the number of upwards (+) and downwards (-) outliers per word can be encoded as "xxx/yyy" where x and y are binary digits and xxx is the number of (+) outliers and yyy is the number of (-) outliers.
0031Whether outliers are recorded per word or per line can be a predetermined design feature, or pre-set for particular applications or can be program controlled. For example, normally an address block would be characterized by the number of outliers per word but long addresses could be characterized per line. Example
0032Again taking eight bytes as the space allocated for the address block characterizing information, as shown in Figure 4 with respect to the first address line, (+) outliers 32, in word 1; 34, in word 2; and 36, in word 3 are identified as exceeding threshold 40, and outlier 42, in word 1, is identified as exceeding threshold 44. Since for address block A all of the outliers can be encoded in less than 60 bits, the resulting bit stream is: <tables id="tabl0005" num="0005"><img file="EP1533758A2_D0003.tif" /></tables> where code 1 indicates per word characterization and 111 is an end code. (The 111 end code, of course, implies that no more than six (+) outliers can be recognized in any word, i.e., 110 means 6 or more.) If less space for characterizing information were available in the indicium, the program could recognize that there was insufficient room on a per word basis, and the characterizing information could be encoded as "xxxx/yyyy" on a per line basis. The resulting bit stream would be: <tables id="tabl0006" num="0006"><img file="EP1533758A2_D0004.tif" /></tables> requiring only 29 bits, allowing a seven line address to be characterized in eight bytes. This bit stream is then incorporated into the indicium as described above.
0033Another embodiment of the subject invention where the characterizing information comprises a description of the shape of the address block is shown in Figure 5. The shape is determined by using a conventional "best fit" scanning algorithm which encloses address block A with "best fit" closed curve 50. (It should be understood that various algorithms for generating a best fit curve will generate different curves. These differences do not affect the subject invention so long as the same algorithm is used to generate the curve whose description is incorporated into the indicium and to recover the curve from the address block when the indicium is validated.) Preferably, curve 50 is constrained. A curve can be generated with limited information so that the resulting curve is simplified. In Figure 5, curve 50 is formed from linked straight line segments, such as segment 51, which are limited to eight "directions", up (U), down (D), left (L), right I, up-right (UR), up-left (UL), down-right (DR), and down-left (DL); viewed as being generated starting in the upper left corner of address block A and traveling clockwise around address block A. Preferably the curve 50 also accounts for spaces between characters, words and lines, treating these spaces as equivalent to printed space, so that curve 50 does not become too convoluted and require extensive descriptive information. It is within the skill of a person skilled in the art to provide an algorithm which will generate robust and compact characterizing information, as described above.
0034The characterizing information, i.e., the description of curve 50, can be encoded in a number of ways. For example, each line segment can be described as a direction and length, preferably in pixels. Lengths can be normalized as described above with respect to Figure 3. Alternatively, end points of line segments, such as end points 52 and 54 of segment 51, expressed in Cartesian co-ordinates or any convenient co-ordinate system, which is preferably scaled and referenced to address block A to reduce the amount of descriptive information needed, can be used to describe curve 50. The description of course is ultimately sent to meter 16 as a bit stream.
0035These methods of encoding have the advantage that they do not require an end code. Processor 26 needs only to detect closure of curve 50. However, these methods can require relatively large amounts of data if curve 50 is complex. Another method of describing curve 50 is to encode only the directions, without lengths, of each successive line segment.
Example
0036Encoding line segment directions as: R = 000, L = 111, U = 001, D = 110, UR = 010, DL = 101, DR = 011, UL = 100; and starting at the upper left of address block A, curve 50 is described by the bit stream: <tables id="tabl0007" num="0007"><img file="EP1533758A2_D0005.tif" /></tables><tables id="tabl0008" num="0008"><img file="EP1533758A2_D0006.tif" /></tables>
0037Thus, curve 50 can be described in nine bytes, including an end code, which can be indicated by reversal (or repetition) of the immediately preceding segment direction. Again, this bit stream is incorporated into the indicium.
0038In other embodiments, the shape of only a portion of address block such as a word or line is described, or only a limited number of line segments are described, which will reduce the amount of data generated. Where only a limited number of segments are described, they can be selected by processor 26 to represent more complex parts of the curve.
0039Programming of a data processor to analyze scan data to perform imaging operations such as identifying lines and words, measuring the dimensions of letters and words or fitting a curve to an image in accordance with predetermined constraints are well known. Such operations are substantially routine in the character and general pattern recognition arts, for example. Techniques for carrying out such operations are also taught in <u>Handbook of Pattern Recognition and Image Processing</u>, edited by T Young and K-S Fu, Academic Press, 1986. Thus programming of scanner 24 and processor 26 to carry out the embodiments described above is well within the ability of those skilled in the art and need not be discussed further here for an understanding of the subject invention.
0040Figure 6 shows a flow diagram of the operation of indicia printing system 30. At step 60, processor 26 obtains a digital image of address block A, either from scanner 24 or from printer controller 12. At step 62, processor 26 abstracts characterizing information descriptive of address block A from the image.
0041At step 66, postage meter 16 inputs postal information such as the postage amount, date, etc., from a data processing system (not shown) or other source, and combines it with the characterizing information and digitally signs the combination. Then, at step 70, meter 16 generates indicium I representative of the combined information and digital signature, preferably as a combination of human-readable text and machine-readable binary code such as 2-dimensional bar code. At step 72, meter 16 controls printer 20 to print indicium I on mail piece E in a conventional manner.
0042The embodiments described above and illustrated in the attached drawings have been given by way of example and illustration only. From the teachings of the present application those skilled in the art will readily recognize numerous other embodiments in accordance with the present invention. Accordingly, limitations on the present invention are to be found only in the claims set forth below.
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| EP1796050A1 | Cited by | European Patent Office (EPO) | Search report |
| US7747544B2 | Cited by | United States of America | Applicant |
| EP1022692A2 | Cites | European Patent Office (EPO) | Search report |
| EP1033686A2 | Cites | European Patent Office (EPO) | Search report |
| US6108643A | Cites | United States of America | Search report |
| US6157919A | Cites | United States of America | Search report |
4 members in 2 offices
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 719061 | United States of America | – | |
| 71906103 | United States of America | A |
Members4
| Document | Office | Kind | |
|---|---|---|---|
| EP1533758A2This record | European Patent Office (EPO) | A2 | |
| EP1533758A3 | European Patent Office (EPO) | A3 | |
| EP1533758B1 | European Patent Office (EPO) | B1 | |
| DE602004028206D1 | Germany | D1 |
30 legal events, as 4 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Notification of lapseLapsedST | ST | FR | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Corresponds to:REF | REF | EP | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Designation fees paidAKX | AKX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1533758
- Application
- 40273138
Titles3
- German
- Verfahren und System zur Erzeugung von Daten zur Charakteriesierung eines Bedruckten Materials wie Adressblöcke und zur Erzeugung diese Daten enthaltendende Postwertzeichen oder dergleichen
- English
- Method and system for generating characterizing information descriptive of printed material such as address blocks and generating postal indicia or the like incorporating such characterizing information
- French
- Méthode et système pour générer une information caractéristique décrivant des données imprimées telles que des blocs d'adresses et pour générer des indices postaux ou similaires comprenant cette information caractéristique
Classification
- IPC, 1
- G07B17 00
Designated states35
- Contracting states, 29
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Luxembourg
- Monaco
- Netherlands (Kingdom of the)
- Poland
- Portugal
and 5 moreShow fewer
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
- Extension states, 6
- Albania
- Croatia
- Lithuania
- Latvia
- North Macedonia
- Yugoslavia, later Serbia and Montenegro (until 2006)