This article may be accessed on the publisher's website (additional fees may apply) at: http://www.imaging.org/store/epub.cfm?abstrid=2454 We investigate a method or 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 equi-distributed 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 of its application to other areas of image processing and computing.
Department, Program, or Center
Chester F. Carlson Center for Imaging Science (COS)
Anderson, Peter, "Linear pixel shuffling applications" (1994). Recent Progress in Digital Halftoning. The Society for Imaging Science and Technology (IS&T), 74-76. Accessed from
RIT – Main Campus