Patent US4646356A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4646356A Expired / Lapsed US ⏱️ 0.0 years remaining

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

Assignee: International Business Machines Corp
•
Filing: 1984-06-29
•
Granted: 1987-02-24
•
Expires: 2004-06-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for converting an image from a bit map to a run end or run length representation includes the steps of: storing the image as a bit map representation; accessing for each byte in an image by a look-up table a selected routine, corresponding to such byte, from a number of routines for converting bit strings to run representations, wherein the look-up table accessed is selected in accordance with a color value of a preceding pixel binary bit; and executing the selected routine on the current byte to convert the bit string to a run representation; storing in a run representation buffer, as a count value, each run representation; repeating the above steps of accessing and executing for each byte and storing for each run of continuous color to the end of the image.

Inventors

  • 👤 Karen L. Anderson
  • 👤 Joan L. Mitchell
  • 👤 William B. Pennebaker
  • 👤 Gerald Goertzel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 21:20
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; 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: 13
Claim 1
Independent Claim 220 words
A computerized method for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said method comprising the steps of: (a) segmenting a first of said lines of said bit map into units of equal numbers of bits for use as lookup table indices; (b) creating a lookup table which contains, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) converting said first line of said image to run representation form by the steps of: (1) using a first unit of said lines as an index into said lookup table to access the conversion routine corresponding to such unit; (2) selecting a conversion routine according to said lookup table contents; (3) executing the selected conversion routine to convert said unit to run representation form; (4) storing any resulting run representations in a run representation buffer, as a count value; and (5) repeating said steps (1), (2), (3) and (4) for successive units until all of the units in said first line have been stored in run representation form in said run representation buffer; and (d) repeating the steps of segmenting and converting for successive lines to the end of the image.
Claim 2
Dependent Claim 220 words
A computerized method for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said method comprising the steps of: (a) segmenting a first of said lines of said bit map into units of equal numbers of bits for use as lookup table indices; (b) creating a lookup table which contains, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) converting said first line of said image to run representation form by the steps of: (1) using a first unit of said lines as an index into said lookup table to access the conversion routine corresponding to such unit; (2) selecting a conversion routine according to said lookup table contents; (3) executing the selected conversion routine to convert said unit to run representation form; (4) storing any resulting run representations in a run representation buffer, as a count value; and (5) repeating said steps (1), (2), (3) and (4) for successive units until all of the units in said first line have been stored in run representation form in said run representation buffer; and (d) repeating the steps of segmenting and converting for successive lines to the end of the image.
Claim 3
Dependent Claim 65 words
A method according to claim 1 wherein the step of creating a lookup table comprises creating first and second lookup tables which contain, for each possible unit used as an index value, the address of a routine which converts said unit to run representation form given that the last image bit in the previously converted unit was of a first or second binary value, respectively.
Claim 4
Dependent Claim 58 words
A method according to claim 2 wherein the step of repeating for successive units in a line further includes: indexing said first lookup table with a successive unit if the preceding image bit has a first binary value; and indexing said second lookup table with a successive unit if the preceding image bit has a secondary binary value.
Claim 5
Dependent Claim 43 words
A method according to claim 1 further comprising the steps of: accessing a trellis routine for a preselected subset of units; and executing a bit by bit conversion on said preselected subset to convert its units from bit string to run representation form.
Claim 6
Dependent Claim 66 words
A method according to claim 4, further including the step of: inputting a successive unit to a first starting point in said trellis routine if a last image bit in the preceding unit has a first binary value; and inputting a successive unit to a second tarting point in said trellis routine if a last image bit in the preceding unit has a second binary value.
Claim 7
Dependent Claim 232 words
Apparatus for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said apparatus comprising: (a) means for segmenting a first of said lines of said bit map into units of equal numbers of bits for use as lookup table indices; (b) lookup table means for containing, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) means for converting the first line of said image to run representation form comprising: (1) indexing means for successively using each unit as an index into said lookup table means to access the respective conversion routine corresponding to each unit; (2) selection means for selecting a conversion routine according to said lookup table contents; (3) means for executing the selected respective conversion routines to convert said units to run representations; (4) run representation buffer means for storing each run representation as a count value; and means for activating said indexing means and said executing means until all of said units in said first line have been stored in run representation form in said run representation buffer means; and (d) means for activating said segmenting and converting means to operate on successive lines to the end of the image, whereby said image is stored in run representation form.
Claim 8
Dependent Claim 232 words
Apparatus for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said apparatus comprising: (a) means for segmenting a first of said lines of said bit map into units of equal numbers of bits for use as lookup table indices; (b) lookup table means for containing, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) means for converting the first line of said image to run representation form comprising: (1) indexing means for successively using each unit as an index into said lookup table means to access the respective conversion routine corresponding to each unit; (2) selection means for selecting a conversion routine according to said lookup table contents; (3) means for executing the selected respective conversion routines to convert said units to run representations; (4) run representation buffer means for storing each run representation as a count value; and means for activating said indexing means and said executing means until all of said units in said first line have been stored in run representation form in said run representation buffer means; and (d) means for activating said segmenting and converting means to operate on successive lines to the end of the image, whereby said image is stored in run representation form.
Claim 9
Dependent Claim 67 words
Apparatus according to claim 6 wherein said lookup table means comprises a first and a second lookup table; and said indexing means further comprises: means for indexing said first lookup table with a successive unit if the preceding image bit has a first binary value; and means for indexing said second lookup table with a successive unit if the preceding image bit has a second binary value.
Claim 10
Dependent Claim 42 words
Apparatus according to claim 6 further comprising: means for accessing a trellis routine for a preselected subset of units; and means for executing a bit by bit conversion on said preselected subset to convert its units from bit string to run representation.
Claim 11
Dependent Claim 65 words
Apparatus according to claim 8 further comprising: means for inputting a successive unit to a first starting point in said trellis routine if a last image bit in the preceding unit has first binary value; and means for inputting a successive unit to a second starting point in said trellis routine if a last image bit in the preceding unit has a second binary value.
Claim 12
Dependent Claim 293 words
A computerized method for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said method comprising the steps of: (a) segmenting a first of said lines of said bit map into units of equal numbers of bits for use in indexing lookup tables; (b) creating first and second lookup tables that contain, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) converting the first line of said image to run representation form by the steps of: (1) using a first unit of said line as an index into said first lookup table to access the conversion routine corresponding to such unit; (2) selecting a conversion routine according to said lookup table contents; (3) executing the selected conversion routine to convert said first unit to run representation form; (4) using the next unit of said line as an index to said first lookup table if the preceding image bit has a first binary value, or indexing it to said second lookup table if the preceding image bit has a second binary value, to access the conversion routine corresponding to said next unit; (5) executing the selected conversion routine to convert said next unit to run representation form; (6) storing each resulting run representation in a run representation buffer, as a count value; and (7) repeating said steps (4), (5) and (6) for successive units until all of the units in said first line have been stored in run representation form in said run representation buffer; and (d) repeating the steps of line segmenting and converting for successive lines to the end of the image.
Claim 13
Dependent Claim 293 words
A computerized method for converting an image stored as a bit map in binary form to a run representation form, said bit map having a plurality of lines, said method comprising the steps of: (a) segmenting a first of said lines of said bit map into units of equal numbers of bits for use in indexing lookup tables; (b) creating first and second lookup tables that contain, for each possible unit used as an index value, the address of a conversion routine which converts said unit to run representation form; (c) converting the first line of said image to run representation form by the steps of: (1) using a first unit of said line as an index into said first lookup table to access the conversion routine corresponding to such unit; (2) selecting a conversion routine according to said lookup table contents; (3) executing the selected conversion routine to convert said first unit to run representation form; (4) using the next unit of said line as an index to said first lookup table if the preceding image bit has a first binary value, or indexing it to said second lookup table if the preceding image bit has a second binary value, to access the conversion routine corresponding to said next unit; (5) executing the selected conversion routine to convert said next unit to run representation form; (6) storing each resulting run representation in a run representation buffer, as a count value; and (7) repeating said steps (4), (5) and (6) for successive units until all of the units in said first line have been stored in run representation form in said run representation buffer; and (d) repeating the steps of line segmenting and converting for successive lines to the end of the image.

References Cited (Backward Citations)

US3739085A Cited
US4121259A Cited
US4555802A Cited
US4610027A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1990-02-23 1990-08-25 1991-02-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1994-02-23 1994-08-25 1995-02-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1998-02-23 1998-08-25 1999-02-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag