Linear pixel shuffling applications

Show simple item record

dc.contributor.author Anderson, Peter en_US
dc.date.accessioned 2007-07-05T14:47:24Z en_US
dc.date.available 2007-07-05T14:47:24Z en_US
dc.date.issued 1994 en_US
dc.identifier.citation Recent Progress in Digital Halftoning (1994) 74-76 en_US
dc.identifier.isbn 0-89208-181-3 en_US
dc.identifier.uri http://hdl.handle.net/1850/4272 en_US
dc.description This article may be accessed on the publisher's website (additional fees may apply) at: http://www.imaging.org/store/epub.cfm?abstrid=2454 en_US
dc.description.abstract 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. en_US
dc.language.iso en_US en_US
dc.publisher The Society for Imaging Science and Technology (IS&T) en_US
dc.title Linear pixel shuffling applications en_US
dc.type Article en_US
dc.subject.keyword Color printing en_US
dc.subject.keyword Mathematical models en_US
dc.subject.keyword Pixel shuffling en_US

Files in this item

Files Size Format View
IS&TCopyrightPolicies.pdf 10.11Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse