Inspired by ASDFPixelSort by Kim Asendorf! I've written a few Pixelsorters before:
- My first one originated from modifying the original processing code until it became a little Java Swing Application: Pixel-Sorter-App.
- My second implementation was in C. It may or may not have been faster and the code was a mess, but it was usable from the command line!
- But now I have engineered THIS pixelsorter with far greater goals, created as a rust practice project but striving to be BEST and FASTEST FOSS-Pixelsorter of them all (maybe)!!!
Pixelsortery-Showcase-Compressed.mp4
Download the binaries from the Releases page here or build it from source
Ensure rust and cargo are installed, then type this on the command line:
git clone https://github.com/Lxtharia/pixelsortery
cd pixelsortery
cargo install --path .To start the gui, double-click it or run the binary from the command line without any arguments:
/path/to/pixelsortery.exeYou can also pass the --gui flag on the command line to apply other options when opening the GUI.
pixelsortery --gui --input image.png --diagonal 30This would for example open the gui with the image loaded and the direction set to diagonal with a 30° angle
You can also sort images via the command line.
This is useful if want to sort many images at once or create animations by manipulating a parameter via code.
There are a bunch of different options available which I will not add to the README, as the --help output is way more up-to-date and nicely formatted, so go look at that.
- Look at the examples to understand how to use it
- Look at the help to see all available options
pixelsortery --help- Read the explanation below to understand what pixelsorting actually is (if you want to)
- Start playing around with different parameters!
Some examples:
# Sorts pixels downwards
pixelsortery -i input.png -o output.png --down
# Sort diagonally (in a 30° angle), only sort orange pixels (hue:10:40) and use the glitchsort algorithm
pixelsortery -i image.png --diagonal 30 --thres hue:10:40 --glitchsort --output sortedimg.png
# You can also chain commands by reading and writing to stdin/stdout (by setting the filename to `-`)
pixelsortery -i image.png --diagonal 30 --output - | pixelsortery --input - --hilbert --glitchsort --output doublesortedimg.png
# Sort the same image a hundred times, creating animation frames
for i in $(seq 1 100); do
echo "Sorting $i"
pixelsortery -i input.png -o "output-$i.png" --thres "bright:0:$i" --down
donePixelsortery has the ability to sort videos! In the GUI, just open a video and the videoplayer will be shown. The video will be autosorted by default, this can lead to a slow playback with bigger videos. You can also pause the video and adjust the sorting parameters with less lag. Note that this is only a preview. When you click on "Start export", a separate process will start and sort the video with the last set parameters.
On the CLI, you simply need to specify the path to the input file and the output file with a video extension.
You can also open a video input and sort the video live. You need to set the output path to - to display the sorted live feed.
For example:
pixelsortery --input /dev/video0 --diagonal 30 --output - - Choose to sort lines in all 4 directions
- Sort pixels diagonally, in rectangular shape, in circles,
- Sort pixels in the shape of the space filling hilbert curve (very sweet)
- Choose to select spans of random or fixed length
- Choose to select spans based on their hue/brightness/saturation
- Sorts pixel with MAPSORT (HELL YEAH!!)
- Also allows to use a COMPLETELY BROKEN sorting algorithm, creating a super rad glitch effect (try it out)
- A super cool CLI interface!
- Read input from stdin and write to stdout, allowing easy chaining
- a GUI (holy damn)
- a really good GUI (damn holy)
- Sort multiple times with layers (wowie)
- Sort VIDEOS (this is getting crazy!)
- a godlike GUI where you can edit masks in real time
- Add more pattern patterns to sort by (sin waves, star shape, ...)
- Allow to read custom pathing data from file
- Allow to use MASKS to control which areas should be sorted and which shouldn't
- Allow to logically combine selectors (sort pixels that are bright and red)
- Built-in animation (someday maybe)
- Animation for sorting videos (another someday maybe)
The pixelsorter is quite modular to allow for easy extension in the future. There are three main stages in the sorting process:
- Creating Paths
- Usually determines the sorting "direction", but can be much more
- Defines the order in which pixels are processed
- Allows to sort in horizontal or vertical lines
- Allows to sort in different shapes like spirals
- Allows to sort in a space filling fractal, the hilbert curve
- Gilbert algorithm taken from jakubcerveny
- Selecting
- The magic behind the cool pixelsort-effect: we only sort intervals of pixels (lets call them "spans")
- We are iterating pixels in whatever order the iteration has yielded them
- We select these intervals by grouping similar pixels together
- Examples:
- Group (select) bright pixels (pixels with their brightness value between 180 and 255)
- Select blue pixels (pixels with their hue value between 190 and 240)
- All other pixels, not fulfilling this requirement, will not get sorted
- We only group pixels that come after each other, so (D, B, B, D, D, B, D) gives us the spans (B, B) and (B)
- With B being a "bright" pixel and D being a "dark" one, following the previous example
- Sorting
- Finally, sorting
- You can sort by different criteria
- Usually sorting by Brightness looks the most smooth
- You can also change the sorting algorithm, which mostly has impact on performance, but could - in theory - create different results (see Sorting algorithm stability)
it will get better hopefully, maybe, eventually
If you like this piece of software, consider buying me a coffee! :D
yeah
Yeah!!
yeah
| yeah |
|---|
| yeah |