Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Error Diffusion Using Linear Pixel Shuffling Peter G. Anderson
 

Summary: Error Diffusion Using Linear Pixel Shuffling
Peter G. Anderson
Rochester Institute of Technology
Rochester, NY, USA
Abstract
Linear pixel shuffling error diffusion is a digital halfton­
ing algorithm that combines the linear pixel shuffling (LPS)
order of visiting pixels in an image with diffusion of quanti­
zation errors in all directions.
LPS uses a simple linear rule to produce a pixel ordering
giving a smooth, uniform probing of the image. This paper
elucidates that algorithm.
Like the Floyd­Steinberg algorithm, LPS error diffusion
enhances edges and retains high­frequency image informa­
tion. LPS error diffusion avoids some of the artifacts (``worm­
s,'' ``tears,'' and ``checkerboarding'') often associated with the
Floyd­Steinberg algorithm. LPS error diffusion requires the
entire image be available in memory; the Floyd­Steinberg al­
gorithm requires storage proportional only to a single scan
line.

  

Source: Anderson, Peter G. - Department of Computer Science, Rochester Institute of Technology

 

Collections: Computer Technologies and Information Sciences