Patent US964838A successfully refreshed from Google Patents.
EP0179205A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Improved method for enlarging a binary image
Assignee: International Business Machines Corp
•
Filing: 1985-07-30
•
Granted: —
•
Expires: 2005-07-30
Abstract
Abstract A method for enlarging a binary image by an arbitrary factor includesthe steps of storing the image in bitsequence; rotating the image in a first direction by ninety degrees; inserting one or more rows of expansion bits along the original horizontal axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated bythe above step; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor F1 along the original horizontal axis; rotating the image in a second direction opposite the first direction by ninety degrees; inserting one or more rows of expansion bits along the vertical axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated by the above step; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor F2 along the vertical axis; storing the enlarged image generated by the above steps.
Inventors
- 👤 Karen Louise Anderson
- 👤 Frederic Cole Mintzer
- 👤 Gerald Goertzel
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 22:48
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: 6
Claim 1
Independent Claim
170 words
A method for enlarging, 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; inserting one or more lines of bits in a regularly interleaved manner between the existing remapped lines to an extent that the ratio of the existing and inserted lines to the existing lines is equal to the rational factor; calculating the values of the inserted bits from the context surrounding each of the bits and adjusting the inserted values accordingly; and remapping, including a nul remapping, the expanded bit set to align with a required axis relative to the image as it is intended to be displayed.
Claim 2
Independent Claim
170 words
A method for enlarging, 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; inserting one or more lines of bits in a regularly interleaved manner between the existing remapped lines to an extent that the ratio of the existing and inserted lines to the existing lines is equal to the rational factor; calculating the values of the inserted bits from the context surrounding each of the bits and adjusting the inserted values accordingly; and remapping, including a nul remapping, the expanded bit set to align with a required axis relative to the image as it is intended to be displayed.
Claim 3
Dependent Claim
119 words
A method as claimed in claim 1, including storing the processing form of the image in bit sequence; initialising a counter, so that a first number of lines are copied after a last blank line is inserted; examining each input line; incrementing the counter as each input line is examined; inserting a line in the image and decrementing the counter if the value of the counter is greater than a fixed threshold; assigning values to all bits in each inserted line; repeating the steps of incrementing, inserting, and assigning until no more input lines remain; replicating a final input line if enlargement by a factor of 2.0 is required; and storing the enlarged image generated by the above steps.
Claim 4
Independent Claim
201 words
A method for enlarging a binary digital image notionally formed of a plurality of stacked rows of pels and processed in the form of an equal plurality of bits comprising the steps of: storing the image in bit sequence; rotating the image in a first direction by ninety degrees; inserting one or more rows of expansion bits along a first axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated by the above steps; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor Fl along the first axis; rotating the image in a second direction opposite the first direction by ninety degrees; inserting one or more rows of expansion bits along a second axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated by the above steps; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor F2 along the second axis; and storing the enlarged image generated by the above steps.
Claim 5
Independent Claim
201 words
A method for enlarging a binary digital image notionally formed of a plurality of stacked rows of pels and processed in the form of an equal plurality of bits comprising the steps of: storing the image in bit sequence; rotating the image in a first direction by ninety degrees; inserting one or more rows of expansion bits along a first axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated by the above steps; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor Fl along the first axis; rotating the image in a second direction opposite the first direction by ninety degrees; inserting one or more rows of expansion bits along a second axis of the image to convert i rows of bits to j rows of bits where i]j]=2i; assigning a value to each expansion bit generated by the above steps; repeating the steps of inserting and assigning a predetermined number of times to achieve an enlargement by a factor F2 along the second axis; and storing the enlarged image generated by the above steps.
Claim 6
Independent Claim
82 words
A method according to any preceding claim, wherein, in the step of storing the enlarged image assigns it to an area of storage beginning at the same position as the area of storage in which the image was originally stored. 5. A method according to any one of claims 1 to 3, wherein, in the step of storing the enlarged image, it is assigned to an area of storage separate from an 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.