EP0179204A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Improved method for reducing a binary image
Assignee: International Business Machines Corp
•
Filing: 1985-07-30
•
Granted: —
•
Expires: 2005-07-30
Abstract
Abstract An improved method of reducing a binary digital image in size by a factor F by storing the image in bit sequence; removing one or more rows of bits along the vertical axis of the image to convert i rows of bits to j rows of bits where 0.5i<=j<i; modifying a line adjacent to each line discarded to preserve selected information from the discarded line; repeating the steps of removing and modifying a predetermined number of times to achieve a reduction by a factor F1 along the vertical axis; rotating the image in a first direction by ninety degrees; removing one or more rows of bits along the original horizontal axis of the image to convert i rows of bitstoj rows of bits where 0.5i<=j<i; modifying a line adjacent to each line discarded to preserve selected information from the discarded line; repeating the steps of removing and modifying a predetermined number of times to achieve a reduction by a factor F2 along the original horizontal axis; rotating the image back to its original orientation; storing the reduced size image generated by the above steps.
Inventors
- 👤 Karen Louise Anderson
- 👤 Frederick Cole Mintzer
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-28 11:19
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/387; H04N1/393; H04N1/3935; G; G06; G06T; G06T3/00; G06T3/40; G06T3/4023
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
146 words
A method for reducing, by a rational factor, up to and including two, along a selected axis relative to the image as intended to be displayed, a binary digital image notionally formed of a plurality of stacked lines of pels and processed in the form of an equal plurality of bits organised in lines, comprising the steps of: rotating, including a nul rotation, by remapping, the bit form of the image so that the bit lines are reformed parallel to the selected axis; removing one or more lines of bits in a regularly interleaved manner of the existing remapped lines to an extent that the ratio of the original lines to the remaining lines is equal to the rational factor; remapping, including a nul remapping, the reduced bit set to align with a required axis relative to the image as it is intended to be displayed.
Claim 2
Independent Claim
146 words
A method for reducing, by a rational factor, up to and including two, along a selected axis relative to the image as intended to be displayed, a binary digital image notionally formed of a plurality of stacked lines of pels and processed in the form of an equal plurality of bits organised in lines, comprising the steps of: rotating, including a nul rotation, by remapping, the bit form of the image so that the bit lines are reformed parallel to the selected axis; removing one or more lines of bits in a regularly interleaved manner of the existing remapped lines to an extent that the ratio of the original lines to the remaining lines is equal to the rational factor; remapping, including a nul remapping, the reduced bit set to align with a required axis relative to the image as it is intended to be displayed.
Claim 3
Dependent Claim
106 words
A method as claimed in claim 1, including storing the processing form of the image in bit sequence; deleting the first line if the reduction factor is two; then and or initialising a rounter, so that a first number of lines are copied before a line is deleted; examining each input line; incrementing the counter each time a line is examined; deleting a line in the image and decrementing the counter if the value in the counter is greater than a fixed threshold; repeating the steps of incrementing and deleting until no more input lines remain: and storing the reduced image generated by the above steps.
Claim 4
Independent Claim
147 words
A method for reducing a binary digital image comprising the steps of: storing the image in bit sequence; removing one or more rows of bits along a first axis of the image to convert i rows of bits to j rows of bits where 0.5i<= j < i; repeating the step of removing a predetermined number of times to achieve a reduction by a factor Fl along the first axis; rotating the image in a first direction by ninety degrees; removing one or more rows of bits along a second axis of the image to convert i rows of bits to j rows of bits where 0.5i<=j<i; repeating the step of removing a predetermined number of times to achieve a reduction by a factor F2 along the second axis; rotating the image back to its original orientation; storing the reduced size image generated by the above steps.
Claim 5
Independent Claim
147 words
A method for reducing a binary digital image comprising the steps of: storing the image in bit sequence; removing one or more rows of bits along a first axis of the image to convert i rows of bits to j rows of bits where 0.5i<= j < i; repeating the step of removing a predetermined number of times to achieve a reduction by a factor Fl along the first axis; rotating the image in a first direction by ninety degrees; removing one or more rows of bits along a second axis of the image to convert i rows of bits to j rows of bits where 0.5i<=j<i; repeating the step of removing a predetermined number of times to achieve a reduction by a factor F2 along the second axis; rotating the image back to its original orientation; storing the reduced size image generated by the above steps.
Claim 6
Independent Claim
29 words
A method as claimed in any preceding claim, further comprising the step of: modifying a line adjacent to each line deleted to preserve selected information from the deleteed line.
Claim 7
Dependent Claim
45 words
A method as claimed in any preceding claim 1, wherein the step of storing the reduced image further comprises: assigning the reduced image to an area of storage beginning at the same position as the area of storage in which the image was originally stored.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.