Given an interval or a higher dimensional block of points, that may be either continuous or discrete, how can we probe that set in a smooth manner, visiting all its regions without slighting some and overprobing others? The method should be easy to program, to understand, and to run efficiently. We investigate a method of visiting the pixels (the elements of a rectangular matrix) and the points in the real unit cube based on an arithmetic progression with wrap-around (modular arithmetic). For appropriate choices of parameters, choices that generalize Fibonacci numbers and the golden mean, we find equidistributed collections of pixels or points, respectively. We illustrate this equidistributivity with a novel approach to progressive rendering of digital images. We also suggest several opportunities for its application to other areas of image processing and computing.
Date of creation, presentation, or exhibit
Department, Program, or Center
Chester F. Carlson Center for Imaging Science (COS)
Anderson, Peter, "Advances in Linear Pixel Shuffling" (2000). Accessed from
RIT – Main Campus