← Back to Patent Explorer
US4596039A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for converting an image from a run end or run length representation to a bit map

Assignee: International Business Machines Corp
•
Filing: 1983-12-30
•
Granted: 1986-06-17
•
Expires: 2003-12-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for converting an image from a run representation to a bit map, includes the steps of: storing a plurality of run representations of an image in a buffer; initializing a line of data; converting, by table lookup, each run representation, in said line, to a picture element representation, storing said picture element representation of said line; repeating the steps of initializing, converting and storing for remaining run representations until said image has been converted to a bit map representation.

Inventors

  • 👤 Joan L. Mitchell
  • 👤 Karen L. Anderson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 05:19
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/46; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413; H04N1/419

Claims Analysis

Total Claims: 22
Claim 1
Independent Claim 170 words
A method for converting data representing a binary image from run representation form to bit map form, comprising the steps of: initializing to a first binary value all of the bits in an output area where the bit map is to be formed; storing data comprising a plurality of pairs of run representations of said image in a buffer, each of said pairs defining the beginning and the end of a run of image bits of a second binary value; converting each of said pairs of run representations stored in said buffer successively to strings of image bits of said second binary value; and transferring said strings of image bits of said second binary value to said output area into positions offset in accordance with the respective beginning positions of said strings as indicated by said run representations, such that said image data is converted to a bit map representation in said output area without the need for creating and transferring strings of image bits of said first binary value.
Claim 2
Independent Claim 170 words
A method for converting data representing a binary image from run representation form to bit map form, comprising the steps of: initializing to a first binary value all of the bits in an output area where the bit map is to be formed; storing data comprising a plurality of pairs of run representations of said image in a buffer, each of said pairs defining the beginning and the end of a run of image bits of a second binary value; converting each of said pairs of run representations stored in said buffer successively to strings of image bits of said second binary value; and transferring said strings of image bits of said second binary value to said output area into positions offset in accordance with the respective beginning positions of said strings as indicated by said run representations, such that said image data is converted to a bit map representation in said output area without the need for creating and transferring strings of image bits of said first binary value.
Claim 3
Dependent Claim 23 words
A method according to claim 1 wherein said step of converting comprises selecting by table lookup bit string representations for said run representations.
Claim 4
Dependent Claim 30 words
A method according to claim 1, further comprising the step of: assigning first and second address pointers to locate run representation data and bit string data during said transfer step.
Claim 5
Dependent Claim 20 words
A method according to claim 1 wherein said data further comprises a plurality of representations of lines of image data.
Claim 6
Dependent Claim 21 words
A method according to claim 1 wherein said output area is composed of bytes and said bytes are arranged in lines.
Claim 7
Dependent Claim 32 words
A method according to claim 5 wherein said step of initializing further comprises adding padding bits to at least one end of each of said lines in accordance with a preselected pattern.
Claim 8
Dependent Claim 15 words
A method according to claim 5 wherein said lines begin and end on byte boundaries.
Claim 9
Dependent Claim 12 words
A method according to claim 5 wherein said lines are arranged sequentially.
Claim 10
Dependent Claim 31 words
A method according to claim 5 further comprising omitting at least portions of certain of said strings of image bits which lie outside of a selected region within said output area.
Claim 11
Dependent Claim 13 words
A method according to claim 1 wherein said run representations comprise run ends.
Claim 12
Dependent Claim 13 words
A method according to claim 1 wherein said run representations comprise run lengths.
Claim 13
Dependent Claim 22 words
A method according to claim 1 wherein said data further comprises a representation of the length of said data in said buffer.
Claim 14
Dependent Claim 15 words
A method according to claim 1 wherein said data further comprises three zero run representations.
Claim 15
Dependent Claim 24 words
A method according to claim 1 wherein said data further comprises a copy of the last run representation at the end of said buffer.
Claim 16
Dependent Claim 40 words
A method according to claim 1 wherein said run representation pairs each comprise a first representation of a sequence of bits of said first bit value and a second representation of a sequence of bits of said second bit value.
Claim 17
Dependent Claim 178 words
Apparatus for converting data representing a binary image from run representation form to bit map form, comprising: output area means comprising a plurality of bits for storing said bit map; means for initializing to a first binary value all of said bits in said output area means; buffer means for storing data comprising a plurality of pairs of run representations of an image, each of said pairs defining the beginning and the end of a run of image bits of a second binary value; means for converting successive pairs of run representations stored in said buffer means to strings of image bits of said second binary value; and means for transferring said strings of image bits of said second binary value to said output area means into positions offset in accordance with the respective beginning positions of said strings as indicated by said run representations, such that said image data is converted to a bit map representation in said output area means without the need for creating and transferring strings of image bits of said first binary value.
Claim 18
Dependent Claim 178 words
Apparatus for converting data representing a binary image from run representation form to bit map form, comprising: output area means comprising a plurality of bits for storing said bit map; means for initializing to a first binary value all of said bits in said output area means; buffer means for storing data comprising a plurality of pairs of run representations of an image, each of said pairs defining the beginning and the end of a run of image bits of a second binary value; means for converting successive pairs of run representations stored in said buffer means to strings of image bits of said second binary value; and means for transferring said strings of image bits of said second binary value to said output area means into positions offset in accordance with the respective beginning positions of said strings as indicated by said run representations, such that said image data is converted to a bit map representation in said output area means without the need for creating and transferring strings of image bits of said first binary value.
Claim 19
Dependent Claim 24 words
Apparatus according to claim 16 wherein said means for converting further comprises table lookup means for selecting bit string representations for said run representations.
Claim 20
Dependent Claim 61 words
Apparatus according to claim 16 wherein said output area means is divided into bytes and said bytes are arranged in lines with said lines beginning and ending on byte boundaries; and said means for initializing further comprises means for assigning bit values to padding bits on at least one end of each of said lines in accordance with a preselected pattern.
Claim 21
Dependent Claim 26 words
Apparatus according to claim 16 further comprising means for assigning first and second address pointers to locate run representation data and bit string data during transfer.
Claim 22
Dependent Claim 32 words
Apparatus according to claim 16 further comprising means for omitting at least portions of certain of said strings of image bits which lie outside of a selected region within said output area.

References Cited (Backward Citations)

US4152697A Cited
US4233601A Cited
US4207599A Cited
US4327379A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1989-06-16 1989-12-16 1990-06-17 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1993-06-16 1993-12-16 1994-06-17 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1997-06-16 1997-12-16 1998-06-17 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag