Process for providing digital halftone images with random error diffusion

Claim 2

A digital halftoning process with random error diffusion for reducing visually apparent artifacts in images that are produced by digital halftone printing, comprising the steps of: scanning an image to detect intensity values at selected pixel locations; encoding selected ones of the pixel locations as one binary value when the detected intensity value at a location is less than a predetermined threshold value, and calculating error values for such pixel locations that equal the detected intensity values; encoding selected other ones of the pixel locations as a second binary value when the detected intensity values at those locations are greater than the predetermined threshold value, and calculating error values for those locations that equal the detected intensity values less the upper limit of the intensity scale; for selected pixel neighbors of the ith pixel in an image, diffusing the calculated error value, E i , of the ith pixel location to its selected neighbors as follows: e.sub.j =(w.sub.j)E.sub.i e j is the error value diffused to the jth pixel neighbor from the ith pixel location, where the jth pixel neighbor is randomly determined from a predetermined set of pixels neighboring the ith pixel, and where w j is a weighting factor determined for the jth pixel location; continuing the error diffusion process for the other pixel neighbors of the ith pixel location; continuing the error diffusion process for the (i+1)th pixel location and so forth, such that coding errors are diffused from substantially all of the pixel locations in a scanned image; and printing images by digital halftone printing based upon intensity values of pixel locations that have been modified by error diffusion.

Claim 3

A digital halftoning process according to claim 1 wherein the predetermined set of neighbor pixels comprises pixels that are immediately adjacent neighbors to a selected ith pixel location.

Claim 4

A digital halftoning process according to claim 2 wherein the predetermined set of neighbor pixels comprises the pixel that immediately follows a selected ith pixel location, a pixel immediately below the selected ith pixel location, and the pixels that immediately precede and follow the pixel immediately below the selected ith pixel location.

Claim 5

A digital halftoning process according to claim 1 wherein the selected threshold value is a number about midway along the selected intensity scale.

Claim 6

A digital halftoning process according to claim 4 wherein the selected threshold value is a constant.

Claim 7

A digital halftoning process according to claim 4 wherein the selected threshold value is randomly varied in a relatively narrow range about a chosen central value.

Claim 8

A digital halftoning process according to claim 1 wherein for each pixel location from which coding error is diffused, a random choice is made of the order in which the errors are diffused to immediately-adjacent neighbors of the pixel location under consideration.

Claim 9

A digital halftoning process according to claim 7 wherein the set of immediately-adjacent neighbors for each selected pixel location comprises four immediately-adjacent neighboring pixel locations.

Claim 10

A digital halftoning process according to claim 8 wherein the order of pixel locations within the predetermined set is randomly selected.

Claim 11

A digital halftoning process according to claim 1 wherein the weighting factors are determined as follows: for the first randomly chosen adjacent neighbor pixel, assigning a weighting factor w di which is randomly selected from a distribution of numbers between 0.0 and 1.0; for the second chosen adjacent neighbor pixel, assigning a weighting factor w dj which is randomly selected from a distribution of numbers between 0.0 and (1.0-w di ); for the third randomly chosen adjacent neighbor pixel, assigning a weighting factor w dk which is randomly selected from a distribution of numbers between 0.0 and (1.0-w dj ); and for the last remaining pixel of said set, assigning a weighting factor w dl where w.sub.dl =1-w.sub.di -w.sub.dj -w.sub.dk.

Claim 12

