Introduction to Pixel Sorting and Glitch Art Aesthetics

Pixel Sorting is an advanced generative digital art technique where segments of pixels in a digital image are isolated and re-ordered based on their physical properties—such as brightness, hue, or saturation. Originally popularized by software artist Kim Asendorf in the early 2010s, pixel sorting creates a stunning "melting" or "dripping" glitch aesthetic that has become a staple of vaporwave, cyberpunk, and modern glitch art.

The Mathematical Criteria Behind Pixel Sorting

To sort pixels, each RGB value is mapped to a single numeric quantity. The tool supports multiple mathematical sorting criteria:

• Luminosity / Brightness: Employs the standard ITU-R BT.601 weights to match human eye perception of color intensity: $$Y = 0.299 \cdot R + 0.587 \cdot G + 0.114 \cdot B$$
• Hue & Saturation: Converts the RGB coordinates to HSL (Hue, Saturation, Lightness) space. Saturation represents the colorfulness of a pixel relative to its brightness: $$S = \frac{\max(R, G, B) - \min(R, G, B)}{2 - (\max(R,G,B) + \min(R,G,B))}$$
• Primary Channels: Isolates the individual intensity values of either the Red, Green, or Blue channel.

Contiguous Threshold Sorting Algorithm

Rather than sorting the entire row or column, which creates flat, uninteresting bands, pixel sorting relies on **threshold masking**. In a given row or column, we scan pixels sequentially. A pixel's brightness is converted to a percentage $B_p \in [0, 100]$. A sorting span is initiated when: $$B_p \ge \text{Threshold}_{\min}$$ And it continues until we reach a pixel where: $$B_p > \text{Threshold}_{\max} \quad \text{or} \quad B_p < \text{Threshold}_{\min}$$ Once the span boundary is terminated, all captured pixels are sorted in ascending or descending order. This creates organic, sweeping glitch flows that preserve high-contrast edges while liquefying flat midtones.

Also explore Color Mosaic Generator, Mix Pixels in Image, and Add Symmetry to Image for more creative image effects.