- Happy Chinese New Year
- A Line Exercise Solution
- Review of Line Walk drawings
- Tone: The appearance of continuous tone can be made through processes of hatching, stippling, dithering, and halftoning, among other techniques.
- Introduction to Assignment 5, Tone
- What are some dimensions of variability that are used to achieve textures with tone? (Examples: density; line weight; duty cycle...)
You can hatch along, against, or perpendicular to natural gradients in the image.
Gérard Edelinck after Charles Le Brun, French, ca. 1675.
Hendrick Goltzius (1558–1617), Apostle Simon, 1589 (detail)
...or hatch in ways that ignore gradients in the "primary" visual material, establishing secondary flows in the image plane.
Contrasts:
Gradient of drawing devices:
Possibilities for dwelling-based halftoning (ink bleeding):
One way to establish tone is to use an alphabet of modular elements of varying luminance.
Leon Harmon & Ken Knowlton, Computer Nude (Studies in Perception I), 1967.
Computer Nude (Studies in Perception I) is the most widely circulated early artwork made using a computer. It demonstrates the unique capacity of the viewer's brain to interpret a composition of abstract symbols grouped to emulate areas of tonal value as a human figure. Leon Harmon, a researcher in cognitive neuroscience, and Ken Knowlton, a computer engineer at AT&T’s Bell Labs, reenvisioned a photograph of dancer Deborah Hay as a bitmap mosaic using a program they developed. Harmon and Knowlton were brought together by Experiments in Art and Technology (E.A.T.), a nonprofit group which aimed to provide creative minds with access to new technology and engineering professionals. A special scanner converted analog voltages to binary numbers which were assigned typographic symbols.
Rauschenberg hung a copy of this image in his studio during a press conference for an E.A.T. event. It was photographed and subsequently reproduced in an October 11, 1967, article in The New York Times titled “Art and Science Proclaim Alliance in Avant-Garde Loft,” becoming the publication’s first full-frontal nude. Due to the popularity of the image, a limited-edition screen print was created from the original work.
Live ASCII webcam video art by Alida Sun:
Some approaches:
Weighted Rejection Sampling (p5)
Rasterization with variable line weight (SpiralRaster)
Novel approaches to variable line density (SquiggleCam)
Traveling Salesman Problem tour
As Bosch and Wexler write, “Even though this tour is the best one possible and does indeed resemble the target image, it doesn’t achieve as good a likeness as the points do alone.” It seems like kind of a waste to solve the traveling salesman problem just to make the picture worse, so they decided to change the rules of the game.
Instead of clustering the points in their image, they start with a regular grid of points. The object of the game is then to connect them not with a path that solves the traveling salesman problem but with one that visually resembles the target image. The path should still hit each point exactly once, but now the winning trip will probably be longer than the TSP-optimal path.
Dithering is the problem of rendering a continuous-tone (or high bit-depth) raster image with fewer bits. There are many, many different techniques.
Some easy ones are: Threshold; Random; Bayer. (How do you suppose they work?)
Floyd-Steinberg is the most common dithering method. it works by using error diffusion, meaning it propagates (adds) the residual quantization error of a given pixel onto its neighboring pixels, to be dealt with later.
for each y from top to bottom do
for each x from left to right do
oldpixel := pixels[x][y]
newpixel := find_closest_palette_color(oldpixel)
pixels[x][y] := newpixel
quant_error := oldpixel - newpixel
pixels[x + 1][y ] := pixels[x + 1][y ] + quant_error × 7/16
pixels[x - 1][y + 1] := pixels[x - 1][y + 1] + quant_error × 3/16
pixels[x ][y + 1] := pixels[x ][y + 1] + quant_error × 5/16
pixels[x + 1][y + 1] := pixels[x + 1][y + 1] + quant_error × 1/16
If you want to nerd out, these articles are amazing.
- Wikipedia Article on Dithering
- Image Dithering: Eleven Algorithms and Source Code
- Ditherpunk — The article I wish I had about monochrome image dithering
- Joel Yliluoma's arbitrary-palette positional dithering algorithm
- Case Study: Dithering in Return of the Obra Dinn
- DITHERT: Dithering implementations in Processing
Work by Loackme (Loïc Schwaller)
Cajal Neural Drawings by Mark Webster