BINARY CODING CIRCUIT FOR OCR

Abstract: This invention provides a binary coding circuit particularly suited for use in an optical character reader which "reads" characters or symbols using a photoelectric conversion cell. A delay circuit has one input for receiving an output of the photoelectric conversion cell, and at least three separate and distinct delayed outputs providing respective delays that are different from each other. A threshold determining circuit is arranged so that when one of the delayed outputs is selected to be a binary-coding target signal, the threshold determining circuit receives as its inputs a plurality of ones of the delayed outputs including one delayed output having larger delay time than that of the binary-coding target signal and one delayed output having smaller delay time than that of the binary-coding target signal, so as to produce a threshold signal. A comparator circuit receives at a first input thereof the binary-coding target signal and receives at a second input thereof the threshold signal. It compares the binary-coding target signal with the threshold signal to thereby produce a binary signal.

Description: The present invention relates to a binary coding circuit as indicated in the precharacterizing part of claim 1. In such a prior art binary-coding circuit (INGENIEUR. vol. 82, no. 43, 23 October 1970, DEN HAAG NL, pages 130-136; Ir. P. Fontijne: "Principes van IBM-machines voor optische tekenherkenning"), the threshold determining circuit comprises two transistors performing a logical OR operation for generating a first and a second threshold signal. Furthermore, an additional transistor is provided for generating a noise threshold potential which increases reference potential by an offset value. A further transistor is provided for generating the binary coding target signal at a middle tap of the delay circuit comprising a series of inductors and capacitors between the input and output. At the input and output of the delay circuit, resistors are provided having the input and output taps respectively in order to attentuate the signals at the input and output of the delay circuit to half the amplitude of the signal at the middle tap. The delay between input and middle tap, as well as between middle tap and output, is half the time which the document to be read travels the distance of the nominal line-width of the characters. The third transistor for generating the offset level in accordance with white level and small noise disturbs the waveforms of the first and second threshold signals. Therefore, when the peak of the waveform of the binary-coding target signal becomes small, for example near white level, it is difficult to achieve accurate binary coding since the offset value can surpress or "cover" these small peaks. The term "character" as used herein includes any kind of character or symbol. Thus, the term includes, but is not limited to alpha-numeric characters, symbols, Japanese "kana", etc. The term "symbol" includes but is not limited to bar codes, etc. Characters are often printed black on white paper. The characters can be discriminated from blank space by discerning a difference between white and black. However, the paper which forms the background of the characters is not always white. This makes it more difficult to discern between the character and background. The area where characters are printed is hereinafter referred to as a "character area". In contrast, the blank space, where no character is printer is referred to as a "background area". The term "optical character reader" (OCR) is used in a broad sense to include various types of apparatus for optically reading characters imprinted on a surface. In a typical OCR, the surface to be read is illuminated with light. A lens system images light reflected from the surface onto a matrix of photoelectric conversion cells. These cells provide output signals that are responsive to the intensity of light on the cells. Output signals of the cells are converted by a binary coding circuit into binary signals indicating a character areas and a background areas. Characters are discriminated on the basis of the binary signal. Light incident on the photoelectric conversion cells varies in accordance with the imprinted characters. Because the characters are black and the background is white, the level of incident light varies corresponding to the existence of characters. There are operational difficulties with OCRs. Characters written on the paper may not always be imprinted evenly on a page being read. The output of a photoelectric conversion cell scanning the paper does not always take one of two values corresponding to black or white. Rather, it may vary continuously and irregularly. Even if the characters are printed using type, a character may not be formed exactly the same each time. Also, characters vary from one another in shape and size, number of strokes, etc. The output of a photoelectric conversion cell may vary widely in an analog manner. Its output may change both spatially and temporally. The output does not simply take either one of a maximum value and a minimum value. Rather, the output continuously varies between the maximum and minimum values. A simple binary coding method for converting such an analog concentration signal into a binary signal is to compare it with a fixed threshold level. However, this binary coding method has a disadvantage in that the character area is often mistaken or misjudged for background area. Characters are often at least partially missed. The simple binary coding method has a further disadvantage in that the background area is often mistaken for character area. The characters may be defaced or obscured by stains between character lines, etc. If character recognition is made on the basis of the binary-coded data in the manner as described above, many errors result. The term "threshold level" as used herein refers to a value that is compared with the amplitude of a signal. As the result of comparison, an output signal of "0" or "1" is generated. The "0" or "1" constitutes a binary code. If the threshold level is fixed, the aforementioned problems exist. Accordingly, a fixed threshold level can not be used unless the characters are extremely simple. Japanese Patent Publication No. 37952/1985 discloses a technique in which four different thresholds are used to binary code the output of a photoelectric conversion cell. Of the four thresholds, one which may provide an optimum result of binary coding is selected. The procedure of determining the optimum threshold will now be described. The characters have line widths that vary from character to character. The line width of a character printed in Gothic type is large in comparison with the same character printed in a different "font". Even for characters printed with the same font, the line width of characters may vary from character to character depending on calligraphic style. Further, some lines of a particular character may be thicker than other lines of the same character. For example, vertical lines of a certain character may be thicker than horizontal lines of the same character, or vice versa. The width of one line in a character may vary from one end of the line to the other. According to the Japanese Patent Publication No. 37952/1985, an optimum threshold is selected on the basis of the change of the line width. A large number of arithmetic operations are required to do this. It can be said that an average line width of characters printed using a certain type font is generally within a predetermined range. The following equation applies and line width can be computed. In the equation, the term "number of black points" means the number of black meshes (picture elements) in the whole picture scene. The term "number of surrounding points" means the number of black picture elements on the boundary of white and black areas. Assume that, for example, a character is simply constituted by a horizontal bar "-" which includes black picture elements of r and q in number arranged in rows and columns respectively ( q » r). The number of black points is r x q, and the number of surrounding points is (2q + 2r - 2). The real line width of the character is r . Accordingly, the line width W as defined by the above equation is approximately r/2. It may be said that the line width W is defined as the half width of the real character line. The average line width of characters printed in a certain type font can be obtained by repeating such arithmetic operations on all characters. Assume that W is known to be 1.5 with respect to a certain group of characters belonging to a certain dictionary pattern. Assume that a typescript is made up of the group of characters contained in the dictionary pattern. The typescript is optically read and the resulting signal is binary coded by comparing it with four separate and distinct threshold levels U₁, U₂, U₃ and U₄. Four binary patterns can be thus obtained to thereby determine black-and-white picture elements. With respect to the four patterns, the number of black points and the number of surrounding points are counted to thereby calculate the line width. If the threshold level is too low, the number of black points is excessively increased so that the line becomes thick, that is, the line width becomes large. If the threshold level is too high, the number of white points is excessively increased so that the line becomes thin, that is, the line width becomes small. Thus, four values of line width, W₁, W₂, W₃, and W₄, can be calculated. Because the average line width W of the characters contained in the dictionary pattern is predetermined, an optimum one that approaches W is selected from the four values of line width, W₁, W₂, W₃ and W₄. Accordingly, one binary pattern is selected from the four binary-coding patterns on the basis of the thus selected optimum line width. According to the Japanese Patent Publication No. 37952/1985, binary coding is performed by use of four threshold levels to thereby calculate values of line width. The calculated values of line width are compared with a predetermined value of line width to thereby select an optimum one of the calculated values of line width which is the most approximate to the predetermined one. This method lacks reliability and a large number of arithmetical operations are required. Because it is necessary to calculate four binary patterns, it is necessary to have a picture memory with a capacity that is four times larger than would otherwise be necessary. If binary-coding processing is performed to obtain the four binary patterns simultaneously, the number of comparator circuits and the like must be multiplied by four. If the binary-coding processing is performed sequentially, the time required to process is four times that which would otherwise be required. The number of black points and the number of surrounding points should be counted according to every pattern. The time required for counting the number of surrounding points is long, because the boundary of white and black must be detected. Furthermore, the line width in the dictionary pattern should be predetermined. There is one of the most difficult aspects of this technique. It is necessary to apply it to various kinds of characters. That is, the range of use is limited to specific kinds of characters. Any character should be read even if the character has any line width. A further disadvantage occurs with the four threshold arrangement. Although four thresholds U₁ - U₄ are used, those thresholds are used in the alternative. Once a threshold is selected, it is used for the whole picture. The local characteristics of the picture are not considered. If the character is so complex that wo peaks are near to each other, the output between the peaks is not zero. Rather, the output is "drawn up" by the two peaks. It is difficult to discriminate the intermediate output from the peaks. Accordingly, the space between two lines becomes "smeared". To detect the space between lines, it is necessary to identify a small level difference between the intermediate value and each peak value. This is however impossible as long as a single threshold level is used throughout the entire picture. The use of a locally variable threshold level would make it possible to detect local characteristics. As discussed above, the binary coding circuit according to the Japanese Patent Publication No. 37952/1985 has the disadvantages of large circuit scale and high cost. Also, real time processing and use for all types of characters are impossible. Therefore, it is the object of the invention to provide a binary coding circuit which is simple in construction, yet capable of determining an optimum threshold level. This object is solved by the features as indicated in claim 1. The output of the photoelectric conversion cell is proportional to the intensity of light impinging thereon. Thus, the cell output becomes large for a black picture element and becomes small for a white one. It is sufficient that portions corresponding to peaks of the output can be detected. The term "peak" includes large peaks, small peaks, wide peaks, and narrow peaks. It is considered that large and wide peaks correspond to bold-faced characters and that small and narrow peaks correspond to light-faced characters. Let the output of the photoelectric conversion cell be represented by " I ". The output varies as a temporal function Ψ (t). If the function takes a peak at t = t₀, the following inequalities should hold for t = t₀: Ψ (t₀)> Ψ (t₀ -τ) (1) Ψ (t₀)> Ψ (t₀ +τ') (2) In the inequalities, each of τ and τ′ represents a short positive amount of time. The fact that Ψ (t) takes a peak at t = t₀ means that Ψ (t₀) is larger than the values immediately preceding and succeeding the value at t = t₀. Accordingly, the inequalities (1) and (2) are established. Each of τ and τ′ can take an arbitrary value but is provided to determine a short interval of time. If τ and τ′ are fixed, the inequalities can be used as simple comparison inequalities. In this case, the necessary and sufficient condition that each of τ and τ′ can take an arbitrary value is removed. Accordingly, in the case where the function varies widely, there is the possibility that the function may have a peak value if the inequalities (1) and (2) are satisfied on the basis of fixed τ and τ′. However, the peak can be almost perfectly detected from the inequalities (1) and (2) as long as τ and τ′ are selected adequately. Ψ (t-τ) represents a delayed signal, and Ψ (t+τ′) represents an advanced signal. The following function (3) is now assumed with τ and τ′ as parameters. Φ (t) = Ψ (t) - max { Ψ (t-τ), Ψ (t+τ)} (3) In the function (3), the term "max { }" means selecting the largest one of the signals represented by what is enclosed within the braces. If the value of Φ (t) is positive for arbitrary short time τ and τ′, the function should be at a peak value. The inequality (3) is equivalent to the two inequalities (1) and (2). That is, the inequality (3) is equivalent to the combination of inequalities (1) and (2). Assuming that τ and τ' are fixed values, Φ (t) does not always take a peak value even if it is a positive value. However, the peak value can be almost perfectly detected when Φ (t) is positive, as long as τ and τ' are selected adequately. Accordingly, it is possible to detect the peak value if three temporally different signals consisting of an original signal I (t) and two signals produced by delaying the original signal for two kinds of time are compared according to the inequality (3). It is impossible to compare the original signal I (t) with the maximum value of the delayed signal and advanced signal, because the advanced signal is not in existence. Accordingly, assume now that a certain signal is delayed for three or two kinds of time by shifting the time axis. Of the thus produced signals, one signal having intermediate delay time can be compared with another signal having delay time less than the intermediate delay time. On the assumption,the following inequality (4) equivalent to the expression (3) can be obtained. Φ (t-t₁) = Ψ (t-t₁)-max{ Ψ (t), Ψ (t-t₁-t₂)} (4) If t-t₁, t₁ and t₂ are respectively replaced by t, τ' and τ, this inequality is quite equal to the inequality (3). BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a block diagram of a binary coding circuit according to the present invention. Figure 2 is a block diagram of the binary coding circuit for use when the input analog signal has the waveform which is upwards convex. Figures 3(a) and 3(b) show waveforms in various parts of the binary coding circuit of Figure 2. Figure 4 is a block diagram of the binary coding circuit for use when the input analog signal has the waveform which is downward convex. Figure 5 is a diagram showing waveforms at various parts of the circuit of Figure 4. Figure 6 is a circuit diagram of a binary coding circuit according to one embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Figure 1 is a block diagram of a binary coding circuit according to the present invention. The output A of a photoelectric conversion cell is generated unit by unit corresponding to picture elements. The cell output is a function of light intensity. The relationship of cell signal output to light intensity can be of either sense as a matter of design choice. For example, the output may be high for a white picture element is selected and low for a black picture element, or the output may be high for a black picture element and low for a white one. In any case, the output can be arbitrarily oriented by using inverter circuitry. We assume henceforth that the photoelectric conversion cell output is high when a character, i.e., a black picture element is being "viewed". A delay circuit 1 generates at least three delayed signals Q₁,...Q m ,...Q n . One signal Q m adequate for binary coding is selected from among those delayed signals. Delayed signals other than the signal Q m , which are (n-1) in number, are linearly coupled or the maximum is selected from the delayed signals, so that a threshold H is determined. This function is carried out by a threshold determining circuit 2. As one possible example, presume that the threshold is determined by the maximum. H = max { Q₁, Q₂, ....Q n } (5) If the amplification factor of Q m is larger than 1, the equation (5) should contain Q m . Alternatively, the threshold can be determined by linear coupling. In the equation (6), the linear coupling coefficient is adequately predetermined, and n is not less than 3, that is, n ≧ 3. Although Q m is a signal to be binary-coded, the signal may be amplified by an amplifier circuit 3 if the signal from the delay circuit 1 is low in amplitude and high in impedance. Amplification may be omitted if not necessary. Threshold H is determined by threshold determining circuit 2. The threshold is locally determined so as to be changed temporally. This threshold is quite different from the conventionally fixed threshold. This threshold is also different from the threshold common to the whole picture, as disclosed in Japanese Patent Publication No. 37952/1985. The threshold according to the present invention is a locally variable threshold level which is individually produced from each local signal delayed or effectively advanced. A most simple case is as follows: Three delayed signals Q₁, Q₂ and Q₃ are produced. Assume that Q₂ is a signal to be binary-coded, and the threshold H is determined from the equation (7) on the basis of the two signals Q₁ and Q₃. H = max { Q₁, Q₃ } (7) The threshold H is then compared with Q₂. Such comparison is equivalent to the equation (4) or (3). If necessary, the threshold level H may be amplified by an amplifier circuit 4. S represents a signal to be binary-coded, obtained by amplifying Q m (or without amplifying Q m ). H represents a threshold signal obtained by amplifying the threshold level (or without amplifying it). To minimize confusion, the reference "H" is used both before and after amplification. A comparator circuit 5 compares S and H. If the signal S has a peak value (if the signal S represents a black picture element) S is larger than H (S > H). If the signal S represents a white picture element, S is smaller than H (S < H). Figure 2 is a block diagram of the binary coding circuit for use when the input analog signal has the waveform which is upwards convex. This is the case wherein the output becomes high for a black picture element. The photoelectric conversion cell output A has several positive peaks at various points. The output is delayed by the delay circuit 1 so that three delayed signals Q₁, Q₂ and Q₃ are generated ( n = 3 ). The three delay times T₁, T₂ and T₃ are different from each other. 0 ≦ T₁ < T₂ < T₃ (8) The signal Q₁ may be the original output signal per se. In other words, the delay time T₁ may be zero. The value of (T₃-T₂) may be equal to the value of (T₂-T₁). A threshold level is determined on the basis of the advanced signal Q₁ and the delayed signal Q₃. In this arrangement, an OR circuit 21 is used. The expression "OR circuit" as referring to OR circuit 21 is not necessarily used in its precise manner. Rather, the words "OR circuit" may include a circuit for identifying the maximum value in the same manner as the equation (7). H = max { Q₁, Q₃ } (9) Q₁ and Q₃ are analog quantities and therefore the term "OR circuit" cannot be exactly defined for those two analog quantities. In this description, the circuit for performing such an arithmetical operation as set forth in equation (9) is referred to as an "OR circuit". The output of the circuit is Q max . Of course, the operation called for by equation (9) may be replaced by the operation called for by the expression H = Q₁ + Q₃. However, it is difficult to carry out such an analog operation. Accordingly, the circuit has been defined so as to include the functions called for by equation (9). Signal Q₂ passes through the amplifier circuit 3 where it is amplified and offset. The amplified and offset signal from amplifier 3 is coupled to one input terminal of the comparator circuit 5 as a binary coding target signal. In the comparator circuit the signals S and H are compared with each other. If the signal S is in a peak state, S is larger than H. If the signal S is not in a peak state, S is smaller than H. Although the reason has been described above, it will be more intuitively described with reference to Figs. 3(a) and 3(b). In Figure 3(a), curve 100 shows the output of the photoelectric conversion cell having a peak. Curves 102, 104 and 106 shows output signals Q₁, Q₂ and Q₃ respectively delayed for delay times T₁, T₂ and T₃. These output signals have the same waveform but the time axes of the signals are differently shifted. The beginning point of the waveform is denoted by P and the end point of the waveform is denoted by R. The intersection of Q₁ and Q₂ is denoted by K and the intersection of Q₂ and Q₃ is denoted by M. The intersection of Q₃ and Q₁ is denoted by L. The threshold level H does not take a constant voltage. The binary coding circuit according to the present invention is different from the conventional binary coding circuit in this respect. The term "level" may be used in its precise manner because it is variable temporally. The threshold H is the maximum value of Q₁ and Q₃, so that H is equal to Q₁ before the point L and then H is equal to Q₃ after the point L. The threshold H is expressed by the curve PKLMR. In those portions of the curve PK and MR, S is less than H. Accordingly, the binary output B is zero and therefore simply expressed as B = 0. In portion KFM of the curve, S is larger than H. The difference between S and H is expressed by the area KLMF. Accordingly, in curve portion KM, the binary output is the value of "1" and simply expressed as B = 1. Reference numeral 108 refers to the waveform of the binary signal B. Between the points K′ and M′ which correspond to the points K and M, the signal B takes the value of "1". Between the points P′ and K′ and between the points M′ and R′, the signal B takes the value of "0". There may be the case where the width K′ M′ in which B takes the value of "1" should be enlarged or shortened according to circumstances. In this case, the amplification factors for S and H are changed and an offset Δ is established. Fig. 3(b) shows the waveforms of Q₁, Q₂ and Q₃ after such a procedure. The amplification factor for Q₂ larger than those for Q₁ and Q₃. Accordingly, the amplitude of Q₂ is larger, but contrarily, Q₂ is offset by Δ downward from Q₁ and Q₃. The value P₂ of Q₂ is lowered by downward from the value P₁ of Q₁ in the start stage. The value R₂ of Q₂ is lowered by Δ downward from the value R₃ of Q₃ in the end stage. Thus, the waveforms of Q₁ and Q₃, the threshold H and the intersection L of Q₁ and Q₃ are not changed, but the binary coding target signal S is changed. The amplification factor is represented by π ( π > 1 ). The change of the binary coding target signal S is expressed as follows: Q₂ → π Q₂ - Δ (10) The intersection of Q₂ and Q₁ is K, and the intersection of Q₂ and Q₃ is M. The distance between K and M is larger than in the case of Figure 3(a). The lower portion of Figure 3(b) shows the binary output B. In this drawing, K′M′ corresponds to black. The reason why the offset Δ is necessary will now be described. Let Q be a flat signal. That is, Q is a signal which is not in the peak state. Q is a signal for generating the binary output B having the value of "0". Because Q is flat, the relation Q = Q₁ = Q₂ = Q₃ should hold. A comparative output is expressed by the following equation (11) with the use of Q₁ or Q₃. Φ = ( π Q₂ - Δ ) - Q₁ (11) When the aforementioned relation holds, the equation (11) can be transformed into the following equation (12). Φ = (π - 1) Q - Δ (12) If the offset - is not established, the comparative output becomes positive against the flat signal because of π - 1 > 0. When the comparative output Φ is positive, the binary output B takes the value of "1" and there is an erroneous judgment. The offset - Δ can prevent such a malfunction. It is apparent from the equation (12) that the malfunction cannot be prevented if the offset Δ does not become deeper as the level of the flat signal Q becomes higher. The depth - Δ of the offset is determined by judging from the amplification factor π and the necessity of preventing the malfunction to the height of the flat level Q. Figure 3(b) shows the case where the offset is not established. When the amplification factor π is larger than 1, the offset is essential. When the amplification factor π is not larger than 1, the offset may be used even though its use is not essential. By using offset - Δ, the frequency of mistaking the white area ( B = 0 ) for the black area can be reduced. Figure 4 is a block diagram of the binary coding circuit for use when the input signal has a waveform which is downward convex. The operation of the binary coding circuit of Figure 4 is similar to that of Figure 2, except that the relation of level is reversed and an AND circuit 22 is used as a threshold determining circuit. Q₁, Q₂ and Q₃ are output signals delayed for times T₁, T₂, and T₃, respectively. A binary coding target signal S is formed from Q₂, and threshold H is formed from Q₁ and Q₃. Figure 5 includes graphs of waveforms explaining the operation of the circuit of Figure 4. The upper portion of Figure 5 shows the output of the photoelectric conversion cell. The output signal has a negative peak. The output signal is delayed for times T₁, T₂ and T₃ to thereby generate waveforms Q₁, Q₂ and Q₃ as shown in center portion of Figure 5. Q₂ is amplified and offset by the positive offset + Δ. The threshold H is expressed by the minimum value of Q₁ and Q₃. H = min { Q₁, Q₃ } (13) The comparative output Φ is defined in the same manner as described above. Φ = S - H (14) If Φ is negative, B = 0. If Φ is positive, B = 1. The relation B = 0 corresponds to the character area, and the relation B = 1 corresponds to the background area. The AND circuit 22 is required for defining the threshold H as expressed by the equation (13). Figure 6 is a circuit diagram of a binary coding circuit according to one embodiment of the present invention. The output A of a photoelectric conversion cell is applied to a delay circuit constituted by delay lines 11 and 12. The delay lines are used as the most simple method for delaying an analog signal without changing the waveform thereof. The delay lines have delay times t₁ and t₂, respectively. The delay lines are connected in series. Accordingly, the delay at the input point a of the delay line 11 is 0, the delay at the junction point b between the delay lines 11 and 12 is t₁, and the delay at the output point c of the delay line 12 is ( t₁ + t₂ ). If the delay quantities are expressed in the manner of Figure 2 or Figure 4, the relation of T₁ = 0, T₂ = t₁ and T₃ = t₁ + t₂ is established. A signal Q₁ from the point a and a signal Q₃ from the point c are respectively connected to non-inversion input terminals of differential amplifiers 6 and 7 in an OR circuit 21. Inversion input terminals of the respective differential amplifiers 6 and 7 are respectively connected to output terminals thereof. These two differential amplifiers 6 and 7 function as a voltage follower. A voltage is not amplified between the input and output but the impedance is lowered. Accordingly, voltages at the output points d and e of the differential amplifiers 6 and 7 are equal to the voltages of the input signals Q₁ and Q₃. The output signals of the differential amplifiers 6 and 7 are respectively passed through diodes D1 and D2 and then connected to an inversion input terminal j of a comparator 51. The inversion input i is grounded through a resistor R5. The respective cathodes of the two diodes D1 and D2 are connected to each other for the purpose of performing OR operation. The signals at the points d and e have analog quantities. The higher one is selected from the signals appears at the point i . A lower one of the signals has no influence on the point i because the diode corresponding to the signal is reversely biased. The voltage at the point i is a little lower than the maximum value at the points d and e , because the voltage is lowered by about 0.6 V due to the PN junction of the diode. The offset value as described above can be adjusted by a variable resistor R4 in a differential amplifier 9. Offset adjusting resistor R4 has the dual purposes of compensating the lowering of voltage due to the pn junction in each of the diodes D1 and D2, and adjusting the offset value defined by the equations (10) - (12). The output Q₂ from the point b between the delay lines 11 and 12 is amplified and offset by the differential amplifier 9. Differential amplifier 9 amplifies the voltage ( π > 1 ), while the amplifier 9 may be used as a voltage follower ( π = 1 ). A constant voltage V EE is connected to an intermediate terminal of variable resistor R4. A resistor R3 is connected to an inverting input terminal g of the differential amplifier 9. The signal Q₂ to be binary-coded is connected to a non-inverting input terminal f of differential amplifier 9 through a resistor R1 which is nearly equal in resistance value to a resistor R3. The output terminal h of the differential amplifier 9 is connected to the inverting input terminal g through a resistor R2. Thus, a non-inverting amplification is carried out to obtain an amplification factor represented by the following equation. The offset of the output can be arbitrarily established by adjusting the resistor R4. As described above, the resistor R4 has the dual purposes of compensating the lowering of voltage due to the PN junction in each of diodes D1 and D2, and adjusting the offset value - Δ defined by the equations (10) - (12). Thus, the two signals S and H are applied to the two input terminals of the comparator 51. The binary signal B takes the value of "1" for the condition of S > H or takes the value of "0" for the condition of S < H. Thus, binary coding takes place as shown in the lower portions of Figures 3(a) and 3(b). This binary coding circuit does not use a fixed threshold level. Further, the circuit does not use a threshold level common to the whole picture. A variable threshold is locally determined by use of the local change of signal. Accordingly, if two types of analog signals respectively having a higher peak value and a lower peak value are continuously received, binary coding is perfected. The circuit is simple in construction but capable of accurate binary coding an analog input signal two a two-valued signal. The circuit is particularly applicable to optical character readers (OCRs) and bar code readers (BCRs). It is particularly well suited for use in portable OCRs and BCRs for point of sale (POS) automated reading where small size, low cost and a high speed are required and where the analog signal level may be unstable.

Claims: A binary coding circuit for an optical character reader which identifies characters or symbols using a photoelectric conversion cell comprising: a delay circuit (1) having one input for receiving an output (A) of said photoelectric conversion cell, and at least three separate and distinct delayed outputs (Q1,Q2,Q3), providing respective delays (T1,T2,T3) that are different from each other; a threshold determining circuit (2) arranged so that when one of said delayed outputs (Q1,Q2,Q3) is selected to be a binary-coding target signal (Q2), said threshold determining circuit (2) receives as its inputs a plurality of said delayed outputs including one delayed output (Q3) having a larger delay time than that of said binary-coding target signal (Q2) and one delayed output (Q1) having a smaller delay time than that of said binary-coding target signal, so as to produce a threshold signal (H) which corresponds to the delayed output (Q1) having a smaller delay time during a first period (T2-T1) and to the delayed output (Q3) having a larger delay time during a second period (T3-T2); and a comparator circuit (5) having a first input receiving said binary-coding target signal (Q2) and a second input receiving said threshold signal (H), for comparing said binary-coding target signal (Q2) with said threshold signal (H) to thereby produce a binary signal (B); characterized by means (3) for amplifying said binary-coding target signal (Q2) with an amplification factor greater than 1 and adding thereto an offset value (-Δ,+Δ). A binary coding circuit according to claim 1, wherein said threshold determining circuit (2) comprises an OR circuit (21) for use when the value of said binary-coding target signal (Q2) becomes high in the area of characters or symbols and said offset value is negative. A binary coding circuit according to claim 1, wherein said threshold determining circuit (2) comprises an AND circuit (22) for use when the value of said binary-coding target signal (Q2) becomes low in the area of characters or symbols and said offset value (+Δ) is positive.

Inventors: MAEDA, NAOKI C/O OSAKA WORKS
Applicants: SUMITOMO ELECTRIC INDUSTRIES LIMITED
Application year: 1987
Main classification: G06K9
IPC codes: G06K7, G06K9, H04N1