Binary image reduction method

Abstract: According to the present invention, provided a binary image reduction method, wherein when horizontal and vertical conversion ratios α x and α y are respectively given by: 1/n x > α x ≧ 1/(n x + 1) 1/n y > α y ≧ 1/(n y + 1) (where n x and n y are natural numbers) some or all of 2(n x + 1) x 2(n y + 1) original pixels are referred in horizontal and vertical directions to have a converted pixel as a central pixel to detect a thin line whose horizontal line width in an original picture is equal to or smaller than n x pixels and whose vertical line width in the original picture is equal to or smaller than n y pixels, and which has a length equal to or larger than a predetermined value in horizontal, vertical, and oblique directions, and a value of the thin line is substituted in a converted pixel closest to the thin line upon detection of the thin line.

Description: BACKGROUND OF THE INVENTION : (Field of the Invention) The present invention relates to a binary picture reduction method which is free from degradation of image quality of an image expressed by black and white, i.e., binary values and, more particularly, to a binary image reduction method which can prevent thin lines from being lost so that an uneven thin line generated when an image is read by an image reading apparatus such as a facsimile can be prevented from being disconnected. (Description of the Prior Art) As a conventional binary picture reduction method, an SPC (Selective Processing Conversion) method shown in Fig. 1(a), a field mapping method shown in Fig. 1(b), and the like are known. In the SPC method, when a converted picture : is mapped to an original image, a value of a pixel of the original picture (to be referred to as an original pixel hereinafter) at a position closest to a pixel of the converted picture to be obtained (to be referred to as a converted pixel hereinafter) is substituted in the converted pixel. In Fig. 1(a), the value of an original pixel P 0.0 is substituted in a converted pixel Q. In the field mapping method, four original pixels near a converted pixel are selected, an average density which is projected to the converted pixel position by these four original pixels is calculated, and the calculated density is subjected to threshold value processing to be converted to the value of the converted pixel. In Fig. 1(b), the value of a converted pixel Q is obtained based on four original pixels P 0.0 , P 0.1 , P 1.0 , and P 1.1 . However, in the above-mentioned reduction methods, when a black or white thin line is present on an original picture, if the thin line on the original picture is not an original pixel closest to the converted pixel position in the SPC method or if the result of the threshold value processing of an average density projected by four original pixels does not coincide with the value of the thin line in the field mapping method, the corresponding thin line is lost from a converted picture, resulting in problems of skipping and batter. The "skipping" occurs when a black thin line of an original picture is lost from a converted picture, and the "batter" occurs when a white thin line is lost. In Figs. 1(a) and 1(b), the value of the converted pixel Q indicates white, and a black thin line (P 1.0 , P 1.1 ) of an original picture is lost. For a better understanding of the present invention it should be added that as a method of preventing skipping or batter caused by a lost thin line, an improved TP (Thin Line Preservation) method has been proposed proposed by the present Applicant in Japanese Patent Application No. 62-236087, September 22, 1987, published under JP-A-1 080 167, said document being not comprised in the state of the art for the present application. In the TP method, a thin line on an original picture is detected, and the detected thin line is preserved on a converted picture, thus preventing skipping or batter. Fig. 2 shows the basic principle of thin line preservation. In Fig. 2, reference symbols P 0.0 , P 0.1 , P 1.0 , P 1.1 , P 2.0 , and P 2.1 denote original pixels; and Q, a converted pixel. Assuming that (P m.m ) represents a value of the original pixel, ( P m.m ) represents an inverse value of (P m.m ), and (Q) represents a value of the converted pixel, if (P 0.0 ) = (P 2.0 ) = ( P 1.0 ), these pixels are detected as a thin line, and (Q) = (P 1.0 ) is set. When the TP method is applied to a reduction ratio of 1/3, a thin line is determined using original pixel references shown in Fig. 3. More specifically, six original pixels in each of the horizontal and vertical directions (i.e., forming a cross shape) are referred to have an original pixel closest to a target of converted pixels as a central pixel. Thin line determination conditions in Fig. 3 are as follows. That is when one of (P 0.0 ) = (P -2.0 ) = ( P -1.0 ), (P 0.0 ) = (P 2.0 ) = ( P 1.0 ), and (P 0.0 ) = (P 3.0 ) = ( P 1.0 ) = ( P 2.0 ) is established, the presence of a vertical thin line is determined. When one of (P 0.0 ) = (P 0.-2 ) = ( P 0.1 ), (P 0.0 ) = (P 0.2 ) = ( P 0.1 ), and (P 0.0 ) = (P 0.3 ) = ( P 0.1 ) = ( P 0.2 ) is established, the presence of a horizontal thin line is determined. However, an image read from a scanner such as a facsimile apparatus often has an uneven pattern. In the TP method, if the thin line includes the uneven pattern, this pattern is recognized as a thin line in an opposite color and is preserved, resulting in loss of a thin line. Figs. 4(a) and 4(b) show a case wherein since an original picture includes an uneven pattern at a reduction ratio of 1/3, an original thin line is disconnected on a converted picture. More specifically, since the thin line determination condition of (P 0.0 ) = (P 2.0 ) = ( P 1.0 ) is established, it is determined that a vertical white thin line is present at the position of an original pixel P 1.0 , and the value of a converted pixel Q in Fig. 4(a) is set to be a white value. As a result, a converted picture becomes as shown in Fig. 4(b). Therefore, the present invention relates to binary picture reduction adopted in a facsimile apparatus or the like and has as its object to provide a binary image reduction method which can reduce an image including an uneven pattern read from a scanner without being skipped or battered, and can reduce an image with high quality even if a reduction ratio is as small as, e.g., 1/4. SUMMARY OF THE INVENTION : According to the present invention as claimed, there is provided a binary picture reduction method for reducing an original binary picture, wherein each pixel is represented by a binary value, at a conversion ratio α x smaller than 1 in a horizontal direction and at a conversion ratio α y smaller than 1 in a vertical direction to obtain a converted binary picture, α x satisfying 1/n x >α x ≥1/(n x +1) α y satisfying 1/n y >α y ≥1/(n y +1) where n x and n y are natural numbers, wherein said method comprises sequentially determining the binary values of each of the converted pixels by executing repeatedly the steps of : a) obtaining (S1 on fig. 6, references 1-2 on fig. 5) a positional relationship between a given one of the converted pixels and original pixels on the original picture when the converted picture is mapped to the original picture ; b) setting (S2 on fig. 6) a rectangular area (reference 11 on fig. 7) having a side of 2(n x +1) original pixels in the horizontal direction and a side of 2(n y +1) original pixels in the vertical direction to have said given converted pixel at a central position ; c) detecting (S3, S4 on fig. 6), by using some or all of 4 (n x +1) · (n y +1) original pixels in the rectangular area, a line segment whose horizontal line width is equal to or smaller than n x pixels and whose vertical line width is equal to or smaller than n y pixels, and which has a length equal to or larger than a predetermined value ; and d) when such a line segment is present in the rectangular area and the converted pixel is closest to the detected line segment, attributing (S5 on fig. 6, reference 6 on fig. 5) the binary value of the pixels of the detected line segment to the given converted pixel ; e) when no such line segment is present in the rectangular area, determining the binary value of the given converted pixel by another method. In a preferred embodiment, the step of detecting the presence/absence of a line segment includes detecting that a line segment is present in the original picture (1) when, in the original picture, a certain pixel having a specific value has right and left adjacent pixels having a different value from said certain pixel, and pixels having the same value as said certain pixel are connected by not less than a predetermined number in a vertical or oblique direction, or (2) when, in the original picture, pixels having the same value are connected in the horizontal direction and pixels horizontally adjacent to the two ends of the horizontally connected pixels have a value different from the connected pixels, the number of the horizontally connected pixels is not less than 2 and not more than n x , and pixels having the same value as the horizontally connected pixels are connected by not less than a predetermined number in a vertical or oblique direction. A difference in characteristic feature between the reduction method of the present invention and a conventional reduction method is that, in the present invention, the length of a thin line is detected so as not to erroneously detect an uneven pattern as a thin line, and a means for referring to original pixels having a size described in step (2) is used to allow detection of the length of a thin line. As a result, according to the binary image reduction method of the present invention, even if a thin line includes an uneven pattern, a thin line can be prevented from being lost, and a converted picture free from degradation can be obtained. In addition, a thin line in a horizontal, vertical, or oblique direction can be prevented from being lost, and a satisfactorily converted picture can be obtained. Therefore, even if a small character is reduced, the reduced character can be read, and a character smaller by 30% than the smallest character which can be reduced in a conventional method can be reduced. BRIEF DESCRIPTION OF THE DRAWINGS : Figs. 1(a) and 1(b) show conventional binary picture reduction methods, in which Fig. 1(a) shows an SPC (Selective Processing Conversion) Method, and Fig. 1(b) shows a field mapping method; Fig. 2 shows the basic principle of thin line preservation in a conventional reduction method; Fig. 3 shows original pixel references in a TP (Thin Line Preservation) method as one conventional reduction method; Figs. 4(a) and 4(b) are views for demonstrating that when an original picture includes an uneven pattern, the conventional TP method erroneously detects the uneven pattern as a thin line upon formation of a converted picture; Fig. 5 is a block diagram showing a binary picture reduction function according to an embodiment of the present invention; Fig. 6 is a flow chart showing binary picture reduction processing according to the present invention; Fig. 7 shows an example of original pixels to be referred by the method of the present invention; Figs. 8(a 1 ) to 8(b 4 ) show a detailed execution method of thin line detection according to the present invention; Figs. 9(a 1 ) to 9(d 3 ) show thin line detection conditions used in the present invention; Figs. 10(a) to 12(ℓ) show positions of thin lines detection on original pictures according to the present invention, in which Figs. 10(a) to 10(h) show detection positions of orthogonal/oblique thin lines having a line width of one pixel and a line length of three pixels when a conversion ratio α satisfies 1/1 > α ≧ 1/2, Figs. 11(a) to 11(f) show detection positions of orthogonal/oblique thin lines having line widths of one and two pixels and a line length of three pixels when a conversion ratio α satisfies 1/2 > α ≧ 1/3, and Figs. 12(a) to 12(ℓ) show detection positions of orthogonal/oblique thin lines having line widths of one, two, and three pixels and a line length of three pixels when a conversion ratio α satisfies 1/3 > α ≧ 1/4; Figs. 13(a) to 13(c) show converted pictures obtained by converting a character (Chinese character) by conventional binary image reduction methods and the binary image reduction method of the present invention; and Figs. 14(a) to 14(c) show converted pictures obtained by converting an original picture having vertical, horizontal, and oblique lines by a conventional binary image reduction method and the binary image reduction method of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS: The present invention will be described in detail hereinafter with reference to the accompanying drawings. Fig. 5 is a function block diagram of an embodiment of the present invention. In Fig. 5, reference numeral 1 denotes an original picture reading means for reading out an original picture from a memory or the like; and 2, a converted pixel position calculating means for obtaining the positional relationship between converted pixels and original pixels when a converted picture is mapped to an original picture. The calculating means 2 determines the positional relationship between converted pixels and original pixels on the basis of a conversion ratio. Reference numeral 3 denotes an original pixel reference reading means for reading out values of 2(n x + 1) (horizontal direction) · 2(n y + 1) (vertical direction) original pixels to have a target of converted pixels as a central pixel; 4, a means for detecting a vertical/oblique thin line having a line width of n x pixels or less and a horizontal/oblique thin line having a line width of n y pixels or less from the values of the original pixel reference read out by the original pixel reference reading means 3, and for obtaining a converted pixel closest to the detected thin line; 5, a thin line length determination means for determining whether or not a thin line has a predetermined length; 6, a means for, when a target of converted pixels is a converted pixel closest to a thin line and the thin line has the predetermined length, substituting the value of the thin line in the converted pixel; 7, a means for, when no thin line is detected, or when the detected thin line has a length shorter than the predetermined length, or when a converted pixel closest to the thin line is not a target of converted pixels, calculating a value of a converted pixel; and 8, a means for determining a value of a converted pixel. Fig. 6 shows a flow of binary picture reduction processing according to the present invention. In the binary picture reduction processing, values of converted pixels are sequentially determined in accordance with a predetermined rule, and the determination operation is repeated to form a converted picture. The embodiment shown in Fig. 5 and the binary picture reduction method of the present invention will be described below with reference to the flow chart of Fig. 6. When horizontal and vertical conversion ratios are different, conversion can be separately performed for the horizontal and vertical directions. Therefore, the following description will be made assuming that the horizontal and vertical conversion ratios are equal to each other, and a conversion ratio α satisfies: 1/n > α ≧ 1/(n+1) (where n is a natural number) An original picture is read out by the original picture reading means 1, and a converted picture is mapped to the original picture by the converted pixel position calculating means 2, thus the position of a target of converted pixels on the original picture is obtained (S1 in Fig. 6). Some or all of a total of 4(n+1) 2 (2(n+1) in the horizontal direction · 2(n+1) in the vertical direction) original pixels are read out as original pixel reference by the original pixel reference reading means 3 (S2 in Fig. 6). The value of the natural number n when the 4(n+1) 2 original pixels are read out takes the following values depending on the conversion ratio α. That is, When 1/1 > α ≧ 1/2, n = 1 When 1/2 > α ≧ 1/3, n = 2 When 1/3 > α ≧ 1/4, n = 3 Fig. 7 exemplifies a case wherein the conversion ratio α satisfies 1/3 > α ≧ 1/4. In Fig. 7, original pixels to be referred are enclosed in a dotted line 11. Each mark "o" indicates an original pixel, and a mark "x" indicates the position of a target of converted pixels. In this case, since n = 3, 64 (= 2(n+1) x 2(n+1) = 8 x 8) original pixels are referred. In a detailed reference method, the position of the target of converted pixels on an original picture is detected, and 2(n+1) (horizontal direction) x 2(n+1) (vertical direction) original pixels are sequentially read out from the contents of a line memory, having a capacity of 2(n+1) lines, for storing an original picture to have the target of converted pixel as a central pixel. The means 4 for detecting thin lines and calculating a value of a converted pixel detects connected pixels which are vertical/oblique connected pixels having a horizontal width of n x pixels or less, and/or are horizontal/oblique connected pixels having a vertical width of n y pixels or less, and the closest converted pixel of which is the target of converted pixels (S3 in Fig. 6). When the connected pixels, the closest converted pixel of which is the target of converted pixels, are detected, the thin line length determination means 5 determines whether or not the connected pixels have a predetermined length (S4 in Fig. 6). Figs. 8(a 1 ) to 8(b 4 ) show a detailed execution method of thin line detection of the present invention. Figs. 8(a 1 ) to 8(b 4 ) exemplify vertical and horizontal thin lines having line widths of one and two original pixels and a length of three pixels when the conversion ratio α = 1/3. Fig. 8(a 1 ) shows an area which defines thin lines detection of a line width of one pixel, and Fig. 8(a 2 ) shows an area which defines thin lines detection of a line width of two pixels. Fig. 8(b 1 ) shows a thin line detection condition (to be referred to as a window hereinafter) for detecting a vertical line width of one pixel, Fig. 8(b 2 ) shows a window for detecting a vertical line width of two pixels, Fig. 8(b 3 ) shows a window for detecting a horizontal line width of one pixel, and Fig. 8(b 4 ) shows a window for detecting a horizontal line width of two pixels. Thin lines are detected using the windows shown in Figs. 8(b 1 ) to 8(b 4 ) by sequentially detecting the presence/absence of thin lines in all the areas of an original pixel reference shown in Fig. 8(a 1 ) or 8(a 2 ). A detection condition of the window of a vertical line width of one pixel in Fig. 8(b 1 ) is given by: (R -1.0 ) = (R 1.0 ) = ( R 0.0 ) = ( R 0.-1 ) = ( R 0.1 ) A detection condition of the window of a vertical line width of two pixels in Fig. 8(b 2 ) is given by: (R -1.0 ) = (R 2.0 ) = ( R 0.0 ) = ( R 1.0 ) = ( R 0.-1 + R 1.-1 ) = ( R 0.1 + R 1.1 ) where a symbol "+" indicates a logic sum (OR). A detection condition of the window of a horizontal line width of one pixel in Fig. 8(b 3 ) is given by: (R 0.-1 ) = (R 0.1 ) = ( R 0.0 ) = (R -1.0 ) = ( R 1.0 ) A detection condition of the window of a horizontal line width of two pixels in Fig. 8(b 4 ) is given by: (R 0.-1 ) = (R 0.2 ) = ( R 0.0 ) = ( R 0.1 ) = ( R -1.0 + R -1.1 ) = ( R 1.0 + R 1.1 ) Figs. 8(a 1 ) to 8(b 4 ) show some examples of thin line detection. Windows used in thin line detection may have various formats depending on the line widths and lengths of thin lines and on a case of detection of only orthogonal thin lines or of detection of both orthogonal and oblique thin lines. Figs. 9(a 1 ) to 9(d 3 ) show effective windows for detecting thin lines in practical use. If it is expressed that a thin line having a line width of m pixels is present when m ( m is a natural number) original pixels having the same value are connected and original pixels adjacent to two ends of the m original pixels have a value different from those of the m original pixels, Figs. 9(a 1 ), 9(a 2 ), and 9(a 3 ) show windows for determining the presence of a thin line when a thin line having a line width of m pixels (where m = 1, 2, or 3) is present and the thin line of the m pixels has a length of two pixels or more in vertical and horizontal directions; Figs. 9(b 1 ), 9(b 2 ), and 9(b 3 ) show windows for determining the presence of a thin line when a thin line having a line width of m pixels is present and the thin line of the m pixels has a length of two pixels or more in vertical, horizontal, and oblique directions; Figs. 9(c 1 ), 9(c 2 ), and 9(c 3 ) show windows for determining the presence of a thin line when a thin line having a line width of m pixels is present and the thin line of the m pixels has a length of three pixels or more in vertical and horizontal directions; and Figs. 9(d 1 ), 9(d 2 ), and 9(d 3 ) show windows for determining the presence of a thin line when a thin line having a line width of m pixels is present and the thin line of the m pixels has a length of three pixels or more in vertical, horizontal, and oblique directions. The windows shown in Figs. 8(b 1 ) and 8(b 3 ) exemplify a case of Fig. 9(c 1 ), and the windows shown in Figs. 8(b 2 ) and 8(b 4 ) exemplify a case of Fig. 9(c 2 ). As has been described above with reference to Figs. 8(a 1 ) to 8(b 4 ), original pixels in an area defined by the conversion ratio are read out to have a target of converted pixels as a central pixel to detect a thin line having a line width determined by the conversion ratio or less, and only a thin line having a length larger than a reference value is preserved. For this purpose, one of the windows shown in Figs. 9(a 1 ) to 9(d 3 ) is selected in accordance with a necessary condition, and the presence/absence of a thin line satisfying the window is detected from the readout area. According to the above-mentioned method, thin lines will not be lost. In the above-mentioned method, the entire area of an original pixel reference read out to have the target of converted pixels as the central pixel is checked to detect the presence/absence of a thin line corresponding to a window, and if a thin line is detected, it is checked if a converted pixel closest to the thin line is the target of converted pixels. When the position of the target of converted pixels is determined, the position of thin lines detection (to be referred to as a window position hereinafter) is determined in accordance with conditions of the conversion ratio, the length and width of the thin line, and the extending direction of the thin line (i.e., the vertical, horizontal, or oblique direction). Therefore, the presence/absence of a thin line can be detected from the window position determined as described above. Note that four different window positions are present according to positional relationship among the target of converted pixels and four original pixels surrounding the target of converted pixels. Figs. 10(a) to 10(h) show window positions which are used for detecting orthogonal/oblique thin lines having a line width of one pixel and a line length of three pixels, i.e., window positions adopting the window shown in Fig. 9(d 1 ) when the conversion ratio α satisfies 1/1 > α ≧ 1/2. In Figs. 10(a) to 10(h), Q 0 designates a target of converted pixels; and P m.n (where m = -2 to 1 and n = -1 to 2), original pixels. A portion 21 surrounded by a dotted line corresponds to a window position. Figs. 10(a), 10(c), 10(e), and 10(g) show window positions for vertical/oblique thin lines having a line width of one pixel, and Figs. 10(b), 10(d), 10(f), and 10(h) show window positions for horizontal/oblique thin lines having a line width of one pixel. Figs. 10(a) to 10(h) exemplify four different cases, i.e., a case wherein the position of the target Q 0 of converted pixels is close to the original pixel P 0.0 (Figs. 10(a) and 10(b)); a case wherein the position of the target Q 0 is close to the original pixel P -1.0 (Figs. 10(c) and 10(d)); a case wherein the position of the target Q 0 is close to the original pixel P 0.1 (Figs. 10(e) and 10(f)); and a case wherein the position of the target Q 0 is close to the original pixel P -1.1 (Figs. 10(g) and 10(h)). The four different positions of the target Q 0 of converted pixels correspond to 90°-rotated positions. In some cases, the target Q 0 of converted pixels may be present at a position separated an equal distance from two adjacent pixels of surrounding four original pixels, or it may be present at a position separated an equal distance from all the four surrounding original pixels. In these cases, the closest original pixel is determined in advance, so that the four different positions of the target of converted pixels can be obtained. Figs. 11(a) to 11(f) show window positions which are used for detecting orthogonal/oblique thin lines having line widths of one and two pixels and a line length of three pixels, i.e., window positions adopting the windows shown in Figs. 9(d 1 ) and 9(d 2 ) when the conversion ratio α satisfies 1/2 > α ≧ 1/3. Note that Figs. 11(a) to 11(f) exemplify only a case wherein the target Q 0 of converted pixels is closest to the original pixel P 0.0 . Of course, the target Q 0 takes four different positions like in Figs. 10(a) to 10(f). Figs. 11(a) and 11(c) show window positions for vertical/oblique thin lines having a line width of one pixel; Figs. 11(b) and 11(d) show window positions for horizontal/oblique thin lines having a line width of one pixel; Fig. 11(e) shows a window position for vertical/oblique thin lines having a line width of two pixels; and Fig. 11(f) shows a window position for horizontal/oblique thin lines having a line width of two pixels. Figs. 12(a) to 12(ℓ) show window positions which are used for detecting orthogonal/oblique thin lines having line widths of one, two, and three pixels and a line length of three pixels, i.e., window positions adopting the windows shown in Figs. 9(d 1 ), 9(d 2 ), and 9(d 3 ) when the conversion ratio α satisfies 1/3 > α ≧ 1/4. Note that Figs. 12(a) to 12(ℓ) exemplify only a case wherein the target Q 0 of converted pixels is closest to the original pixel P 0.0 in the same way as Figs. 11(a) to 11(f). Of course, the target Q 0 takes four different positions as in Figs. 10(a) to 10(f). Figs. 12(a), 12(c), and 12(e) show window positions for vertical/oblique thin lines having a line width of one pixel; Figs. 12(b), 12(d), and 12(f) show window positions for horizontal/oblique thin lines having a line width of one pixel; Figs. 12(g) and 12(i) show window positions for vertical/oblique thin lines having a line width of two pixels; Figs. 12(h) and 12(j) show window positions for horizontal/oblique thin lines having a line width of two pixels; Fig. 12(k) shows a window position for vertical/oblique thin lines having a line width of three pixels; and Fig. 12(ℓ) shows a window position for horizontal/oblique thin lines having a line width of three pixels. All the examples of window positions shown in Figs. 10(a) to 12(ℓ) are used for a case wherein the thin line has a length of three pixels. The window position for a thin line having a length of two pixels can be determined in the same manner as described above. The windows for thin lines having a length of two pixels adopt those shown in Figs. 9(a 1 ), 9(a 2 ), 9(a 3 ), 9(b 1 ), 9(b 2 ), and 9(b 3 ). When a thin line having a predetermined length is detected by the thin line length determination means 5 shown in Fig. 5, the means 6 for substituting the value of the thin line in a converted pixel substitutes the value of the thin line in the value of the target of converted pixels (S5 in Fig. 6). When no thin line is detected or when a converted pixel closest to the thin line is not the target of converted pixels even if a thin line is detected, or when the detected thin line does not have a predetermined length, the means 7 for calculating the value of the converted pixel shown in Fig. 5 calculates the value of the converted pixel (e.g., a value of the closest original pixel) in accordance with predetermined logical calculations, and substitutes the calculated value in the target of converted pixels. In this embodiment, a method of detecting that the target of converted pixels is closer to a thin line than other converted pixels can be realized in such a manner that the central line of the detected thin line is calculated, distances from the central line to nearby converted pixels are compared to detect the closest converted pixel, and it is checked if the closest pixel is the target of converted pixels. In another method, if a distance between original pixels is given by 1, a distance between converted pixels is given by 1/α if the conversion ratio is α. The center between two converted pixels is separated from both the converted pixels by 1/2 α. Therefore, when it can be detected if the central line of a thin line is included in an area separated from the target of converted pixels by a distance 1/2α in the left, right, upper, and lower directions, it can be checked if the a converted pixel closest to the thin line is the target of converted pixels. In this embodiment, all the 2(n+1) (horizontal direction) · 2(n+1) (vertical direction) original pixels are read out, and a thin line is detected using some or all of the readout original pixels, thereby forming a converted picture. However, a converted picture may be formed by a method of reading out only original pixels necessary for thin line detection. In the above description, the cases have been described wherein thin lines having a length of two pixels or more are detected and wherein thin lines having a length of three pixels or more are detected. Upon comparison of these cases, the following features are found. Assume that the case wherein thin lines having a length of two or more pixels are detected will be called a method (1) hereinafter, and the case wherein thin lines having a length of three or more pixels are detected will be called a method (2) hereinafter. The number of pixels necessary for thin line detection of the method (1) shown in Figs. 9(a 1 ) to 9(b 3 ) is smaller than that of the method (2) shown in Figs. 9(c 1 ) to 9(d 3 ). For this reason, when thin line detection of the method (1) is realized in a hardware manner, the number of hardware components can be smaller than that in the method (2); when it is realized in a software manner, the program size can be smaller than that in the method (2), resulting in a higher processing speed. However, since thin lines having a length of two or more pixels are detected, if an uneven pattern of one pixel is included in a thin line, the thin line cannot often be prevented from being disconnected. For this reason, image quality of a converted picture in the method (1) is inferior to that in the method (2). On the other hand, the number of pixels necessary for thin line detection in the method (2) is larger than that in the method (1). For this reason, when thin line detection of the method (2) is realized in a hardware manner, the number of hardware components is larger than that in the method (1); when it is realized in a software manner, the program size is larger and a processing speed is lower. However, in the method (2), since thin lines having a length of three or more pixels are detected, even if an uneven pattern of one pixel is present in a thin line, the thin line will not be disconnected. For this reason, image quality of a converted image is superior to that in the method (1). Even if an uneven pattern of one pixel is present in a thin line, since the uneven pattern does not have a length of three or more pixels, the uneven pattern is never erroneously detected as a thin line. The above features can provide the following advantages. That is, when the number of hardware components is to be decreased or when a higher processing speed is to be attained, the method (1) is preferably employed. When an importance is put on image quality, the method (2) is preferable. In this manner, a desired method can be selected from the two methods. Fig. 13(b) shows characters obtained by reducing an original picture shown in Fig. 13(a) by conventional reduction methods (the SPC method and the TP method), and Fig. 13(c) shows a character obtained by converting the original picture of Fig. 13(a) by the reduction method of the present invention. Fig. 14(b) shows a pattern obtained by reducing an original picture having vertical, horizontal, and oblique lines shown in Fig. 14(a) by the conventional reduction method (the SPC method), and Fig. 14(c) shows a pattern obtained by converting the original picture of Fig. 14(a) by the reduction method of the present invention. As can be seen from these figures, binary image reduction free from loss of thin lines can be realized by the reduction method of the present invention.