A digital halftoning process with random error diffusion for reducing visually apparent artifacts in images that are produced by digital halftone printing, comprising the steps of: scanning an image to detect intensity values at selected pixel locations; for a first selected pixel location, encoding the pixel location as one binary value when the detected intensity value at the location is less than a predetermined threshold value, and assigning an error value to the pixel location equal to the detected intensity value; when the detected intensity value at the first selected pixel location is greater than the threshold value, encoding the pixel location as a second binary value and calculating an error value for that location that equals the detected intensity value less the upper limit of the intensity scale; randomly choosing a first neighbor to the first pixel location from a predetermined set of neighboring pixels; for the first randomly chosen neighbor, assigning a weighting factor which is randomly selected; randomly choosing other neighbors to the first pixel location from the first predetermined set, and assigning weighting factors to those locations that are randomly selected; for the selected pixel neighbors, diffusing error values as follows: e.sub.j =(w.sub.j)E.sub.i e j is the error value diffused to the jth pixel neighbor from the ith pixel where the jth pixel neighbor is randomly determined from a predetermined set of pixels neighboring the ith pixel, w j is the weight determined for the jth pixel location, and E i is the error value assigned to the ith pixel location; assigning revised gray-scale values to the selected neighbor pixels such that the revised gray-scale values equal the detected gray-scale values plus the diffused gray-scale values; and printing images by digital halftone printing based upon intensity values of pixel locations that have been modified by error diffusion.

Claim 13

A digital halftoning process with random error diffusion for reducing visually apparent artifacts in images that are produced by digital halftone printing, comprising the steps of: scanning an image to detect intensity values at selected pixel locations; for a first selected pixel location, encoding the pixel location as one binary value when the detected intensity value at the location is less than a predetermined threshold value, and assigning an error value to the pixel location equal to the detected intensity value; when the detected intensity value at the first selected pixel location is greater than the threshold value, encoding the pixel location as a second binary value and calculating an error value for that location that equals the detected intensity value less the upper limit of the intensity scale; randomly choosing a first neighbor to the first pixel location from a predetermined set of neighboring pixels; for the first randomly chosen neighbor, assigning a weighting factor which is randomly selected; randomly choosing other neighbors to the first pixel location from the first predetermined set, and assigning weighting factors to those locations that are randomly selected; for the selected pixel neighbors, diffusing error values as follows: e.sub.j =(w.sub.j)E.sub.i e j is the error value diffused to the jth pixel neighbor from the ith pixel where the jth pixel neighbor is randomly determined from a predetermined set of pixels neighboring the ith pixel, w j is the weight determined for the jth pixel location, and E i is the error value assigned to the ith pixel location; assigning revised gray-scale values to the selected neighbor pixels such that the revised gray-scale values equal the detected gray-scale values plus the diffused gray-scale values; and printing images by digital halftone printing based upon intensity values of pixel locations that have been modified by error diffusion.

Claim 14

A digital halftoning process according to claim 11 wherein the predetermined set of neighbor pixels comprises pixels that are immediately adjacent neighbors.

Claim 15

A digital halftoning process according to claim 11 wherein the predetermined set of neighbor pixels comprises the pixel that immediately follows a selected pixel, a pixel immediately below the selected pixel, and the pixels that immediately precede and follow the pixel immediately below the selected pixel.

Claim 16

A digital halftoning process with random error diffusion for reducing visually apparent artifacts in images that are produced by digital halftone printing, comprising the steps of: detecting intensity values of an image at selected pixel locations; for a selected pixel location, encoding the pixel location as one binary value when the detected intensity value at the location is less than a predetermined threshold value, and assigning an error value E x ,y to the pixel location equal to the detected intensity value; when the detected intensity value at the selected pixel location is greater than the threshold value, encoding the pixel location as a second binary value and calculating an error value for the pixel location that equals the detected intensity value less the upper limit of the intensity scale; randomly choosing a first adjacent neighbor pixel to the selected pixel location where the adjacent neighbor is one of four pixels comprised of the set that includes the pixel which immediately follows the selected pixel, the pixel immediately below the first pixel, and the pixels which immediately precede and follow the pixel immediately below the selected pixel; for the first randomly chosen adjacent neighbor pixel, assigning a weight w di which is randomly selected from a distribution of numbers between 0.0 and 1.0: randomly choosing a second adjacent neighbor to the first-selected pixel location where the second chosen adjacent neighbor pixel is one of the three remaining pixels of said set; for the second chosen adjacent neighbor pixel, assigning a weight w dj which is randomly selected from a distribution of numbers between 0.0 and (1.0-w di ); randomly choosing a third adjacent neighbor to the initially-selected pixel where the third chosen adjacent neighbor pixel is one of the two remaining pixels of said set; for the third randomly chosen adjacent neighbor pixel, assigning a weight w dk which is randomly selected from a distribution of numbers between 0.0 and (1.0-w di -w dj ); determining the one remaining pixel of said set and assigning a weight w dl to it where w.sub.dl =1-w.sub.di -w.sub.dj -w.sub.dk ; for the first, second, third and fourth neighbor pixels, determining respective error values as follows: e.sub.1 =(w.sub.di)E.sub.x,y e.sub.2 =(w.sub.dj)E.sub.x,y e.sub.3 =(w.sub.dk)E.sub.x,y, and e.sub.4 =(w.sub.dl)E.sub.x,y ; assigning revised gray-scale values to the first, second, third and fourth adjacent neighbor pixels, respectively, as follows: pixel'.sub.(x+1,y) =pixel.sub.(x+1,y) +e.sub.1 pixel'.sub.(x+1,y+1) =pixel.sub.(x+1,y+1) +e.sub.2 pixel'.sub.(x,y+1) =pixel.sub.(x,y+1) +e.sub.3 and pixel'.sub.(x+1,y+1) =pixel.sub.(x-1,y+1) +e.sub.4 where the primes indicate the revised gray-scale values of the pixel locations; continuing the above-described error diffusion process as subsequent pixel locations are scanned; and printing based upon the diffused error values.

Claim 17

A digital halftoning process with random error diffusion for reducing visually apparent artifacts in images that are produced by digital halftone printing, comprising the steps of: detecting intensity values of an image at selected pixel locations; for a selected pixel location, encoding the pixel location as one binary value when the detected intensity value at the location is less than a predetermined threshold value, and assigning an error value E x ,y to the pixel location equal to the detected intensity value; when the detected intensity value at the selected pixel location is greater than the threshold value, encoding the pixel location as a second binary value and calculating an error value for the pixel location that equals the detected intensity value less the upper limit of the intensity scale; randomly choosing a first adjacent neighbor pixel to the selected pixel location where the adjacent neighbor is one of four pixels comprised of the set that includes the pixel which immediately follows the selected pixel, the pixel immediately below the first pixel, and the pixels which immediately precede and follow the pixel immediately below the selected pixel; for the first randomly chosen adjacent neighbor pixel, assigning a weight w di which is randomly selected from a distribution of numbers between 0.0 and 1.0: randomly choosing a second adjacent neighbor to the first-selected pixel location where the second chosen adjacent neighbor pixel is one of the three remaining pixels of said set; for the second chosen adjacent neighbor pixel, assigning a weight w dj which is randomly selected from a distribution of numbers between 0.0 and (1.0-w di ); randomly choosing a third adjacent neighbor to the initially-selected pixel where the third chosen adjacent neighbor pixel is one of the two remaining pixels of said set; for the third randomly chosen adjacent neighbor pixel, assigning a weight w dk which is randomly selected from a distribution of numbers between 0.0 and (1.0-w di -w dj ); determining the one remaining pixel of said set and assigning a weight w dl to it where w.sub.dl =1-w.sub.di -w.sub.dj -w.sub.dk ; for the first, second, third and fourth neighbor pixels, determining respective error values as follows: e.sub.1 =(w.sub.di)E.sub.x,y e.sub.2 =(w.sub.dj)E.sub.x,y e.sub.3 =(w.sub.dk)E.sub.x,y, and e.sub.4 =(w.sub.dl)E.sub.x,y ; assigning revised gray-scale values to the first, second, third and fourth adjacent neighbor pixels, respectively, as follows: pixel'.sub.(x+1,y) =pixel.sub.(x+1,y) +e.sub.1 pixel'.sub.(x+1,y+1) =pixel.sub.(x+1,y+1) +e.sub.2 pixel'.sub.(x,y+1) =pixel.sub.(x,y+1) +e.sub.3 and pixel'.sub.(x+1,y+1) =pixel.sub.(x-1,y+1) +e.sub.4 where the primes indicate the revised gray-scale values of the pixel locations; continuing the above-described error diffusion process as subsequent pixel locations are scanned; and printing based upon the diffused error values.

Claim 18

A digital halftoning process according to claim 14 wherein the distribution of numbers is an even distribution.