1 April 1993 Linear pixel shuffling for image processing: an introduction
Author Affiliations +
J. of Electronic Imaging, 2(2), (1993). doi:10.1117/12.143463
Abstract
We investigate a method of ordering pixels (the elements of a rectangular matrix) based on an arithmetic progression with wrap-around (modular arithmetic). For appropriate choices of the progression's parameters, based on a generalization of Fibonacci numbers and the golden mean, we find equidistributed collections of pixels formed by subintervals of the pixel progression or "shuffle." We illustrate this equidistributivity with a novel approach to progressive rendering of a synthetic image, and we suggest several opportunities for its application to other areas of image processing.
Peter G. Anderson, "Linear pixel shuffling for image processing: an introduction," Journal of Electronic Imaging 2(2), (1 April 1993). http://dx.doi.org/10.1117/12.143463
JOURNAL ARTICLE
8 PAGES


SHARE
KEYWORDS
Image processing

Image compression

Visualization

Computer graphics

Image transmission

Algorithm development

Halftones

Back to Top