Claims: A binary picture reduction method for reducing an original binary picture, wherein each pixel is represented by a binary value, at a conversion ratio α x smaller than 1 in a horizontal direction and at a conversion ratio α y smaller than 1 in a vertical direction to obtain a converted binary picture, α x satisfying 1/n x >α x ≥1/(n x +1) α y satisfying 1/n y >α y ≥1/(n y +1) where n x and n y are natural numbers, wherein said method comprises sequentially determining the binary values of each of the converted pixels by executing repeatedly the steps of : a) obtaining (S1 on fig. 6, references 1-2 on fig. 5) a positional relationship between a given one of the converted pixels and original pixels on the original picture when the converted picture is mapped to the original picture ; b) setting (S2 on fig. 6) a rectangular area (reference 11 on fig. 7) having a side of 2(n x +1) original pixels in the horizontal direction and a side of 2(n y +1) original pixels in the vertical direction to have said given converted pixel at a central position ; c) detecting (S3, S4 on fig. 6), by using some or all of 4 (n x +1)·(n y +1) original pixels in the rectangular area, a line segment whose horizontal line width is equal to or smaller than n x pixels and whose vertical line width is equal to or smaller than n y pixels, and which has a length equal to or larger than a predetermined value ; and d) when such a line segment is present in the rectangular area and the converted pixel is closest to the detected line segment, attributing (S5 on fig. 6, reference 6 on fig. 5) the binary value of the pixels of the detected line segment to the given converted pixel ; e) when no such line segment is present in the rectangular area, determining the binary value of the given converted pixel by another method. A binary picture reduction method according to claim 1, wherein the step of detecting the presence/absence of a line segment includes detecting that a line segment is present in the original picture (1) when, in the original picture, a certain pixel having a specific value has right and left adjacent pixels having a different value from said certain pixel, and pixels having the same value as said certain pixel are connected by not less than a predetermined number in a vertical or oblique direction, or (2) when, in the original picture, pixels having the same value are connected in the horizontal direction and pixels horizontally adjacent to the two ends of the horizontally connected pixels have a value different from the connected pixels, the number of the horizontally connected pixels is not less than 2 and not more than n x , and pixels having the same value as the horizontally connected pixels are connected by not less than a predetermined number in a vertical or oblique direction. A binary picture reduction method according to claim 1, wherein the step of detecting the presence/absence of a line segment includes detecting that the line segment is present in the original picture (1) when, in the original picture, a certain pixel having a specific value has upper and lower adjacent pixels having a different value from said certain pixel, and pixels having the same value as said certain pixel are connected by not less than a predetermined number in a horizontal or oblique direction, or (2) when, in the original picture, pixels having the same value are connected in the vertical direction and pixels vertically adjacent to the two ends of the vertically connected pixels have a value different from the connected pixels, the number of the vertically connected pixels is not less than 2 and not more than n y , and pixels having the same value as the vertically connected pixels are connected by not less than a predetermined number in a horizontal or oblique direction. A binary picture reduction method according to claim 2 or 3, wherein the predetermined number corresponds to at least two pixels on the original picture.

Inventors: ADACHI FUMIO, ICHIKAWA TADASHI, WAKABAYASHI KAORU, ADACHI, FUMIO, ICHIKAWA, TADASHI, WAKABAYASHI, KAORU
Applicants: NIPPON TELEGRAPH & TELEPHONE, NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Application year: 1990
Main classification: G06T3
IPC codes: G06T3