Spatially varying log-chromaticity normals for use in an image process
View Patent ↗In a first exemplary embodiment of the present invention, an automated, computerized method is provided for processing an image. According to a feature of the present invention, the method comprises the steps of providing an image file depicting an image defined by image locations, in a computer memory, generating a bi-illuminant chromaticity plane in a log color space for representing the image locations of the image in a log-chromaticity representation for the image, providing a set of estimates for an orientation of the bi-illuminant chromaticity plane and calculating a single orientation for each one of the image locations as a function of the set of estimates for an orientation.
1. An automated, computerized method for processing an image, comprising the steps of:
providing an image file depicting an image defined by image locations, in a computer memory;
generating a bi-illuminant chromaticity plane in a log color space for representing the image locations of the image in a log-chromaticity representation for the image;
providing a set of estimates for an orientation of the bi-illuminant chromaticity plane; and
calculating a single orientation for each one of the image locations as a function of the set of estimates for the orientation.
2. The method of claim 1 wherein the step of calculating a single orientation for each one of the image locations as a function of the set of estimates for an orientation is carried out by executing a k-NN algorithm.
3. The method of claim 2 wherein the k-NN algorithm is based upon a weighted function of spatial and spectral distances between the image locations and the set of estimates for an orientation of the bi-illuminant chromaticity plane.
4. The method of claim 1 wherein the step of calculating a single orientation for each one of the image locations as a function of the set of estimates for an orientation is carried out by solving a system of linear equations representing constraints between values based upon selected ones of the set of estimates for an orientation of the bi-illuminant chromaticity plane.
5. The method of claim 4 wherein the constraints include constraints selected from the group including a smoothness constraint, a data constraint, an anchor constraint, and combinations thereof.
6. The method of claim 1 wherein the image locations comprise pixels.
7. The method of claim 1 wherein the image locations comprise tokens.
8. A computer system which comprises:
a CPU; and
a memory storing an image file containing an image defined by image locations;
the CPU arranged and configured to execute a routine to generate a bi-illuminant chromaticity plane in a log color space for representing the image locations of the image in a log-chromaticity representation for the image, provide a set of estimates for an orientation of the bi-illuminant chromaticity plane and calculate a single orientation for each one of the image locations as a function of the set of estimates for an orientation.
9. A computer program product, disposed on a non-transitory computer readable media, the product including computer executable process steps operable to control a computer to: provide an image file depicting an image defined by image locations, in a computer memory, generate a bi-illuminant chromaticity plane in a log color space for representing the image locations of the image in a log-chromaticity representation for the image, provide a set of estimates for an orientation of the bi-illuminant chromaticity plane and calculate a single orientation for each one of the image locations as a function of the set of estimates for an orientation.
10. The computer program product of claim 9 wherein the process step to calculate a single orientation for each one of the image locations as a function of the set of estimates for an orientation is carried out by a process step to execute a k-NN algorithm.
11. The computer program product of claim 10 wherein the k-NN algorithm is based upon a weighted function of spatial and spectral distances between the image locations and the set of estimates for an orientation of the bi-illuminant chromaticity plane.
12. The computer program product of claim 9 wherein the process step to calculate a single orientation for each one of the image locations as a function of the set of estimates for an orientation is carried out by a process step to solve a system of linear equations representing constraints between values based upon selected ones of the set of estimates for an orientation of the bi-illuminant chromaticity plane.
13. The computer program product of claim 12 wherein the constraints include constraints selected from the group including a smoothness constraint, a data constraint, an anchor constraint, and combinations thereof.
14. The computer program product of claim 9 wherein the image locations comprise pixels.
15. The computer program product of claim 9 wherein the image locations comprise tokens.