Patent US20030128182A1 successfully refreshed from Google Patents.
US4747156A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Image preprocessing procedure for noise removal
Assignee: International Business Machines Corp
•
Filing: 1986-06-17
•
Granted: 1988-05-24
•
Expires: 2006-06-17
Abstract
Abstract A method for removing noise in the form of small black spots in a black and white raster picture, which includes the following steps: Generating a moving window of 5×5 picture elements having an inner window (R1) of nine and a surrounding outer window (R2) of sixteen picture elements; detecting for each such window whether there are more black picture elements in the inner window than a given threshold, or whether there is any connection between black picture elements in the inner window and the outer window; if this is true, leaving the inner window unchanged; otherwise, i.e. if there are less black picture elements in the inner window than the threshold, and if they are not connected to black picture elements in the outer window, making the inner window all white. Thus, isolated small black spots are eliminated without eroding edges or erasing very thin lines.
Inventors
- 👤 Friedrich M. Wahl
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 17:26
CPC Classifications
H; H04; H04N; H04N1/00; H04N1/40; H04N1/409; H04N1/4097; G; G06; G06T; G06T5/00; G06T5/20
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
162 words
A method for improving an image represented by a raster pattern of black and white picture elements, for removing noise, characterized by the steps of: scanning the image to obtain for successive window areas an inner window (R1) and a surrounding outer window (R2) of black and white pixels, both windows having a given size; detecting for each such window area (a) whether the number (CT) of black picture elements in the inner window exceeds a given threshold value (TH), and (b) whether any black picture element exists in the outer window and whether a black picture element in the inner window is connected to at least one black picture element in the other window; determining, in dependence of the results of the detecting steps a and b, the contents of the respective window for further processing, by either maintaining the picture elements of the respective inner window of the input image unchanged, or by modifying them according to a given rule.
Claim 2
Independent Claim
162 words
A method for improving an image represented by a raster pattern of black and white picture elements, for removing noise, characterized by the steps of: scanning the image to obtain for successive window areas an inner window (R1) and a surrounding outer window (R2) of black and white pixels, both windows having a given size; detecting for each such window area (a) whether the number (CT) of black picture elements in the inner window exceeds a given threshold value (TH), and (b) whether any black picture element exists in the outer window and whether a black picture element in the inner window is connected to at least one black picture element in the other window; determining, in dependence of the results of the detecting steps a and b, the contents of the respective window for further processing, by either maintaining the picture elements of the respective inner window of the input image unchanged, or by modifying them according to a given rule.
Claim 3
Independent Claim
238 words
A method of preprocessing an image represented by a raster pattern of black and white binary picture elements, for removing small isolated black spots, characterized by the steps of: (a) scanning the image to obtain for each one of successive overlapping windows an inner window (R1) of close neighborhood picture elements and an outer window (R2) of picture elements surrounding said inner window; (b) detecting for each such inner window whether the number (CT) of black picture elements exceeds a given threshold value (TH), and (b1) leaving the contents of said inner window unchanged if the number of black picture elements is above the threshold, but (b2) if the number of black picture elements in the inner window is not above the threshold, going to step (c); (c) detecting whether a black picture element in the inner window is substantially connected to at least one black picture element in the outer window, and (c1) if a black element in the inner window is substantially connected to at least one black picture element in the outer window exists, leaving the contents of the inner window unchanged, but (c2) replacing all black picture elements by white picture elements in the inner window if no exists between black picture elements in the inner window and black picture elements in the outer window, and using the new binary values of the modified picture elements for subsequent windows instead of their original values.
Claim 4
Independent Claim
238 words
A method of preprocessing an image represented by a raster pattern of black and white binary picture elements, for removing small isolated black spots, characterized by the steps of: (a) scanning the image to obtain for each one of successive overlapping windows an inner window (R1) of close neighborhood picture elements and an outer window (R2) of picture elements surrounding said inner window; (b) detecting for each such inner window whether the number (CT) of black picture elements exceeds a given threshold value (TH), and (b1) leaving the contents of said inner window unchanged if the number of black picture elements is above the threshold, but (b2) if the number of black picture elements in the inner window is not above the threshold, going to step (c); (c) detecting whether a black picture element in the inner window is substantially connected to at least one black picture element in the outer window, and (c1) if a black element in the inner window is substantially connected to at least one black picture element in the outer window exists, leaving the contents of the inner window unchanged, but (c2) replacing all black picture elements by white picture elements in the inner window if no exists between black picture elements in the inner window and black picture elements in the outer window, and using the new binary values of the modified picture elements for subsequent windows instead of their original values.
Claim 5
Dependent Claim
37 words
A method in accordance with claim 1, characterized in that the inner window has a size of n×n picture elements, and the outer window has the form of a frame having a dimension of (n+2)×(n+2) picture elements.
Claim 6
Dependent Claim
11 words
A method in accordance with claim 3, characterized in that n=3.
Claim 7
Dependent Claim
27 words
A method in accordance with claim 1, characterized that for modifying the contents of the inner window, all picture elements in the inner window are made white.
Claim 8
Dependent Claim
60 words
A method in accordance with claim 1, characterized in that no modification is made if the number (CT) of black picture elements in the inner window exceeds the given threshold (TH), or if the threshold is not exceeded but any black picture element in the inner window is connected to at least one black picture element in the outer window.
Claim 9
Dependent Claim
49 words
A method in accordance with claim 1, characterized in that for considering a picture element in the outer window to be connected to a picture element in the inner window, it must be in direct horizontal, vertical, or diagonal connection with the respective picture element in the inner window.
Claim 10
Dependent Claim
49 words
A method in accordance with claim 6, characterized in that for considering a picture element in the outer window to be connected to a picture element in the inner window, it must be in direct horizontal, vertical, or diagonal connection with the respective picture element in the inner window.
Claim 11
Dependent Claim
60 words
A method in accordance with claim 5, characterized in that no modification is made if the number (CT) if black picture elements in the inner window exceeds the given threshold (TH), or if the threshold is not exceeded but any black picture element in the inner window is connected to at least one black picture element in the outer window.
Claim 12
Dependent Claim
49 words
A method in accordance with claim 9, characterized in that for considering a picture element in the outer window to be connected to a picture element in the inner window, it must be in direct horizontal, vertical, or diagonal connection with the respective picture element in the inner window.
Claim 13
Dependent Claim
46 words
A method in accordance with claim 1, characterized in that the movements of the window area are made in increments of one picture element, and that the modifications made in the contents of one window are effective for the following windows containing the same picture elements.
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) | 1991-05-24 | 1991-11-23 | 1992-05-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-05-24 | 1995-11-23 | 1996-05-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-05-24 | 1999-11-23 | 2000-05-24 | $7700.00 | Window Closed / Lapsed |