The sorting operation can be performed vertically and horizontally in any order once any number of times. The sorting itself can also be performed on the basis of perceived brightness, HSL color space parameters, or instead of sorting, pixels can be arranged randomly. Intervals can be determined based on the perceived brightness, hue and saturation of the HSL color space, by a mask which is a external black and white image showing which areas are to be sorted, or by performing edge detection. The next step is to perform a sort by a certain pixel parameter in a given interval.
pixels that, according to certain criteria, have common features. There are two crucial stages in the sorting process, the first of which is the division of pixel rows into intervals, i.e. There are many programs whose task is to create the pixel sorting effect, but when creating my implementation in Go, I focused on optimizing this process in terms of time and creating a modular platform, thanks to which, implementation of new functionalities related to pixel sorting will be simple task. Pixel sorting is a kind of photo editing, which is a subgenre of glitch art, the operation of which consists in reorganizing groups of pixels in a photo according to certain criteria.
0 kommentar(er)
