EP0473142A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for smoothing an image
Assignee: Kyocera Corp
•
Filing: 1991-08-28
•
Granted: —
•
Expires: 2011-08-28
Abstract
Abstract This invention relates to a method for forming an image constituted of a dot matrix and is applied to a printer, such as a laser printer of al LED printer, or to a bit map display unit such as a CRT display, and more particularly to a method for smoothing the image by smoothing stairsteps included in the image to obtain a high resolution. The method comprises steps of dividing a pixel (A, B) into a plurality of subpixels ( * 1... * 3) along a vertical scanning line or a horizontal scanning line, and of reversing a signal for a subpixel ( * 1... * 3) in accordance with a reversion signal to smooth the image as desired. The reversion signal may be provided by subjecting a specific pixel to a boolean operation, a conjunction or disjunction operation, with the adjacent pixels next to the specific pixel. The reversion signal may also be provided by steps comprising: generating, in advance, a set of four bordering data which represents the relationship of a specific pixel with bordering pixels, which bordering data are generated by subjecting the specific pixel and the four bordering pixels to a nonequivalent boolean operation, respectively, detecting the location of the stairstep and recognizing the style of the stairstep referring to the relationship among the bordering data for the pixels located along the vertical or horizontal line, and measuring the length of the level pixels adjoining with the stairstep.
Inventors
- 👤 Yasuto Kyocera Corporation Tamada
- 👤 Katsumi Kyocera Corporation Nagata
- 👤 Taketoshi Kyocera Corporation Kojima
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 22:29
CPC Classifications
G; G06; G06K; G06K15/00; G06K15/02; G06K15/12; G06K15/1238; G06K15/1242; G06K15/1247
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
73 words
A method for smoothing an image by reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white or black pixels which form an image pattern in a matrix, the method comprising the steps of: selecting a specific pixel to be smoothed with the information of pixels bordering the specific pixel, reversing one or a plurality of signals to be applied to the subpixel(s) of the specific pixel.
Claim 2
Independent Claim
73 words
A method for smoothing an image by reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white or black pixels which form an image pattern in a matrix, the method comprising the steps of: selecting a specific pixel to be smoothed with the information of pixels bordering the specific pixel, reversing one or a plurality of signals to be applied to the subpixel(s) of the specific pixel.
Claim 3
Dependent Claim
55 words
The method of claim 1, wherein the smoothing procedure is subjected to reverse a group of subpixels N or a vacant pixel as desired, which vacant subpixel is disposed at each end of the group of subpixels N, while the image signal is applied to the group of subpixels N for the normal image output.
Claim 4
Dependent Claim
46 words
The method of claim 1, wherein the smoothing procedure is conducted to reverse one or a plurality of subpixels selected from a group of subpixels P, while the image signal is applied to a group of subpixels N (N < P) for the normal image output.
Claim 5
Dependent Claim
45 words
The method of claim 1, wherein the subpixels-(s) is/are so reversed as desired that the location of subpixel(s) seemingly shifts in the direction of the scanning line, or that the size or diameter of the subpixels seemingly changes in the direction of the scanning line.
Claim 6
Dependent Claim
54 words
The method of claim 4, wherein the reversion of a subpixel is conducted with the subpixel(s) as desired within the constitution of the pixel so that the location of the subpixel(s) seemingly shifts in the desired scanning direction, or that the size or diameter of the subpixels seemingly changes in the desired scanning direction.
Claim 7
Dependent Claim
54 words
The method of claim 4, wherein the reversion of a subpixel is conducted with the subpixel(s) as desired up to the subpixel(s) of the bordering pixel so that the location of subpixel(s) seemingly shifts in the desired scanning direction, or that the size or diameter of the subpixels changes in the desired scanning direction.
Claim 8
Independent Claim
127 words
A method for smoothing an image by reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white and black pixels, which form an image pattern in a matrix, the method comprising the steps of: subjecting a specific pixel and one or a plurality of bordering pixels to a conjunction operation, or to a combination of conjunction and disjunction operations, in which the specific pixel is located at the stairstep where a white pixel(s) turns to a black pixel(s), or a black pixel(s) turns to a white pixel(s), wherein the specific pixel adjoins the bordering pixel located on the preceding or succeeding scanning line, reversing, as desired, the subpixel(s) of the specific pixel, the bordering pixel(s) or pixel(s) adjoining the bordering pixel.
Claim 9
Independent Claim
127 words
A method for smoothing an image by reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white and black pixels, which form an image pattern in a matrix, the method comprising the steps of: subjecting a specific pixel and one or a plurality of bordering pixels to a conjunction operation, or to a combination of conjunction and disjunction operations, in which the specific pixel is located at the stairstep where a white pixel(s) turns to a black pixel(s), or a black pixel(s) turns to a white pixel(s), wherein the specific pixel adjoins the bordering pixel located on the preceding or succeeding scanning line, reversing, as desired, the subpixel(s) of the specific pixel, the bordering pixel(s) or pixel(s) adjoining the bordering pixel.
Claim 10
Dependent Claim
50 words
The method of claim 7, wherein the specific pixel and the bordering pixel located on the preceding, or the succeeding scanning line are subjected to a conjunction operation for assigning subpixel(s) to be reversed, and wherein the subpixel(s) between the specific subpixel and the assigned subpixel reverses spontaneously as well.
Claim 11
Independent Claim
116 words
A method for smoothing an image for reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white or black pixels which form an image pattern in a matrix, the method comprising the steps of: generating a bordering datum representing the relationship between any specific pixel and a bordering pixel adjoining the specific pixel, specifying the location of a stairstep and the style of the stairstep with the relationship of the bordering data of pixels located on the desired scanning line in the horizontal or vertical direction, measuring the length of level pixels adjacent to the specific pixel, reversing subpixel(s) as desired corresponding to said data to form the image output.
Claim 12
Independent Claim
116 words
A method for smoothing an image for reversing subpixel signal(s) as desired, which subpixel is a divisional part of a pixel, including white or black pixels which form an image pattern in a matrix, the method comprising the steps of: generating a bordering datum representing the relationship between any specific pixel and a bordering pixel adjoining the specific pixel, specifying the location of a stairstep and the style of the stairstep with the relationship of the bordering data of pixels located on the desired scanning line in the horizontal or vertical direction, measuring the length of level pixels adjacent to the specific pixel, reversing subpixel(s) as desired corresponding to said data to form the image output.
Claim 13
Dependent Claim
56 words
The method of claim 9, wherein bordering data of four bits of binary values are generated by subjecting each of specific pixel and the four bordering pixels to a nonequivalence operation, in which the bordering pixels adjoin the specific pixel located on preceding or succeeding lines, and at the right or left on the same line.
Claim 14
Dependent Claim
184 words
The method as claimed in claim 9, wherein, in the bordering data for more than three pixels extracted from pixels adjoining the specific pixel horizontally or vertically in a line, the relationship among the bordering data for a pair of the adjoining pixels, denoted d0A, ..., d3A and dOB, ..., d3B, and assumed (a and ; 8) as any one of combinations among (0, 1), (1, 2), (2, 3) and (3, 0), will be wherein, assuming 7 or 6 are any other numerals designating the bordering data for the pixel A taken in Equation 1), the rest of the bordering data for the pixel A will be wherein the relationship within the bordering data for the pixel C opposite to the pixel B next to the pixel A, and assuming τ or 6 are any other numerals taken in the Equation 1), will be and wherein, if the relationship among the bordering data for the three pixels, A, B, and C, satisfy simultaneously at least the three equations, Equs. 1), 2) and 3), the boundary between A and B is deciphered as the stairstep.
Claim 15
Dependent Claim
22 words
The method of claim 11, wherein the style of the stairstep is recognized with the three equations, Equs. 1), 2) and 3).
Claim 16
Dependent Claim
46 words
The method of claim 9, wherein a reversion code is assigned to each pixel according to the distance from the stairstep and to the length of level pixels, in which the reversion code represents which of the subpixel(s) is reversed for each style of the stairsteps.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.