Method for facsimile transmission and compression

Abstract: A method of facsimile transmission which utilizes pattern matching, whereby the appearance of the transmitted facsimile and the compression performance are enhanced. The appearance of the respective prototype symbols is enhanced by using the average of images that match the same pattern as the prototype. Compression performance is enhanced by incorporating white space parameters into prototypes thereby eliminating the need to send positional identification when each character ID is sent.

Description: This invention relates to facsimile transmission and compression. More particularly, it relates to a method for improving the appearance of a transmitted facsimile and for reducing the amount of data transmitted for the creation of the facsimile. Brickman et al, in U.S. Patent US-A-4,499,499, describe a pattern matching system where documents are transmitted as OCR (Optical Character Recognition) scanned symbols. The transmitting system and the receiving system therein both maintain identical libraries of prototypes. Each prototype is given an identification code and is transmitted only once, upon its initial recognition. Transmission reduction is achieved because subsequent repetitive symbols are transmitted by sending their identification codes only. Pratt et al, in "Combined System Matching Facsimile Data Compression System," Proceedings of the IEEE, Vol. 68, No. 7, July 1980, also take advantage of symbol repetitions in document to achieve facsimile compression and transmission reduction. The system compares each input symbol with entries of a prototype library. If a match is indicated, a corresponding library ID and the horizontal location with respect to the previous symbol are coded. Otherwise, the binary pattern of the symbol is transmitted, in addition to being placed in the library as a new prototype element. Casey et al, in U.S. Patent US-A-4,499,596, compare input PEL patterns with library prototypes. Upon match, an index number is generated. Upon mismatch, the pattern will be registered as a new prototype in the library. In these prior pattern matching facsimile systems, each prototype is sent immediately upon first recognition. Noise due to poorly printed documents could result in poorly chosen prototypes and thereby cause poor image quality in the received document. Moreover, because inter-character spaces are not determined in these prior systems, each identification code must therefore be accompanied by an address that indicates the symbol's relative position in the document. A significant reduction in data transmission will result if the need to transmit this one address for each and every symbol is eliminated. The present invention relates to a method for facilitating the transmission as well as improving the appearance of a facsimile. The invention is disclosed in the attached patent claims. Transmission reduction is accomplished by determining the amount of white space at opposite sides of each prototype. The amount of white space is sent to the receiving system together with the prototype as one of its parameters. When repetitive symbols of the prototype are subsequently encountered, only the identification code is sent. The prototype is retrieved as a pseudo font character having the white space imbedded therein. As inter-character spaces have already been determined for the pseudo fonts, only the address of a first symbol in a page of the document needs to be sent. Subsequent symbols may be positioned next to each other without the need for more addresses. Appearance of the transmitted facsimile is improved by taking advantage of the redundancy which exists in the repetitions of symbols in the document to be transmitted. The transmitting system takes the average of all input symbols which match the same pattern and transmits the average as the prototype for those symbols. As a result, the quality of a transmitted facsimile is enhanced. A theoretical description of the invention and a description of a preferred embodiment will be given below, with reference to the drawing, in which Fig. 1 illustrates a portion of a line of a document to be transmitted; Fig. 2 illustrates a logical block diagram of the system configuration embodying the present invention; Fig. 3a shows ten characters from a scanned document that belong to the same prototype; Fig. 3b shows an average of the ten characters in Fig. 3a; Fig. 4 is a segment of the APL source code for determining the mean center-to-center distances between class i and class j symbols; Fig. 5 is a segment of the APL source code of determining the white spaces b i and f i of class i symbols; Fig. 6 is the APL routine called by the procedure in Fig. 5 for iteratively determining b i and f i ; and Fig. 7 is a matrix of average edge-to-edge distances between different classes of symbols. Fig. 1 illustrates a text line of a document which is optically scanned for digital facsimile transmission. A matrix representation of the line is obtained and the locations of individual character patterns are determined. Symbol i (the character "v") is followed by symbol j (the character "a") which in turn is followed by symbol k (the character "r"). The space parameters of a symbol are characterized by its width W, its front white space f and its back white space b. Symbols i and j are separated by a white space s ij which is equal to b i + f j dot columns. Symbols j and k are separated by s jk which has b j + f k dot columns. W j , s ij and s jk of symbol j can be directly measured on the digital image. The front white space f j and the back white space b j of the symbol are, however, not directly measurable and can only be derived from s ij and s jk . In pattern matching terminology, "class i" is defined as the ensemble of symbol patterns that match the ith prototype. Parameter W i can be estimated as the mean value of the widths observed for members of class i. In order to estimate b i and f j , the inter-character spaces are first measured for the entire document. Let s ij be the average white space between patterns of class i and class j. Estimates of b i and f j can be obtained by minimizing the squared sum of differences SD of equation where The minimization is performed by differentiating equation (1) with respect to b i and f j and equating the result to zero. This yields 2N equations: where If every class pair is present, i.e., if δ ij = 1 for all i,j then the equations to be solved are: with solutions b i = Ri N - σ b (4) f j = Cj N - σ j (5) where σ b, σ f are arbitrary constants satisfying These constants should be chosen such that all the spacing parameters are non-negative. If not all class pairs occur in the document, the general case can be solved by first obtaining initial estimates of b i , f i using These values are then used to estimate the missing S ij, i.e., otherwise. This provides a complete set of s ij . Equations 4, 5 and 6 can be used to obtain new estimates of b i , f i . Iterating on this procedure, at the kth loop, can be computed. The process is iterated until convergence. Variations in character width affect the observed values of s ij ; e.g., a faded character will contribute extra white space. A more accurate estimate can be obtained by measuring the average center-to-center distances c ij between characters of classes i and j rather than the blank space s ij . The procedure above may then be used to minimize the equation The minimization proceeds exactly as before, except that Fig. 2 illustrates a configuration having a transmitting system 1 and a receiving system 2. The transmitting system 1 consists of a commercially available scanner 3 such as the IBM model 8815. Scanner 3 scans the document to be transmitted and produces data output which is saved in buffer 4. Buffer 4, which is an IBM PC in this implementation, also functions as a terminal to the Central Processing Unit (CPU) 5. CPU 5 can be an IBM System/370 CPU running under an APL interpreter defined by the APL Language Processor, Release No. 3 published in the IBM Manual No. G6 26-3847, 5th Edition, in 1978. System/370 architecture is described in Amdahl et al, U.S. Patent No. 3,226,689, and in the publication "IBM Systems/370 Principles of Operation," form A22-7000-4. Although a reduction to practice has used APL source code running under an IBM System/370 computer, other programming languages and computing apparatus can also be implemented to perform equivalent functions without undue experimentation. The receiving system 2 consists of a receiving CPU 6 which can also be an IBM System/370 computer. Receiving CPU 6 is connected to a printer flexible page printer (often called laser printer) 7 such as the IBM page printer model 3812 which allows fonts to be downloaded from its host computer. Since methods for identifying symbols using optical character recognition devices are widely known, the method of this invention will be understood more clearly by starting the description at the point where symbols have already been scanned and identified. (a) Noise Reduction by Averaging The document to be transmitted is scanned by the OCR scanner 3. Each scanned symbol received by the transmitting CPU 5 is registered as a pxq bit array in which a "1" bit represents a black PEL while a "0" denotes a white PEL. The transmitting CPU matches each bit array to a pattern and assigns thereto an identification code (ID) depending on the matched pattern. The bit array and the ID of the symbol are then stored in the memory. When the end of the document is reached, the transmitting CPU retrieves the stored bit arrays and their respective ID's. It then averages the bit arrays in a manner similar to that described by the pseudo code of Table 1. Fig. 3a shows ten symbols which match the same pattern. Fig. 3b shows the average of these ten symbols. The average of Fig. 3b is derived by summing the ten arrays and thresholding at a value = 5. The result of the averaging, A(i,j), of all bit arrays belonging to a pattern is then used as a prototype for that pattern. It is sent to the receiving system where it is used to build a font. During the recreation of the document, the font is used when a corresponding symbol is to be printed. (b) Determining White Space Parameters The center-to-center distances c ij between symbols of class i and class j are measured. The average of c ij is then calculated in a procedure similar to the procedure listed in Table 1. The width w i of the enhanced prototype i and the width w j of the enhanced prototype j are determined after the averaging of section (a) has been performed. Subtracting half of w i and half of w j from the average of c ij gives the average edge-to-edge distance s ij between symbols of classes i and j. Fig. 4 shows a listing of the APL source code for determining the average edge-to-edge distances s ij between symbols of classes i and j. Although edge-to-edge distances are used in this implementation, the method of this invention for calculating white spaces can be practiced without undue experimentation using other distances between prespecified points of symbols. After all existing edge-to-edge distances s ij have been determined, they are put into a matrix of the form illustrated in Fig. 7. Each row x of the matrix in Fig. 4 contains the average distances s xk , 1≦k≦N, of all class sequences (x,k) having symbols of class x as immediately preceding symbols. Each column y of the matrix contains the average distances s ky , 1≦k≦N, of all class sequences (k,y) having symbols of class y as immediately succeeding symbols. Not every class sequence is present in the document. Thus, there are some missing entries in the matrix. Equations (4) and (5), however, can only be used when all class sequences are present; therefore the missing s ij entries must be determined. Fig. 5 shows a listing of a segment of the APL source code for finding estimates of the missing s ij . In line 14, the sum of all existing entries of each row is calculated (as R in the APL source code). R i is the average white space between two symbols having class i as a succeeding symbol. Similarly, the sum of all existing entries of each column is calculated (as C in the APL source code). C i is the average white space between two symbols having class i as the preceding symbols. The constant is calculated in lines 19-21 (represented in the code as Q). In line 23, a row matrix F is obtained. Each ith element of F is the average value of the distances s ki , 1≦k≦N, of sequences (k,i) having symbols of class i as immediately succeeding symbols. MINF of line 23 contains the smallest element of matrix F. FF is a row matrix formed by subtracting each element of F by MINF. Each i th element of the matrix FF is an estimated value of a corresponding f i . In line 25, a column matrix B is obtained . Each ith element of B is the average value of the distances S ik , 1≦k≦N, of sequence (i,k) having symbols of class i as immediately preceding symbols. BB is a column matrix obtained by subtracting each element of B by the value (Q-MINF). Each i th element of the matrix BB is an estimated value of a corresponding b i . In line 27, a NxN matrix is formed by combining BB and FF using the outer product function of APL. A corresponding term in this new matrix is applied to each missing entry of the original matrix, thereby forming a new complete matrix SS of average distance of all s ij 's. Fig. 6 shows a listing of APL source code used in conjunction with lines 32 to 39 of the APL code of Table 3. The code in Table 4 iteratively revises the matrix SS, BB and FF, thereby obtaining better values of b i and f i

