Advances in Linear Pixel Shuffling

Show full item record

Title: Advances in Linear Pixel Shuffling
Author: Anderson, Peter
Abstract: 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.
Description: "Advances in Linear Pixel Shuffling," Presented at the Conference on Fibonacci Numbers and their Applications. International Conference on Fibonacci Numbers and their Applications. Held in Pullman, Washington: July 1994.
Record URI: http://hdl.handle.net/1850/3070
Date: 2000-04-11

Files in this item

Files Size Format View
PAndersonConfProc04-11-2000.pdf 904.8Kb PDF View/Open

The following license files are associated with this item:

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse