| | |
Summary: Linear Pixel Shuffling for Image Processing,
an Introduction
Peter G. Anderson
Computer Science Department
Rochester Institute of Technology
Rochester, New York 14623-0887
pga@cs.rit.edu
April 1993
Abstract
We present a method of ordering pixels (the elements
of a rectangular matrix) based on an arithmetic pro-
gression 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 achieve uniformly distributed
collections of pixels formed by intervals of the pixel
progression or "shuffle."
We illustrate this uniformity with a novel approach
to progressive rendering of a synthetic image, and we
note several opportunities for applications to other
|
