US5083214A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and methods for extracting data from a scanned bit-mapped data strip
Assignee: Eastman Kodak Co
•
Filing: 1990-05-02
•
Granted: 1992-01-21
•
Expires: 2010-05-02
Abstract
Abstract Apparatus, and accompanying methods, for determining appropriate sampling points located throughout a scanned microfilmed bit-mapped "data strip" in order to properly extract the values of stored data bits therefrom. Each data bit is formed of a contiguous group of one or more pixels in the data strip. Specifically, my technique involves parsing the data strip into successive vertical strips that each has successive rows of pixels, determining inter-row and inter-pixel differential intensity values for each vertical strip, and defining vertical line addresses and horizontal pixel addresses in each of the strips as a function of the pixel positions of the inter-row and inter-pixel differential intensity values associated therewith. The individual pixels in each vertical strip, which are situated at the horizontal pixel addresses and which lie on those rows in that vertical strip specified by the vertical line addresses, are sampled in order to yield sampled pixel data. All the sampled pixel data collectively represents the values of the data bits stored in the data strip. Advantageously, the line and pixel addresses will appropriately change in response to skew that occurs between the data strip and a microfilm line scanner as the data strip is being scanned and/or to changes in data bit size that occurs from one data strip to the next.
Inventors
- 👤 Daniel B. Knowles
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 07:48
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/38; G; G06; G06K; G06K17/00; G06K17/0016; H04N1/04; H04N2201/00; H04N2201/04; H04N2201/0402; H04N2201/0426
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
192 words
A method for determining pixel locations at which a scanned incoming bit-mapped array of pixel values is to be sampled in order to extract values of data bits stored in said array, each of said data bits being formed of at least one pixel in said array, said method comprising the steps of: parsing said scanned bit-mapped array into successive strips each having successive rows of pixel values; first determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second determining, within each one of said strips, horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and sampling said bit-mapped array at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said bit-mapped array.
Claim 2
Independent Claim
192 words
A method for determining pixel locations at which a scanned incoming bit-mapped array of pixel values is to be sampled in order to extract values of data bits stored in said array, each of said data bits being formed of at least one pixel in said array, said method comprising the steps of: parsing said scanned bit-mapped array into successive strips each having successive rows of pixel values; first determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second determining, within each one of said strips, horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and sampling said bit-mapped array at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said bit-mapped array.
Claim 3
Dependent Claim
11 words
The method in claim 1 wherein said pixel values are bi-tonal.
Claim 4
Dependent Claim
16 words
The method in claim 2 wherein said bit-mapped array is a data strip recorded on microfilm.
Claim 5
Dependent Claim
25 words
The method in claim 3 wherein said data strip is located on the microfilm in the vicinity of and associated with a corresponding microfilmed image.
Claim 6
Dependent Claim
43 words
The method in claim 2 further comprising the step of processing an entire row of pixel values in said bit-mapped array at a time, wherein said entire row extends through horizontally adjacent blocks situated across said array and situated in successive corresponding strips.
Claim 7
Dependent Claim
90 words
The method in claim 2 wherein said first determining step comprises the step of: generating each one of said vertical line addresses as a vertical pixel position of a first mid-point situated approximately halfway between ones of said vertical line addresses associated with each corresponding pair of local peak values in said differential inter-row intensity values, said corresponding pair of peak values having a first local peak value of a pre-determined first polarity followed by a second local peak value of a polarity opposite to that of said first polarity.
Claim 8
Dependent Claim
39 words
The method in claim 6 wherein said corresponding pair of local peak values comprises a local positive peak value followed by a local negative peak value, or a local negative peak value followed by a local positive peak value.
Claim 9
Dependent Claim
25 words
The method in claim 7 wherein said local positive peak value and said local negative peak value exceed respective first and second pre-defined threshold values.
Claim 10
Dependent Claim
133 words
The method in claim 6 wherein said first determining step further comprises the step of: forming said inter-row differential intensity values by the steps of: summing pixel intensity values across each one of said rows to form a series of intensity value sums; and determining a difference between each one of said intensity value sums and a next successive one of said intensity value sums to yield a corresponding one of said inter-row differential intensity values; or by the steps of: determining pixel intensity differences between two vertically aligned pixels in each successive pair of adjacent ones of said rows; and combining said intensity differences at successive horizontal pixel positions extending across said strip in order to generate a corresponding one of said inter-row differential intensity differences for each one of said rows.
Claim 11
Dependent Claim
55 words
The method in claim 6 wherein said second determining step comprises the step of: generating said horizontal pixel addresses as horizontal pixel positions associated with second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local peak values in said inter-pixel differential intensity values.
Claim 12
Dependent Claim
23 words
The method in claim 10 wherein all of said adjacent local peak values in said inter-pixel differential intensity values have a common polarity.
Claim 13
Dependent Claim
161 words
The method in claim 10 wherein said second determining step further comprises the steps of: for each block in said strip, wherein said block extends horizontally across said strip and vertically occupies a plurality of said rows in said strip and a plurality of vertically successive blocks forms said strip: determining a difference in intensity values between each pair of horizontally adjacent pixels in each of said each rows in said block to yield an array of inter-pixel differential intensity values for said block; summing absolute values of said inter-pixel differential values in said array of differential values for each column of vertically aligned pixels in said block to yield a series of absolute valued differential values; and generating said horizontal pixel addresses as horizontal pixel positions associated with said second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local positive peak values in said absolute valued differential values.
Claim 14
Dependent Claim
55 words
The method in claim 2 wherein said second determining step comprises the step of: generating said horizontal pixel addresses as horizontal pixel positions associated with second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local peak values in said inter-pixel differential intensity values.
Claim 15
Dependent Claim
23 words
The method in claim 13 wherein all of said adjacent local peak values in said inter-pixel differential intensity values have a common polarity.
Claim 16
Dependent Claim
158 words
The method in claim 14 wherein said second determining step further comprises the steps of: for each block in said strip, wherein said block extends horizontally across said strip and vertically occupies a plurality of said rows in said strip and a plurality of vertically successive blocks forms said strip: determining a difference in intensity values between each pair of horizontally adjacent pixels in each of said each rows in said block to yield an array of inter-pixel differential intensity values for said block; summing absolute values of said inter-pixel differential values in said array for each column of vertically aligned pixels in said block to yield a series of absolute valued differential values; and generating said horizontal pixel addresses as horizontal pixel positions associated with said second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local positive peak values in said absolute valued differential values.
Claim 17
Independent Claim
197 words
A method for determining pixel locations at which a scanned incoming microfilm data strip of bi-tonal pixel values is to be sampled in order to extract values of bi-tonal data bits stored in said data strip, each of said data bits being formed of at least one pixel in said data strip, said method comprising the steps of: parsing said scanned data strip into successive strips each having successive rows of pixel values; first determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second determining, within each one of said strips, horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and sampling said data strip at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said data strip.
Claim 18
Independent Claim
197 words
A method for determining pixel locations at which a scanned incoming microfilm data strip of bi-tonal pixel values is to be sampled in order to extract values of bi-tonal data bits stored in said data strip, each of said data bits being formed of at least one pixel in said data strip, said method comprising the steps of: parsing said scanned data strip into successive strips each having successive rows of pixel values; first determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second determining, within each one of said strips, horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and sampling said data strip at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said data strip.
Claim 19
Dependent Claim
90 words
The method in claim 16 wherein said first determining step comprises the step of: generating each one of said vertical line addresses as a vertical pixel position of a first mid-point situated approximately halfway between ones of said vertical line addresses associated with each corresponding pair of local peak values in said differential inter-row intensity values, said corresponding pair of peak values having a first local peak value of a pre-determined first polarity followed by a second local peak value of a polarity opposite to that of said first polarity.
Claim 20
Dependent Claim
39 words
The method in claim 17 wherein said corresponding pair of local peak values comprises a local positive peak value followed by a local negative peak value, or a local negative peak value followed by a local positive peak value.
Claim 21
Dependent Claim
25 words
The method in claim 18 wherein said local positive peak value and said local negative peak value exceed respective first and second pre-defined threshold values.
Claim 22
Dependent Claim
133 words
The method in claim 17 wherein said first determining step further comprises the step of: forming said inter-row differential intensity values by the steps of: summing pixel intensity values across each one of said rows to form a series of intensity value sums; and determining a difference between each one of said intensity value sums and a next successive one of said intensity value sums to yield a corresponding one of said inter-row differential intensity values; or by the steps of: determining pixel intensity differences between two vertically aligned pixels in each successive pair of adjacent ones of said rows; and combining said intensity differences at successive horizontal pixel positions extending across said strip in order to generate a corresponding one of said inter-row differential intensity differences for each one of said rows.
Claim 23
Dependent Claim
55 words
The method in claim 16 wherein said second determining step comprises the step of: generating said horizontal pixel addresses as horizontal pixel positions associated with second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local peak values in said inter-pixel differential intensity values.
Claim 24
Dependent Claim
23 words
The method in claim 21 wherein all of said adjacent local peak values in said inter-pixel differential intensity values have a common polarity.
Claim 25
Dependent Claim
158 words
The method in claim 22 wherein said second determining step further comprises the steps of: for each block in said strip, wherein said block extends horizontally across said strip and vertically occupies a plurality of said rows in said strip and a plurality of vertically successive blocks forms said strip: determining a difference in intensity values between each pair of horizontally adjacent pixels in each of said each rows in said block to yield an array of inter-pixel differential intensity values for said block; summing absolute values of said inter-pixel differential values in said array for each column of vertically aligned pixels in said block to yield a series of absolute valued differential values; and generating said horizontal pixel addresses as horizontal pixel positions associated with said second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local positive peak values in said absolute valued differential values.
Claim 26
Dependent Claim
219 words
Apparatus for determining pixel locations at which a scanned incoming microfilm data strip of bi-tonal pixel values is to be sampled in order to extract values of bi-tonal data bits stored in said data strip, each of said data bits being formed of at least one pixel in said data strip, said apparatus comprising: means for parsing said scanned data strip into successive strips each having successive rows of pixel values; first means, responsive to said parsing means, for determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second means, responsive to said first means and to said scanned data strip, for determining horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and means, responsive to said first and second determining means, for sampling said data strip at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said data strip.
Claim 27
Dependent Claim
219 words
Apparatus for determining pixel locations at which a scanned incoming microfilm data strip of bi-tonal pixel values is to be sampled in order to extract values of bi-tonal data bits stored in said data strip, each of said data bits being formed of at least one pixel in said data strip, said apparatus comprising: means for parsing said scanned data strip into successive strips each having successive rows of pixel values; first means, responsive to said parsing means, for determining, within each one of said strips, vertical line addresses as a function of inter-row differential intensity values occurring between each pair of successive ones of said rows of pixels in said one strip; second means, responsive to said first means and to said scanned data strip, for determining horizontal pixel addresses as a function of inter-pixel differential intensity values occurring between each pair of successive pixels situated along each one of said rows defined by said vertical line addresses in said one strip; and means, responsive to said first and second determining means, for sampling said data strip at horizontal pixel addresses situated therein and lying on each of said rows defined by said vertical line addresses so as to yield sampled pixel data, whereby said sampled pixel data represents the data bit values stored in said data strip.
Claim 28
Dependent Claim
89 words
The apparatus in claim 24 wherein said first determining means comprises: means for generating each one of said vertical line addresses as a vertical pixel position of a first mid-point situated approximately halfway between ones of said vertical line addresses associated with each corresponding pair of local peak values in said differential inter-row intensity values, said corresponding pair of peak values having a first local peak value of a pre-determined first polarity followed by a second local peak value of a polarity opposite to that of said first polarity.
Claim 29
Dependent Claim
39 words
The apparatus in claim 25 wherein said corresponding pair of local peak values comprises a local positive peak value followed by a local negative peak value, or a local negative peak value followed by a local positive peak value.
Claim 30
Dependent Claim
25 words
The apparatus in claim 26 wherein said local positive peak value and said local negative peak value exceed respective first and second pre-defined threshold values.
Claim 31
Dependent Claim
124 words
The apparatus in claim 25 wherein said first determining step further comprises: means for summing pixel intensity values across each one of said rows to form a series of intensity value sums; and means for determining a difference between each one of said intensity value sums and a next successive one of said intensity value sums to yield a corresponding one of said inter-row differential intensity values; or means for determining pixel intensity differences between two vertically aligned pixels in each successive pair of adjacent ones of said rows; and means for combining said intensity differences at successive horizontal pixel positions extending across said strip in order to generate a corresponding one of said inter-row differential intensity differences for each one of said rows.
Claim 32
Dependent Claim
54 words
The apparatus in claim 24 wherein said second determining means comprises: means for generating said horizontal pixel addresses as horizontal pixel positions associated with second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local peak values in said inter-pixel differential intensity values.
Claim 33
Dependent Claim
23 words
The apparatus in claim 29 wherein all of said adjacent local peak values in said inter-pixel differential intensity values have a common polarity.
Claim 34
Dependent Claim
160 words
The apparatus in claim 30 wherein said second determining means further comprises: means for determining a difference in intensity values between each pair of horizontally adjacent pixels in each of said each rows in each one of a plurality of vertically successive blocks to yield an array of inter-pixel differential intensity values for said block, wherein each of said blocks extends horizontally across said strip and vertically occupies a plurality of said rows therein and said plurality of blocks forms said strip; means for summing absolute values of said inter-pixel differential values in said array for each column of vertically aligned pixels in said block to yield a series of absolute valued differential values; and means for generating said horizontal pixel addresses as horizontal pixel positions associated with said second mid-points, wherein each successive one of said second mid-points is located approximately halfway between a corresponding successive pair of adjacent local positive peak values in said absolute valued differential values.
References Cited (Backward Citations)
US3805239A
Cited
US3968475A
Cited
US4218673A
Cited
US4204230A
Cited
US4278999A
Cited
US4695991A
Cited
US4547811A
Cited
US4634850A
Cited
US4786792A
Cited
US4553171A
Cited
US4588882A
Cited
US4652730A
Cited
US4811321A
Cited
US4692603A
Cited
US4782221A
Cited
US4728783A
Cited
US4754127A
Cited
US4939589A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-01-20 | 1995-07-22 | 1996-01-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-01-20 | 1999-07-22 | 2000-01-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-01-20 | 2003-07-22 | 2004-01-21 | $7700.00 | Window Closed / Lapsed |