US4290084A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and means for preserving original continuity/discontinuity among same colored pel clusters upon array compression
Assignee: International Business Machines Corp
•
Filing: 1979-09-21
•
Granted: 1981-09-15
•
Expires: 1999-09-21
Abstract
Abstract Data manipulation apparatus is described for converting raster-scanned data received, for example, from a scanner 2 at a first picture element (pel) resolution to a second lower pel resolution for display, for example, on a CRT terminal 4. The apparatus includes a scale-changing means 8 which functions to replace selected subgroups of pels in the input image by single pels at its output. The significance of each single pel reflects the presence or absence of a pel representing part of an image object in the associated subgroup of pels. The number of pels in the selected subgroups are determined by the degree of compression required to convert to the lower pel resolution. Prior to scale change, the apparatus functions to modify the input data in order to minimize merging of adjacent image objects as a result of scale change and thereby improve the legibility of the output image at the lower resolution. The scanned data is first supplied to a data sensitive thinner 5 which detects narrow gaps between adjacent objects and selectively detects image object edge pels in order to widen the gap. The selectively thinned scanned data is then supplied to a further thinner 6 which removes excess image pels from selected edges of the image objects. The data from thinner 6 is then supplied to a data sensitive merge inhibit unit 7 which moves selected image object pels from a subgroup in which merging as a result of scale change will occur to an adjacent subgroup where merging will not occur. Removal of a pel by the selective thinner 5, or by the thinner 6 or movement of a pel by unit 7 is inhibited if to do so would result in fragmentation of the associated image object.
Inventors
- 👤 John F. Minshull
- 👤 Pavel Brazdil
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 04:29
CPC Classifications
G; G06; G06T; G06T3/00; G06T3/40; G06T3/4023; G06T3/403; G06T5/00; G06T5/20; G06T5/30; G06V; G06V10/00; G06V10/20; G06V30/00; G06V30/10; G06V30/16; G06V30/166; G06V30/168; G06V30/20; H; H04; H04N; H04N1/00; H04N1/41; H04N1/411
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
115 words
A method for preserving continuities and discontinuities among clusters of the same first color valued pels originating in an m×n multicolor valued pel array upon said array being compressed into a smaller p×q size, at least two contiguous first color pels constituting a cluster, the method steps prior to compression include: detecting a bifurcation between clusters defined by at least one run of consecutive second color valued pels in at least one or more consecutive scan lines through row major order scanning of the m×n array; upon the detection of a bifurcation, converting first color valued pels lying within a predetermined number of array positions contiguous to said detected bifurcation into second color valued pels.
Claim 2
Independent Claim
115 words
A method for preserving continuities and discontinuities among clusters of the same first color valued pels originating in an m×n multicolor valued pel array upon said array being compressed into a smaller p×q size, at least two contiguous first color pels constituting a cluster, the method steps prior to compression include: detecting a bifurcation between clusters defined by at least one run of consecutive second color valued pels in at least one or more consecutive scan lines through row major order scanning of the m×n array; upon the detection of a bifurcation, converting first color valued pels lying within a predetermined number of array positions contiguous to said detected bifurcation into second color valued pels.
Claim 3
Dependent Claim
34 words
A method according to claim 1 wherein the detecting step further includes the step of additional scanning of the m×n array for detecting clusters at least one pel thick and inhibiting the converting step.
Claim 4
Dependent Claim
128 words
A method according to claim 1 wherein the compression of the m×n to a p×q array comprises the steps of: forming a p×n array from the m×n array, p≦m, by encoding each ith scan line in row major order with reference to the ith-1 scan line through the substitution of a pel of the same color value in a weighted position for each run of two or more same color valued pels; and forming a p×q array from the p×n array, q≦n, by the encoding of each rth scan line in column major order with reference to the rth-1 scan line through the substitution of a pel of the same color valued in a weighted position for each run of two or more contiguous same color valued pels.
Claim 5
Dependent Claim
170 words
Data manipulation apparatus for receiving raster-scanned data as a first series of bits indicative of individual objects forming an image at a first picture element (pel) resolution and for converting the data into a second series of bits indicative of the image at a second lower pel resolution, comprising a scale changing means operable on receipt of said first series of input bits to convert selected subgroups of said input bits each into a single output bit, the significance of each output bit being determined by the presence or absence of a bit of a predetermined significance anywhere in the associated subgroup of input bits, the size of the subgroups being determined by the degree of compression required to effect the scale-change from said first to said second pel resolution, and means operable prior to scale-change for investigating bits in adjacent subgroups and selectively to change the significance of one or more of said investigated bits if merging of said objects after scale-change to said lower resolution would otherwise occur.
Claim 6
Dependent Claim
170 words
Data manipulation apparatus for receiving raster-scanned data as a first series of bits indicative of individual objects forming an image at a first picture element (pel) resolution and for converting the data into a second series of bits indicative of the image at a second lower pel resolution, comprising a scale changing means operable on receipt of said first series of input bits to convert selected subgroups of said input bits each into a single output bit, the significance of each output bit being determined by the presence or absence of a bit of a predetermined significance anywhere in the associated subgroup of input bits, the size of the subgroups being determined by the degree of compression required to effect the scale-change from said first to said second pel resolution, and means operable prior to scale-change for investigating bits in adjacent subgroups and selectively to change the significance of one or more of said investigated bits if merging of said objects after scale-change to said lower resolution would otherwise occur.
Claim 7
Dependent Claim
93 words
Data manipulation apparatus as claimed in claim 4, in which said means for investigating bits in adjacent subgroups includes data sensitive thinning means operable to detect narrow gaps separating adjacent objects in the input image by a number of pels equal to or less than the number of pels in the largest subgroup selected by said scale-changing means and, in the absence of constraints, to delete selected edge pels of said objects so that the number of pels in the resultant gap is greater than the number of pels in said largest subgroup.
Claim 8
Dependent Claim
72 words
Data manipulation apparatus as claimed in claim 4, in which said data sensitive thinning means includes a plurality of individual selective edge thinners each of which is operable to detect a predetermined edge bit of an object adjacent a narrow gap and, in the absence of said constraints, to delete the detected edge bit, said individual selecting edge thinners being arranged in a predetermined order with respect to image data supplied thereto.
Claim 9
Dependent Claim
50 words
Data manipulation apparatus as claimed in claim 4, in which said means for investigating bits in adjacent subgroups includes constraint means operable to inhibit changing of significance of one or more of said investigated bits, if as a result of so doing, fragmentation of the associated object would otherwise occur.
Claim 10
Dependent Claim
99 words
Data manipulation apparatus as claimed in claim 4, including a plurality of rows of shift registers connected in series to receive said first series of bits, said bits being supplied to the input of a first of said plurality of shift registers to be progressively shifted pel by pel through the registers to the output of a last of said plurality of shift registers, the arrangement being such that the relative row and column positions of pels within the registers correspond at all times to the original row and column positions of those pels in the raster-scanned input image.
Claim 11
Dependent Claim
38 words
Data manipulation apparatus as claimed in claim 4 in which the subgroups of bits are divided into sets, one set containing a different number of pels from another set in order that nonintegral valued scale-change may be achieved.
Claim 12
Dependent Claim
86 words
Data manipulation apparatus as claimed in claim 4, including data sensitive merge inhibit means operable, in response to predetermined stimuli and in the absence of constraints, to investigate remaining bits representing objects in the input image emerging from said further thinner to move a bit representing the edge of an object in the input image from one subgroup to an adjacent subgroup to prevent merging of that bit with an edge bit of an adjacent object which would otherwise occur after scale-change to said lower resolution.
Claim 13
Dependent Claim
59 words
Data manipulation apparatus as claimed in claim 10, in which said merge inhibit means includes a plurality of individual merge correction units, each of which is operable, in the absence of constraints, to move an associated bit in a predetermined direction, said individual merge correction units being arranged to operate in a predetermined order with respect to image data.
Claim 14
Dependent Claim
62 words
Data manipulation apparatus as claimed in claim 10, in which the stimulus for merge correction of bits is derived as a result of logical tests performed on bits occupying selected near and adjacent pel positions which indicates that repositioning of the investigated bit will not result in merging with an edge bit of a further adjacent object which otherwise would not occur.
Claim 15
Dependent Claim
273 words
Data manipulation apparatus as claimed in claim 12, in which said scale-changing means consists of a shift register connected to receive remaining bits representing objects in the input image emerging from said data sensitive merge inhibit means, stage gating means operable to shift the contents of the register one stage at a time each time a subgroup of pels is received by an input stage of the register, the input stage being set to state representing a bit of said predetermined significance whenever an image bit representing an object is present in the subgroup, register gating means selectively operable to either deliver the contents of the shift register to an output terminal or to recirculate the contents through the shift register, the recirculated image data being applied to the input stage in synchronism with image pels supplied to the input stage from a corresponding subgroup of pels in the current row of scanned image data, the input stage being set as a result to a state representative of said bit of predetermined significance if an image bit representing an object is present in the received subgroup of the current scanned image row or is recirculated from the corresponding position in the previous scanned image row, said register gating means being operable to deliver the contents of the shift register to said output terminal upon passage of a subgroup of rows through the shift register, the selection of the subgroups of pels by said stage gating means and subgroups of rows by said register gating means is such that the image data supplied at said output terminal is at said second lower pel resolution.
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) | 1984-09-14 | 1985-03-16 | 1985-09-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1988-09-14 | 1989-03-16 | 1989-09-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1992-09-14 | 1993-03-16 | 1993-09-15 | $7700.00 | Window Closed / Lapsed |