Patent US151381A successfully refreshed from Google Patents.
Patent US5634088A successfully refreshed from Google Patents.
US5634088A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for rotation of high addressability bitmap images
Assignee: Xerox Corp
•
Filing: 1995-11-01
•
Granted: 1997-05-27
•
Expires: 2015-11-01
Abstract
Abstract The present invention is a method and apparatus for consistently rotating high addressability bitmap images to be rendered on a printing system. The invention first encodes the high addressability image to produce a regular bitmap array and then rotates the regular array. Next the invention applies a compact dot growth operation to assure that the exposure pulses for any gray pixels are consistently positioned, thereby assuring consistent output-independent of the rotation direction.
Inventors
- 👤 Martin E. Banton
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 19:06
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/60; G06T3/606
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
217 words
A printing system for rotating a high addressability binary bitmap received for printing, the bitmap including an anamorphic two-dimensional array of input image signals, where a first resolution along a first dimension exceeds a second resolution along a second dimension, the printing system comprising: an encoder for encoding the input image signals to produce a bitmap image that is represented by a regular two-dimensional array of multi-bit image signals having a resolution in both dimensions that is equivalent to the second resolution; a first memory for storing the array of multi-bit image signals at the second resolution; a rotation circuit for rotating the multi-bit image signals stored in said first memory with respect to the orientation of the input image so as to produce a rotated image at the second resolution; a second memory for storing the image signals of the rotated image; a compact dot growth circuit, operating on the multi-bit image signals stored in said second memory, for generating output signals, each output signal generated in response to a gray multi-bit image signal having an exposure pulse positioned in response to the states of the multi-bit signal and adjacent multi-bit image signals; and an output engine for outputting an image representation in response to the high addressability signals generated by said compact dot growth circuit.
Claim 2
Dependent Claim
217 words
A printing system for rotating a high addressability binary bitmap received for printing, the bitmap including an anamorphic two-dimensional array of input image signals, where a first resolution along a first dimension exceeds a second resolution along a second dimension, the printing system comprising: an encoder for encoding the input image signals to produce a bitmap image that is represented by a regular two-dimensional array of multi-bit image signals having a resolution in both dimensions that is equivalent to the second resolution; a first memory for storing the array of multi-bit image signals at the second resolution; a rotation circuit for rotating the multi-bit image signals stored in said first memory with respect to the orientation of the input image so as to produce a rotated image at the second resolution; a second memory for storing the image signals of the rotated image; a compact dot growth circuit, operating on the multi-bit image signals stored in said second memory, for generating output signals, each output signal generated in response to a gray multi-bit image signal having an exposure pulse positioned in response to the states of the multi-bit signal and adjacent multi-bit image signals; and an output engine for outputting an image representation in response to the high addressability signals generated by said compact dot growth circuit.
Claim 3
Dependent Claim
36 words
The printing system of claim 1, wherein the output signals are high addressability n-bit signals, comprising: a 2-bit signal specifying the exposure pulse location; and an (n-2) bit pulse width signal specifying the exposure pulse duration.
Claim 4
Dependent Claim
68 words
The printing system of claim 1, wherein the encoder comprises: a latch for temporarily storing a plurality of input image signals in response to a clock signal and periodically writing the contents therein to a location in said first memory; and an address counter, operatively associated with said first memory, for uniquely indicating the address of the location in said first memory in response to the clock signal.
Claim 5
Dependent Claim
34 words
The printing system of claim 3, wherein the encoder further comprises a clock signal divider to divide the clock signal by a factor corresponding to the number of bits in the multi-bit image signal.
Claim 6
Dependent Claim
83 words
The printing system of claim 1, wherein the compact dot growth circuit comprises: a template matching circuit for receiving a plurality of neighboring multi-bit image signals from said second memory and comparing the signals against a predefined template pattern to identify a match therebetween, said template matching circuit generating an output code in response to such a match; and a look-up table, responsive to the output code generated by said template matching circuit, for generating the output signals to drive the output engine.
Claim 7
Dependent Claim
20 words
The printing system of claim 5, wherein the compact dot growth circuit is incorporated within an application specific integrated circuit.
Claim 8
Dependent Claim
20 words
The printing system of claim 5, wherein the compact dot growth circuit is incorporated within a programmable image processing system.
Claim 9
Dependent Claim
22 words
The printing system of claim 5, wherein the predefined template pattern represents a region of an image having an edge transition therein.
Claim 10
Dependent Claim
25 words
The printing system of claim 1, wherein said rotation circuit rotates the the multi-bit image signals stored in said first memory by multiples of 90°.
Claim 11
Independent Claim
219 words
A method, operating in a printing system for rotating a high addressability binary bitmap received for printing by the system, the bitmap including an anamorphic two-dimensional array of input image signals, where a first resolution along a dimension exceeds a second resolution along a second dimension, the method comprising the steps of: encoding the input image signals to produce a bitmap image that is represented by a regular two-dimensional array of multi-bit image signals having a resolution in both dimensions that is equivalent to the second resolution; storing the array of multi-bit image signals in a first memory at the second resolution; rotating the multi-bit image signals stored in the first memory in an increment of about 90° with respect to the orientation of the input image so as to produce a rotated image at the second resolution; storing the image signals of the rotated image in a second memory; in response to the multi-bit image signals stored in the second memory, generating high addressability binary signals, wherein each high addressability signal generated in response to a multi-bit image signal has an exposure pulse positioned in response to the states of the multi-bit signal and adjacent multi-bit image signals; and outputting an image representation in response to the the high addressability signals generated by said compact dot growth circuit.
Claim 12
Independent Claim
219 words
A method, operating in a printing system for rotating a high addressability binary bitmap received for printing by the system, the bitmap including an anamorphic two-dimensional array of input image signals, where a first resolution along a dimension exceeds a second resolution along a second dimension, the method comprising the steps of: encoding the input image signals to produce a bitmap image that is represented by a regular two-dimensional array of multi-bit image signals having a resolution in both dimensions that is equivalent to the second resolution; storing the array of multi-bit image signals in a first memory at the second resolution; rotating the multi-bit image signals stored in the first memory in an increment of about 90° with respect to the orientation of the input image so as to produce a rotated image at the second resolution; storing the image signals of the rotated image in a second memory; in response to the multi-bit image signals stored in the second memory, generating high addressability binary signals, wherein each high addressability signal generated in response to a multi-bit image signal has an exposure pulse positioned in response to the states of the multi-bit signal and adjacent multi-bit image signals; and outputting an image representation in response to the the high addressability signals generated by said compact dot growth circuit.
Claim 13
Dependent Claim
37 words
The method of claim 10, wherein the high addressability binary signals are n-bit signals, consisting essentially of: a 2-bit signal specifying the exposure pulse location; and an (n-2) bit pulse width signal specifying the exposure pulse duration.
Claim 14
Dependent Claim
97 words
The method of claim 10, wherein the encoding step comprises the steps of: temporarily storing, in a latch, a plurality of input image signals in response to a clock signal; periodically writing the values of at least two signals stored in the latch to a location in the first memory; dividing the clock signal by a factor corresponding to the number of bits in the multi-bit image signals; and uniquely indicating, with an address counter operatively associated with the first memory, the address of the location in said first memory in response to the divided clock signal.
Claim 15
Dependent Claim
80 words
The method of claim 10, wherein the step of generating high addressability binary signals comprises the steps of: retrieving a plurality of neighboring multi-bit image signals from the second memory and comparing the signals against a predefined template pattern to identify a match therebetween, and generating an output code in response to such a match; and using a look-up table responsive to the output code generated by said template matching circuit, generating the output signals to drive the output engine.
Claim 16
Independent Claim
138 words
A method, operating on a programmable computer, for rotating a binary input bitmap image in about 90° increments, said input bitmap image representing binary image signals at an N×M resolution, where N=P×M and where P is an integer that is greater than 1, said method comprising the steps of: encoding the N×M resolution image bitmap to produce a second, P-bit per pixel image bitmap at an M×M resolution; rotating the second bitmap; operating on the M×M rotated bitmap to identify those P-bit per pixel signals representing gray pixels therein and producing a third binary image bitmap, wherein exposure pulses for the third binary image bitmap are selectively repositioned within a pixel exposure period so that the pulses abut a pulse from an adjacent pixel period causing the resultant dot for the adjacent pixel period to enlarge upon development.
Claim 17
Independent Claim
138 words
A method, operating on a programmable computer, for rotating a binary input bitmap image in about 90° increments, said input bitmap image representing binary image signals at an N×M resolution, where N=P×M and where P is an integer that is greater than 1, said method comprising the steps of: encoding the N×M resolution image bitmap to produce a second, P-bit per pixel image bitmap at an M×M resolution; rotating the second bitmap; operating on the M×M rotated bitmap to identify those P-bit per pixel signals representing gray pixels therein and producing a third binary image bitmap, wherein exposure pulses for the third binary image bitmap are selectively repositioned within a pixel exposure period so that the pulses abut a pulse from an adjacent pixel period causing the resultant dot for the adjacent pixel period to enlarge upon development.
Claim 18
Dependent Claim
97 words
The method of claim 14, wherein said encoding step comprises the steps of: temporarily storing, in a latch, a plurality of input bitmap image signals in response to a clock signal; periodically writing the values of P-bit signals stored in the latch to a location in a first memory; dividing the clock signal by P; and uniquely indicating, with an address counter operatively associated with the first memory, the address of the location in said first memory in response to the divided clock signal so as to store the second bitmap image signals in the first memory.
Claim 19
Dependent Claim
118 words
The method of claim 15, wherein the step of operating on the M×M rotated bitmap to identify those P-bit per pixel signals representing gray pixels therein and producing a third binary image bitmap, wherein exposure pulses for the third input image bitmap are selectively repositioned within a pixel exposure period comprises the steps of: retrieving, from the first memory, a plurality of neighboring second image bitmap signals; comparing the plurality of neighboring second image bitmap signals against a predefined template pattern to identify a match therebetween, and generating an output code in response to such a match; and generating, using a look-up table responsive to the output code generated during said comparing step, the third binary image bitmap.
References Cited (Backward Citations)
US4467448A
Cited
US4716544A
Cited
US4975977A
Cited
US5012434A
Cited
US5124692A
Cited
US5404411A
Cited
US5359706A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-05-26 | 2000-11-25 | 2001-05-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-05-26 | 2004-11-25 | 2005-05-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-05-26 | 2008-11-25 | 2009-05-27 | $7700.00 | Window Closed / Lapsed |