Advances in Linear Pixel Shuffling

Peter G. Anderson

A chapter in Applications of Fibonacci Numbers, 1996, pp 1-21 from Springer

Abstract: 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.

Keywords: Compression Algorithm; Fibonacci Number; Handwritten Digit Recognition; Optical Character Recognition System; Blue Noise (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-0223-7_1

Ordering information: This item can be ordered from
http://www.springer.com/9789400902237

DOI: 10.1007/978-94-009-0223-7_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().