Last active
June 13, 2024 01:40
-
-
Save prophetgoddess/667c5554e5d9d9a25ae6 to your computer and use it in GitHub Desktop.
Python pixel sorting.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# The MIT License (MIT) | |
# Copyright (c) 2014 Lycaon (lycaon.me) | |
# 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. | |
from PIL import Image | |
import random, sys | |
def quick_sort(pixels): | |
#Quicksort function that sorts pixels based on combined RGB values (R + B + G) | |
if pixels == []: | |
return pixels | |
else: | |
pivot = pixels[0] | |
lesser = quick_sort([x for x in pixels[1:] if (x[0] + x[1] + x[2]) < (pivot[0] + pivot[1] + pivot[2])]) | |
greater = quick_sort([x for x in pixels[1:] if (x[0] + x[1] + x[2]) >= (pivot[0] + pivot[1] + pivot[2])]) | |
return lesser + [pivot] + greater | |
def sort_all_pixels(image): | |
#sorts every line of pixels | |
print("Sorting all pixels.") | |
print("Opening image...") | |
img = Image.open(image) | |
img = img.convert('RGBA') | |
print("Get data...") | |
data = img.load() | |
new = Image.new('RGBA', img.size) | |
pixels = [] | |
sorted_pixels = [] | |
print("Getting pixels...") | |
#Load all of the pixels into the pixels list | |
for y in range(img.size[1]): | |
pixels.append([]) | |
for x in range(img.size[0]): | |
pixels[y].append(data[x, y]) | |
print("Quicksorting pixels...") | |
for y in range(img.size[1]): | |
sorted_pixels.append(quick_sort(pixels[y])) | |
print("Placing pixels...") | |
for y in range(img.size[1]): | |
for x in range(img.size[0]): | |
new.putpixel((x, y), sorted_pixels[y][x]) #apply the pixels to the new image | |
print("Saving image...") | |
new.save('output-sortall.png') | |
def random_sort_pixels(image, intensity): | |
#sorts pixels in a random fashion | |
if intensity > 100: | |
intensity = 100 | |
print("Sorting " + image + " with intensity " + str(intensity)) | |
#Open the image, convert it to RGBA, get the pixels | |
print("Opening image...") | |
img = Image.open(image) | |
img = img.convert('RGBA') | |
print("Get data...") | |
data = img.load() | |
new = Image.new('RGBA', img.size) | |
pixels = [] | |
sorted_pixels = [] | |
print("Getting pixels...") | |
#Load all of the pixels into the pixels list | |
for y in range(img.size[1]): | |
pixels.append([]) | |
for x in range(img.size[0]): | |
pixels[y].append(data[x, y]) | |
print("Quicksorting pixels...") | |
for y in range(img.size[1]): | |
#pick different starting points for each line | |
if(random.randint(0, 100) > intensity): | |
sorted_pixels.append(pixels[y]) #Don't sort this line of pixels | |
else: | |
minsort = random.randint(3, len(pixels[y]) - 3) #pick the start of the sorted area on this pixel line | |
maxsort = random.randint(minsort, len(pixels[y]) - 1)# pick the end of the sorted area on this pixel line | |
sort = [] | |
for x in range(minsort, maxsort): | |
sort.append(pixels[y][x]) | |
sort = quick_sort(sort) #sort the pixels by brightness | |
i = 0 | |
for x in range(minsort, maxsort): | |
pixels[y][x] = sort[i] | |
i = i + 1 | |
sorted_pixels.append(pixels[y]) | |
print("Placing pixels...") | |
for y in range(img.size[1]): | |
for x in range(img.size[0]): | |
new.putpixel((x, y), sorted_pixels[y][x]) #apply the pixels to the new image | |
print("Saving image...") | |
new.save('output-sortrandom.png') | |
def sort_pixels_pivot(image): | |
print ("Sorting pixels on pivot.") | |
#Open the image, convert it to RGBA, get the pixels | |
print("Opening image...") | |
img = Image.open(image) | |
img = img.convert('RGBA') | |
print("Get data...") | |
data = img.load() | |
new = Image.new('RGBA', img.size) | |
pixels = [] | |
sorted_pixels = [] | |
print("Getting pixels...") | |
#Load all of the pixels into the pixels list | |
for y in range(img.size[1]): | |
pixels.append([]) | |
for x in range(img.size[0]): | |
pixels[y].append(data[x, y]) | |
print("Quicksorting pixels...") | |
minsort = random.randint(3, img.size[0] - 3) #get sorting pivot | |
for y in range(img.size[1]): | |
maxsort = random.randint(minsort, len(pixels[y]) - 1) #pick the end of the sorted area on this pixel line | |
sort = [] | |
for x in range(minsort, maxsort): | |
sort.append(pixels[y][x]) | |
sort = quick_sort(sort) #sort the pixels by brightness | |
i = 0 | |
for x in range(minsort, maxsort): | |
pixels[y][x] = sort[i] | |
i = i + 1 | |
sorted_pixels.append(pixels[y]) | |
print("Placing pixels...") | |
for y in range(img.size[1]): | |
for x in range(img.size[0]): | |
new.putpixel((x, y), sorted_pixels[y][x]) #apply the pixels to the new image | |
print("Saving image...") | |
new.save('output-sortpivot.png') | |
sys.setrecursionlimit(10000) #Increase the recursion depth limit. Without this, the script fails on larger images because quicksort recurses too much. | |
sort_all_pixels("image.jpg") | |
random_sort_pixels("image.jpg", random.randint(1, 100)) | |
sort_pixels_pivot("image.jpg") | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment