Half Toning - PowerPoint PPT Presentation

About This Presentation
Title:

Half Toning

Description:

Your eye will average over an area - Spatial Integration. Thresholding ... Pink(low), Blue (high), White(all) frequency noise. Pink. Blue. The trouble with noise ... – PowerPoint PPT presentation

Number of Views:81
Avg rating:3.0/5.0
Slides: 75
Provided by: thearbe
Category:
Tags: half | toning | whiteeye

less

Transcript and Presenter's Notes

Title: Half Toning


1
Half Toning
2
Continuous Half Toning
3
Color Half Toning
4
Half toning and Colors
5
Digital Half Toning
6
(No Transcript)
7
Half Toning
Emulating 5 different levels
8
Half Toning
10 levels
9
Original
10
Half Toning
11
Original
12
Dithering
13
Dithering and Halftoning
  • Trade spatial for intensity resolution
  • (works well for printing where dot printing is
    very high)
  • Thresholding.
  • Random dither Roberts algorithm
  • Ordered dither
  • Error diffusion
  • Your eye will average over an area
  • - Spatial Integration

14
Thresholding
  • Assume we want to quantize a gray-level image to
    a binary colormap.
  • Map the upper half of the gray-level scale to
    white, and the lower half to black a simple
    threshold operation, preformed independently at
    each pixel.

15
Thresholding
Original image.
Simple threshold.
n 0.5
Errors are low spatial frequencies.
16
Roberts Algorithm
  • First add noise
  • Then quantize

i
r 1
1
Quantized to 1
Quantized to 0
r
0
x
Moves errors to higher spatial frequencies. -gt
eye averages over an area.
17
Threshold
18
Threshold Noise
19
Roberts Algorithm
Pink
Blue
20
Roberts Algorithm
  • Moves low frequency (average error) to high
    frequency
  • Pink(low), Blue (high), White(all) frequency noise

Pink
Blue
21
The trouble with noise
  • Difficult to compute quickly.
  • Not reproducible.
  • Pre-compute pseudo-random function and store in
    table.
  • Small tiled patterns sufficient

22
Dithering
  • It is possible to improve the quality of a
    quantized image by distributing the quantized
    error.
  • Lets have a closer look.

23
Dithering
Thresholding
Dithering
24
Dithering
Each pixel produces a quatization error The
quality of the result may be improved by
adjusting the threshold locally, so that adjacent
pixels in small areas are quantized with
different thresholds. This reduces the average
local quantization error. Matrices of these
threshold are called dither matrices.
25
Threshold Noise
26
Dithering
27
Ordered Dithering
  • Trade off spatial resolution for intensity
    resolution.
  • Use dither patterns.
  • Can be represented as a matrix.

28
Bayer Ordered Dither Patterns
29
Other possibilities
30
The dithering matrix (3x3)
For all Xpixels For all Ypixels v
approximate(x,y) i x mod 3 j
y mod 3 if v gt Mi,j then
Set_Pixel(x,y, BLACK) else
Set_Pixel(x,y, WHITE)
31
Dithering
5
7
3
6
1
2
Dithering mask
9
4
8
1
2
3
Image
2
2
3
8
4
4
Binary image
32
Original
33
Dithering
34
Dithering
35
Error Diffusion
36
Floyd-Steinberg Error Diffusion
With this method, the average quatization error
is reduced by propagating the error from each
pixel to some of its neighbors in the scan order.
37
1D Error Diffusion
1
0
1
38
1D Error Diffusion
1
0
39
1D Error Diffusion
1
0
40
1D Error Diffusion
1
0
41
1D Error Diffusion
1
0
0
1
42
1D Error Diffusion
1
0
0
1
1
43
1D Error Diffusion
1
0
44
1D Error Diffusion
1
0
45
1D Error Diffusion
1
0
46
Floyd-Steinberg Error Diffusion
With this method, the average quatization error
is reduced by propagating the error from each
pixel to some of its neighbors in the scan order.
Note that the error propagation weights must sum
to one
47
Dither vs. Floyd-Steinberg
48
(No Transcript)
49
Original Picture
50
Dithering result
Error diffusion result
51
Examples Continue
52
Dithering
Dithering Note that each square ring is of
different brightness
53
Error Diffusion
Error Diffusion Note that the error is
distributed across the layers
54
Examples Continue
Original
55
Dithering
56
Error Diffusion
57
(No Transcript)
58
(No Transcript)
59
Error Diffusion
Set AccErr to zero For each pixel in the image
scanning from left to right value
Pixel_value(x,y) AccErrx,y if (value gt
WHITE/2) Set_pixel(x,y, WHITE) Error value
- WHITE else Set_pixel(x,y,
BLACK) Error value - BLACK
if scanning from left to right
AccErrx1, y 3/8 Error AccErrx,
y1 3/8 Error AccErrx1,y1
2/8 Error
60
Space Filling Curves
  • order of scan

61
Space Filling Curves
Hilbert curve (1-4)
62
Space Filling Curves
Hilbert curve (1-4)
63
Space Filling Curves
Hilbert curve (1-4)
64
Space Filling Curves
Hilbert curve (1-4)
65
Space Filling Curves
Peano curve
66
Context Based SFC
67
Original Image
68
Threshholding
69
Bayers Ordered Dithering
70
Error Diffusion
71
Median Cut (4 levels)
72
Median Cut (8 levels)
73
(No Transcript)
74
(No Transcript)
75
(No Transcript)
76
(No Transcript)
77
(No Transcript)
Write a Comment
User Comments (0)
About PowerShow.com