Repository: fogleman/primitive
Branch: master
Commit: 0373c216458b
Files: 26
Total size: 63.6 KB
Directory structure:
gitextract_s2bcgc36/
├── .gitignore
├── LICENSE.md
├── README.md
├── bot/
│ ├── .gitignore
│ ├── main.py
│ └── requirements.txt
├── main.go
├── primitive/
│ ├── color.go
│ ├── core.go
│ ├── ellipse.go
│ ├── heatmap.go
│ ├── log.go
│ ├── model.go
│ ├── optimize.go
│ ├── polygon.go
│ ├── quadratic.go
│ ├── raster.go
│ ├── rectangle.go
│ ├── scanline.go
│ ├── shape.go
│ ├── state.go
│ ├── triangle.go
│ ├── util.go
│ └── worker.go
└── scripts/
├── html.py
└── process.py
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitignore
================================================
/*.png
/*.svg
/*.gif
================================================
FILE: LICENSE.md
================================================
Copyright (C) 2016 Michael Fogleman
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
================================================
FILE: README.md
================================================
# Primitive Pictures
Reproducing images with geometric primitives.
### How it Works
A target image is provided as input. The algorithm tries to find the single most optimal shape that can be drawn to minimize the error between the target image and the drawn image. It repeats this process, adding *one shape at a time*. Around 50 to 200 shapes are needed to reach a result that is recognizable yet artistic and abstract.
### Primitive for macOS
Now available as a native Mac application!
https://primitive.lol/
### Twitter
Follow [@PrimitivePic](https://twitter.com/PrimitivePic) on Twitter to see a new primitive picture every 30 minutes!
The Twitter bot looks for interesting photos using the Flickr API, runs the algorithm using randomized parameters, and
posts the picture using the Twitter API.
You can tweet a picture to the bot and it will process it for you.
### Command-line Usage
Run it on your own images! First, [install Go](https://golang.org/doc/install).
go get -u github.com/fogleman/primitive
primitive -i input.png -o output.png -n 100
Small input images should be used (like 256x256px). You don't need the detail anyway and the code will run faster.
| Flag | Default | Description |
| --- | --- | --- |
| `i` | n/a | input file |
| `o` | n/a | output file |
| `n` | n/a | number of shapes |
| `m` | 1 | mode: 0=combo, 1=triangle, 2=rect, 3=ellipse, 4=circle, 5=rotatedrect, 6=beziers, 7=rotatedellipse, 8=polygon |
| `rep` | 0 | add N extra shapes each iteration with reduced search (mostly good for beziers) |
| `nth` | 1 | save every Nth frame (only when `%d` is in output path) |
| `r` | 256 | resize large input images to this size before processing |
| `s` | 1024 | output image size |
| `a` | 128 | color alpha (use `0` to let the algorithm choose alpha for each shape) |
| `bg` | avg | starting background color (hex) |
| `j` | 0 | number of parallel workers (default uses all cores) |
| `v` | off | verbose output |
| `vv` | off | very verbose output |
### Output Formats
Depending on the output filename extension provided, you can produce different types of output.
- `PNG`: raster output
- `JPG`: raster output
- `SVG`: vector output
- `GIF`: animated output showing shapes being added - requires ImageMagick (specifically the `convert` command)
For PNG and SVG outputs, you can also include `%d`, `%03d`, etc. in the filename. In this case, each frame will be saved separately.
You can use the `-o` flag multiple times. This way you can save both a PNG and an SVG, for example.
### Progression
This GIF demonstrates the iterative nature of the algorithm, attempting to minimize the mean squared error by adding one shape at a time. (Use a ".gif" output file to generate one yourself!)
", model.Sw, model.Sh))
lines = append(lines, fmt.Sprintf("", model.Scale))
for i, shape := range model.Shapes {
c := model.Colors[i]
attrs := "fill=\"#%02x%02x%02x\" fill-opacity=\"%f\""
attrs = fmt.Sprintf(attrs, c.R, c.G, c.B, float64(c.A)/255)
lines = append(lines, shape.SVG(attrs))
}
lines = append(lines, " ")
lines = append(lines, " ")
return strings.Join(lines, "\n")
}
func (model *Model) Add(shape Shape, alpha int) {
before := copyRGBA(model.Current)
lines := shape.Rasterize()
color := computeColor(model.Target, model.Current, lines, alpha)
drawLines(model.Current, color, lines)
score := differencePartial(model.Target, before, model.Current, model.Score, lines)
model.Score = score
model.Shapes = append(model.Shapes, shape)
model.Colors = append(model.Colors, color)
model.Scores = append(model.Scores, score)
model.Context.SetRGBA255(color.R, color.G, color.B, color.A)
shape.Draw(model.Context, model.Scale)
}
func (model *Model) Step(shapeType ShapeType, alpha, repeat int) int {
state := model.runWorkers(shapeType, alpha, 1000, 100, 16)
// state = HillClimb(state, 1000).(*State)
model.Add(state.Shape, state.Alpha)
for i := 0; i < repeat; i++ {
state.Worker.Init(model.Current, model.Score)
a := state.Energy()
state = HillClimb(state, 100).(*State)
b := state.Energy()
if a == b {
break
}
model.Add(state.Shape, state.Alpha)
}
// for _, w := range model.Workers[1:] {
// model.Workers[0].Heatmap.AddHeatmap(w.Heatmap)
// }
// SavePNG("heatmap.png", model.Workers[0].Heatmap.Image(0.5))
counter := 0
for _, worker := range model.Workers {
counter += worker.Counter
}
return counter
}
func (model *Model) runWorkers(t ShapeType, a, n, age, m int) *State {
wn := len(model.Workers)
ch := make(chan *State, wn)
wm := m / wn
if m%wn != 0 {
wm++
}
for i := 0; i < wn; i++ {
worker := model.Workers[i]
worker.Init(model.Current, model.Score)
go model.runWorker(worker, t, a, n, age, wm, ch)
}
var bestEnergy float64
var bestState *State
for i := 0; i < wn; i++ {
state := <-ch
energy := state.Energy()
if i == 0 || energy < bestEnergy {
bestEnergy = energy
bestState = state
}
}
return bestState
}
func (model *Model) runWorker(worker *Worker, t ShapeType, a, n, age, m int, ch chan *State) {
ch <- worker.BestHillClimbState(t, a, n, age, m)
}
================================================
FILE: primitive/optimize.go
================================================
package primitive
import (
"math"
"math/rand"
)
type Annealable interface {
Energy() float64
DoMove() interface{}
UndoMove(interface{})
Copy() Annealable
}
func HillClimb(state Annealable, maxAge int) Annealable {
state = state.Copy()
bestState := state.Copy()
bestEnergy := state.Energy()
step := 0
for age := 0; age < maxAge; age++ {
undo := state.DoMove()
energy := state.Energy()
if energy >= bestEnergy {
state.UndoMove(undo)
} else {
// fmt.Printf("step: %d, energy: %.6f\n", step, energy)
bestEnergy = energy
bestState = state.Copy()
age = -1
}
step++
}
return bestState
}
func PreAnneal(state Annealable, iterations int) float64 {
state = state.Copy()
previous := state.Energy()
var total float64
for i := 0; i < iterations; i++ {
state.DoMove()
energy := state.Energy()
total += math.Abs(energy - previous)
previous = energy
}
return total / float64(iterations)
}
func Anneal(state Annealable, maxTemp, minTemp float64, steps int) Annealable {
factor := -math.Log(maxTemp / minTemp)
state = state.Copy()
bestState := state.Copy()
bestEnergy := state.Energy()
previousEnergy := bestEnergy
for step := 0; step < steps; step++ {
pct := float64(step) / float64(steps-1)
temp := maxTemp * math.Exp(factor*pct)
undo := state.DoMove()
energy := state.Energy()
change := energy - previousEnergy
if change > 0 && math.Exp(-change/temp) < rand.Float64() {
state.UndoMove(undo)
} else {
previousEnergy = energy
if energy < bestEnergy {
// pct := float64(step*100) / float64(steps)
// fmt.Printf("step: %d of %d (%.1f%%), temp: %.3f, energy: %.6f\n",
// step, steps, pct, temp, energy)
bestEnergy = energy
bestState = state.Copy()
}
}
}
return bestState
}
================================================
FILE: primitive/polygon.go
================================================
package primitive
import (
"fmt"
"strings"
"github.com/fogleman/gg"
"github.com/golang/freetype/raster"
)
type Polygon struct {
Worker *Worker
Order int
Convex bool
X, Y []float64
}
func NewRandomPolygon(worker *Worker, order int, convex bool) *Polygon {
rnd := worker.Rnd
x := make([]float64, order)
y := make([]float64, order)
x[0] = rnd.Float64() * float64(worker.W)
y[0] = rnd.Float64() * float64(worker.H)
for i := 1; i < order; i++ {
x[i] = x[0] + rnd.Float64()*40 - 20
y[i] = y[0] + rnd.Float64()*40 - 20
}
p := &Polygon{worker, order, convex, x, y}
p.Mutate()
return p
}
func (p *Polygon) Draw(dc *gg.Context, scale float64) {
dc.NewSubPath()
for i := 0; i < p.Order; i++ {
dc.LineTo(p.X[i], p.Y[i])
}
dc.ClosePath()
dc.Fill()
}
func (p *Polygon) SVG(attrs string) string {
ret := fmt.Sprintf(
"'
path = '%s.jpg' % name
print ' '
def main():
args = sys.argv[1:]
print HEADER
run(args[0], args[1])
print FOOTER
HEADER = '''
PrimitivePic
original
50 shapes
100 shapes
200 shapes
'''
FOOTER = '''
'''
if __name__ == '__main__':
main()
================================================
FILE: scripts/process.py
================================================
from Queue import Queue
import itertools
import os
import subprocess
import sys
import threading
def makedirs(x):
try:
os.makedirs(x)
except Exception:
pass
def primitive(i, o, n, a, m):
makedirs(os.path.split(o)[0])
args = (i, o, n, a, m)
cmd = 'primitive -r 128 -s 512 -i %s -o %s -n %d -a %d -m %d' % args
subprocess.call(cmd, shell=True)
def create_jobs(in_folder, out_folder, n, a, m):
result = []
for name in os.listdir(in_folder):
base, ext = os.path.splitext(name)
if ext.lower() not in ['.jpg', '.jpeg', '.png']:
continue
out_name = '%d.%%d.png' % (m)
in_path = os.path.join(in_folder, name)
out_path = os.path.join(out_folder, base, out_name)
if os.path.exists(out_path):
continue
key = (base, n, m)
args = (in_path, out_path, n, a, m)
result.append((key, args))
return result
def worker(jobs, done):
while True:
job = jobs.get()
log(job)
primitive(*job)
done.put(True)
def process(in_folder, out_folder, nlist, alist, mlist, nworkers):
jobs = Queue()
done = Queue()
for i in xrange(nworkers):
t = threading.Thread(target=worker, args=(jobs, done))
t.setDaemon(True)
t.start()
count = 0
items = []
for n, a, m in itertools.product(nlist, alist, mlist):
for item in create_jobs(in_folder, out_folder, n, a, m):
items.append(item)
items.sort()
for _, job in items:
jobs.put(job)
count += 1
for i in xrange(count):
done.get()
log_lock = threading.Lock()
def log(x):
with log_lock:
print x
if __name__ == '__main__':
args = sys.argv[1:]
nlist = [500]
alist = [128]
mlist = [0, 1, 3, 5]
nworkers = 4
process(args[0], args[1], nlist, alist, mlist, nworkers)
### Static Animation
Since the algorithm has a random component to it, you can run it against the same input image multiple times to bring life to a static image.
### Creative Constraints
If you're willing to dabble in the code, you can enforce constraints on the shapes to produce even more interesting results. Here, the rectangles are constrained to point toward the sun in this picture of a pyramid sunset.
### Shape and Iteration Comparison Matrix
The matrix below shows triangles, ellipses and rectangles at 50, 100 and 200 iterations each.
### How it Works, Part II
Say we have a `Target Image`. This is what we're working towards recreating. We start with a blank canvas, but we fill it with a single solid color. Currently, this is the average color of the `Target Image`. We call this new blank canvas the `Current Image`. Now, we start evaluating shapes. To evaluate a shape, we draw it on top of the `Current Image`, producing a `New Image`. This `New Image` is compared to the `Target Image` to compute a score. We use the [root-mean-square error](https://en.wikipedia.org/wiki/Root-mean-square_deviation) for the score.
Current Image + Shape => New Image
RMSE(New Image, Target Image) => Score
The shapes are generated randomly. We can generate a random shape and score it. Then we can mutate the shape (by tweaking a triangle vertex, tweaking an ellipse radius or center, etc.) and score it again. If the mutation improved the score, we keep it. Otherwise we rollback to the previous state. Repeating this process is known as [hill climbing](https://en.wikipedia.org/wiki/Hill_climbing). Hill climbing is prone to getting stuck in local minima, so we actually do this many different times with several different starting shapes. We can also generate N random shapes and pick the best one before we start hill climbing. [Simulated annealing](https://en.wikipedia.org/wiki/Simulated_annealing) is another good option, but in my tests I found the hill climbing technique just as good and faster, at least for this particular problem.
Once we have found a good-scoring shape, we add it to the `Current Image`, where it will remain unchanged. Then we start the process again to find the next shape to draw. This process is repeated as many times as desired.
### Primitives
The following primitives are supported:
- Triangle
- Rectangle (axis-aligned)
- Ellipse (axis-aligned)
- Circle
- Rotated Rectangle
- Combo (a mix of the above in a single image)
More shapes can be added by implementing the following interface:
```go
type Shape interface {
Rasterize() []Scanline
Copy() Shape
Mutate()
Draw(dc *gg.Context)
SVG(attrs string) string
}
```
### Features
- [Hill Climbing](https://en.wikipedia.org/wiki/Hill_climbing) or [Simulated Annealing](https://en.wikipedia.org/wiki/Simulated_annealing) for optimization (hill climbing multiple random shapes is nearly as good as annealing and faster)
- Scanline rasterization of shapes in pure Go (preferable for implementing the features below)
- Optimal color computation based on affected pixels for each shape (color is directly computed, not optimized for)
- Partial image difference for faster scoring (only pixels that change need be considered)
- Anti-aliased output rendering
### Inspiration
This project was originally inspired by the popular and excellent work of Roger Johansson - [Genetic Programming: Evolution of Mona Lisa](https://rogeralsing.com/2008/12/07/genetic-programming-evolution-of-mona-lisa/). Since seeing that article when it was quite new, I've tinkered with this problem here and there over the years. But only now am I satisfied with my results.
It should be noted that there are significant differences in my implementation compared to Roger's original work. Mine is not a genetic algorithm. Mine only operates on one shape at a time. Mine is much faster (AFAIK) and supports many types of shapes.
### Examples
Here are more examples from interesting photos found on Flickr.
================================================
FILE: bot/.gitignore
================================================
config.py
env
venv
================================================
FILE: bot/main.py
================================================
import datetime
import os
import random
import requests
import subprocess
import time
import traceback
import twitter
RATE = 60 * 30
MENTION_RATE = 65
INPUT_FOLDER = ''
OUTPUT_FOLDER = ''
FLICKR_API_KEY = None
TWITTER_CONSUMER_KEY = None
TWITTER_CONSUMER_SECRET = None
TWITTER_ACCESS_TOKEN_KEY = None
TWITTER_ACCESS_TOKEN_SECRET = None
MODE_NAMES = [
'primitives', # 0
'triangles', # 1
'rectangles', # 2
'ellipses', # 3
'circles', # 4
'rectangles', # 5
'beziers', # 6
'ellipses', # 7
'polygons', # 8
]
SINCE_ID = None
START_DATETIME = datetime.datetime.utcnow()
USER_DATETIME = {}
try:
from config import *
except ImportError:
print 'no config found!'
class AttrDict(dict):
def __init__(self, *args, **kwargs):
super(AttrDict, self).__init__(*args, **kwargs)
self.__dict__ = self
class Config(AttrDict):
def randomize(self):
self.m = random.choice([1, 5, 6, 7])
self.n = random.randint(10, 50) * 10
self.rep = 0
self.a = 128
self.r = 300
self.s = 1200
def parse(self, text):
text = (text or '').lower()
tokens = text.split()
for i, name in enumerate(MODE_NAMES):
if name in text:
self.m = i
for token in tokens:
try:
self.n = int(token)
except Exception:
pass
def validate(self):
self.m = clamp(self.m, 0, 8)
if self.m == 6:
self.a = 0
self.rep = 19
self.n = 100
else:
self.n = clamp(self.n, 1, 500)
@property
def description(self):
total = self.n + self.n * self.rep
return '%d %s' % (total, MODE_NAMES[self.m])
def clamp(x, lo, hi):
if x < lo:
x = lo
if x > hi:
x = hi
return x
def random_date(max_days_ago=1000):
today = datetime.date.today()
days = random.randint(1, max_days_ago)
d = today - datetime.timedelta(days=days)
return d.strftime('%Y-%m-%d')
def interesting(date=None):
url = 'https://api.flickr.com/services/rest/'
params = dict(
api_key=FLICKR_API_KEY,
format='json',
nojsoncallback=1,
method='flickr.interestingness.getList',
)
if date:
params['date'] = date
r = requests.get(url, params=params)
return r.json()['photos']['photo']
def photo_url(p, size=None):
# See: https://www.flickr.com/services/api/misc.urls.html
if size:
url = 'https://farm%s.staticflickr.com/%s/%s_%s_%s.jpg'
return url % (p['farm'], p['server'], p['id'], p['secret'], size)
else:
url = 'https://farm%s.staticflickr.com/%s/%s_%s.jpg'
return url % (p['farm'], p['server'], p['id'], p['secret'])
def download_photo(url, path):
r = requests.get(url)
with open(path, 'wb') as fp:
fp.write(r.content)
def primitive(**kwargs):
args = []
for k, v in kwargs.items():
if v is None:
continue
args.append('-%s' % k)
args.append(str(v))
args = ' '.join(args)
cmd = 'primitive %s' % args
subprocess.call(cmd, shell=True)
def twitter_api():
return twitter.Api(
consumer_key=TWITTER_CONSUMER_KEY,
consumer_secret=TWITTER_CONSUMER_SECRET,
access_token_key=TWITTER_ACCESS_TOKEN_KEY,
access_token_secret=TWITTER_ACCESS_TOKEN_SECRET)
def tweet(status, media, in_reply_to_status_id=None):
api = twitter_api()
api.PostUpdate(status, media, in_reply_to_status_id=in_reply_to_status_id)
def handle_mentions():
global SINCE_ID
print 'checking for mentions'
api = twitter_api()
statuses = api.GetMentions(200, SINCE_ID)
for status in reversed(statuses):
SINCE_ID = status.id
print 'handling mention', status.id
handle_mention(status)
print 'done with mentions'
def handle_mention(status):
mentions = status.user_mentions or []
if len(mentions) != 1:
print 'mention does not have exactly one mention'
return
media = status.media or []
if len(media) != 1:
print 'mention does not have exactly one media'
return
url = media[0].media_url or None
if not url:
print 'mention does not have a media_url'
return
created_at = datetime.datetime.strptime(
status.created_at, '%a %b %d %H:%M:%S +0000 %Y')
if created_at < START_DATETIME:
print 'mention timestamp before bot started'
return
user_id = status.user.id
now = datetime.datetime.utcnow()
td = datetime.timedelta(minutes=5)
if user_id in USER_DATETIME:
if now - USER_DATETIME[user_id] < td:
print 'user mentioned me too recently'
return
USER_DATETIME[user_id] = now
in_path = os.path.join(INPUT_FOLDER, '%s.jpg' % status.id)
out_path = os.path.join(OUTPUT_FOLDER, '%s.png' % status.id)
print 'downloading', url
download_photo(url, in_path)
config = Config()
config.randomize()
config.parse(status.text)
config.validate()
status_text = '@%s %s.' % (status.user.screen_name, config.description)
print status_text
print 'running algorithm: %s' % config
primitive(i=in_path, o=out_path, **config)
if os.path.exists(out_path):
print 'uploading to twitter'
tweet(status_text, out_path, status.id)
print 'done'
else:
print 'failed!'
def flickr_url(photo_id):
alphabet = '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'
return 'https://flic.kr/p/%s' % base_encode(alphabet, int(photo_id))
def base_encode(alphabet, number, suffix=''):
base = len(alphabet)
if number >= base:
div, mod = divmod(number, base)
return base_encode(alphabet, div, alphabet[mod] + suffix)
else:
return alphabet[number] + suffix
def generate():
date = random_date()
print 'finding an interesting photo from', date
photos = interesting(date)
photo = random.choice(photos)
print 'picked photo', photo['id']
in_path = os.path.join(INPUT_FOLDER, '%s.jpg' % photo['id'])
out_path = os.path.join(OUTPUT_FOLDER, '%s.png' % photo['id'])
url = photo_url(photo, 'z')
print 'downloading', url
download_photo(url, in_path)
config = Config()
config.randomize()
config.validate()
status_text = '%s. %s' % (config.description, flickr_url(photo['id']))
print status_text
print 'running algorithm: %s' % config
primitive(i=in_path, o=out_path, **config)
if os.path.exists(out_path):
print 'uploading to twitter'
tweet(status_text, out_path)
print 'done'
else:
print 'failed!'
def main():
previous = 0
mention_previous = 0
while True:
now = time.time()
if now - previous > RATE:
previous = now
try:
generate()
except Exception:
traceback.print_exc()
if now - mention_previous > MENTION_RATE:
mention_previous = now
try:
handle_mentions()
except Exception:
traceback.print_exc()
time.sleep(5)
def download_photos(folder, date=None):
try:
os.makedirs(folder)
except Exception:
pass
date = date or random_date()
photos = interesting(date)
for photo in photos:
url = photo_url(photo, 'z')
path = '%s.jpg' % photo['id']
path = os.path.join(folder, path)
download_photo(url, path)
if __name__ == '__main__':
main()
================================================
FILE: bot/requirements.txt
================================================
python-twitter==3.1
requests==2.11.1
================================================
FILE: main.go
================================================
package main
import (
"flag"
"fmt"
"log"
"math/rand"
"os"
"path/filepath"
"runtime"
"strconv"
"strings"
"time"
"github.com/fogleman/primitive/primitive"
"github.com/nfnt/resize"
)
var (
Input string
Outputs flagArray
Background string
Configs shapeConfigArray
Alpha int
InputSize int
OutputSize int
Mode int
Workers int
Nth int
Repeat int
V, VV bool
)
type flagArray []string
func (i *flagArray) String() string {
return strings.Join(*i, ", ")
}
func (i *flagArray) Set(value string) error {
*i = append(*i, value)
return nil
}
type shapeConfig struct {
Count int
Mode int
Alpha int
Repeat int
}
type shapeConfigArray []shapeConfig
func (i *shapeConfigArray) String() string {
return ""
}
func (i *shapeConfigArray) Set(value string) error {
n, _ := strconv.ParseInt(value, 0, 0)
*i = append(*i, shapeConfig{int(n), Mode, Alpha, Repeat})
return nil
}
func init() {
flag.StringVar(&Input, "i", "", "input image path")
flag.Var(&Outputs, "o", "output image path")
flag.Var(&Configs, "n", "number of primitives")
flag.StringVar(&Background, "bg", "", "background color (hex)")
flag.IntVar(&Alpha, "a", 128, "alpha value")
flag.IntVar(&InputSize, "r", 256, "resize large input images to this size")
flag.IntVar(&OutputSize, "s", 1024, "output image size")
flag.IntVar(&Mode, "m", 1, "0=combo 1=triangle 2=rect 3=ellipse 4=circle 5=rotatedrect 6=beziers 7=rotatedellipse 8=polygon")
flag.IntVar(&Workers, "j", 0, "number of parallel workers (default uses all cores)")
flag.IntVar(&Nth, "nth", 1, "save every Nth frame (put \"%d\" in path)")
flag.IntVar(&Repeat, "rep", 0, "add N extra shapes per iteration with reduced search")
flag.BoolVar(&V, "v", false, "verbose")
flag.BoolVar(&VV, "vv", false, "very verbose")
}
func errorMessage(message string) bool {
fmt.Fprintln(os.Stderr, message)
return false
}
func check(err error) {
if err != nil {
log.Fatal(err)
}
}
func main() {
// parse and validate arguments
flag.Parse()
ok := true
if Input == "" {
ok = errorMessage("ERROR: input argument required")
}
if len(Outputs) == 0 {
ok = errorMessage("ERROR: output argument required")
}
if len(Configs) == 0 {
ok = errorMessage("ERROR: number argument required")
}
if len(Configs) == 1 {
Configs[0].Mode = Mode
Configs[0].Alpha = Alpha
Configs[0].Repeat = Repeat
}
for _, config := range Configs {
if config.Count < 1 {
ok = errorMessage("ERROR: number argument must be > 0")
}
}
if !ok {
fmt.Println("Usage: primitive [OPTIONS] -i input -o output -n count")
flag.PrintDefaults()
os.Exit(1)
}
// set log level
if V {
primitive.LogLevel = 1
}
if VV {
primitive.LogLevel = 2
}
// seed random number generator
rand.Seed(time.Now().UTC().UnixNano())
// determine worker count
if Workers < 1 {
Workers = runtime.NumCPU()
}
// read input image
primitive.Log(1, "reading %s\n", Input)
input, err := primitive.LoadImage(Input)
check(err)
// scale down input image if needed
size := uint(InputSize)
if size > 0 {
input = resize.Thumbnail(size, size, input, resize.Bilinear)
}
// determine background color
var bg primitive.Color
if Background == "" {
bg = primitive.MakeColor(primitive.AverageImageColor(input))
} else {
bg = primitive.MakeHexColor(Background)
}
// run algorithm
model := primitive.NewModel(input, bg, OutputSize, Workers)
primitive.Log(1, "%d: t=%.3f, score=%.6f\n", 0, 0.0, model.Score)
start := time.Now()
frame := 0
for j, config := range Configs {
primitive.Log(1, "count=%d, mode=%d, alpha=%d, repeat=%d\n",
config.Count, config.Mode, config.Alpha, config.Repeat)
for i := 0; i < config.Count; i++ {
frame++
// find optimal shape and add it to the model
t := time.Now()
n := model.Step(primitive.ShapeType(config.Mode), config.Alpha, config.Repeat)
nps := primitive.NumberString(float64(n) / time.Since(t).Seconds())
elapsed := time.Since(start).Seconds()
primitive.Log(1, "%d: t=%.3f, score=%.6f, n=%d, n/s=%s\n", frame, elapsed, model.Score, n, nps)
// write output image(s)
for _, output := range Outputs {
ext := strings.ToLower(filepath.Ext(output))
if output == "-" {
ext = ".svg"
}
percent := strings.Contains(output, "%")
saveFrames := percent && ext != ".gif"
saveFrames = saveFrames && frame%Nth == 0
last := j == len(Configs)-1 && i == config.Count-1
if saveFrames || last {
path := output
if percent {
path = fmt.Sprintf(output, frame)
}
primitive.Log(1, "writing %s\n", path)
switch ext {
default:
check(fmt.Errorf("unrecognized file extension: %s", ext))
case ".png":
check(primitive.SavePNG(path, model.Context.Image()))
case ".jpg", ".jpeg":
check(primitive.SaveJPG(path, model.Context.Image(), 95))
case ".svg":
check(primitive.SaveFile(path, model.SVG()))
case ".gif":
frames := model.Frames(0.001)
check(primitive.SaveGIFImageMagick(path, frames, 50, 250))
}
}
}
}
}
}
================================================
FILE: primitive/color.go
================================================
package primitive
import (
"fmt"
"image/color"
"strings"
)
type Color struct {
R, G, B, A int
}
func MakeColor(c color.Color) Color {
r, g, b, a := c.RGBA()
return Color{int(r / 257), int(g / 257), int(b / 257), int(a / 257)}
}
func MakeHexColor(x string) Color {
x = strings.Trim(x, "#")
var r, g, b, a int
a = 255
switch len(x) {
case 3:
fmt.Sscanf(x, "%1x%1x%1x", &r, &g, &b)
r = (r << 4) | r
g = (g << 4) | g
b = (b << 4) | b
case 4:
fmt.Sscanf(x, "%1x%1x%1x%1x", &r, &g, &b, &a)
r = (r << 4) | r
g = (g << 4) | g
b = (b << 4) | b
a = (a << 4) | a
case 6:
fmt.Sscanf(x, "%02x%02x%02x", &r, &g, &b)
case 8:
fmt.Sscanf(x, "%02x%02x%02x%02x", &r, &g, &b, &a)
}
return Color{r, g, b, a}
}
func (c *Color) NRGBA() color.NRGBA {
return color.NRGBA{uint8(c.R), uint8(c.G), uint8(c.B), uint8(c.A)}
}
================================================
FILE: primitive/core.go
================================================
package primitive
import (
"image"
"math"
)
func computeColor(target, current *image.RGBA, lines []Scanline, alpha int) Color {
var rsum, gsum, bsum, count int64
a := 0x101 * 255 / alpha
for _, line := range lines {
i := target.PixOffset(line.X1, line.Y)
for x := line.X1; x <= line.X2; x++ {
tr := int(target.Pix[i])
tg := int(target.Pix[i+1])
tb := int(target.Pix[i+2])
cr := int(current.Pix[i])
cg := int(current.Pix[i+1])
cb := int(current.Pix[i+2])
i += 4
rsum += int64((tr-cr)*a + cr*0x101)
gsum += int64((tg-cg)*a + cg*0x101)
bsum += int64((tb-cb)*a + cb*0x101)
count++
}
}
if count == 0 {
return Color{}
}
r := clampInt(int(rsum/count)>>8, 0, 255)
g := clampInt(int(gsum/count)>>8, 0, 255)
b := clampInt(int(bsum/count)>>8, 0, 255)
return Color{r, g, b, alpha}
}
func copyLines(dst, src *image.RGBA, lines []Scanline) {
for _, line := range lines {
a := dst.PixOffset(line.X1, line.Y)
b := a + (line.X2-line.X1+1)*4
copy(dst.Pix[a:b], src.Pix[a:b])
}
}
func drawLines(im *image.RGBA, c Color, lines []Scanline) {
const m = 0xffff
sr, sg, sb, sa := c.NRGBA().RGBA()
for _, line := range lines {
ma := line.Alpha
a := (m - sa*ma/m) * 0x101
i := im.PixOffset(line.X1, line.Y)
for x := line.X1; x <= line.X2; x++ {
dr := uint32(im.Pix[i+0])
dg := uint32(im.Pix[i+1])
db := uint32(im.Pix[i+2])
da := uint32(im.Pix[i+3])
im.Pix[i+0] = uint8((dr*a + sr*ma) / m >> 8)
im.Pix[i+1] = uint8((dg*a + sg*ma) / m >> 8)
im.Pix[i+2] = uint8((db*a + sb*ma) / m >> 8)
im.Pix[i+3] = uint8((da*a + sa*ma) / m >> 8)
i += 4
}
}
}
func differenceFull(a, b *image.RGBA) float64 {
size := a.Bounds().Size()
w, h := size.X, size.Y
var total uint64
for y := 0; y < h; y++ {
i := a.PixOffset(0, y)
for x := 0; x < w; x++ {
ar := int(a.Pix[i])
ag := int(a.Pix[i+1])
ab := int(a.Pix[i+2])
aa := int(a.Pix[i+3])
br := int(b.Pix[i])
bg := int(b.Pix[i+1])
bb := int(b.Pix[i+2])
ba := int(b.Pix[i+3])
i += 4
dr := ar - br
dg := ag - bg
db := ab - bb
da := aa - ba
total += uint64(dr*dr + dg*dg + db*db + da*da)
}
}
return math.Sqrt(float64(total)/float64(w*h*4)) / 255
}
func differencePartial(target, before, after *image.RGBA, score float64, lines []Scanline) float64 {
size := target.Bounds().Size()
w, h := size.X, size.Y
total := uint64(math.Pow(score*255, 2) * float64(w*h*4))
for _, line := range lines {
i := target.PixOffset(line.X1, line.Y)
for x := line.X1; x <= line.X2; x++ {
tr := int(target.Pix[i])
tg := int(target.Pix[i+1])
tb := int(target.Pix[i+2])
ta := int(target.Pix[i+3])
br := int(before.Pix[i])
bg := int(before.Pix[i+1])
bb := int(before.Pix[i+2])
ba := int(before.Pix[i+3])
ar := int(after.Pix[i])
ag := int(after.Pix[i+1])
ab := int(after.Pix[i+2])
aa := int(after.Pix[i+3])
i += 4
dr1 := tr - br
dg1 := tg - bg
db1 := tb - bb
da1 := ta - ba
dr2 := tr - ar
dg2 := tg - ag
db2 := tb - ab
da2 := ta - aa
total -= uint64(dr1*dr1 + dg1*dg1 + db1*db1 + da1*da1)
total += uint64(dr2*dr2 + dg2*dg2 + db2*db2 + da2*da2)
}
}
return math.Sqrt(float64(total)/float64(w*h*4)) / 255
}
================================================
FILE: primitive/ellipse.go
================================================
package primitive
import (
"fmt"
"math"
"github.com/fogleman/gg"
"github.com/golang/freetype/raster"
)
type Ellipse struct {
Worker *Worker
X, Y int
Rx, Ry int
Circle bool
}
func NewRandomEllipse(worker *Worker) *Ellipse {
rnd := worker.Rnd
x := rnd.Intn(worker.W)
y := rnd.Intn(worker.H)
rx := rnd.Intn(32) + 1
ry := rnd.Intn(32) + 1
return &Ellipse{worker, x, y, rx, ry, false}
}
func NewRandomCircle(worker *Worker) *Ellipse {
rnd := worker.Rnd
x := rnd.Intn(worker.W)
y := rnd.Intn(worker.H)
r := rnd.Intn(32) + 1
return &Ellipse{worker, x, y, r, r, true}
}
func (c *Ellipse) Draw(dc *gg.Context, scale float64) {
dc.DrawEllipse(float64(c.X), float64(c.Y), float64(c.Rx), float64(c.Ry))
dc.Fill()
}
func (c *Ellipse) SVG(attrs string) string {
return fmt.Sprintf(
"