Claims: A method of transmitting a facsimile of a document from a transmitting processor (5) to a receiving processor (6), each such processor having a library of symbol prototypes, each prototype being identified by an identification code; the method comprising the creation of a library of symbol prototypes, and scanning the document and sending the corresponding identification code of a prototype which matches the scanned symbol; and characterised by the step of : during the creation of the library, determining, on the basis of data (Sij, Wj, Cij) obtained from the representation of the scanned symbols, the amount of white space (bi, fi) at opposite sides, in the direction of scan, of each symbol prototype, and designating for each prototype a parameter comprising a respective code representing the amount of white space (bi, fi) so determined. A method as claimed in claim 1, including the further step of: as each symbol is scanned from the document, representing such symbol as a p x q array in which one binary state represents a black pel and the opposite state represents a white pel, the array constituting the prototype for that symbol; matching each subsequent bit array corresponding to a particular previously scanned symbol to the prototype representing that respective symbol; averaging the bit arrays corresponding to each particular scanned symbol to create an enhanced prototype for that particular symbol; and creating a library of enhanced prototypes as a font comprising said symbols. A method as claimed in claim 2 including the step, following completion of scanning of the document, of transmitting to the receiving processor the enhanced prototypes of each scanned symbol for recreating the document. A method as claimed in any preceding claim wherein the determining step includes: measuring the centre-to-centre (cij) distances between adjacent Pairs of symbols scanned from the document; calculating the average of the measured distances for each combination of adjacent symbol pairs so scanned; measuring the width (wi, wj) of each symbol of each such adjacent pair; and deriving the average edge-to-edge distance between the symbols of each such adjacent pair by subtracting half the width of each such symbol of the adjacent pair from the average of the measured distances, said amount of white space being determined on the basis of the average edge-to-edge distances thus obtained. A method as claimed in claim 4, including the further step of: deriving from said measured centre-to-centre distances and widths of symbols of adjacent symbol pairs present in the scanned document the edge-to-edge distances for all combinations of adjacent symbol pairs not present in the scanned document.

Inventors: CASEY RICHARD GEORGE, KING JAMES CORNELIUS, CASEY, RICHARD GEORGE, KING, JAMES CORNELIUS
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1987
Main classification: H04N1
IPC codes: G06T9, H04N1