Patent DE87189C successfully refreshed from Google Patents.
Patent US5845017A successfully refreshed from Google Patents.
US5845017A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital image processing method for degraining of film images using distance weighted averaging of target pixel code values
Assignee: Intellectual Ventures Fund 83 LLC
•
Filing: 1996-12-17
•
Granted: 1998-12-01
•
Expires: 2016-12-17
Abstract
Abstract A method of digital image processing for degraining (smoothing) of images based on selected averaging of pixels in a neighborhood of pixels surrounding a target pixel to be recalculated. Improvement in the application of the selected average method to images of higher graininess such as might be obtained from higher speed films is achieved by weighting the difference in code values between each neighborhood pixel and the target pixel in accordance with a function that is related to physical distance between the neighborhood pixel and the target pixel. After all target pixels are recalculated using a selected fraction of pixel elements based on their distance weighted difference values, the process is iterated for each target pixel "n" number of times to achieve a desired relative code value of the target pixel to surrounding background pixel code values whereupon a final unweighted averaging operation is performed to achieve the final recalculated value of the target pixel.
Inventors
- 👤 Michael P. Keyes
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 18:32
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/20; H; H04; H04N; H04N1/00; H04N1/46; H04N1/56; H04N1/58
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
138 words
An improved method of degraining a digital image by means of a selected average technique in which code values of selected pixels, in a neighborhood of pixels surrounding a target pixel and which are rank ordered by differences in code values between the neighborhood pixels and the target pixel, are averaged to obtain an average code value and the average code value is assigned to the target pixel, wherein the improvement comprises: weighting said difference code values as a function of distance of each neighborhood pixel from the target pixel before rank ordering said weighted difference code values, wherein said weighting comprises multiplying the difference code value of each neighborhood pixel by a factor which is related to distance between said target pixel and said neighborhood pixel; the factor being raised to an exponential value greater than zero.
Claim 2
Dependent Claim
138 words
An improved method of degraining a digital image by means of a selected average technique in which code values of selected pixels, in a neighborhood of pixels surrounding a target pixel and which are rank ordered by differences in code values between the neighborhood pixels and the target pixel, are averaged to obtain an average code value and the average code value is assigned to the target pixel, wherein the improvement comprises: weighting said difference code values as a function of distance of each neighborhood pixel from the target pixel before rank ordering said weighted difference code values, wherein said weighting comprises multiplying the difference code value of each neighborhood pixel by a factor which is related to distance between said target pixel and said neighborhood pixel; the factor being raised to an exponential value greater than zero.
Claim 3
Dependent Claim
14 words
The improved method of claim 1 wherein the exponential value is greater than 1.
Claim 4
Dependent Claim
15 words
The improved method of claim 2 wherein said exponential value is substantially equal to 2.
Claim 5
Dependent Claim
57 words
The improvement of claim 1 in which a distance weighted average code value is calculated and assigned for a target pixel in each of a plurality of neighborhoods in an image after which the process of calculation and assignment is iterated for all of said target pixels to establish successive recalculated code values for the target pixels.
Claim 6
Dependent Claim
51 words
The improvement of claim 4 in which said neighborhoods of pixels include background and edge pixel elements and the process is iterated until substantially all said assigned target pixel code values of said plurality of neighborhoods are closer to code values of said background pixel elements than said edge pixel elements.
Claim 7
Dependent Claim
63 words
The improvement of claim 5 in which, as a final step, average code values for said target pixels of said plurality of neighborhoods are calculated from a selected fraction of unweighted neighborhood pixel code values closest in code values to the most recent assigned target pixel code values; and said last mentioned average code values are assigned as final target pixel code values.
Claim 8
Independent Claim
141 words
A method of digital image processing to perform a smoothing function on the image comprising the steps of: selecting a target pixel element in the digital image; defining a neighborhood of pixel elements surrounding the target pixel; rank ordering the pixels in the neighborhood as a function of difference code values between each neighborhood pixel element and the target pixel element in order of increasing absolute difference in code values between each pixel element and the target pixel; weighting the difference code values of each neighborhood pixel element as a function of the distance of the neighborhood pixel element from the target pixel element; calculating an average code value from a predetermined fraction of the rank ordered pixel elements having smallest weighted difference code values relative to said target pixel; and assigning said average code value to said target pixel element.
Claim 9
Independent Claim
141 words
A method of digital image processing to perform a smoothing function on the image comprising the steps of: selecting a target pixel element in the digital image; defining a neighborhood of pixel elements surrounding the target pixel; rank ordering the pixels in the neighborhood as a function of difference code values between each neighborhood pixel element and the target pixel element in order of increasing absolute difference in code values between each pixel element and the target pixel; weighting the difference code values of each neighborhood pixel element as a function of the distance of the neighborhood pixel element from the target pixel element; calculating an average code value from a predetermined fraction of the rank ordered pixel elements having smallest weighted difference code values relative to said target pixel; and assigning said average code value to said target pixel element.
Claim 10
Dependent Claim
57 words
The improvement of claim 7 in which a distance weighted average code value is calculated and assigned for a target pixel in each of a plurality of neighborhoods in an image after which the process of calculation and assignment is iterated for all of said target pixels to establish successive recalculated code values for the target pixels.
Claim 11
Dependent Claim
51 words
The improvement of claim 8 in which said neighborhoods of pixels include background and edge pixel elements and the process is iterated until substantially all said assigned target pixel code values of said plurality of neighborhoods are closer to code values of said background pixel elements than said edge pixel elements.
Claim 12
Dependent Claim
63 words
The improvement of claim 9 in which, as a final step, average code values for said target pixels of said plurality of neighborhoods are calculated from a selected fraction of unweighted neighborhood pixel code values closest in code values to the most recent assigned target pixel code values; and said last mentioned average code values are assigned as final target pixel code values.
References Cited (Backward Citations)
US4731865A
Cited
US4833723A
Cited
US5533149A
Cited
US5563963A
Cited
US5594816A
Cited
US5091972A
Cited
US5031227A
Cited
US5452376A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-30 | 2002-06-01 | 2002-12-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-30 | 2006-06-01 | 2006-12-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-30 | 2010-06-01 | 2010-12-01 | $7700.00 | Window Closed / Lapsed |