Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Try to Implement Atkinson Dithering Algorithm #5

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Try to Implement Atkinson Dithering Algorithm #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 28 additions & 13 deletions esp32_firmware/esp32_cam_uart_stream/esp32_cam_uart_stream.ino
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -166,18 +166,33 @@ bool IsDarkBit(uint8_t bit){
return result;
}

void DitherImage(camera_fb_t* fb) {
for(uint8_t y = 0; y < fb->height; ++y){
for (uint8_t x = 0; x < fb->width; ++x){
size_t current = (y*fb->width) + x;
uint8_t oldpixel = fb->buf[current];
uint8_t newpixel = oldpixel >= 128 ? 255 : 0;
fb->buf[current] = newpixel;
uint8_t quant_error = oldpixel - newpixel;
fb->buf[(y*fb->width) + x + 1] = fb->buf[(y*fb->width) + x + 1] + quant_error * 7 / 16;
fb->buf[(y+1*fb->width) + x-1] = fb->buf[(y+1*fb->width) + x-1] + quant_error * 3 / 16;
fb->buf[(y + 1*fb->width) + x] = fb->buf[(y + 1*fb->width) + x] + quant_error * 5 / 16;
fb->buf[(y+1*fb->width) + x+1] = fb->buf[(y+1*fb->width) + x+1] + quant_error * 1 / 16;
void DitherImage(camera_fb_t *fb) {
for (uint8_t y = 0; y < fb->height; ++y) {
for (uint8_t x = 0; x < fb->width; ++x) {
size_t current = (y * fb->width) + x;
uint8_t oldpixel = fb->buf[current];
uint8_t newpixel = oldpixel >= 128 ? 255 : 0;
fb->buf[current] = newpixel;
int8_t quant_error = oldpixel - newpixel;

if (x + 1 < fb->width) {
fb->buf[y * fb->width + x + 1] += (quant_error * 1 / 8);
}
}
if (x + 2 < fb->width) {
fb->buf[y * fb->width + x + 2] += (quant_error * 1 / 8);
}
if (x > 0 && y + 1 < fb->height) {
fb->buf[(y + 1) * fb->width + x - 1] += (quant_error * 1 / 8);
}
if (y + 1 < fb->height) {
fb->buf[(y + 1) * fb->width + x] += (quant_error * 1 / 8);
}
if (y + 1 < fb->height && x + 1 < fb->width) {
fb->buf[(y + 1) * fb->width + x + 1] += (quant_error * 1 / 8);
}
if (y + 2 < fb->height) {
fb->buf[(y + 2) * fb->width + x] += (quant_error * 1 / 8);
}
}
}
}