Jump to ContentJump to Main Navigation
Spatial Vision$
Users without a subscription are not able to see the full content.

Russell L. DeValois and Karen K. DeValois

Print publication date: 1991

Print ISBN-13: 9780195066579

Published to Oxford Scholarship Online: January 2008

DOI: 10.1093/acprof:oso/9780195066579.001.0001

Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2015. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see http://www.oxfordscholarship.com/page/privacy-policy).date: 28 November 2015

Linear Systems Analysis

(p.3) 1 Linear Systems Analysis
Spatial Vision

Russell L. De Valois

Karen K. De Valois

Oxford University Press

This chapter provides a background on linear systems analysis to allow the reader to follow the applications to visual problems discussed in this book. Specifically, it discusses the Fourier theorem and its applications to vision. Fourier analysis is a powerful tool for studying complex waveforms, allowing one to specify quantitatively the characteristics of any complex waveform or shape. Another major advantage in its application to vision is that it gives a common basis by which one can examine optical, physiological, and psychophysical data. The principal limitation in its application to visual problems is the underlying assumption of linearity, a condition that is only met by the visual system under limited conditions.

Keywords:   Fourier theorem, Fourier analysis, vision, visual systems

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .