US6301397B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Systems and methods for rotating high addressability images
Assignee: Xerox Corp
•
Filing: 1998-12-30
•
Granted: 2001-10-09
•
Expires: 2018-12-30
Abstract
Abstract Image rotation systems and methods optimally rotate high addressability binary images in a compact manner. High addressability bit pixels are clustered to form multi-bit pixels. The multi-bit pixel image is rotated +/−90°. A pixel mapping method is employed that realigns high addressability pixels within each target group of pixels in a manner that maintains edge integrity, maintains density, and does not introduce additional false contours. Information regarding neighboring pixel values is used to determine edge information about a given high addressability target pixel group. The edge information includes an edge slope and edge location of the high addressability target pixel group. Based on the rotation angle and the edge information of the pixel group, the target high addressability pixel group is mapped to a preferred pattern. After mapping to a preferred pattern, the high addressability pixel group is rotated.
Inventors
- 👤 Henry P. Jankowski
- 👤 David Glassman
- 👤 Robert P. Loce
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:27
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/60; G06T3/606; H; H04; H04N; H04N1/00; H04N1/387; H04N1/3877
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
95 words
A method for rotating a high addressability binary image having high addressability pixels, the method comprising: converting the high addressability pixels in the high addressability binary image to multi-bit pixels, the multi-bit pixels forming a multi-bit pixel image; determining neighborhood information about selected multi-bit pixels in the multi-bit pixel image; mapping selected multi-bit pixels to modified multi-bit pixels using the neighborhood information to generate a modified multi-bit pixel image; rotating the modified multi-bit pixel image; and re-defining the rotated modified multi-bit pixel image to form a rotated high addressability binary image having high addressability pixels.
Claim 2
Independent Claim
95 words
A method for rotating a high addressability binary image having high addressability pixels, the method comprising: converting the high addressability pixels in the high addressability binary image to multi-bit pixels, the multi-bit pixels forming a multi-bit pixel image; determining neighborhood information about selected multi-bit pixels in the multi-bit pixel image; mapping selected multi-bit pixels to modified multi-bit pixels using the neighborhood information to generate a modified multi-bit pixel image; rotating the modified multi-bit pixel image; and re-defining the rotated modified multi-bit pixel image to form a rotated high addressability binary image having high addressability pixels.
Claim 3
Dependent Claim
44 words
The method according to claim 1 , wherein converting the high addressability pixels in the high addressability binary image to multi-bit pixels includes: observing a neighborhood of high addressability pixels; and clustering the observed neighborhood of high addressability pixels to form a multi-bit pixel.
Claim 4
Dependent Claim
35 words
The method according to claim 2 , wherein, when the high addressability image has A-by high addressability, observing a neighborhood of high addressability pixels includes using an A-by-1 observation window, where A is an integer.
Claim 5
Dependent Claim
47 words
The method according to claim 1 , wherein determining neighborhood information about selected multi-bit pixels in the multi-bit pixel image comprises: observing a neighborhood of multi-bit pixels for each of the selected multi-bit pixels; and generating the neighborhood information based on the observed neighborhood of multi-bit pixels.
Claim 6
Dependent Claim
22 words
The method according to claim 4 , wherein the neighborhood of multi-bit pixels is observed using a 3×3 multi-bit pixel observation window.
Claim 7
Dependent Claim
14 words
The method according to claim 4 , wherein the neighborhood information is edge information.
Claim 8
Dependent Claim
14 words
The method according to claim 6 , wherein the edge information includes gradient information.
Claim 9
Dependent Claim
32 words
The method according to claim 7 , wherein determining the gradient information comprises: observing a multi-bit pixel above each selected multi-bit pixel; and observing a multi-bit pixel below each selected multi-bit pixel.
Claim 10
Dependent Claim
31 words
The method according to claim 8 , wherein generating the neighborhood information based on the observed neighborhood of multi-bit pixels includes determining if a boundary exists adjacent each selected multi-bit pixel.
Claim 11
Dependent Claim
33 words
The method according to claim 9 , wherein generating the neighborhood information based on the observed neighborhood of multi-bit pixels includes determining, if a boundary exists, if the boundary is positive or negative.
Claim 12
Dependent Claim
15 words
The method according to claim 6 , wherein the edge information includes black edge information.
Claim 13
Dependent Claim
39 words
The method according to claim 11 , wherein determining the black edge information comprises: observing a multi-bit pixel to the right of each selected multi-bit pixel; and observing a multi-bit pixel to the left of each selected multi-bit pixel.
Claim 14
Dependent Claim
22 words
The method according to claim 4 , wherein the neighborhood information includes multi-bit pixel values of the multi-bit pixels in the neighborhood.
Claim 15
Dependent Claim
24 words
The method according to claim 13 , wherein each neighborhood comprises a selected multi-bit pixel and 4 multi-bit pixels surrounding the selected multi-bit pixel.
Claim 16
Dependent Claim
46 words
The method according to claim 14 , wherein, for each neighborhood, generating the neighborhood information based on the observed neighborhood of multi-bit pixels comprises: combining image information from each of the multi-bit pixels in the neighborhood; and concatenating the image information to form a multi-bit word.
Claim 17
Dependent Claim
25 words
The method according to claim 15 , wherein the high addressability binary image possesses 4× high addressability, and the multi-bit word is a 20-bit word.
Claim 18
Dependent Claim
22 words
The method according to claim 1 , wherein the high addressability binary image possesses A-by high addressability, where A is an integer.
Claim 19
Dependent Claim
25 words
The method according to claim 17 , wherein each multi-bit pixel contains image information from A high addressability binary pixels, where A is an integer.
Claim 20
Dependent Claim
44 words
The method according to claim 1 , wherein mapping selected multi-bit pixels using the neighborhood information to generate a modified multi-bit pixel image comprises: inputting the neighborhood information into a template operator; and extracting a corresponding modified multi-bit pixel based on the neighborhood information.
Claim 21
Dependent Claim
15 words
The method according to claim 19 , wherein the template operator is a look-up table.
Claim 22
Dependent Claim
18 words
The method according to claim 20 , wherein a degree of rotation is input into the look-up table.
Claim 23
Dependent Claim
21 words
The method according to claim 21 , wherein the degree of rotation is at least one of 90°, 180°, and 270°.
Claim 24
Dependent Claim
16 words
The method according to claim 19 , wherein the template operator is a Boolean logic circuit.
Claim 25
Dependent Claim
16 words
The method according to claim 1 , wherein the multi-bit pixel image is an isomorphic image.
Claim 26
Dependent Claim
97 words
An image rotation system that rotates a high addressability binary image, the image rotation system comprising: an image clustering circuit that clusters the high addressability binary image to generate a multi-bit pixel image; a pixel parameter determining circuit that determines multi-bit pixel parameter information in the multi-bit pixel image; a pixel mapping circuit that converts the multi-bit pixel image to a modified multi-bit pixel image; an image rotation circuit that rotates the modified multi-bit pixel image; and a high addressability definition circuit that converts the rotated modified multi-bit pixel image into a rotated high addressability binary image.
Claim 27
Dependent Claim
97 words
An image rotation system that rotates a high addressability binary image, the image rotation system comprising: an image clustering circuit that clusters the high addressability binary image to generate a multi-bit pixel image; a pixel parameter determining circuit that determines multi-bit pixel parameter information in the multi-bit pixel image; a pixel mapping circuit that converts the multi-bit pixel image to a modified multi-bit pixel image; an image rotation circuit that rotates the modified multi-bit pixel image; and a high addressability definition circuit that converts the rotated modified multi-bit pixel image into a rotated high addressability binary image.
Claim 28
Dependent Claim
35 words
The image rotation system according to claim 25 , wherein the pixel parameter determining circuit comprises at least one of: a pixel value determining circuit; a gradient determining circuit; and a black edge determining circuit.
Claim 29
Dependent Claim
11 words
A printer comprising the image rotation system of claim 26 .
Claim 30
Dependent Claim
12 words
A personal computer comprising the image rotation system of claim 26 .
Claim 31
Dependent Claim
12 words
A facsimile machine comprising the image rotation system of claim 26 .
References Cited (Backward Citations)
US4437122A
Cited
US4437122B1
Cited
US4630125A
Cited
US4847641A
Cited
US5005139A
Cited
US5027078A
Cited
US4933689A
Cited
US5226094A
Cited
US5383086A
Cited
US5325216A
Cited
US5274472A
Cited
US5237646A
Cited
US5506699A
Cited
US5521989A
Cited
US5383036A
Cited
US5353127A
Cited
US5387985A
Cited
US5579445A
Cited
US5696845A
Cited
US5528384A
Cited
US5659634A
Cited
US5666470A
Cited
US5742703A
Cited
US5634088A
Cited
US5768432A
Cited
US5809177A
Cited
US5758034A
Cited
US5862305A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-10-08 | 2005-04-09 | 2005-10-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-10-08 | 2009-04-09 | 2009-10-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-10-08 | 2013-04-09 | 2013-10-09 | $7700.00 | Window Closed / Lapsed |