US5095512A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for manipulating image data employing an intermediate format
Assignee: NETEXPRESS SYSTEMS INC (A NEVADA CORPORATION)
•
Filing: 1988-10-24
•
Granted: 1992-03-10
•
Expires: 2008-10-24
Abstract
Abstract Bit-mapped and compressed image data are converted one another through an intermediate image data or code form wherein each image is represented by a list of sublists, each sublist being itself a list of numerical values representing run lengths transistions from one type of picture element (pel) to a second and opposite type of picture element (pel) (e.g., a black pel and a white pel). Hence the intermediate code data structure according to the invention is termed a transition list or TL code or data structure. The data structure and coding rules are defined by rules relating to code type, code word length and code word interdependence. A specific conversion process specifies that the transition list be composed of sublists wherein each represents a scan line. The preferred form of intermediate code is a fixed word-length transition list, that is, a serial list of values representing run lengths of either "black" picture elements or "white" picture elements stored serially in digital data format having a fixed word length.
Inventors
- 👤 Lawrence G. Roberts
- 👤 Dennis L. Hunt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 10:55
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/005; H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/413
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
148 words
A method for converting a first image described by a first graphic image code to a corresponding second image described by a second graphics image code, said first graphics image code and said second graphics image code lacking a one-to-one code word conversion correspondence, said method comprising: analyzing said first graphics image code representing said first image to identify a first scan line representation for each scan line of said first graphics image code; converting said first scan line representation into a line of code of a translation code, which is a scan line code having a variable length and formed of defined number of fixed length code words; accumulating a sufficient number of said line codes of said translation code to construct a translation unit of said second graphics image code; and constructing from said translation unit said second image described by said second graphics image code.
Claim 2
Independent Claim
148 words
A method for converting a first image described by a first graphic image code to a corresponding second image described by a second graphics image code, said first graphics image code and said second graphics image code lacking a one-to-one code word conversion correspondence, said method comprising: analyzing said first graphics image code representing said first image to identify a first scan line representation for each scan line of said first graphics image code; converting said first scan line representation into a line of code of a translation code, which is a scan line code having a variable length and formed of defined number of fixed length code words; accumulating a sufficient number of said line codes of said translation code to construct a translation unit of said second graphics image code; and constructing from said translation unit said second image described by said second graphics image code.
Claim 3
Dependent Claim
25 words
The method according to claim 1 wherein said translation code comprises a list of transitions between black and white picture elements for each scan line.
Claim 4
Dependent Claim
23 words
The method according to claim 2 wherein said transition list includes a list of run lengths of pels in fixed length code words.
Claim 5
Independent Claim
161 words
An apparatus for converting a first image described by a first graphics image code to a co responding second image described by a second graphics image code, said first graphics image code and said second graphics image code lacking a one-to-one word conversion correspondence, said apparatus comprising: means for analyzing said first graphics image code representing said first image to identify a first scan line representation for each scan line of said first graphics image code; means for converting said first scan line representation into a line of code of a translation code, which is a scan line code having a variable length and formed of a defined number o fixed length code words; means for storing in an ordered manner a sufficient number of said line codes of said translation code to construct a translation unit of said second graphics image code; and means for constructing from said translation unit said second image described by said second graphics image code.
Claim 6
Independent Claim
161 words
An apparatus for converting a first image described by a first graphics image code to a co responding second image described by a second graphics image code, said first graphics image code and said second graphics image code lacking a one-to-one word conversion correspondence, said apparatus comprising: means for analyzing said first graphics image code representing said first image to identify a first scan line representation for each scan line of said first graphics image code; means for converting said first scan line representation into a line of code of a translation code, which is a scan line code having a variable length and formed of a defined number o fixed length code words; means for storing in an ordered manner a sufficient number of said line codes of said translation code to construct a translation unit of said second graphics image code; and means for constructing from said translation unit said second image described by said second graphics image code.
Claim 7
Dependent Claim
25 words
The apparatus according to claim 4 wherein said translation code comprises a list of transitions between black and white picture elements for each scan line.
Claim 8
Dependent Claim
23 words
The apparatus according to claim 5 wherein said transition list includes a list of run lengths of pels in fixed length code words.
Claim 9
Dependent Claim
27 words
The method according to claim 1 including the step of processing said translation code to manipulate the source of said second image before constructing said second image.
Claim 10
Dependent Claim
27 words
The method according to claim 4 including the step of processing said translation code to manipulate the source of said second image before constructing said second image.
Claim 11
Dependent Claim
26 words
The method according to claim 2 wherein each transition list has a first transition list code word specifying the number of said transitions per scan line.
Claim 12
Dependent Claim
26 words
The method according to claim 5 wherein each transition list has a first transition list code word specifying the number of said transitions per scan line.
References Cited (Backward Citations)
US4876607A
Cited
US4602383A
Cited
US4610027A
Cited
US4646356A
Cited
US4783834A
Cited
US4858017A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-03-10 | 1995-09-09 | 1996-03-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-03-10 | 1999-09-09 | 2000-03-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-03-10 | 2003-09-09 | 2004-03-10 | $7700.00 | Window Closed / Lapsed |