Linear pixel shuffling for image processing: an introduction

Peter G. Anderson

doi:10.1117/12.143463

1 April 1993 Linear pixel shuffling for image processing: an introduction

Peter G. Anderson

Author Affiliations +

Journal of Electronic Imaging, Vol. 2, Issue 2, (April 1993). https://doi.org/10.1117/12.143463

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 or "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.

Citation Download Citation

Peter G. Anderson "Linear pixel shuffling for image processing: an introduction," Journal of Electronic Imaging 2(2), (1 April 1993). https://doi.org/10.1117/12.143463

Published: 1 April 1993

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available