Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3394018
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T04:07:12+00:00 2026-05-18T04:07:12+00:00

I know that Floyd–Steinberg dithering algorithm can’t be implemented with pixel shader, because that

  • 0

I know that Floyd–Steinberg dithering algorithm can’t be implemented with pixel shader, because that algorithm is strictly sequential. But maybe there exist some higly parallel dithering algorithm which by it’s visual output is similar to Floyd-Steinberg algorithm ?

So the question is – What are dithering algorithms which are suitable to implement on pixel shader (preferably GLSL) and with output quality (very) similar to Floyd-Steinberg dithering ?

BTW. Multi-pass algorithms are allowed until there are not more than 2 passes and CPU overhead between those passes is small.

Any ideas ?

EDIT:
I need dithering from 24-bit color to 21-bit color.
(That is – i need to convert from 8 bits/channel to 7 bits/channel.)

EDIT 2
Maybe I’ve not explained problem very well. So i’ll try to expand a bit on exact problem.
Problem is this – consider we have this picture:
alt text

And we have above picture, but processed with dithering algorithm:
alt text

Now this is procedure which will test your dithering is good for me or not:

1. Load these pictures in Photoshop as one picture with 2 layers.

2. Choose Layers blending mode to “Difference”.

3. Perform “Merge Visible” operation on layers, to get just one layer.

4. Perform operation => Image/Adjustments/Equalize

After that you must get such image:
alt text

As you see – middle pixels which was in monotone red color was not dithered at all.
Also dithering of left and right image zones is a bit different. Try to reconstruct dithering algorithm with such behavior.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-18T04:07:13+00:00Added an answer on May 18, 2026 at 4:07 am

    If you are reducing from 8 bits to 7, you are throwing away almost no information. Are you sure you even need to dither?

    If you need to dither, add random noise and then clip, it will be plenty good for your application.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I know that usually you want to strip these out, but I need the
I know that .NET lambda expressions can capture outer variables. However, I have seen
I know that the foreach loop used in the following example doesn't compile. But
I know that default mail transport could be set in bootstrap file but how
I know that fetching a cursor will give me access to variables like %ROWCOUNT,
I know that the implementation of threads in the Linux kernel and libc went
I know that the user defines them in different ways (XML compared to UML
I need a flood fill algorithm to fill existing raster shapes with various colors
Hey folks. Trying to get started with iPhone video capture stuff, and having a

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.