← Back to Patent Explorer
US5259042A Expired / Lapsed US ⏱️ 0.0 years remaining

Binarization processing method for multivalued image and method to form density pattern for reproducing binary gradations

Assignee: Artience Co Ltd
•
Filing: 1990-11-20
•
Granted: 1993-11-02
•
Expires: 2010-11-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A high quality binary valued image is reproduced from a multivalued original image by a combination of density pattern processing and error diffusion processing using density patterns prepared previously in correspondence to each density value of pixels of an image to be reproduced.

Inventors

  • 👤 Hiroshi Matsuki
  • 👤 Yukihiko Takahashi

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 10:05
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/405; H04N1/4055; H04N1/4058; G; G06; G06V; G06V10/00; G06V10/20; G06V10/28

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 392 words
A binarization processing method for a multi-valued image for reproducing an original image, comprising steps of: dividing, by an image input unit, the original image into a plurality of multivalued input pixels arranged in matrix form of k lines and l rows; characterizing the input pixels by gradation values; expressing, by an image output unit, an output image in the form of a plurality of binary valued dots arranged in matrix form of p lines and q rows; separating said plurality of binary valued dots into a plurality of virtual meshes arranged in matrix form of k lines and l rows, wherein each mesh consists of a group of said dots in matrix form of m lines and n rows (mn>1); classifying the gradation values of the input pixels into "mn+1" hierarchies of C O , C 1 , . . . , C r , . . . , C mn expressed by "mn" printing dots; providing a reference value N r (r=0, 1, . . . , mn) representing the hierarchy C r (r=0, 1, . . . , mn) is provided; establishing a diffusion coefficient matrix; preparing an area-type density expression pattern table in matrix form of v lines and w rows to represent a group of said dots of m lines and n rows wherein each element expresses a gradation r for each hierarchy C r ; outputting an area-type density expression pattern having line number of (y-1) mod (v)+1 and row number of (x-1) mod (w)+1 to meshes of y line and x row of an output image from the area-type density expression pattern table for a gradation value of a y ,x of an individual input pixel of x line and y row; identifying an error a y ,x -N r for a mesh of the output image in the preceding step; dispersing the error for a mesh of the output image to pixels surrounding the mesh; adding the error of the mesh of the output image to the gradation values of the pixels surrounding the mesh according to the sizes of coefficients in the diffusion coefficient matrix, wherein diffusion coefficients relatively correspond to the positions of input pixels; and repeating said steps of outputting, identifying, dispersing and adding to other dot meshes of input pixels with new gradation values so that the error is diffused.
Claim 2
Dependent Claim 392 words
A binarization processing method for a multi-valued image for reproducing an original image, comprising steps of: dividing, by an image input unit, the original image into a plurality of multivalued input pixels arranged in matrix form of k lines and l rows; characterizing the input pixels by gradation values; expressing, by an image output unit, an output image in the form of a plurality of binary valued dots arranged in matrix form of p lines and q rows; separating said plurality of binary valued dots into a plurality of virtual meshes arranged in matrix form of k lines and l rows, wherein each mesh consists of a group of said dots in matrix form of m lines and n rows (mn>1); classifying the gradation values of the input pixels into "mn+1" hierarchies of C O , C 1 , . . . , C r , . . . , C mn expressed by "mn" printing dots; providing a reference value N r (r=0, 1, . . . , mn) representing the hierarchy C r (r=0, 1, . . . , mn) is provided; establishing a diffusion coefficient matrix; preparing an area-type density expression pattern table in matrix form of v lines and w rows to represent a group of said dots of m lines and n rows wherein each element expresses a gradation r for each hierarchy C r ; outputting an area-type density expression pattern having line number of (y-1) mod (v)+1 and row number of (x-1) mod (w)+1 to meshes of y line and x row of an output image from the area-type density expression pattern table for a gradation value of a y ,x of an individual input pixel of x line and y row; identifying an error a y ,x -N r for a mesh of the output image in the preceding step; dispersing the error for a mesh of the output image to pixels surrounding the mesh; adding the error of the mesh of the output image to the gradation values of the pixels surrounding the mesh according to the sizes of coefficients in the diffusion coefficient matrix, wherein diffusion coefficients relatively correspond to the positions of input pixels; and repeating said steps of outputting, identifying, dispersing and adding to other dot meshes of input pixels with new gradation values so that the error is diffused.
Claim 3
Dependent Claim 156 words
A binarization processing method for multi-valued image according to claim 1, wherein said step of preparing an area-type density expression pattern table includes steps of preparing a basic output priority matrix of h lines and i rows having output priority rank for each element thereof; rotating the basic output priority matrix by repeating said basic output priority matrix in X and Y directions and rotating it by an angle θ; and presenting correspondence of output priority matrices to mesh units of V lines and W rows wherein an element of said output priority matrices corresponds to an equal or a nearest element of a rotated output priority matrix, and wherein, in each mesh, the dots are outputted in an order of element of said output priority matrix according to higher priority to form said area-type density expression pattern table, to enable expressing of density patterns of hierarchy of 0, 1, 2 . . . , mn.
Claim 4
Dependent Claim 54 words
A binarization processing method for multi-valued image according to claim 2, wherein the spacings of elements in X and Y directions on said rotated basic output priority matrix are m/h times of the unit length in x direction on a plane of x-y coordinates and n/i times of the unit length in y direction.
Claim 5
Dependent Claim 15 words
A binarization processing method for multivalued image according to claim 3, wherein h≧m and i≧n.
Claim 6
Dependent Claim 51 words
A binarization processing method for multi-valued image according to claim 2, wherein (a) tan θ=(n·c)/(m·b) or tan θ≈(n·c)/(m·b), and (b) b 2 +c 2 =d 2 or b 2 +c 2 ≈d 2 , V=W=d for a set of integer numbers b, c and d satisfying the conditions (a) and (b).
Claim 7
Dependent Claim 100 words
A binarization processing method for multi-valued image according to claim 2, wherein (a) tan θ=(n·c)/(m·b) or tan θ≈(n·c)/(m·b), and (b) b 2 +c 2 =d 2 or b 2 +c 2 ≈d 2 , V=W=d for a set of integer numbers b, c and d satisfying the conditions (a) and (b), and the spacings of elements in X and Y directions on said rotated basic output priority matrix are (d/√b 2 +c 2 )·(m/h) times the unit length in x direction on the x-y coordinate plane, and (d/√b 2 +c 2 )·(n/i) times of the unit length in y direction.
Claim 8
Dependent Claim 39 words
A binarization processing method for multi-valued image according to claim 2, wherein said basic output priority matrix is sequentially arranged from the central portion of the matrix to the peripheral portion from higher priority rank to the lower rank.
Claim 9
Dependent Claim 18 words
A binarization processing method for multi-valued image according to claim 2, wherein said rotating angle θ is 0°.
Claim 10
Independent Claim 157 words
A method for forming a density pattern for reproducing binary gradation in an image using an area-type density expression pattern table, comprising steps of: producing said area-type density expression pattern table with a basic output priority matrix of h lines and i rows having output priority rank as an element; rotating said basic output priority matrix by repeating said basic output priority matrix in X and Y directions and rotating it by the angle θ; establishing an output priority matrix corresponding to mesh units of V lines and W rows in which an element of said output priority matrix corresponds to equal or nearest element of said rotated output priority matrix; and outputting printing dots of the image in the order of elements of said output priority matrix according higher priority for forming said area-type density expression pattern table, said table permitting expression of density patterns of hierarchy of 0, 1, 2 . . . , mn.
Claim 11
Independent Claim 157 words
A method for forming a density pattern for reproducing binary gradation in an image using an area-type density expression pattern table, comprising steps of: producing said area-type density expression pattern table with a basic output priority matrix of h lines and i rows having output priority rank as an element; rotating said basic output priority matrix by repeating said basic output priority matrix in X and Y directions and rotating it by the angle θ; establishing an output priority matrix corresponding to mesh units of V lines and W rows in which an element of said output priority matrix corresponds to equal or nearest element of said rotated output priority matrix; and outputting printing dots of the image in the order of elements of said output priority matrix according higher priority for forming said area-type density expression pattern table, said table permitting expression of density patterns of hierarchy of 0, 1, 2 . . . , mn.
Claim 12
Dependent Claim 63 words
A method to form density pattern for reproducing binary gradation using an area-type density expression pattern table according to claim 9, further comprising spacing said elements in X and Y directions on a rotated basic output priority matrix with spacing m/h times a unit length in x direction on a plane of x-y coordinates and n/i times a unit length in y direction.
Claim 13
Dependent Claim 25 words
A method to form density pattern for reproducing binary gradation using an area-type density expression pattern table according to claim 10, wherein h≧m, and i≧n.
Claim 14
Dependent Claim 61 words
A method to form density pattern for reproducing binary gradation using an area-type density expression pattern table according to claim 9, wherein (a) tan θ=(n·c)/(m·b), or tan θ≈(n·c)/(m·b) and (b) b 2 +c 2 =d 2 or b 2 +c 2 ≈d 2 , V=W=d for a set of integer numbers b, c and d satisfying the conditions (a) and (b).
Claim 15
Dependent Claim 108 words
A method to form density pattern for reproducing binary gradation using an area-type density expression pattern table according to claim 9, wherein (a) tan θ=(n·c)/(m·b), or tan θ≈(n·c)/(m·b) and (b) b 2 +c 2 =d 2 or b 2 +c 2 ≈d 2 , V=W=d for a set of integer numbers b, c and d satisfying the conditions (a) and (b), and spacings of elements in X and Y directions on a rotated basic output priority matrix are (d/√b 2 +c 2 )·(m/h) times a unit length in x direction on the x-y coordinate plane, and (d/√b 2 +c 2 )·(n/i) times a unit length in y direction.
Claim 16
Dependent Claim 49 words
A method to form density pattern for reproducing binary gradations using an area-type density expression pattern table according to claim 9, wherein said basic output priority matrix is sequentially arranged from the central portion of the matrix to the peripheral portion from higher priority rank to the lower rank.
Claim 17
Dependent Claim 28 words
A method to form density pattern for reproducing binary gradations using an area-type density expression pattern table according to claim 9, wherein said rotating angle θ is 0°.

References Cited (Backward Citations)

US4783837A Cited
US4626901A Cited
US4673971A Cited
US4890121A Cited
US4742400A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-11-01 1997-05-03 1997-11-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-11-01 2001-05-03 2001-11-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-11-01 2005-05-03 2005-11-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag