Method and apparatus for filtering images having insufficient tonal precision
AssigneeHewlett-Packard Development Company, L.P.
InventorsIrwin Sobel, Ronny Kimmel
Life of this patent
Estimating the term…
Abstract
An array of n-bit words representing an image is filtered to produce a corresponding array of higher precision m-bit words representing the image. During the filtering, upper and lower bounds for the m-bit words are identified, and values for the m-bit words are selected between the upper and lower bounds. There is at least some spatial smoothness between the selected values. For example, the values may be selected at sample points of a curve or surface between the upper and lower bounds.
Claims23
A method of filtering a signal representing an array of n-bit words to produce a signal representing a corresponding array of m-bit words, where m and n are integers and m>n, the method comprising:
- identifying upper and lower bounds of each m-bit word;
- and
- selecting values for the m-bit words between the upper and lower bounds, there being at least some spatial smoothness between the selected values;
- the lower bound of a given m-bit word having its n most significant bits equal to the corresponding n-bit word;
- the upper bound of a given n-bit word being equal to a sum of a maximum uncertainty and the lower bound of the given m-bit word.
A method of filtering a signal representing a sequence of n-bit words to produce a signal representing a corresponding array of m-bit words, where m and n are integers and m>n, the method comprising:
- identifying upper and lower bounds of the m-bit words in the sequence;
- identifying a first change point in the sequence;
- skipping a constant run of lower bounds following the first change point;
- identifying a second change point at the end of the constant run;
- interpolating values for the m-bit words in the constant run, the values of the m-bit words being interpolated between the first and second change points;
- and
- clipping any values that fall outside of the upper or lower bounds.
A method of filtering a signal representing a two-dimensional array of n-bit words to produce a signal representing a corresponding two-dimensional array of m-bit words, where m and n are integers and m>n, the method comprising the steps of:
- identifying upper and lower bounds of each m-bit word;
- generating an optimally smooth surface between the upper and lower bounds of the m-bit words;
- and
- selecting values of the m-bit words at sample points on the surface;
- the lower bound of a given m-bit word having its n most significant bits equal to the corresponding n-bit word;
- the upper bound of a given n-bit word being equal to a sum of a maximum uncertainty and the lower bound of the given m-bit word.
A data system comprising:
- means for generating a plurality of n-bit data words;
- and
- means for filtering the plurality of n-bit words to produce corresponding m-bit words, the filtering being performed by identifying upper and lower bounds of the m-bit words;
- and selecting values of the m-bit words between the upper and lower bounds, there being at least some spatial smoothness between the selected values, the lower bound of a given m-bit word having its n most significant bits equal to the corresponding n-bit word, the upper bound of a given n-bit word being equal to a sum of a maximum uncertainty and the lower bound of the given m-bit word.
Apparatus for filtering a plurality of n-bit words to produce a plurality of corresponding m-bit words, the apparatus comprising:
- a processor;
- and
- computer memory encoded with a program that, when executed, instructs the processor to identify upper and lower bounds of each m-bit word;
- and select m-bit word values between the upper and lower bounds, there being at least some spatial smoothness between the selected values, the lower bound of a given m-bit word having its n most significant bits equal to the corresponding n-bit word, the upper bound of a given n-bit word being equal to a sum of a maximum uncertainty and the lower bound of the given m-bit word.
An article of manufacture for a processor of an image filter, the article comprising:
- computer memory;
- and
- a program encoded in the computer memory, the program, when executed, instructing the processor to identify upper and lower bounds of each m-bit word in an array;
- and select values of the m-bit words between the upper and lower bounds, there being at least some spatial smoothness between the selected values, the lower bound of a given m-bit word having its n most significant bits equal to the corresponding n-bit word, the upper bound of a given n-bit word being equal to a sum of a maximum uncertainty and the lower bound of the given m-bit word.
Dependencies are inferred from the claim text.