Linear pixel shuffling for image processing, an introduction

Show full item record

Title: Linear pixel shuffling for image processing, an introduction
Author: Anderson, Peter
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 of '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.
Description: RIT community members may access full-text via RIT Libraries licensed databases: http://library.rit.edu/databases/
Record URI: http://hdl.handle.net/1850/3018
Publishers URL: http://dx.doi.org/10.1117/12.143463
Date: 1993-04

Files in this item

Files Size Format View

An open access version of this file is not available. Check "Publisher URL" field for access

This item appears in the following Collection(s)

Show full item record

Search RIT DML


Advanced Search

Browse