US4189711A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multilevel processing of image signals
Assignee: AT&T Inc
•
Filing: 1977-11-08
•
Granted: 1980-02-19
•
Expires: 1997-11-08
Abstract
Abstract A graphic arts image comprising a plurality of regions, each region having a characteristic multilevel intensity, hue, texture or the like, is sampled and coded using samples along two consecutive scan lines. Individual code words are generated for the beginning, or head, of each run defining the start of a vein or boundary of a region of contiguous like-valued samples along each line and other code words are used for connecting information relating to samples on adjacent lines defining continuations of the boundary for the same region. Other code words identify the characteristic intensity or the like of the region, and a final type of code word identifies the end of the vein. Because the present method and apparatus advantageously codes each internal boundary between adjacent regions only once, an increase of efficiency by a factor approaching two is realized over techniques previously used.
Inventors
- 👤 Amalie J. Frank
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 13:35
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/20
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
138 words
Apparatus for coding a two-dimensional information field having a plurality of regions, each region having one of a plurality of different graphical values, comprising scanning means for generating for each scanned region a first binary electric code representative of the length of a constant-value run along a scanning path spanning said field, means for generating for each region a second binary electric code representative of the graphical value of said region, means for generating for any other scanning path spanning said field and passing through said region a third binary electric code representative of the connectivity of a constant-value run along said other scanning paths to a constant-value run along an adjacent scanning path, and means for generating for each region a fourth binary electric code representative of the end of the last scanning path spanning said region.
Claim 2
Dependent Claim
138 words
Apparatus for coding a two-dimensional information field having a plurality of regions, each region having one of a plurality of different graphical values, comprising scanning means for generating for each scanned region a first binary electric code representative of the length of a constant-value run along a scanning path spanning said field, means for generating for each region a second binary electric code representative of the graphical value of said region, means for generating for any other scanning path spanning said field and passing through said region a third binary electric code representative of the connectivity of a constant-value run along said other scanning paths to a constant-value run along an adjacent scanning path, and means for generating for each region a fourth binary electric code representative of the end of the last scanning path spanning said region.
Claim 3
Dependent Claim
60 words
The apparatus of claim 1, wherein said scanning paths spanning said field are parallel scan lines, and wherein said means for generating said first, second, third and fourth binary electric codes for each region comprises means for sequentially examining said binary electric code representations of said scan lines starting with a binary electric code representation of a reference scan line.
Claim 4
Dependent Claim
30 words
The apparatus of claim 2 wherein said means for examining comprises means for storing binary electric signals representative of said graphical values for successive points along n adjacent scan lines.
Claim 5
Dependent Claim
7 words
Apparatus according to claim 3 wherein n=2.
Claim 6
Dependent Claim
34 words
Apparatus according to claim 4 wherein said means for examining includes shift register means for comparing the binary bit positions of said binary electric coded representations of like-valued runs on two successive scan lines.
Claim 7
Dependent Claim
32 words
Apparatus according to claim 3 further comprising means for defining new regions which are fragments of other regions, and means for encoding said new regions in the same manner as other regions.
Claim 8
Dependent Claim
149 words
A machine method for coding a two-dimensional information field having a plurality of regions, each region having one of a plurality of different graphical values, comprising the steps of scanning said two-dimensional information field in successive lines to generate electrical signals representing said plurality of graphical values, generating for each region a first binary electric code representative of the length of a constant-value run along a scanning path spanning said field, generating for each region a second binary electric code representative of the graphical value of said region, generating for any other scanning path spanning said field and passing through said region a third binary electric code representative of the connectivity of a run along said other scanning paths to a run along an adjacent scanning path, and generating a fourth binary electric code for each region representative of the end of the last scanning path spanning said region.
Claim 9
Dependent Claim
149 words
A machine method for coding a two-dimensional information field having a plurality of regions, each region having one of a plurality of different graphical values, comprising the steps of scanning said two-dimensional information field in successive lines to generate electrical signals representing said plurality of graphical values, generating for each region a first binary electric code representative of the length of a constant-value run along a scanning path spanning said field, generating for each region a second binary electric code representative of the graphical value of said region, generating for any other scanning path spanning said field and passing through said region a third binary electric code representative of the connectivity of a run along said other scanning paths to a run along an adjacent scanning path, and generating a fourth binary electric code for each region representative of the end of the last scanning path spanning said region.
Claim 10
Dependent Claim
58 words
The method of claim 7 wherein said paths scanning spanning said field are parallel scan lines, and wherein said steps of claim 7 comprise comparing the positions in each said scan line of like-valued runs for each of a plurality of successive scan lines and generating said first, second, third and fourth codes in response to said comparing.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1983-02-18 | 1983-08-20 | 1984-02-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1987-02-18 | 1987-08-20 | 1988-02-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1991-02-18 | 1991-08-20 | 1992-02-19 | $7700.00 | Window Closed / Lapsed |