Color grading, made effortless.
Video color grading is complex and hard to control. With Chroa, it has never been so simple.
v1.0.1 · Windows · 201 MB
Every grade is built from nodes.
Nodes are filed in the order a graph gets built — where a stream comes from, what is done to the picture, where it is written. Every graph then compiles to ffmpeg arguments three times over: once as a preflight, once as a proxy, once as the render. How that works.
Sourcewhere a stream comes from
- video
- image
Colorizemoves colour to where it should have been — one channel, one hue range or one tone at a time
- exposure
- color-levels
- color-balance
- color-correct
- curves
- color-mixer
- selective-color
- hue-saturation
- vibrance
- color-temperature
- color-contrast
- color-space
- chroma-hold
- equalizer
- normalize
- histeq
- gray-world
- desaturate
- monochrome
- tint
- set-range
Stylizeputs a look on the picture that was never in it, the whole frame at once
- lut
- curve-file
- vignette
- vignette-classic
- posterize
- blur
- sharpen
- denoise
- noise
- pseudocolor
Transformcuts or turns the picture, changing no colour at all
- video-transform
- video-cut
- scale
- pad
Combinewhat happens after the picture has been changed
- blend
- blend-image
- picture-in-picture
- video-concat
Outputwhere it is written
- transcode
- direct-output
- gif-output
Miscnot part of a render's path
- histogram
- waveform
- vectorscope
- batch-job
- meow
The graph is an object, not a backdrop.
A node is not grading in a vacuum. It is handed the graph around it — the wires, the neighbouring cards, its own parameters, and the measurements the editor has already made.
reads
A node sees the wiring and its own parameters together.
Graph state reaches a node through a single seam, in the same commit as the change that prompted it, so a drop the node refuses never flashes on the canvas first.
proposes
Nodes do not mutate the graph. They return intents.
A single executor applies them, so the canvas never lands in a state two nodes disagree about — and orchestration that needs many changes lives in the editor, not scattered through node definitions.
takes back
A wire that cannot hold is returned, not left broken.
blend is the worked example: it reads the graph, notices a wire that cannot stay, and hands it back to its pin instead of stranding the connection.
Every wired pin is a unit of work.
Export enumerates a node's wired pins and compiles one plan per pin. The plans go into a single queue that runs one at a time, and cancels everything still pending the moment one of them fails.
Concurrency 1 · pending plans cancel on the first failure
Blog.
Release notes, and writing about how the thing is built.
Grade something on a graph.
v1.0.1 · Windows · 201 MB