Patent US4463386A successfully refreshed from Google Patents.
US4463386A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Facsimile data reduction
Assignee: International Business Machines Corp
•
Filing: 1982-05-03
•
Granted: 1984-07-31
•
Expires: 2002-05-03
Abstract
Abstract Facsimile or other data to be reduced is scanned and segmented into blocks of isolated figures. The figures are compared to stored templates. If no match is found, the figure remains in place. If a match is found, the figure is erased, i.e., the block is reduced to white. When recognized figures have been erased, the residual image is transmitted using an efficient known two-dimensional encoding compression technique. The locations of figures are specified by inserting identifying data in the data stream at a point corresponding a point on the figure, the preferred point being the lower right-hand corner. If not a recognized template, the receiving end can extract the figure constructed from the data stream and store it in its template memory. If a figure is a recognized template, it is extracted from the receiving end's template memory using the identifying data and inserted into the reconstructed residual image.
Inventors
- 👤 Robert D. Goddard
- 👤 Robert R. Schomburg
- 👤 Wayne L. Wohler
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 06:10
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/41; H04N1/411; H04N1/4115; G; G06; G06V; G06V10/00; G06V10/70; G06V10/74; G06V10/75; G06V10/751
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
136 words
Apparatus for encoding a two-dimensional graphic image comprising the combination of: means for converting said graphic image to a representative binary matrix; means for segmenting contiguous groups of like elements in said binary matrix into binary submatrices; means for storing identifiable binary submatrices as templates; means for comparing said binary submatrices with selected templates and for supplying a match signal when a binary submatrix substantially matches one of said selected templates; means for replacing substantially matched binary submatrices in said binary matrix with blank submatrices in response to said match signal; means for encoding said binary matrix as a data stream; and means for inserting in said data stream identifying data representative of a substantially matched selected template at a point in said data stream relative to the location of the corresponding substantially matched binary submatrix.
Claim 2
Dependent Claim
136 words
Apparatus for encoding a two-dimensional graphic image comprising the combination of: means for converting said graphic image to a representative binary matrix; means for segmenting contiguous groups of like elements in said binary matrix into binary submatrices; means for storing identifiable binary submatrices as templates; means for comparing said binary submatrices with selected templates and for supplying a match signal when a binary submatrix substantially matches one of said selected templates; means for replacing substantially matched binary submatrices in said binary matrix with blank submatrices in response to said match signal; means for encoding said binary matrix as a data stream; and means for inserting in said data stream identifying data representative of a substantially matched selected template at a point in said data stream relative to the location of the corresponding substantially matched binary submatrix.
Claim 3
Dependent Claim
68 words
The invention as claimed in claim 1 wherein said converting means comprises: means for scanning said graphic image line by line including means for producing binary signals of one value when a scanned position of said graphic image is dark and of the other value when said scanned position is light; and memory means coupled to said scanning means for storing said binary signals as a binary matrix.
Claim 4
Dependent Claim
200 words
Apparatus for transmitting facsimile data representing a two-dimensional graphic image comprising the combination: Transmitting means for sending a data stream and including; (a) means for converting said graphic image to a representative binary matrix, (b) means for segmenting contiguous groups of like elements in said binary matrix into binary submatrices, (c) first means for storing identifiable binary submatrices as templates, (d) means for comparing said binary submatrices with selected templates and for supplying a match signal when a binary submatrix substantially matches one of said selected templates, means for replacing substantially matched binary submatrices in said binary matrix with blank submatrices in response to said match signal, (f) means for encoding said binary matrix as a data stream, and (g) means for inserting in said data stream identifying data representative of a substantially matched selected template at a point in said data stream relative to the location of the corresponding substantially matched binary submatrix; receiving means for receiving said data stream and including; (a) second means for storing identifiable binary submatrices as templates, (b) means for inserting an identified selected template in said binary matrix at a location specified by the position of said identifying data in said data stream.
Claim 5
Dependent Claim
200 words
Apparatus for transmitting facsimile data representing a two-dimensional graphic image comprising the combination: Transmitting means for sending a data stream and including; (a) means for converting said graphic image to a representative binary matrix, (b) means for segmenting contiguous groups of like elements in said binary matrix into binary submatrices, (c) first means for storing identifiable binary submatrices as templates, (d) means for comparing said binary submatrices with selected templates and for supplying a match signal when a binary submatrix substantially matches one of said selected templates, means for replacing substantially matched binary submatrices in said binary matrix with blank submatrices in response to said match signal, (f) means for encoding said binary matrix as a data stream, and (g) means for inserting in said data stream identifying data representative of a substantially matched selected template at a point in said data stream relative to the location of the corresponding substantially matched binary submatrix; receiving means for receiving said data stream and including; (a) second means for storing identifiable binary submatrices as templates, (b) means for inserting an identified selected template in said binary matrix at a location specified by the position of said identifying data in said data stream.
Claim 6
Dependent Claim
36 words
The invention as claimed in claim 3 further including in said transmitting means: (h) means responsive to said comparing means for storing a binary submatrix as an identifiable template in the absence of a match signal.
Claim 7
Dependent Claim
90 words
The invention as claimed in claim 4 further including in said transmitting means: (i) means for inserting in said data stream identifying data representative of an unmatched binary submatrix at a point in said data stream representative of the location of said unmatched binary submatrix in said binary matrix, and further including in said receiving means; (c) means for extracting in response to identifying data in said data stream an unmatched binary submatrix, and (d) means for storing extracted identified unmatched binary submatrices as templates in said second storing means.
Claim 8
Dependent Claim
41 words
The invention as claimed in claim 4 wherein said receiving means includes: (e) means for recognizing unmatched binary submatrices in said data stream, and (f) means for storing unmatched binary submatrices appearing in said data stream in said second storing means.
Claim 9
Independent Claim
204 words
A method for transmitting a graphic image comprising the steps of: scanning said graphic image in two dimensions to produce information signals representing light and dark areas of said image; storing said information signals as binary values; segmenting contiguous like binary values of one kind as separate figures; storing selected separate figures as identifiable templates; comparing separate figures with said identifiable templates; producing a match signal when a separate figure substantially matches an identifiable template; removing matched separate figures by changing said like binary values to binary values of the other kind in response to said match signal to leave a residual image representation; encoding said residual image representation into a data stream; inserting into said data stream identifying data for identifying a template substantially matching a separate figure at a point in said data stream corresponding to the position from which said separate figure was removed; transmitting said data stream with said inserted identifying data; receiving said data stream with said inserted identifying data; decoding said data stream into a reconstructed residual image; and interjecting said identified template in said reconstructed residual image at a location defined by the point of said identifying data in the data stream to form said graphic image.
Claim 10
Independent Claim
204 words
A method for transmitting a graphic image comprising the steps of: scanning said graphic image in two dimensions to produce information signals representing light and dark areas of said image; storing said information signals as binary values; segmenting contiguous like binary values of one kind as separate figures; storing selected separate figures as identifiable templates; comparing separate figures with said identifiable templates; producing a match signal when a separate figure substantially matches an identifiable template; removing matched separate figures by changing said like binary values to binary values of the other kind in response to said match signal to leave a residual image representation; encoding said residual image representation into a data stream; inserting into said data stream identifying data for identifying a template substantially matching a separate figure at a point in said data stream corresponding to the position from which said separate figure was removed; transmitting said data stream with said inserted identifying data; receiving said data stream with said inserted identifying data; decoding said data stream into a reconstructed residual image; and interjecting said identified template in said reconstructed residual image at a location defined by the point of said identifying data in the data stream to form said graphic image.
Claim 11
Dependent Claim
84 words
The invention as claimed in claim 7 including the additional steps of after said removing step: selecting for storage a compared separate figure as an identifiable template in the absence of said match signal; including in said identifying data information denoting that a corresponding non-removed separate figure is a new identifiable template; after said interjecting step: storing in response to said information included in said identifying data a replica of said corresponding non-removed figure as an identifiable template identified by said inserted identifying data.
Claim 12
Dependent Claim
56 words
The invention as claimed in claim 7 including the additional steps of after said removing step: selecting for storage a compared separate figure as an identifiable template in the absence of said match signal; after the interjecting step, the step of: recognizing a non-removed separate figure as an identifiable template identified by said inserted identifying data.
References Cited (Backward Citations)
US3980809A
Cited
US4103287A
Cited
US3883847A
Cited
US4319225A
Cited
US4191974A
Cited
US4091424A
Cited
US4291339A
Cited
US4302775A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-07-31 | 1988-01-30 | 1988-07-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-07-31 | 1992-01-30 | 1992-07-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-07-31 | 1996-01-30 | 1996-07-31 | $7700.00 | Window Closed / Lapsed |