home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!mailer.cc.fsu.edu!sun13!diku.dk
- From: torbenm@diku.dk (Torben AEgidius Mogensen)
- Newsgroups: comp.graphics.research
- Subject: Re: Fast dithering techniques?
- Message-ID: <11660@sun13.scri.fsu.edu>
- Date: 9 Jan 93 02:17:21 GMT
- References: <11626@sun13.scri.fsu.edu>
- Sender: news@sun13.scri.fsu.edu
- Organization: Department of Computer Science, U of Copenhagen
- Lines: 30
- Approved: murray@vs6.scri.fsu.edu
- X-Submissions-To: graphics@scri1.scri.fsu.edu
- X-Administrivia-To: graphics-request@scri1.scri.fsu.edu
-
- Tom_Lane@G.GP.CS.CMU.EDU writes:
-
- >The free JPEG image compression software currently uses traditional
- >Floyd-Steinberg dithering when reducing the number of colors in its output.
-
- >Even with careful coding, F-S dithering is a remarkably expensive
- >proposition... in our current release, dithering *alone* (not counting color
- >selection) takes nearly as much time as JPEG decompression proper.
-
- >If anyone is aware of cheaper dithering techniques that give results as good
- >as F-S, or of implementation tricks to speed up F-S, I'd appreciate hearing
- >about them.
-
- I once made a variant of F-S that was somewhat faster: instead of
- distributing the error to four neighbouring pixels, distribute it to
- only one. The idea is to make the choice of which pixel to distribute
- to random: in the simplest case you randomly choose either the next
- pixel on the same scan-line or the same pixel on the next scan-line.
- You need a fast way to generate random bits, bit a simple
- shift-register method works reasonably well. If you want slightly
- better quality, you randomly choose one of the four pixels that F-S
- would distribute the error to.
-
- The quality is not quite up to the standard of F-S, but nearly so.
-
- Torben Mogensen (torbenm@diku.dk)
-
- --
- Moderated by SCRI Vis <> Submissions to: graphics@scri1.scri.fsu.edu
- Guy, John R. Murray <> Administrivia to: graphics-request@scri1.scri.fsu.edu
-