@string{WMCS = {Department of Computer Science, College of William and Mary}}
@string{WMCS_addr = {Williamsburg, VA  23185}}

@string{WU = {Department of Computer Science, Washington University}}
@string{WU_addr = {St.\ Louis, MO  63130}}

@string{ACADEMIC = {Academic Press}}
@string{ACADEMIC_addr = {Orlando, FL}}

@string{AW = {Addison-Wesley}}
@string{AW_addr = {Reading, MA}}

@string{CAMBRIDGE = {Cambridge University Press}}
@string{CAMBRIDGE_addr = {New York, NY}}

@string{CSP = {Computer Science Press}}
@string{CSP_addr = {Rockville, MD}}

@string{DOVER = {Dover}}
@string{DOVER_addr = {New York, NY}}

@string{DOWDEN = {Dowden, Hutchinson, and Ross}}
@string{DOWDEN_addr = {Stroudsburg, PA}}

@string{FREEMAN = {W. H. Freeman}}
@string{FREEMAN_addr = {New York, NY}}

@string{IEEE = {IEEE}}
@string{IEEE_addr = {New York, NY}}

@string{IEEECS = {IEEE Computer Society}}
@string{IEEECS_addr = {Silver Spring, MD}}

@string{KLUWER = {Kluwer Academic Publishers}}
@string{KLUWER_addr = {Boston, MA}}

@string{MACMILLAN = {Macmillan}}
@string{MACMILLAN_addr = {New York, NY}}

@string{MCGRAW = {McGraw-Hill}}
@string{MCGRAW_addr = {New York, NY}}

@string{MIT = {MIT Press}}
@string{MIT_addr = {Cambridge, MA}}

@string{NASA = {NASA}}
@string{NASA_addr = {Washington, DC}}

@string{NOHOLLAND = {North-Holland}}
@string{NOHOLLAND_addr = {???}}

@string{OHMSHA = {Ohmsha, Ltd.}}
@string{OHMSHA_addr = {Tokyo, Japan}}

@string{OXFORD = {Oxford University Press}}
@string{OXFORD_addr = {New York, NY}}

@string{PLENUM = {Plenum Press}}
@string{PLENUM_addr = {New York, NY}}

@string{PH = {Prentice-Hall}}
@string{PH_addr = {Englewood Cliffs, NJ}}

@string{PWS = {Prindle, Weber & Schmidt}}
@string{PWS_addr = {Boston, MA}}

@string{RCA = {RCA Laboratories}}
@string{RCA_addr = {Princeton, NJ}}

@string{SPIE = {SPIE}}
@string{SPIE_addr = {Bellingham, WA}}

@string{SPRINGER = {Springer-Verlag}}
@string{SPRINGER_addr = {New York, NY}}

@string{SPSE = {SPSE}}
@string{SPSE_addr = {Springfield, VA}}

@string{ILL = {University of Illinois Press}}
@string{ILL_addr = {Urbana, IL}}

@string{VNR = {Van Nostrand Reinhold}}
@string{VNR_addr = {New York, NY}}

@string{WILEY = {John Wiley and Sons}}
@string{WILEY_addr = {New York, NY}}

@string{ACMCS = {ACM Computing Surveys}}

@string{ADVIMG = {Advanced Imaging}}

@string{AJOPO = {American Journal of Optometry and Physiological Optics}}

@string{AO = {Applied Optics}}

@string{BSTJ = {Bell System Technical Journal}}

@string{BYTE = {Byte}}

@string{CACM = {Communications of the ACM}}

@string{CG = {Computer Graphics}}

@string{CGIP = {Computer Graphics and Image Processing}}
@string{CVGIP = {Computer Vision, Graphics, and Image Processing}}

@string{C+G = {Comput.\ \& Graphics}}

@string{CGW = {Computer Graphics World}}

@string{EL = {Electronics Letters}}

@string{ECJ = {Electronics and Communications in Japan}}

@string{COMP = {Computer}}
@string{SPECTRUM = {IEEE Spectrum}}
@string{PIEEE = {Proceedings of the IEEE}}
@string{IEEEAES = {IEEE Transactions on Aerospace and Electronic Systems}}
@string{IEEEAC = {IEEE Transactions on Automatic Control}}
@string{IEEEASSP = {IEEE Transactions on Acoustics, Speech, and Signal
	Processing}}
@string{IEEEAU = {IEEE Transactions on Audio and Electroacoustics}}
@string{IEEEC = {IEEE Transactions on Computers}}
@string{IEEECAS = {IEEE Transactions on Circuits and Systems}}
@string{IEEECOM = {IEEE Transactions on Communications}}
@string{IEEEIT = {IEEE Transactions on Information Theory}}
@string{IEEEPAMI = {IEEE Transactions on Pattern Analysis and Machine
	Intelligence}}
@string{IEEESMC = {IEEE Transactions on Systems, Man, and Cybernetics}}
@string{IEEESP = {IEEE Transactions on Signal Processing}}

@string{PIRE = {Proceedings of the IRE}}
@string{IREIT = {IRE Transactions on Information Theory}}

@string{IVC = {Image and Vision Computing}}

@string{INFOCNTRL = {Information and Control}}

@string{INFOSCI = {Information Sciences}}

@string{IBMJRD = {IBM J. Res.\ Develop.}}

@string{JACM = {Journal of the Association for Computing Machinery}}

@string{JOSA = {Journal of the Optical Society of America}}
@string{JOSAA = {Journal of the Optical Society of America A}}
@string{JOSAB = {Journal of the Optical Society of America B}}

@string{JRNBS = {Journal of Research of the National Bureau of Standards}}

@string{JSOUNDVIB = {J. Sound Vib.}}

@string{MATHCOMP = {Mathematics of Computation}}

@string{OPTACT = {Optica Acta}}

@string{OE = {Optical Engineering}}

@string{OPTICSCOMM = {Optics Communications}}

@string{JPDC = {Journal of Parallel and Distributed Computing}}
 
@string{PARCOMP = {Parallel Computing}}

@string{PATTERNREC = {Pattern Recognition}}

@string{PHOTOGRAM = {Photogrammetria}}

@string{PHOTOSCIENGR = {Photographic Science and Engineering}}

@string{PHYSICA = {Physica}}

@string{PNEC = {Proc.\ NEC}}

@string{RCAREV = {RCA Review}}

@string{REVSCIINSTR = {Rev.\ Sci.\ Instrum.}}

@string{PTRSLA = {Philosophical Transactions of the Royal Society
		of London A}}
@string{PRSLB = {Proceedings of the Royal Society London B}}

@string{SCIENCE = {Science}}

@string{SIAMJAM = {SIAM Journal of Applied Mathematics}}
@string{SIAMJSSC = {SIAM Journal of Scientific and Statistical
		Computing}}

@string{SP = {Signal Processing}}

@string{SMPTEJ = {SMPTE Journal}}

@string{SSI = {Space Science Instrumentation}}

@string{TUGBOAT = {TUGboat}}

@string{CCVPR = {Proceedings of the Conference on
	Computer Vision and Pattern Recognition}}

@string{ICASSP = {Proceedings of the International Conference on
	Acoustics, Speech, and Signal Processing}}

@string{ICPR = {Proceedings of the International Conference on
	Pattern Recognition}}

@string{IRENCR = {IRE National Conv.\ Rec.}}

@string{ISCAS = {Proceedings of the International Symposium on Circuits
	and Systems}}

@string{CISS = {Proceedings of the Princeton Conference on
	Information Sciences and Systems}}

@string{OSA = {Optical Society of America Annual Meeting}}

@string{CPRIP = {Proceedings of the Conference on Pattern Recognition
	and Image Processing}}

@string{VIPTTR = {Visual Information Processing for Television and
	Telerobotics}}

@BOOK{oed,
	TITLE = "Oxford English Dictionary",
	EDITION = "Compact",
	PUBLISHER = OXFORD,
	ADDRESS = OXFORD_addr,
	YEAR = 1971
}

@BOOK{abramowitz+stegun:mathematical_functions,
	EDITOR = "Abramowitz, Milton and Stegun, Irene A.",
	TITLE = "Handbook of Mathematical Functions",
	PUBLISHER = DOVER,
	ADDRESS = DOVER_addr,
	YEAR = 1965
}

@BOOK{burden++:numerical_analysis,
	EDITOR = "Burden, Richard L. and Faires, J. Douglas and
		Reynolds, Albert C.",
	TITLE = "Numerical Analysis",
	EDITION = "Second",
	PUBLISHER = PWS,
	ADDRESS = PWS_addr,
	YEAR = 1981
}

@BOOK{churchill+brown,
	AUTHOR = "Churchill, Ruel V. and Brown, James Ward",
	TITLE = "Complex Variables and Applications",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1984
}

@BOOK{cullen:linear_algebra+differential_equations,
	AUTHOR = "Cullen, Charles G.",
	TITLE = "Linear Algebra and Differential Equations",
	PUBLISHER = PWS,
	ADDRESS = PWS_addr,
	YEAR = 1979
}

@BOOK{hildebrand:methods_of_applied_mathematics,
	AUTHOR = "Hildebrand, Francis B.",
	TITLE = "Methods of Applied Mathematics",
	EDITION = "Second",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1965
}

@BOOK{hogg,
	AUTHOR = "Hogg, Robert V. and Craig, Allen T.",
	TITLE = "Introduction to Mathematical Statististics",
	EDITION = "Fourth",
	PUBLISHER = MACMILLAN,
	ADDRESS = MACMILLAN_addr,
	YEAR = 1978
}

@BOOK{horn+johnson:matrix_analysis,
	AUTHOR = "Horn, Roger A. and Johnson, Charles R.",
	TITLE = "Matrix Analysis",
	PUBLISHER = CAMBRIDGE,
	ADDRESS = CAMBRIDGE_addr,
	YEAR = 1985
}

@BOOK{kaplan:advanced_calculus,
	AUTHOR = "Kaplan, Wilfred",
	TITLE = "Advanced Calculus",
	EDITION = "Third",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1984
}

@BOOK{knuth:vol1,
	AUTHOR = "Knuth, Donald E.",
	TITLE = "The Art of Computer Programming: {Fundamental} Algorithms",
	EDITION = "Second",
	VOLUME = "1",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1973
}

@BOOK{knuth:vol2,
	AUTHOR = "Knuth, Donald E.",
	TITLE = "The Art of Computer Programming: {Seminumerical} Algorithms",
	EDITION = "Second",
	VOLUME = "2",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1981
}

@BOOK{knuth:vol3,
	AUTHOR = "Knuth, Donald E.",
	TITLE = "The Art of Computer Programming: {Sorting} and Searching",
	VOLUME = "3",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1973
}

@BOOK{lancaster+salkauskas:curve_and_surface_fitting,
	AUTHOR = "Lancaster, Peter and \v{S}alkauskas, K\c{e}stutis",
	TITLE = "Curve and Surface Fitting:  {An} Introduction",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1986
}

@BOOK{law+kelton:simulation_modeling+analysis,
	AUTHOR = "Law, Averill M. and Kelton, W. David",
	TITLE = "Simulation Modeling and Analysis",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1982
}

@BOOK{marsden+hoffman:complex_analysis,
	AUTHOR = "Marsden, Jerrold E. and Hoffman, Michael J.",
	TITLE = "Basic Complex Analysis",
	EDITION = "Second",
	PUBLISHER = FREEMAN,
	ADDRESS = FREEMAN_addr,
	YEAR = 1987
}

@BOOK{manna:theory_of_computation",
	AUTHOR = "Manna, Zohar",
	TITLE = "Mathematical Theory of Computation",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1974
}

@BOOK{morris:numerical_analysis,
	AUTHOR = "Morris, John Ll.",
	TITLE = "Computational Methods in Elementary Numerical Analysis",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1983
}

@BOOK{papoulis,
	AUTHOR = "Papoulis, Athansios",
	TITLE = "Probability, Random Variables, and Stochastic Processes",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1984
}

@BOOK{press++:numerical_recipes,
	AUTHOR = "Press, William H. and Flannery, Brian P. and
		Teukolsky, Saul A. and Vetterling, William T.",
	TITLE = "Numerical Recipes: {The} Art of Scientific Computing",
	PUBLISHER = CAMBRIDGE,
	ADDRESS = CAMBRIDGE_addr,
	YEAR = 1986
}

@BOOK{press++:numerical_recipes_in_c,
	AUTHOR = "Press, William H. and Flannery, Brian P. and
		Teukolsky, Saul A. and Vetterling, William T.",
	TITLE = "Numerical Recipes in C: {The} Art of Scientific Computing",
	PUBLISHER = CAMBRIDGE,
	ADDRESS = CAMBRIDGE_addr,
	YEAR = 1988
}

@BOOK{ross:probability_models,
	AUTHOR = "Ross, Sheldon M.",
	TITLE = "Introduction to Probability Models",
	EDITION = "Third",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1985
}

@BOOK{ross:stochastic_processes,
	AUTHOR = "Ross, Sheldon M.",
	TITLE = "Stochastic Processes",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1983
}

@BOOK{schultz:spline_analysis,
	AUTHOR = "Schultz, Martin H.",
	TITLE = "Spline Analysis",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1973
}

@BOOK{schumaker:spline_functions,
	AUTHOR = "Schumaker, Larry L.",
	TITLE = "Spline Functions: {Basic} Theory",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1981
}

@BOOK{solomon:probability+stochastic_processes,
	AUTHOR = "Solomon, Frederick",
	TITLE = "Probability and Stochastic Processes",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1987
}

@BOOK{thomas:calculus,
	AUTHOR = "Thomas, Jr., George B.",
	TITLE = "Calculus and Analytic Geometry",
	EDITION = "Alternate",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1972
}

@BOOK{allnatt,
	AUTHOR = "Allnatt, J.",
	TITLE = "Transmitted-Picture Assessment",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1983
}

@BOOK{andrews+hunt,
	AUTHOR = "Andrews, H. C. and Hunt, B. R.",
	TITLE = "Digital Image Restoration",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1977
}

@BOOK{ballard+brown,
	AUTHOR = "Ballard, Dana H. and Brown, Christopher M.",
	TITLE = "Computer Vision",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1982
}

@BOOK{barnhill+riesenfeld:cagd,
	EDITOR = "Barnhill, Robert E. and Riesenfeld, Richard F.",
	TITLE = "Computer Aided Geometric Design",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1974
}

@INCOLLECTION{catmull+rom:cagd,
	AUTHOR = "Catmull, Edwin and Rom, Raphael",
	TITLE = "A Class of Local Interpolating Splines",
	BOOKTITLE = "Computer Aided Geometric Design",
	EDITOR = "Barnhill, Robert E. and Riesenfeld, Richard F.",
	PAGES = "317--326",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1974
}

@BOOK{barsky:beta-splines,
	AUTHOR = "Barsky, Brian A.",
	TITLE = "Computer Graphics and Geometric Modeling Using Beta-splines",
	PUBLISHER = SPRINGER,
	ADDRESS = SPRINGER_addr,
	YEAR = 1988
}

@BOOK{biberman:perception_of_displayed_information,
	EDITOR = "Biberman, Lucien M.",
	TITLE = "Perception of Displayed Information",
	PUBLISHER = PLENUM,
	ADDRESS = PLENUM_addr,
	YEAR = 1973
}

@INCOLLECTION{biberman:schade,
	AUTHOR = "Schade, Sr., Otto H.",
	TITLE = "Image Reproduction by a Line Raster Process",
	BOOKTITLE = "Perception of Displayed Information",
	EDITOR = "Biberman, Lucien M.",
	CHAPTER = "6",
	PAGES = "233--278",
	PUBLISHER = PLENUM,
	ADDRESS = PLENUM_addr,
	YEAR = 1973
}

@BOOK{bracewell:fourier_transform,
	AUTHOR = "Bracewell, Ronald N.",
	TITLE = "The {Fourier} Transform and Its Applications",
	EDITION = "Revised Second",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1986
}

@BOOK{bracewell:hartley_transform,
	AUTHOR = "Bracewell, Ronald N.",
	TITLE = "The {Hartley} Transform",
	PUBLISHER = OXFORD,
	ADDRESS = OXFORD_addr,
	YEAR = 1986
}

@BOOK{brigham,
	AUTHOR = "Brigham, E. O.",
	TITLE = "The Fast {Fourier} Transform",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1974
}

@BOOK{candy,
	AUTHOR = "Candy, James V.",
	TITLE = "Signal Processing: {The} Model-Based Approach",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1986
}

@BOOK{castleman,
	AUTHOR = "Castleman, Kenneth R.",
	TITLE = "Digital Image Processing",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1979
}

@BOOK{chellappa+sawchuk:v1,
	EDITOR = "Chellappa, Rama and Sawchuk, Alexander A.",
	TITLE = "Digital Image Processing and Analysis: {Digital} Image
		Processing",
	VOLUME = "1",
	PUBLISHER = IEEECS,
	ADDRESS = IEEECS_addr,
	YEAR = 1985
}

@BOOK{chellappa+sawchuk:v2,
	EDITOR = "Chellappa, Rama and Sawchuk, Alexander A.",
	TITLE = "Digital Image Processing and Analysis: {Digital} Image
		Analysis",
	VOLUME = "2",
	PUBLISHER = IEEECS,
	ADDRESS = IEEECS_addr,
	YEAR = 1985
}

@BOOK{clarke,
	AUTHOR = "Clarke, R. J.",
	TITLE = "Transform Coding of Images",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1985
}

@BOOK{cornsweet,
	AUTHOR = "Cornsweet, Tom",
	TITLE = "Visual Perception",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1970
}

@BOOK{duda+hart,
	AUTHOR = "Duda, Richard O. and Hart, P. E.",
	TITLE = "Pattern Classification and Scene Analysis",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1973
}

@BOOK{dudgeon+mersereau,
	AUTHOR = "Dudgeon, Dan E. and Mersereau, Russell M.",
	TITLE = "Multidimensional Digital Signal Processing",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1984
}

@BOOK{duff+levialdi,
	EDITOR = "Duff, M. J. B. and Levialdi, S.",
	TITLE = "Languages and Architectures for Image Processing",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1981
}

@BOOK{ekstrom,
	EDITOR = "Ekstrom, Michael P.",
	TITLE = "Digital Image Processing Techniques",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1984
}

@INCOLLECTION{ekstrom:hunt,
	AUTHOR = "Hunt, B. R.",
	TITLE = "Image Restoration",
	BOOKTITLE = "Digital Image Processing Techniques",
	EDITOR = "Ekstrom, Michael P.",
	CHAPTER = "2",
	PAGES = "53--76",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1984
}

@BOOK{faugeras,
	EDITOR = "Faugeras, O. D.",
	TITLE = "Fundamentals in Computer Vision: {An} Advanced Course",
	PUBLISHER = CAMBRIDGE,
	ADDRESS = CAMBRIDGE_addr,
	YEAR = 1983
}

@INCOLLECTION{faugeras:levialdi,
	AUTHOR = "Levialdi, S.",
	TITLE = "Edge Extraction Techniques",
	BOOKTITLE = "Fundamentals in Computer Vision: {An} Advanced Course",
	EDITOR = "Faugeras, O. D.",
	PAGES = "117--144",
	PUBLISHER = CAMBRIDGE,
	ADDRESS = CAMBRIDGE_addr,
	YEAR = 1983
}

@BOOK{gabel+roberts:signals_and_linear_systems,
	AUTHOR = "Gabel, Robert A. and Roberts, Richard A.",
	TITLE = "Signals and Linear Systems",
	EDITION = "Third",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1987
}

@BOOK{gaskill,
	AUTHOR = "Gaskill, Jack D.",
	TITLE = "Linear Systems, Fourier Transforms, and Optics",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1978
}

@BOOK{gonzalez+wintz,
	AUTHOR = "Gonzalez, Rafael C. and Wintz, Paul",
	TITLE = "Digital Image Processing",
	EDITION = "Second",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1987
}

@BOOK{green,
	AUTHOR = "Green, William B.",
	TITLE = " Digital Image Processing: {A} Systems Approach",
	PUBLISHER = VNR,
	ADDRESS = VNR_addr,
	YEAR = 1983
}

@BOOK{hall,
	AUTHOR = "Hall, Ernest L.",
	TITLE = "Computer Image Processing and Recognition",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1979
}

@BOOK{hamming,
	AUTHOR = "Hamming, R. W.",
	TITLE = "Digital Filters",
	EDITION = "Second",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1983
}

@BOOK{honig+messerschmitt,
	AUTHOR = "Honig, Michael L. and Messerschmitt, David G.",
	TITLE = "Adaptive Filters",
	PUBLISHER = KLUWER,
	ADDRESS = KLUWER_addr,
	YEAR = 1984
}

@BOOK{horn:robot_vision,
	AUTHOR = "Horn, Berthold Klaus Paul",
	TITLE = "Robot Vision",
	PUBLISHER = MIT,
	ADDRESS = MIT_addr,
	YEAR = 1986
}

@BOOK{huang,
	EDITOR = "Huang, T. S.",
	TITLE = "Picture Processing and Digital Filtering",
	EDITION = "Second Corrected and Updated",
	SERIES = "Topics in Applied Physics",
	VOLUME = 6,
	PUBLISHER = SPRINGER,
	ADDRESS = SPRINGER_addr,
	YEAR = 1979
}

@BOOK{huang:frieden,
	AUTHOR = "Frieden, B. R.",
	TITLE = "Image Enhancement and Restoration",
	EDITOR = "Huang, T. S.",
	BOOKTITLE = "Picture Processing and Digital Filtering",
	EDITION = "Second Corrected and Updated",
	SERIES = "Topics in Applied Physics",
	VOLUME = 6,
	PUBLISHER = SPRINGER,
	ADDRESS = SPRINGER_addr,
	YEAR = 1979
}

@INBOOK{fujio:jarect14,
	AUTHOR = "Fujio, Takashi",
	TITLE = "High-Definition Television",
	EDITOR = "Inose, Hiroshi",
	BOOKTITLE = "Japan Annual Reviews in Electronics, Computers, and
		Telecommunications",
	VOLUME = "14",
	PUBLISHER = OHMSHA,
	ADDRESS = OHMSHA_addr,
	PAGES = "123--137",
	YEAR = 1984,
	ABSTRACT = "TO BE TYPED"
}

@INBOOK{iijima:jarect14,
	AUTHOR = "Iijima, Hiroshi",
	TITLE = "Digital Signal Processing Technologies: Video Signal
		Coding and Processing",
	EDITOR = "Inose, Hiroshi",
	BOOKTITLE = "Japan Annual Reviews in Electronics, Computers, and
		Telecommunications",
	VOLUME = "14",
	PUBLISHER = OHMSHA,
	ADDRESS = OHMSHA_addr,
	PAGES = "188--200",
	YEAR = 1984,
	ABSTRACT = "TO BE TYPED"
}

@BOOK{inoue,
	EDITOR = "Inou\'{e}, Shinya",
	TITLE = "Video Microscopy",
	PUBLISHER = PLENUM,
	ADDRESS = PLENUM_addr,
	YEAR = 1986
}

@INCOLLECTION{inoue:hansen,
	AUTHOR = "Hansen, Eric W.",
	TITLE = "Modulation Transfer Function Analysis in Video Microscopy",
	EDITOR = "Inou\'{e}, Shinya",
	BOOKTITLE = "Video Microscopy",
	CHAPTER = "II",
	PAGES = "467--475",
	PUBLISHER = PLENUM,
	ADDRESS = PLENUM_addr,
	YEAR = 1986
}

@BOOK{jain,
	AUTHOR = "Jain, Anil K.",
	TITLE = "Fundamentals of Digital Image Processing",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1989
}

@BOOK{jackson,
	AUTHOR = "Jackson, Leland B.",
	TITLE = "Digital Filters and Signal Processing",
	PUBLISHER = KLUWER,
	ADDRESS = KLUWER_addr,
	YEAR = 1986
}

@BOOK{kittler+duff,
	EDITOR = "Kittler, Josef and Duff, Michael J. B.",
	TITLE = "Image Processing System Architectures",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1985
}

@BOOK{levialdi,
	EDITOR = "Levialdi, S.",
	TITLE = "Integrated Technology for Parallel Image Processing",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1985
}

@BOOK{levine,
	EDITOR = "Levine, Martin D.",
	TITLE = "Vision in Man and Machine",
	PUBLISHER = MCGRAW,
	ADDRESS = MCGRAW_addr,
	YEAR = 1985
}

@BOOK{lim+oppenheim:advanced_topics_in_signal_processing,
	EDITOR = "Lim, Jae S. and Oppenheim, Alan V.",
	TITLE = "Advanced Topics In Signal Processing",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1988
}

@BOOK{marr,
	AUTHOR = "Marr, David",
	TITLE = "Vision",
	PUBLISHER = FREEMAN,
	ADDRESS = FREEMAN_addr,
	YEAR = 1982
}

@BOOK{moik,
	AUTHOR = "Moik, Johannes G.",
	TITLE = "Digital Processing of Remotely Sensed Images",
	PUBLISHER = NASA,
	ADDRESS = NASA_addr,
	YEAR = 1979
}

@BOOK{mitra+ekstrom,
	AUTHOR = "Mitra, Sanjit K. and Ekstrom, Michael P.",
	TITLE = "Two-Dimensional Digital Signal Processing",
	PUBLISHER = DOWDEN,
	ADDRESS = DOWDEN_addr,
	YEAR = 1978
}

@BOOK{oppenheim+schafer,
	AUTHOR = "Oppenheim, Alan V. and Schafer, Ronald W.",
	TITLE = "Digital Signal Processing",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1975
}

@BOOK{oppenheim++,
	AUTHOR = "Oppenheim, Alan V. and Willsky, Alan S. and Young, Ian T.",
	TITLE = "Signals and Systems",
	PUBLISHER = PH,
	ADDRESS = PH_addr,
	YEAR = 1983
}

@BOOK{pavlidis,
	AUTHOR = "Pavlidis, Theo",
	TITLE = "Algorithms for Graphics and Image Processing",
	PUBLISHER = CSP,
	ADDRESS = CSP_addr,
	YEAR = 1982
}

@BOOK{pratt,
	AUTHOR = "Pratt, William K.",
	TITLE = "Digital Image Processing",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1978
}

@BOOK{pratt:itt,
	EDITOR = "Pratt, William K.",
	BOOKTITLE = "Image Transmission Techniques",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1979
}

@INCOLLECTION{sakrison:pratt,
	AUTHOR = "Sakrison, David J.",
	TITLE = "Image Coding Applications of Vision Models",
	BOOKTITLE = "Image Transmission Techniques",
	EDITOR = "Pratt, William K.",
	CHAPTER = "2",
	PAGES = "21--71",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1979
}

@BOOK{preston+uhr,
	EDITOR = "Preston, Jr., Kendall and Uhr, Leonard",
	TITLE = "Multicomputers and Image Processing: {Algorithms}
		and Programs",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1982
}

@BOOK{roberts+mullis:digital_signal_processing,
	AUTHOR = "Roberts, Richard A. and Mullis, Clifford T.",
	TITLE = "Digital Signal Processing",
	PUBLISHER = AW,
	ADDRESS = AW_addr,
	YEAR = 1987
}

@BOOK{rosenfeld+kak,
	AUTHOR = "Rosenfeld, Azriel and Kak, Avinash C.",
	TITLE = "Digital Picture Processing",
	EDITION = "Second",
	PUBLISHER = ACADEMIC,
	ADDRESS = ACADEMIC_addr,
	YEAR = 1982
}

@BOOK{schade:image_quality,
	AUTHOR = "Schade, Sr., Otto H.",
	TITLE = "Image Quality: {A} Comparison of Photographic and Television
		Systems",
	PUBLISHER = RCA,
	ADDRESS = RCA_addr,
	YEAR = 1975
}

@BOOK{schreiber,
	AUTHOR = "Schreiber, William F.",
	TITLE = "Fundamentals of Electronic Imaging Systems: {Some} Aspects
		of Image Processing",
	PUBLISHER = SPRINGER,
	ADDRESS = SPRINGER_addr,
	YEAR = 1986
}

@BOOK{shannon+weaver,
	AUTHOR = "Shannon, Claude and Weaver, Warren",
	TITLE = "The Mathematical Theory of Communication",
	PUBLISHER = ILL,
	ADDRESS = ILL_addr,
	YEAR = 1964,
	NOTE = "Originally published in the {\it Bell System
		Technical Journal}, 27:379--423 and 28:623--656, 1948."
}

@BOOK{weaver,
	AUTHOR = "Weaver, H. Joseph",
	TITLE = "Applications of Discrete and Continuous Fourier Analysis",
	PUBLISHER = WILEY,
	ADDRESS = WILEY_addr,
	YEAR = 1983
}

@BOOK{wiener,
	AUTHOR = "Wiener, N.",
	TITLE = "Extrapolation, Interpolation, and Smoothing of
		Stationary Time Series",
	PUBLISHER = MIT,
	ADDRESS = MIT_addr,
	YEAR = 1949
}

@PROCEEDINGS{wollensak+shannon:spie13,
	EDITOR = "Wollensak, Richard and Shannon, Robert",
	TITLE = "Modulation Transfer Function",
	ORGANIZATION = "Proc.\ SPIE 13",
	YEAR = 1968
}

@PROCEEDINGS{derr+shannon:spie16,
	EDITOR = "Derr, Albert J. and Shannon, Robert",
	TITLE = "Image Information Recovery",
	ORGANIZATION = "Proc.\ SPIE 16",
	YEAR = 1968
}

@PROCEEDINGS{parsons:spie199,
	EDITOR = "Parsons, John R.",
	TITLE = "Advances in Display Technology",
	ORGANIZATION = "Proc.\ SPIE 199",
	YEAR = 1979
}

@PROCEEDINGS{oosterlinck+tescher:spie397,
	EDITOR = "Oosterlinck, Andr{\'e} and Tescher, Andrew G.",
	TITLE = "Applications of Digital Image Processing",
	ORGANIZATION = "Proc.\ SPIE 397",
	YEAR = 1983
}

@PROCEEDINGS{oosterlinck+danielsson:spie435,
	EDITOR = "Oosterlinck, Andr{\'e} and Danielsson, Per-Erik",
	TITLE = "Architectures and Algorithms for Digital Image Processing I",
	ORGANIZATION = "Proc.\ SPIE 435",
	YEAR = 1983
}

@PROCEEDINGS{corbett:spie534,
	EDITOR = "Corbett, Francis J.",
	TITLE = "Architectures and Algorithms for Digital Image Processing II",
	ORGANIZATION = "Proc.\ SPIE 534",
	YEAR = 1985
}

@PROCEEDINGS{hsing:spie1001,
	EDITOR = "Hsing, T. Russell",
	TITLE = "Visual Communications and Image Processing III",
	ORGANIZATION = "Proc.\ SPIE 1001",
	YEAR = 1988
}

@PROCEEDINGS{pearlman:spie1199,
	EDITOR = "Pearlman, William A.",
	TITLE = "Visual Communications and Image Processing IV",
	ORGANIZATION = "Proc.\ SPIE 1199",
	YEAR = 1989
}

@PROCEEDINGS{kunt:spie1360,
	EDITOR = "Kunt, Murat",
	TITLE = "Visual Communications and Image Processing V",
	ORGANIZATION = "Proc.\ SPIE 1360",
	YEAR = 1989
}

@UNPUBLISHED{park:draft,
	AUTHOR = "Park, Stephen K.",
	TITLE = "{\it Introduction to Digital Image Processing}",
	NOTE = "Unpublished Draft (Computer Science Department,
		College of William and Mary)",
	INSTITUTION = WMCS,
	ADDRESS = WMCS_addr,
	YEAR = 1987
}

@UNPUBLISHED{park:notes,
	AUTHOR = "Park, Stephen K.",
	TITLE = "{\it Discrete Linear Systems}",
	NOTE = "Unpublished Lecture Notes (Computer Science Department,
		College of William and Mary)",
	INSTITUTION = WMCS,
	ADDRESS = WMCS_addr,
	YEAR = 1988
}

@INPROCEEDINGS{abramatic:iscas79,
	AUTHOR = "Abramatic, Jean-Fran\c{c}ois",
	TITLE = "Image Filtering by Sequential Convolution of `Small'
		Generating Kernels",
	BOOKTITLE = ISCAS,
	ORGANIZATION = "IEEE",
	PAGES = "539--542",
	YEAR = 1979,
	ABSTRACT = "This paper summarizes design procedures for classes
		of 2-D FIR filters that can be implemented by sequentially
		convolving the input data with small size operators.
		Assessments of the results are given for image processing
		applications."
}

@INPROCEEDINGS{abramatic+faugeras:cprip78,
	AUTHOR = "Abramatic, Jean-Fran\c{c}ois and Faugeras, Oliver D.",
	TITLE = "Design of Two-Dimensional {FIR} Filters from `Small'
		Generating Kernels",
	BOOKTITLE = CPRIP,
	ORGANIZATION = "IEEE",
	PAGES = "116--118",
	YEAR = 1978,
	ABSTRACT = "This paper presents a synthesis procedure for a class
		of two-dimensional finite impulse response filters that are
		easily implemented by sequential convolution of small
		convolution operators, 3x3 for example.  The design method
		is based upon minimization of the mean square error between
		the synthesized filter and a design prototype."
}

@ARTICLE{abramatic+faugeras:ieeeassp30/1,
	AUTHOR = "Abramatic, Jean-Fran\c{c}ois and Faugeras, Oliver D.",
	TITLE = "Sequential Convolution Techniques for Image Filtering",
	JOURNAL = IEEEASSP,
	VOLUME = "30",
	NUMBER = "1",
	PAGES = "1--10",
	YEAR = 1982,
	ABSTRACT = "Sequentially convolving images with small size
		operators is a promising idea for performing image
		filtering.  various classes of two-dimensional finite
		impulse response (FIR) filters that can be implemented
		with such techniques are studied.  Design procedures are
		presented for each of the classes.  They are based upon
		minimizing $L^2$ and $L^{\infty}$ criteria.  Results
		are assessed in an image processing context."
}

@INPROCEEDINGS{abramatic+germain:icassp79,
	AUTHOR = "Abramatic, Jean-Fran\c{c}ois and Germain, F. and
		Rosencher, Emm.",
	TITLE = "Design of 2-D Recursive Filters with Separable Denominator
		Transfer Functions",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "24--27",
	YEAR = 1979,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{abramatic+silverman:ieeepami4/2,
	AUTHOR = "Abramatic, Jean-Fran\c{c}ois and Silverman, Leonard M.",
	TITLE = "Nonlinear Restoration of Noisy Images",
	JOURNAL = IEEEPAMI,
	VOLUME = "4",
	NUMBER = "2",
	PAGES = "141--149",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.
		Also in the {\it Proceedings of the IEEE Conference on
		Decision and Control Including the Symposium on
		Adaptive Processes}, Vol. 1, Ft. Lauderdale, FL,
		Dec. 12--14, 1979.",
	ABSTRACT = "The restoration of images degraded by an additive white
		noise is performed by nonlinearly filtering a noisy image.  The
		standard Wiener approach to this problem is modified to take
		into account the edge information of the image.  Various
		filters of increasing complexity are derived.  Experimental
		results are shown and compared to the standard Wiener filter
		results and other earlier attempts involving nonstationary
		filters.",
	INDEX = "image restoration,
		nonlinear filter,
		nonlinear restoration"
}

@UNPUBLISHED{alter-gartenberg+huck,
	AUTHOR = "Alter-Gartenberg, Rachel and Huck, Friedrich O.",
	TITLE = "Beyond Primal Sketches"
}

@UNPUBLISHED{alter-gartenberg++,
	AUTHOR = "Alter-Gartenberg, Rachel and Fales, Carl L. and
		Huck, Friedrich O. and McCormick, Judith A.",
	TITLE = "End-to-End Performance of Image Gathering and Processing"
}

@ARTICLE{alter-gartenberg++:josaa7/5,
	AUTHOR = "Alter-Gartenberg, Rachel and Huck, Friedrich O.
		and Narayanswamy, Ramkumar",
	TITLE = "Image Recovery from Edge Primitives",
	JOURNAL = JOSAA,
	VOLUME = "7",
	NUMBER = "5",
	PAGES = "898--911",
	YEAR = 1990,
	ABSTRACT = "TO BE TYPED"
}

@UNPUBLISHED{alter-gartenberg++:subm,
	AUTHOR = "Alter-Gartenberg, Rachel and Fales, Carl L. and
		Huck, Friedrich O. and Rahman, Zia-ur and
		Reichenbach, Stephen E.",
	TITLE = "Multiresponse Imaging: Information and Fidelity",
	NOTE = "Submitted for publication.",
	XJOURNAL = VCIR,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{altmann+reitbock:ieeepami6/1,
	AUTHOR = "Altman, J{\"{u}}rgen and Reitb{\"{o}}ck, Herbert J. P.",
	TITLE = "A Fast correlation Method for Scale- and
		Translation-Invariant Pattern Recognition",
	JOURNAL = IEEEPAMI,
	VOLUME = "6",
	NUMBER = "1",
	PAGES = "46--57",
	YEAR = 1984,
	ABSTRACT = "TO BE TYPED",
	INDEX = "cross correlation,
		Fourier transform,
		logarithmic mapping,
		Mellin transform,
		moments,
		pattern recognition,
		scale-invariant pattern recognition"
}

@ARTICLE{anderson+netravali:ieeesmc6/12,
	AUTHOR = "Anderson, G. Leigh and Netravali, Arun N.",
	TITLE = "Image Restoration Based on a Subjective Criterion",
	JOURNAL = IEEESMC,
	VOLUME = "6",
	NUMBER = "12",
	PAGES = "845--853",
	YEAR = 1976,
	ABSTRACT = "The problem of removing random noise from gray tone
		images without significantly sacrificing the subjective
		resolution is considered.  Based on a subjective visibility
		function, which gives the relationship between the visibility
		of a unit noise and a measure of local spatial detail (spatial
		masking), two procedures are developed to adapt continuously
		the finite impulse response of a two-dimensional, noncausal,
		linear digital filter.  At sharp transitions in the image
		intensity, the filter operator is strongly peaked to preserve
		the resolution, whereas in flat areas it is flat to
		effectively average out the random noise.  The first procedure
		(S-filter) is computationally more efficient, but does not
		perform as well as the second method (SD-filter) which
		requires solution of a new optimization problem at every
		picture element.  Results of several simulations are presented
		to demonstrate the feasibility of our approach.  Extensions
		are pointed out to incorporate different adaptation
		procedures and psychovisual criteria other than the type of
		spatial masking used here."
}

@ARTICLE{andrews:comp7/5,
	AUTHOR = "Andrews, H. C.",
	TITLE = "Digital Image Restoration: {A} Survey",
	JOURNAL = COMP,
	VOLUME = "7",
	NUMBER = "5",
	PAGES = "36--45",
	YEAR = 1974
}

@ARTICLE{arguello++:ieeec21/7,
	AUTHOR = "Arguello, Roger J. and Sellner, Harvey R. and Stuller,
		John A.",
	TITLE = "Transfer Function Compensation of Sampled Imagery",
	JOURNAL = IEEEC,
	VOLUME = "21",
	NUMBER = "7",
	PAGES = "812--818",
	YEAR = 1972,
	ABSTRACT = "With the availability of the computer for
		two-dimensional picture processing, digital restoration
		of deterministically degraded sampled images is a practical
		reality.  This correspondence presents a mathematical
		formulation of discrete modulation transfer compensation
		of sampled imagery.  The analysis makes no assumption
		regarding the band limitedness of the imaging system and
		accounts explicitly for the effects of spectrum foldover.

		A series of simulation experiments were performed to
		determine the minimum-size processing array that would
		result in a scene quality subjectively equivalent to
		that obtained using an array that is large enough to be
		unnoticeably affected by truncation.  When the optimum
		truncation function is applied to the optimum processing
		array, virtually complete compensation is achieved
		utilizing a processing array of the same relative extent
		as the uncompensated intensity-point spread function.",
	INDEX = "aliasing,
		image restoration,
		modulation function compensation,
		point spread function,
		processing array,
		sampled image,
		transfer function compensation,
		truncation"
}

@ARTICLE{backus+gilbert:ptrsla266,
	AUTHOR = "Backus, G. and Gilbert, F.",
	TITLE = "Uniqueness in the Inversion of Inaccurate Gross Earth Data",
	JOURNAL = PTRSLA,
	VOLUME = "266",
	PAGES = "123--192",
	YEAR = 1970,
	ABSTRACT = "A gross earth datum is a single measurable number
		describing some property of the whole Earth, such as
		mass, moment of inertia, or the frequency of oscillation
		of some identified elastic-gravitational normal mode.  We
		suppose that a finite set \cal{G} of gross Earth data
		has been measured, that the measurements are inaccurate,
		and that the variance matrix of the errors of measurement
		can be estimated.  We show that such sets \cal{G} of
		measurements determine the structure of the Earth within
		certain limits of error except for fine-scale detail.
		That is, from some sets \cal{G} it is possible to
		compute localized averages of the Earth structure at
		various depths.  These localized averages will be slightly
		in error, and their errors will be larger as the resolving
		lengths are shortened.  We show how to determine whether
		a given set \cal{G} of measured gross Earth data permits
		such a construction of localized averages, and, if so,
		how to find the shortest length scale over which \cal{G}
		gives a local average structure at a particular depth if
		the variance of the error in computing that local average
		from \cal{G} is to be less than a specified amount.  We
		apply the general theory to the linear problem of finding
		the  depth variation of a frequency-independent local
		elastic dissipation (\cal{Q}) from the observed damping
		rates of a finite number of normal modes.  We also apply
		the theory to the nonlinear problem of finding density
		against depth from the total mass, moment and normal-mode
		frequencies, in the case the compressional and shear
		velocities are known."
}

@ARTICLE{barakat+houston:josa53/11,
	AUTHOR = "Barakat, Richard and Houston, Agnes",
	TITLE = "Reciprocity Relations Between the Transfer Function
		and Total Illuminance.  I",
	JOURNAL = JOSA,
	VOLUME = "53",
	NUMBER = "11",
	PAGES = "1244--1249",
	YEAR = 1963,
	ABSTRACT = "The functional relationship between the total
		illuminance and transfer function is obtained for
		systems having rotationally symmetric aberrations.  It
		is shown that the behavior of the transfer function
		at zero spatial frequency determines the asymptotic
		behavior of the total illuminance.  In addition, the
		moments of the transfer function determine the behavior
		of the total illuminance in the vicinity of the origin.
		Typical numerical results are presented."
}

@ARTICLE{barakat:josa54/1,
	AUTHOR = "Barakat, Richard",
	TITLE = "Numerical Results Concerning the Transfer Functions
		and Total Illuminance for Optimum Balanced Fifth-Order
		Spherical Aberration",
	JOURNAL = JOSA,
	VOLUME = "54",
	NUMBER = "1",
	PAGES = "38--44",
	YEAR = 1964,
	ABSTRACT = "Numerical values of the transfer function and total
		illuminance (encircled energy) are presented for optimum
		balanced fifth-order spherical aberration."
}

@ARTICLE{barakat+houston:josa54/6,
	AUTHOR = "Barakat, Richard and Houston, Agnes",
	TITLE = "Line Spread Function and Cumulative Line Spread Function
		for Systems with Rotational Symmetry",
	JOURNAL = JOSA,
	VOLUME = "54",
	NUMBER = "6",
	PAGES = "768--773",
	YEAR = 1964,
	ABSTRACT = "The line spread function and the cumulative line spread
		function for a circular aperture having rotationally
		symmetric aberrations are determined by integrals involving
		the transfer function of the system.  Asymptotic
		expansions of the line spread function and the cumulative
		line spread function are obtained from a knowledge
		of the transfer function and its derivatives evaluated
		at zero spatial frequency.  The moments of the transfer
		function determine the behavior of the line spread function
		and the cumulative line spread function for small values of
		the argument.  Typical numerical results are also presented."
}

@ARTICLE{barakat:josa54/7,
	AUTHOR = "Barakat, Richard",
	TITLE = "Application of the Sampling Theorem to Optical
		Diffraction Theory",
	JOURNAL = JOSA,
	VOLUME = "54",
	NUMBER = "7",
	PAGES = "920--930",
	YEAR = 1964,
	ABSTRACT = "The sampling theorem is applied to optical diffraction
		theory as a computation tool.  Formulas are developed
		in terms of sampled values of the point spread function for
		the transfer function, total illuminance, line spread
		function and cumulative line spread function.  Typical
		numerical examples are presented.  The theory is presented
		for general point spread functions for slit and square
		apertures, but only for rotationally symmetric point
		spread functions for circular apertures.  In the case of
		the slit aperture, the following question is answered:
		Given the real part of the incoherent transfer function,
		determine its imaginary part and vice versa.  The
		theory of conjugate Fourier series and finite Hilbert
		transforms is introduced in order to answer this question."
}

@ARTICLE{barakat+houston:josa55/9,
	AUTHOR = "Barakat, Richard and Houston, Agnes",
	TITLE = "Line Spread and Edge Spread Functions in the Presence
		of Off-Axis Aberrations",
	JOURNAL = JOSA,
	VOLUME = "55",
	NUMBER = "9",
	PAGES = "1132--1135",
	YEAR = 1965,
	ABSTRACT = "The line spread function and edge spread function for
		incoherent illumination are expressed in terms of the transfer
		function in the presence of rotationally nonsymmetric
		aberrations.  A sampling theorem is derived which expresses
		the edge spread function in terms of sampled values of the
		line spread function.  Typical numerical results are presented
		for third-order coma."
}

@ARTICLE{barakat:josa55/10,
	AUTHOR = "Barakat, Richard",
	TITLE = "Determination of the Optical Transfer Function Directly
		from the Edge Spread Function",
	JOURNAL = JOSA,
	VOLUME = "55",
	NUMBER = "10",
	PAGES = "1217--1221",
	YEAR = 1965,
	ABSTRACT = "A method for obtaining the optical transfer function
		from the edge spread function is described.  The method
		involves the inversion of a Fredholm integral equation of
		the first kind using sampling-theory concepts.  Typical
		examples for both symmetric and asymmetric edge spread
		functions are studied and compared with known solutions"
}

@ARTICLE{beal++:optengr26/9,
	AUTHOR = "B\'{e}al, G. and Boucharlat, G. and Chabbal, J. and
		Dupin, J. P. and Fort B. and Mellier, Y.",
	TITLE = "Thomson-{CSF} Frame-Transfer Charge-Coupled-Device Imagers:
		{Design} and Evaluation at Low Flux Level",
	JOURNAL = OE,
	VOLUME = "26",
	NUMBER = "9",
	PAGES = "902--910",
	YEAR = 1987,
	ABSTRACT = "A slow-scan, cooled CCD camera system, similar to
		that used for astronomical observations, was constructed
		at Toulouse Observatory and used for testing CCD chips.
		Several devices were tested extensively.  This paper
		describes the design and performance of some
		Thomson-CSF solid-state area-array CCD sensors.  These
		sensors use a frame-transfer organization adapted to
		operate in a double-interlaced-field readout mode with
		a memory zone (sensor TH 7861) or adapted to operate
		in a single-field mode without a memory zone (sensors
		TH 7882, TH 7883, TH7884).  We briefly describe the
		system and the evaluation of the photometric performance
		of these chips, including quantum efficiency, readout
		noise, transfer efficiency, linearity, dark current,
		and field uniformity.  Some projected developments of
		Thomson-CSF chips for scientific applications, such
		as the TH X31156 (1024 x 1024 pixels) and the buttable
		TH 7882 (TH X31157), are also presented.",
	INDEX = "charge-coupled devices,
		frame transfer,
		cameras,
		slow scan,
		area array,
		astronomy"
}

@ARTICLE{bennett:bstj27/1,
	AUTHOR = "Bennett, W. R.",
	TITLE = "Spectra of Quantized Signals",
	JOURNAL = BSTJ,
	VOLUME = "27",
	PAGES = "447--472",
	YEAR = 1948
}

@ARTICLE{bergland:spectrum6/7,
	AUTHOR = "Bergland, G. D.",
	TITLE = "A Guided Tour of the Fast {Fourier} Transform",
	JOURNAL = SPECTRUM,
	VOLUME = "6",
	NUMBER = "7",
	PAGES = "41--52",
	YEAR = 1969,
	ABSTRACT = "For some time the Fourier transform has served as a
		bridge between the the time domain and the frequency
		domain.  It is now possible to go back and forth between
		waveform and spectrum with enough speed and economy to
		create a whole new range of applications for the classic
		mathematical device.  This article is intended as a primer
		on the fast Fourier transform, which has revolutionized the
		digital processing of waveforms.  The reader's attention is
		especially directed to the IEEE Transactions on Audio and
		Electroacoustics for June 1969, a special issue devoted to
		the fast Fourier transform."
}

@INPROCEEDINGS{berkovitz:spie13,
	AUTHOR = "Berkovitz, M. A.",
	TITLE = "Edge Gradient Analysis OTF Accuracy Study",
	BOOKTITLE = "Modulation Transfer Function",
	PEDITOR = "Wollensak, Richard and Shannon, Robert",
	ORGANIZATION = "Proc.\ SPIE 13",
	PAGES = "115--123",
	YEAR = 1968,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{bernstein:ibmjrd20,
	AUTHOR = "Bernstein, R.",
	TITLE = "Digital Image Processing of Earth Observation Sensor Data",
	JOURNAL = IBMJRD,
	VOLUME = "20",
	PAGES = "40--57",
	YEAR = 1976,
	ABSTRACT = "This paper describes digital image processing techniques
		that were developed to precisely correct Landsat multispectral
		Earth observation data and gives illustrations of the results
		achieved, e.g., geometric corrections with an error of less
		that one picture element, a relative error of one-fourth
		picture element, and no radiometric error effect.  Techniques
		for enhancing the sensor data, digitally mosaicking multiple
		scenes, and extracting information are also illustrated."
}

@INPROCEEDINGS{blackman:spie16,
	AUTHOR = "Blackman, Elliot S.",
	TITLE = "Recovery of System Transfer Functions from
		Noisy Photographic Records",
	BOOKTITLE = "Seminar on Image Information Recovery",
	PEDITOR = "Derr, Albert J. and Shannon, R.",
	ORGANIZATION = "Proc.\ SPIE 16",
	PAGES = "105--112",
	YEAR = 1969,
	ABSTRACT = "The recovery of photographic system transfer
		functions from film records is invariably complicated
		by the presence of grain noise, which often causes
		these experimentally determined functions to oscillate
		wildly, and introduces into the calculated data a
		positive bias with respect to the correct transfer
		functions.  However, by utilizing the contrast between
		random behavior of grain noise and the more well behaved
		photographic system transfer function, we may remove a
		substantial amount of noise-caused error through the
		use of suitable smoothing techniques.

		To demonstrate the merit of a particular smoothing
		technique, which improves the signal to noise ratio
		in the frequency domain by convolving the raw transfer
		function with a variable bandwidth smoothing function,
		noisy photographic edge image traces were synthesized
		using a CDC-3300 computer, the Fourier analysis program,
		FRAP, and microdensitometer traces of an evenly exposed
		film sample.  The application of the smoothing technique
		to the raw transfer functions produced from this edge
		data and the utilization of the smoothed transfer functions
		in the calculation of line and three-bar image cross
		sections serve to illustrate the effectiveness of the
		method."
}

@ARTICLE{bold:pieee73/12,
	AUTHOR = "Bold, Gary E. J.",
	TITLE = "A Comparison of the Time Involved in Computing
		Fast {Hartley} and Fast {Fourier} Transforms",
	JOURNAL = PIEEE,
	VOLUME = "73",
	NUMBER = "12",
	PAGES = "1863--1864",
	YEAR = 1985,
	ABSTRACT = "It is shown that the DFT of a real sequence,
		formed via the Fast Hartley Transform, can be
		computed at most only 2 times faster than by
		using a complex Fast Fourier Transform.  However,
		more sophisticated FFT algorithms exist which give
		the same speedup factor.  A simple FHT subroutine
		is presented to illustrate the similarity of the
		FHT and FFT butterflies in their simplest forms."
}

@ARTICLE{bracewell:josa73/12,
	AUTHOR = "Bracewell, Ronald N.",
	TITLE = "Discrete {Hartley} Transform",
	JOURNAL = JOSA,
	VOLUME = "73",
	NUMBER = "12",
	PAGES = "1832--1835",
	YEAR = 1983,
	ABSTRACT = "The discrete Hartley transform (DHT) resembles the
		discrete Fourier transform (DFT) but is free from two
		characteristics of the DFT that are sometimes computationally
		undesirable.  The inverse DHT is identical with the
		direct transform, and so it is not necessary to keep
		track of the $+i$ and $-i$ versions as with the DFT.
		Also, the DHT has real rather than complex values and
		thus does not require provision for complex arithmetic
		or separately managed storage for real and imaginary
		parts.  Nevertheless, the DFT is directly obtainable
		from the DHT by a simple additive operation.  In most
		image-processing applications the convolution of two
		data sequences $f_1$ and $f_2$ is given by DHT of
		[(DHT of $f_1$) $\times$ (DHT of $f_2$)], which is
		a rather simpler algorithm than the DFT permits,
		especially if images are to be manipulated in two
		dimensions.  It permits faster computing.  Since
		the speed of the fast Fourier transform depends on
		the number of multiplications, and since one complex
		multiplication equals four real multiplications, a
		fast Hartley transform also promises to speed up
		Fourier-transform calculations.  The name discrete
		Hartley transform is proposed because the DHT bears
		the same relation to an integral transform described
		by Hartley [R.V.L.Hartley, Proc. IRE {\bf 30},
		144 (1942)] as the DFT bears to the Fourier transform."
}

@ARTICLE{bracewell:pieee72/8,
	AUTHOR = "Bracewell, Ronald N.",
	TITLE = "The Fast {Hartley} Transform",
	JOURNAL = PIEEE,
	VOLUME = "72",
	NUMBER = "8",
	PAGES = "1010--1018",
	YEAR = 1984,
	ABSTRACT = "A fast algorithm has been worked out for performing
		the Discrete Hartley Transform (DHT) of a data sequence
		of $N$ elements in a time proportional to $N \log_{2} N$.
		The Fast Hartley Transform (FHT) is as fast as or faster
		than the Fast Fourier Transform (FFT) and serves for all
		the uses such as spectral analysis, digital processing, and
		convolution to which the FFT is at present applied.  A new
		timing diagram (stripe diagram) is presented to illustrate
		the overall dependence of running time on the subroutines
		composing one implementation; this mode of presentation
		supplements the simple counting of multiplies and adds.
		One may view the Fast Hartley procedure as a sequence of
		matrix operations on the data and thus a constituting
		a new factorization of the DFT matrix operator; this
		factorization is presented.  The FHT computes convolutions
		and power spectra distinctly faster than the FFT."
}

@ARTICLE{bracewell++:ao24/10,
	AUTHOR = "Bracewell, Ronald N. and Bartelt, H. and
		Lohmann, A. W. and Streibl, N.",
	TITLE = "Optical Synthesis of the Hartley Transform",
	JOURNAL = AO,
	VOLUME = "24",
	NUMBER = "10",
	PAGES = "1401--1402",
	YEAR = 1985
}

@ARTICLE{bracewell++:pieee74/9,
	AUTHOR = "Bracewell, Ronald N. and Buneman, O. and Hao, H.
		and Villasenor, J.",
	TITLE = "Fast Two-dimensional {Hartley} Transform",
	JOURNAL = PIEEE,
	VOLUME = "74",
	NUMBER = "9",
	PAGES = "1282--1283",
	YEAR = 1986,
	ABSTRACT = "The fast {Hartley} transform algorithm introduced in
		1984 offers an alternative to the fast Fourier transform,
		with the advantages of not requiring complex arithmetic or a
		sign change of $i$ to distinguish inverse transformation
		from direct.  a two-dimensional extension is described
		that speeds up Fourier transformation of real digital
		images."
}

@ARTICLE{bucklew+gallagher:ieeeit25/5,
	AUTHOR = "Bucklew, James A. and Gallagher, Neal C.",
	TITLE = "Quantization Schemes for Bivariate {Gaussian} Random
		Variables",
	JOURNAL = IEEEIT,
	VOLUME = "25",
	NUMBER = "5",
	PAGES = "537--543",
	YEAR = 1979,
	ABSTRACT = "The problem of quantizing two-dimensional Gaussian
		random variables is considered.  It is shown that, for
		all but a finite number of cases, a polar representation
		gives a smaller mean square quantization error than a
		Cartesian representation.  Applications of the results
		to a transform coding scheme known as spectral phase
		coding are discussed."
}

@ARTICLE{budrikis:pieee60/7,
	AUTHOR = "Budrikis, Zigmantas L.",
	TITLE = "Visual Fidelity Criterion and Modeling",
	JOURNAL = PIEEE,
	VOLUME = "60",
	NUMBER = "7",
	PAGES = "771--778",
	YEAR = 1972,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{buneman:siamjssc7/2,
	AUTHOR = "Buneman, Oscar",
	TITLE = "Conversion of {FFT}'S to Fast {Hartley} Transforms",
	JOURNAL = SIAMJSSC,
	VOLUME = "7",
	NUMBER = "2",
	PAGES = "624--628",
	YEAR = 1986,
	ABSTRACT = "The complex Fourier transform of a real function
		and its real Hartley transform are expressed in terms
		of each other, allowing translation of theorems and
		computer programs between the two versions.  Any
		FFT can thus be converted, by a few indexing changes,
		into a Fast Hartley Transform which is equally efficient,
		in terms of floating point operations per real datum
		transformed.  The FHT can therefore transform one real
		array of length $N$ in half the time that it takes the FFT
		to process a complex array of length N.  Several tricks
		to speed up both FHT and FFT are presented and a Fortran
		version of the FHT is supplied which delivers the result
		in $.75 N \log_2 N$ multiplications and $1.75 N \log_2 N$
		additions."
}

@ARTICLE{buneman:pieee75/2,
	AUTHOR = "Buneman, Oscar",
	TITLE = "Multidimensional {Hartley} Transforms",
	JOURNAL = PIEEE,
	VOLUME = "75",
	NUMBER = "2",
	PAGES = "267",
	YEAR = 1987,
	ABSTRACT = "The computational effort required for multidimensional
		Hartley transforming is estimated."
}

@ARTICLE{burt+adelson:ieeecom31/4,
	AUTHOR = "Burt, Peter J. and Adelson, Edward H.",
	TITLE = "The {Laplacian} Pyramid as a Compact Image Code",
	JOURNAL = IEEECOM,
	VOLUME = "31",
	NUMBER = "4",
	PAGES = "532--540",
	YEAR = 1983,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{burt:spie1199,
	AUTHOR = "Burt, Peter J.",
	TITLE = "Multiresolution Techniques for Image Representation,
		Analysis, and `Smart' Transmission",
	BOOKTITLE = "Visual Communications and Image Processing IV",
	PEDITOR = "Pearlman, William A.",
	ORGANIZATION = "Proc.\ SPIE 1199",
	PAGES = "833--840",
	YEAR = 1989,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{burton+park+miller:spse43,
	AUTHOR = "Burton, John C. and Park, Stephen K. 
                  and Miller, Keith W.",
	TITLE = "Hexagonally Sampled Digital Imaging System Analysis",
	BOOKTITLE = "SPSE's 43rd Annual Conf.",
	ORGANIZATION = SPSE,
	PAGES = "238--241",
	YEAR = 1990,
	XNOTE = "Summary Only"
}

@ARTICLE{cannon:ieeeassp24/1,
	AUTHOR = "Cannon, Michael",
	TITLE = "Blind Deconvolution of Spatially Invariant Image
		Blurs with Phase",
	JOURNAL = IEEEASSP,
	VOLUME = "24",
	NUMBER = "1",
	PAGES = "58--63",
	YEAR = 1976,
	ABSTRACT = "This paper is concerned with the digital estimation
		of the frequency response of a two-dimensional spatially
		invariant linear system through which an image has been
		passed and blurred.  For the cases of uniform linear camera
		motion and an out-of-focus lens system it is shown that the
		power cepstrum of the image contains sufficient information
		to identify the blur.  Methods for deblurring are presented,
		including restoration of the density version of the image.
		The restoration procedure consumes only a modest amount of
		computation time.  Results are demonstrated on images blurred
		in the camera."
}

@ARTICLE{canny:ieeepami8/6,
	AUTHOR = "Canny, John",
	TITLE = "A Computational Approach to Edge Detection",
	JOURNAL = IEEEPAMI,
	VOLUME = "8",
	NUMBER = "6",
	PAGES = "679--698",
	YEAR = 1986,
	ABSTRACT = "This paper describes a computational approach to edge
		detection.  The success of the approach depends on the
		definition of a {\it comprehensive} set of goals for the
		computation of edge points.  These goals must be precise
		enough to delimit the desired behavior of the detector
		while making minimal assumptions about the form of the
		solution.  We define detection and localization criteria
		for a class of edges, and present mathematical forms for
		these criteria as functionals on the operator impulse response.
		A third criterion is then added to ensure that the detector
		has only one response to a single edge.  We use the criteria
		in numerical optimization to derive detectors for several
		common image features, including step edges.  On specializing
		the analysis to step edges, we find that there is a natural
		uncertainty principle between detection and localization
		performance, which are the two main goals.  With this
		principle we derive a single operator shape which is optimal
		at any scale.  The optimal detector has a simple approximate
		implementation in which edges are marked at maxima in gradient
		magnitude of a Gaussian-smoothed image.  We extend this simple
		detector using operators of several widths to cope with
		different signal-to-noise ratios in the image.  We present
		a general method, called feature synthesis, for the
		fine-to-course integration of information from operators at
		different scales.  finally we show that step edge detector
		performance improves considerably as the operator function
		is extended along the edge.  This detection scheme uses several
		elongated operators at each point, and the directional operator
		outputs are integrated with the gradient maximum detector.",
	INDEX = "edge detection,
		feature extraction,
		image processing,
		machine vision,
		multiscale image analysis"
}

@ARTICLE{cathey++:josaa1/3,
	AUTHOR = "Cathey, W. Thomas and Frieden, B. Roy and
		Rhodes, William T. and Rushforth, Craig K.",
	TITLE = "Image Gathering and Processing for Enhanced Resolution",
	JOURNAL = JOSAA,
	VOLUME = "1",
	NUMBER = "3",
	PAGES = "241--250",
	YEAR = 1984,
	ABSTRACT = "Traditional approaches to optical resolution enhancement
		have involved either the design of appropriate image-formation
		systems or some type of postprocessing of an image that has
		already been formed.  Results presented in this paper suggest
		that improved images can be obtained if the image-gathering
		system is designed specifically to enhance the performance of
		the image-restoration algorithm to be used.  We consider a
		class of problems in which the total available spatial
		bandwidth is fixed but the location of this bandwidth along
		the spatial-frequency axis is to some extent under our
		control.  For example, we might consider either a low-pass
		system or a bandpass system of the same total bandwidth.
		We show that system performance can be substantially improved
		by proper allocation of the available bandwidth in the
		spatial-frequency domain.  The optimum allocation is shown
		to be a function of the signal-to-noise ratio.  We also
		describe coherent and incoherent optical image-gathering
		systems that can achieve the desired spatial-frequency
		passbands."
}

@INPROCEEDINGS{chellali+ingle:spie1001,
	AUTHOR = "Chellali, Mohamed and Inglengle, Vinay K.",
	TITLE = "Applications of Adaptive Least Square Filtering to Image
		Restoration",
	BOOKTITLE = "Visual Communications and Image Processing III",
 	PEDITOR = "Hsing, T. Russell",
	ORGANIZATION = SPIE,
	VOLUME = "1001",
	PAGES = "19--24",
	YEAR = 1988,
	ABSTRACT = "Images in real life are inhomogeneous while the
		transmission channels are time varying, hence, adaptive
		schemes are suitable for tracking slow variations on
		system identification and inverse filtering.  In this
		paper we report theoretical and experimental study of the
		application of adaptive filtering to two dimensional
		signals.  In particular, we focus on the recursive least
		squares transversal filter applied to image restoration.
		A multichannel extension of the well known one dimensional
		recursive least square (RLS) algorithm is presented.
		Finally simulation results on real world images are given."
}

@ARTICLE{chellappa+kashyap:ieeeassp30/3,
	AUTHOR = "Chellappa, R. and Kashyap, R. L.",
	TITLE = "Digital Image Restoration Using Spatial Interaction Models",
	JOURNAL = IEEEASSP,
	VOLUME = "30",
	NUMBER = "3",
	PAGES = "461--472",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "This paper is concerned with developing fast nonrecursive
		algorithms for the minimum mean-squared error restoration of
		degraded images.  The degradation is assumed to be due to a
		space invariant, periodic, nonseparable known point-spread
		function, and additive white noise.  Our basic approach is to
		represent the images by a class of spatial interaction models,
		namely the simultaneous autoregressive models and the
		conditional Markov models defined on toroidal lattices, and
		develop minimum mean-squared error restoration algorithms
		using these models.  The restoration algorithms are optimal,
		if the parameters characterizing the interaction models are
		exactly known.  However, in practice, the parameters are
		estimated from the images.  By using spatial interaction
		models, we develop restoration algorithms that do not require
		the availability of the original image or its prototype.  The
		specific structure of the underlying lattice enables the
		implementation of the filters using fast Fourier transform
		(FFT) computations.  Severral restoration examples are given."
}

@ARTICLE{chu+mcgillem:ieeeassp27/5,
	AUTHOR = "Chu, Nim-Yau and {McGillem}, Clare D.",
	TITLE = "Image Restoration Filters Based on a 1-0 Weighting
		Over the Domain of Support of the {PSF}",
	JOURNAL = IEEEASSP,
	VOLUME = "27",
	NUMBER = "5",
	PAGES = "457--464",
	YEAR = 1979,
	ABSTRACT = "Development of restoration filters based on the use
		of a narrowness measure for the composite point spread
		function of a blurring-restoration operation that is the
		ratio of the energy of the composite PSF in a fixed interval
		around the origin to its total energy, is discussed.  For
		a continuous-continuous model, this leads to composite
		PSF's that belong to the family of prolate spheroidal
		wave functions. for a continuous-discrete model, the
		solutions do not have simple analytical forms but resemble
		those of the continuous model.  Filters of this type
		have been found to be superior to those with a
		radius-of-gyration narrowness measure for the control of
		sidelobes in the case of a Gaussian blurring function and
		for restoration of images degraded by linear motion
		blurring.  Details of filter construction and examples of
		image restoration performance are presented."
}

@ARTICLE{cooley+tukey:mathcomp19/90,
	AUTHOR = "Cooley, J. W. and Tukey, J. W.",
	TITLE = "An Algorithm for the Machine Calculation of Complex {Fourier}
		Series",
	JOURNAL = MATHCOMP,
	VOLUME = "19",
	NUMBER = "90",
	PAGES = "297--301",
	YEAR = 1965
}

@ARTICLE{cooley++:ieeeau15/2,
	AUTHOR = "Cooley, James W. and Lewis, Peter A. W. and Welch, Peter D.",
	TITLE = "Application of the Fast {Fourier} Transform to Computation
		of {Fourier} Integrals, {Fourier} Series, and Convolution
		Integrals",
	JOURNAL = IEEEAU,
	VOLUME = "15",
	NUMBER = "2",
	PAGES = "79--84",
	YEAR = 1967,
	ABSTRACT = "The fast Fourier transform is a computational procedure
		for calculating the finite Fourier transform of a time
		series.  In this paper, the properties of the finite
		Fourier transform are related to commonly used integral
		transforms including the Fourier transform and convolution
		integrals.  The relationship between the finite Fourier
		transform and Fourier series is also discussed."
}

@ARTICLE{cooley++:jsoundvib12/3,
	AUTHOR = "Cooley, J. W. and Lewis, P. A. W. and Welch, P. D.",
	TITLE = "The Fast {Fourier} Transform Algorithm: {Programming}
		Considerations in the Calculation of Sine, Cosine,
		and {Laplace} Transforms",
	JOURNAL = JSOUNDVIB,
	VOLUME = "12",
	NUMBER = "3",
	PAGES = "315--337",
	YEAR = 1970,
	ABSTRACT = "In the organization of programming packages for
		computing Fourier and Laplace transforms, it is useful,
		both for conceptual understanding and for operational
		efficiency to consider the discrete {\it complex}
		Fourier transform as a kind of nucleus around which
		programming for special applications is performed.  An
		advantage of these procedures is that the basic complex
		Fourier transform algorithm is systematic and can
		relatively easily be implemented in efficient subroutines,
		micro-programs and special hardware devices.  Once this is
		done, programming for special properties of the data can
		efficiently be left to the user to implement on a general
		purpose computer.

		The problem of establishing the correspondence between
		the discrete transforms and the continuous functions with
		which one is usually dealing is described.  The application
		of these results and the above-mentioned subroutines to
		the calculation and inversion of Laplace transforms is
		given with formulas and empirical results displaying the
		effect of optimal parameters on computational efficiency
		and accuracy."
}

@INPROCEEDINGS{coon+perera:vipttr,
	AUTHOR = "Coon, D. D. and Perera, A. G. U.",
	TITLE = "Parallel Asynchronous Systems and Image Processing
		Algorithms",
	BOOKTITLE = VIPTTR,
	ORGANIZATION = "NASA Conf.\ Pub.\ 3053",
	YEAR = 1989,
	PAGES = "11--22",
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{cornsweet:ajopo62/7,
	AUTHOR = "Cornsweet, Tom N.",
	TITLE = "Prentice Award Lecture: {A} Simple Retinal Mechanism
		That Has Complex and Profound Effects on Perception",
	JOURNAL = AJOPO,
	VOLUME = "62",
	NUMBER = "7",
	PAGES = "427--438",
	YEAR = 1985
}

@ARTICLE{cornsweet+yellott:josaa2/10,
	AUTHOR = "Cornsweet, Tom N. and Yellott, Jr., John I.",
	TITLE = "Intensity-Dependent Spatial Summation",
	JOURNAL = JOSAA,
	VOLUME = "2",
	NUMBER = "10",
	PAGES = "1769--1786",
	YEAR = 1985,
	ABSTRACT = "Psychophysical evidence indicates that, in the human
		retina, the size of the spatial-summation area decreases
		as illuminance increases.  Such a relationship would be
		beneficial for the detection of spatial contrast in the
		presence of photon noise.  We analyze an image-processing
		mechanism in which the area of a strictly positive
		point-spread function varies inversely with local illuminance
		while its volume remains constant.  In addition to its
		expected effect of improving spatial resolution as
		illuminance increases, this mechanism also yields
		center-surround antagonism and all other manifestations
		of bandpass filtering and accounts for Ricco's law and
		Weber's law---including the failures of both laws a function
		of test conditions.  The relationship between this mechanism
		and lateral inhibition is analyzed."
}

@ARTICLE{david:pnec15,
	AUTHOR = "David, Jr., Edward E.",
	TITLE = "Digital Simulation in Perceptual Research",
	JOURNAL = PNEC,
	VOLUME = "15",
	PAGES = "322--328",
	YEAR = 1959,
	ABSTRACT = "Evaluation of communications systems transmitting
		visual or auditory information is complicated since the
		final message destination is a human observer.  It is the
		perceptual significance of transmission distortions which
		must form the basis for evaluation.

		Following this prescription, signal samples with specified
		distortions must be generated to serve as material for
		subjective evaluation.  These samples can be obtained at
		the output of the system under test by supplying an
		appropriate input.  In some instances, however, the 
		system has never been built as an operating model, or is,
		perhaps, inaccessible.  Here a digital computer can often
		be programmed to simulate the system and generate the
		desired samples.  Several investigations using this technique
		have been carried out using a data translator to provide an
		input-output link to the computer.  The significant
		properties of several band-saving codings have been so
		obtained.  The programming and computing effort required
		is modest.  A compiling routine to aid in programming similar
		problems has been devised.  Potentially this technique can
		be extended to generate complex stimuli for psychological
		exploration of perceptual mechanisms."
}

@ARTICLE{deutsch:ieeec:19/10,
	AUTHOR = "Deutsch, E. S.",
	TITLE = "On Parallel Operations on Hexagonal Arrays",
	JOURNAL = IEEEC,
	VOLUME = "19",
	NUMBER = "10",
	PAGES = "982--983",
	YEAR = 1970,
	NOTE = "Correspondence",
	ABSTRACT = "Some comments arising from a recent paper concerning
		rectangular and hexagonal arrays are presented.  An
		alternative skeletonizing algorithm for use in the latter
		type of array is described."
}

@ARTICLE{diament:ao15/6,
	AUTHOR = "Diament, Paul",
	TITLE = "Image Processing by Nutation: {An} Analysis",
	JOURNAL = AO,
	VOLUME = "15",
	NUMBER = "6",
	PAGES = "1573--1583",
	YEAR = 1976,
	ABSTRACT = "Enhancement of blurred images by nutation involves
		accumulation of information from displaced replicas of
		the degraded image.  The technique is analyzed theoretically
		and is found to be equivalent to convolution with the weight
		distribution assigned to the replicas.  The process is
		shown to improve resolution, correct certain aberrations,
		or reduce effects of noise, when adjustable parameters
		are properly selected.  Plots of spectrum enhancement and
		of SNR calculations are presented, and tradeoffs between
		resolution and noise are discussed."
}

@ARTICLE{duhamel+vetterli:ieeeassp35/6,
	AUTHOR = "Duhamel, Pierre and Vetterli, Martin",
	TITLE = "Improved {Fourier} and {Hartley} Transform Algorithms:
		{Application} to Cyclic Convolution of Real Data",
	JOURNAL = IEEEASSP,
	VOLUME = "35",
	NUMBER = "6",
	PAGES = "818--824",
	YEAR = 1987,
	ABSTRACT = "This paper highlights the possible tradeoffs
		between arithmetic and structural complexity when
		computing cyclic convolution of real data in the
		transform domain.  Both Fourier and Hartley-based
		schemes are first explained in their usual form and 
		then improved, either from the structural point of
		view or in the number of operations involved.  Namely,
		we first present an algorithm for the in-place computation
		of the discrete Fourier transform on real data:  a
		decimation-in-time split-radix algorithm, more compact
		than the previously published one.  Second, we present
		a new fast Hartley transform algorithm with a reduced
		number of operations.  A more regular convolution
		scheme based on FFT's is also proposed.  Finally, we
		show that Hartley transforms belong to a larger class
		of algorithms characterized by their ``generalized''
		convolution property."
}

@ARTICLE{ekstrom:ieeeassp30/1,
	AUTHOR = "Ekstrom, Michael P.",
	TITLE = "Realizable {Wiener} Filtering in Two Dimensions",
	JOURNAL = IEEEASSP,
	VOLUME = "30",
	NUMBER = "1",
	PAGES = "31--41",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "The extension of Wiener's classical mean-square
		estimation theory to a two-dimensional setting is
		presented.  In analogy with the one-dimensional problem,
		the optimal realizable filter is derived by solution
		of a two-dimensional, discrete Wiener-Hopf equation
		using a spectral factorization procedure.  Filters are
		developed for the cases of prediction, filtering,
		and smoothing, and appropriate error expressions are
		derived to characterize their performance."
}

@ARTICLE{fales++:ao23/6,
	AUTHOR = "Fales, Carl L. and Huck, Friedrich O. and Samms, Richard W.",
	TITLE = "Image System Design for Improved Information Capacity",
	JOURNAL = AO,
	VOLUME = "23",
	NUMBER = "6",
	PAGES = "872--888",
	YEAR = 1984,
	ABSTRACT = "Shannon's theory of information for communication
		channels is used to assess the performance of line-scan
		and sensor-array imaging systems and to optimize the
		design trade-offs involving sensitivity, spatial response,
		and sampling intervals.  Formulations and computational
		evaluations account for spatial responses typical of
		line-scan and sensor-array mechanisms, lens diffraction
		and transmittance shading, defocus blur, and square and
		hexagonal sampling lattices."
}

@ARTICLE{fales++:josaa5/3,
	AUTHOR = "Fales, Carl L. and Huck, Friedrich O. and
		{McCormick}, Judith A. and Park, Stephen K.",
	TITLE = "{Wiener} Restoration of Sampled Image Data:
		{End}-to-End Analysis",
	JOURNAL = JOSAA,
	VOLUME = "5",
	NUMBER = "3",
	PAGES = "300--314",
	YEAR = 1988,
	ABSTRACT = "Traditional formulations of the Wiener filter for
		image restoration have accounted for the blurring and
		noise that occur in (digital) image gathering, but have
		failed to account for (1) the insufficient sampling that
		causes further degradations by aliasing and (2) the
		image-reconstruction degradations that ordinarily occur
		when the processed digital data are reproduced as a
		continuous representation.  In this paper we formulate
		the Wiener filter as a function of the basic image-gathering
		and image-reconstruction constraints, thereby providing
		a method for minimizing the mean-squared error between
		the (continuous-output) radiance field and its
		restored (continuous-output) representation.  Simulations
		demonstrate that this filter restores clearer and
		sharper images than the traditional filter.  We also
		formulate the Wiener-characteristic filter to provide a
		method for explicitly specifying the characteristic,
		or feature, of the scene that one wishes to enhance
		or extract."
}

@ARTICLE{fales+huck:infosci,
	AUTHOR = "Fales, Carl L. and Huck, Friedrich O.",
	TITLE = "An Information Theory of Image Gathering",
	NOTE = "Accepted for publication in {\it Information Sciences}.",
	JOURNAL = INFOSCI,
	VOLUME = "23",
	NUMBER = "6",
	PAGES = "872--888",
	YEAR = 1990,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{faugeras+abramatic:icassp79,
	AUTHOR = "Faugeras, Oliver D. and Abramatic, Jean-Fran\c{c}ois",
	TITLE = "2-{D} {FIR} Filter Design from Independent `Small'
		Generating Kernels Using a Mean Square and
		{Tchebyshev} Error Criterion",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "1--4",
	YEAR = 1979,
	ABSTRACT = "We present and compare two design techniques for
		a large class of 2-D FIR filters.  They can be implemented
		by means of sequential convolutions with small size
		kernels.  Design methods are based upon the minimization of
		either the mean square or the maximum error between the
		synthesized filter and a design prototype in the Fourier
		domain."
}

@ARTICLE{fellgett+linfoot:ptrsla247,
	AUTHOR = "Fellgett, P. B. and Linfoot, E. H.",
	TITLE = "On the Assessment of Optical Images",
	JOURNAL = PTRSLA,
	VOLUME = "247",
	PAGES = "369--407",
	YEAR = 1955,
	ABSTRACT = "In the formation of an optical image, each surface element
		of the object gives rise to a more or less blurred distribution
		in the image surface, of total brightness proportional to that
		of the object element.  The image is the sum of these
		distributions in the appropriate sense: when the object is
		coherently lit, the image is built up by adding their complex
		amplitudes; when the object elements are regarded as incoherent
		it is the intensities which are added.

		In both cases the image can be expressed as the convolution
		of the object with a spread function which characterizes the
		optical system.  In systems for which the spread function
		does not change appreciably from one part of the field to
		another, the Fourier transform of the image is obtained to
		a sufficient approximation on multiplying the Fourier transform
		of the object with that of the spread function.  More
		generally, this holds for any part of the field of a
		non-isoplanatic system over which the changes in the form of
		the spread function are small enough to be disregarded;
		we call such an area an `isoplanatism-patch'.  Working
		over such an area, an optical system can be regarded as a
		linear filter in which the Fourier components of the object
		reappear in the image multiplied by `transmission factors'.
		These factors, fist considered by Duffieux, depend on the
		aperture and aberrations of the system, and in {\S}2 they
		are evaluated in terms of an ikonal function.

		The qualities required of an optical image are so varied
		that an assessment valid over the whole range of practical
		applications seems out of the question.  Two extreme cases
		are considered in the present paper.  In the first of these
		it is assumed that the aim of an optical design is to produce
		an image which is directly similar to the object.  This is
		appropriate when no process of image interpretation or
		reconstruction is envisaged.  In the second case, the aim
		is to produce an image containing the greatest possible
		amount of information about the object, without regard to
		the complexity of the interpretation processes which may be
		needed to extract it.

		For the first case, a criterion of image fidelity is proposed
		in {\S}2-4 which gives a numerical measure of the resemblance
		of image to object in terms of the transmission factors of
		the optical system.

		In the second case, assessment is based on the information
		content of the image in Shannon's sense.  This depends not
		only on the transmission factors of the system but also on
		the statistical properties of the presumed object set and of
		the unpredictable fluctuations which necessarily disturb
		observation; the analysis is carried through in {\S}3.

		In {\S}4 the assessment of optical images is discussed in
		terms of these two criteria."
}

@ARTICLE{field:josaa4/12,
	AUTHOR = "Field, David J.",
	TITLE = "Relations between the statistics of Natural Images
		and the Response Properties of Cortical Cells",
	JOURNAL = JOSAA,
	VOLUME = "4",
	NUMBER = "12",
	PAGES = "2379--2394",
	YEAR = 1987,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{freeman+saleh:josaa5/7,
	AUTHOR = "Freeman, Mark O. and Saleh, Bahaa E. A.",
	TITLE = "Moment Invariants in the Space and Frequency Domains",
	JOURNAL = JOSAA,
	VOLUME = "5",
	NUMBER = "7",
	PAGES = "1073--1084",
	YEAR = 1988,
	ABSTRACT = "Moment invariants of the Fourier transform of an image
		are introduced.  It is found that a feature set composed of
		moment invariants from both the space domain and the
		Fourier domain gives better performance for a wide range of
		classification tasks than does the same number of moment
		invariants from either domain alone.  Redundancy among
		moments of the two domains is examined by using the correlation
		coefficient between the feature kernals as a measure.
		Examples are used to compare the feature sets and to assess
		their performance in classification tasks.  Moment
		invariants of the magnitude of the Fourier transform and,
		by inference, some popular features, such as the spectral
		ring-wedge detector, are found to fall far short in
		performance compared with those in which the phase of
		the Fourier transform is also utilized.  Coherent
		optical systems to compute the dual-domain moment invariants
		are proposed."
}

@ARTICLE{frieden:josa60/4,
	AUTHOR = "Frieden, B. Roy",
	TITLE = "Information and the Restorability of Images",
	JOURNAL = JOSA,
	VOLUME = "60",
	NUMBER = "4",
	PAGES = "575--576",
	YEAR = 1970,
	INDEX = "information theory,
		image formation,
		photography"
}

@ARTICLE{frieden:josa62/4,
	AUTHOR = "Frieden, B. Roy",
	TITLE = "Restoring with Maximum Likelihood and Maximum Entropy",
	JOURNAL = JOSA,
	VOLUME = "62",
	NUMBER = "4",
	PAGES = "511--518",
	YEAR = 1972,
	ABSTRACT = "Given $M$ sampled image values of an incoherent object,
		what can be deduced as the most likely object?  Using a
		communication-theory model for the process of image formation,
		we find that the most likely object has a maximum entropy and
		is represented by a restoring formula that is positive and
		not band limited.  The derivation is an adaptation to optics of
		a formulation by Jaynes for unbiased estimates of positive
		probability functions.  The restoring formula is tested, via
		computer simulation, upon noisy images of objects consisting of
		random impulses.  These are found to be well restored, with
		resolution often exceeding the Rayleigh limit and with a
		complete absence of spurious detail.  The proviso is that the
		noise in each image input must not exceed about 40\% of the
		signal image.  The restoring method is applied to experimental
		data consisting of line spectra.  Results are consistent
		with those of the computer simulations.",
	INDEX = "computers,
		deconvolution,
		image formation,
		information theory,
		resolution,
		spectroscopy"
}

@ARTICLE{frieden:josa64/5,
	AUTHOR = "Frieden, B. Roy",
	TITLE = "Image Restoration by Discrete Convolution of Minimal
		Length",
	JOURNAL = JOSA,
	VOLUME = "64",
	NUMBER = "5",
	PAGES = "682--686",
	YEAR = 1974,
	ABSTRACT = "A conventional method of restoring blur-degraded
		image data is inverse filtering.  This technique is
		usually implemented with 32 or 64 image data points
		contributing, via two Fourier transforms or one
		convolution, to each restored output point.  We show
		that actually about seven data points (in a seven-term
		convolution) suffice for producing about the same resolution
		and side-lobe characteristics as for inverse filtering.
		We calculate, by use of a computer search routine, the
		necessary weights for use in a convolution-type
		restoring formula of 5, 7, 11, or 15 terms.  The criterion
		for weight selection is a required first-zero position
		in the output point spread function and, simultaneously,
		a minimum value of the largest side lobe in the point
		spread function.  The 15-term case is further constrained
		to have weights selected from the values -1, 0, +1, only.
		This defines a method of restoring by addition and
		subtraction of image values.  Experimental results using
		diffraction-blurred edge data are used to test the methods.",
	INDEX = "image restoration,
		spread function,
		photography,
		deconvolution"
}

@ARTICLE{frost++:ieeepami4/2,
	AUTHOR = "Frost, Victor S. and Stiles, Josephine Abbott and
		Shanmugan, K. S. and Holtzman, Julian C.",
	TITLE = "A Model for Radar Images and its Application to Adaptive
		Digital Filtering of Multiplicative Noise",
	JOURNAL = IEEEPAMI,
	VOLUME = "4",
	NUMBER = "2",
	PAGES = "157--166",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "Standard image processing techniques which are used to
		enhance noncoherent optically produced images are not
		applicable to radar images due to the coherent nature of the
		radar imaging process. A model for the radar imaging process is
		derived in this paper and a method for smoothing noisy radar
		images is also presented.

		The imaging model shows that radar image is corrupted by
		multiplicative noise.  The model leads to the functional form
		of an optimum (minimum MSE) filter for smoothing radar images.
		By using locally estimated parameter values the filter is
		made adaptive so that it provides minimum MSE estimates inside
		homogeneous areas of an image while preserving the edge
		structure.  It is shown that the filter can be easily
		implemented in the spatial domain and is computationally
		efficient.  The performance of the adaptive filter is
		compared (qualitatively and quantitatively) with several
		standard filters using real and simulated radar images.",
	INDEX = "adaptive filtering,
		image enhancement,
		minimum mean square error (MMSE),
		multiplicative noise,
		radar image modeling,
		radar image processing,
		speckle reduction,
		synthetic aperture radar (SAR)"
}

@ARTICLE{fujio:pieee73/4,
	AUTHOR = "Fujio, Takashi",
	TITLE = "High-Definition Television Systems",
	JOURNAL = PIEEE,
	VOLUME = "73",
	NUMBER = "4",
	PAGES = "646--655",
	YEAR = 1985,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{gallagher:ieeeit24/2,
	AUTHOR = "Gallagher, Neal C.",
	TITLE = "Quantizing Schemes for the Discrete {Fourier} Transform
		of a Random Time-Series",
	JOURNAL = IEEEIT,
	VOLUME = "24",
	NUMBER = "2",
	PAGES = "156--163",
	YEAR = 1978,
	ABSTRACT = "The problem of quantizing a large-dynamic-range,
		possibly nonstationary signal after it has been transformed
		via a discrete Fourier transform (DFT) is investigated.
		It is demonstrated that, for purposes of quantization,
		a polar-form representation for these DFT coefficients
		is preferable to the Cartesian-form when fixed-information
		quantization schemes are considered.  A technique called
		spectral phase coding (SPC) is described for transforming
		the DFT coefficients into a bounded sequence
		$\{\psi_p\}$, where $-\pi<\psi_p\leq\pi$.  In most cases,
		the terms $\{\psi_p\}$ are uniformly distributed over
		this range.  The results indicate that SPC is a robust
		suboptimum procedure for coding nonstationary or
		larg-dynamic-range signals into digital form."
}

@INPROCEEDINGS{gonsalves++:spie205,
	AUTHOR = "Gonsalves, Robert A. and Lianza, Thomas A. and
		Masia, Andrew",
	TITLE = "Generation of Random Scenes with Controlled Statistics",
	BOOKTITLE = "Image Understanding Systems II",
	PEDITOR = "Clark",
	ORGANIZATION = SPIE,
	VOLUME = "205",
	PAGES = "146--152",
	YEAR = 1979,
	ABSTRACT = "We consider the problem of generating a random field
		of numbers (a random, digital scene) with specified
		spectral and spatial statistics.  In particular we
		specify the amplitude spectrum $A_g(f)$ and the first order
		probability distribution $p(g)$ of the scene.  When the
		latter is Gaussian, the problem has a simple, well-known
		solution.  We interpret this solution in an algorithm.
		For a general $p(g)$ the problem is more difficult.
		We present an iterative technique as a possible solution.
		We also describe some applications of the scenes in visual
		and objective measurements of optical systems."
}

@ARTICLE{granrath:pieee69/5,
	AUTHOR = "Granrath, Douglas J.",
	TITLE = "The Role of Human Visual Models in Image Processing",
	JOURNAL = PIEEE,
	VOLUME = "69",
	NUMBER = "5",
	PAGES = "552--561",
	YEAR = 1981,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{hao+bracewell:pieee75/2,
	AUTHOR = "Hao, Hong and Bracewell, Ronald N.",
	TITLE = "A Three-Dimensional {DFT} Algorithm Using the
		Fast {Hartley} Transform",
	JOURNAL = PIEEE,
	VOLUME = "75",
	NUMBER = "2",
	PAGES = "264--266",
	YEAR = 1987,
	ABSTRACT = "A three-dimensional (3-D) Discrete Fourier Transform (DFT)
		algorithm for real data using the one-dimensional
		Fast Hartley Transform (FHT) is introduced.  It requires
		the same number of one-dimensional transforms as a direct
		FFT approach but is simpler and retains the speed advantage
		that is characteristic of the Hartley approach.  The
		method utilizes a decomposition of the cas function kernel
		of the Hartley transform to obtain a temporary transform,
		which is then corrected by some additions to yield the
		3-D DFT.  A fortran subroutine is available on request."
}

@ARTICLE{haralick:cvgip36,
	AUTHOR = "Haralick, Robert M.",
	TITLE = "Computer Vision Theory: {The} Lack Thereof",
	JOURNAL = CVGIP,
	VOLUME = "36",
	PAGES = "372--386",
	YEAR = 1986,
	ABSTRACT = "The first part of the paper presents a brief
		description of how science and the scientific method
		might apply to computer vision and then contrasts this
		perspective with three strong papers in the pose
		detection area of computer vision.  The contrast
		illuminates the shortcomings and the lack of a completed
		computer vision theory in these papers.  The second
		part of the paper outlines a theoretical approach
		and problem statement to 3D object matching through
		a sensor projection, a Bayesian approach to the
		robust estimation of camera parameters, and to the
		hypothesis verification problem."
}


@INPROCEEDINGS{harris++:icassp77,
	AUTHOR = "Harris, David B. and {McClellan}, James H. and
		Chan, David S. K. and Schuessler, Hans W.",
	TITLE = "Vector Radix Fast {Fourier} Transform",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "548--551",
	YEAR = 1977,
	ABSTRACT = "A new radix-2 two-dimensional direct FFT
		developed by Rivard is generalized in this paper
		to include arbitrary radices and non-square
		arrays.  It is shown that the radix-4 version of
		this algorithm may require significantly fewer
		computations than conventional row-column transform
		methods.  Also, the new algorithm eliminates the
		matrix transpose operation normally required when
		then array must reside on a bulk storage device.  It
		requires the same number of passes over the array
		on bulk storage as efficient matrix transpose routines,
		but produces the transform in bit-reversed order.
		An additional pass over the data is necessary to sort
		the array if normal ordering is desired."
}

@ARTICLE{harris:josa56/5,
	AUTHOR = "Harris, Sr., James L.",
	TITLE = "Image Evaluation and Restoration",
	JOURNAL = JOSA,
	VOLUME = "56",
	NUMBER = "5",
	PAGES = "569--574",
	YEAR = 1966,
	ABSTRACT = "The evaluation of an image must depend upon the
		purpose for which the image was obtained and the manner
		in which the image is to be examined.  Where the goal is
		extraction of information and where the image is to be
		processed prior to viewing, the information content of the
		image is the only true evaluation criterion.  Under these
		conditions, the improvement achieved by processing can be
		evaluated by comparing the ability of the human observer
		to extract information from the image before and after
		processing.  The extent to which the processing approaches the
		optimum can be evaluated by determining the fraction of the
		total information content of the image which can be visually
		extracted after processing.  The basic mathematical concepts
		of image processing are indicated, relating  to the
		{\it input point spread function} (p.s.f. of the unprocessed
		image), the {\it processing point spread function} (p.s.f.
		which defines the processing operation), and the
		{\it output point spread function} (p.s.f. of the processed
		image), and their Fourier domain equivalents.  Examples are
		shown of images which have been processed and the details of
		the processing operations are described.",
	INDEX = "image formation,
		modulation transfer,
		computers,
		spread functions"
}

@ARTICLE{hartley:pire30,
	AUTHOR = "Hartley, R. V. L.",
	TITLE = "A More Symmetrical {Fourier} Analysis Applied to
		Transmission Problems",
	JOURNAL = PIRE,
	VOLUME = "30",
	PAGES = "144--150",
	YEAR = 1942,
	ABSTRACT = "The Fourier identity is here expressed in a more
		symmetrical form which leads to certain analogies
		between the function of the original variable and its
		transform.  Also it permits a function of time, for
		example, to be analyzed into two independent sets of
		sinusoidal components, one of which is represented
		in terms of positive frequencies, and the other of
		negative.  The steady-state treatment of transmission
		problems in terms of this analysis is similar to the
		familiar ones and may be carried out either in terms
		of real quantities or of complex exponentials.  In the
		transient treatment, use is made of the analogies referred
		to above, and their relation to the method of ``paired
		echos'' is discussed.  A restatement is made of the
		condition which is known to be necessary in order that
		a given steady-state characteristic may represent a passive
		or stable active system (actual or ideal).  A particular
		necessary condition is deduced from this as an illustration."
}

@INPROCEEDINGS{hazra++:vipttr,
	AUTHOR = "Hazra, Rajeeb and Miller, Keith W. and Park, Stephen K.",
	TITLE = "Model-Based Quantification of Image Quality",
	BOOKTITLE = VIPTTR,
	ORGANIZATION = "NASA Conf.\ Pub.\ 3053",
	YEAR = 1989,
	PAGES = "11--22",
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{helstrom:josa57/3,
	AUTHOR = "Helstrom, C. W.",
	TITLE = "Image Restoration by the Method of Least Squares",
	JOURNAL = JOSA,
	VOLUME = "57",
	NUMBER = "3",
	PAGES = "297--303",
	YEAR = 1967,
	ABSTRACT = "The restoration of optical images, as well as the
		unfolding of spectroscopic and other data that have been
		convolved with a window function or an instrumental impulse
		response, can be viewed as the solution of an integral
		equation.  Solution of such an integral equation when the
		data are corrupted by noise or experimental error is treated
		as the problem of finding an estimate that is a linear
		functional of the data and minimizes the mean squared error
		between the true solution and itself.  The estimate depends
		on assumptions about the spectral densities of the images
		and the noise, the choice of which is discussed.  Coherent
		optical processing and digital processing are described.",
	INDEX = "image restoration,
		Fourier transform"
}

@ARTICLE{higgins:ao3/1,
	AUTHOR = "Higgins, George C.",
	TITLE = "Methods for Engineering Photographic Systems",
	JOURNAL = AO,
	VOLUME = "3",
	NUMBER = "1",
	PAGES = "1--10",
	YEAR = 1964,
	ABSTRACT = "The treatment of a photograph as a communication
		channel is reviewed.  The characteristics that are
		peculiar to photography, such as adjacency effects and
		the double function of the emulsion as light diffuser
		and transducer, are emphasized, and the diverse
		standpoints from which quality can be appraised are
		pointed out."
}

@ARTICLE{higgins:photosciengr15/2,
	AUTHOR = "Higgins, George C.",
	TITLE = "Methods for Analyzing the Photographic System,
		Including the Effects of Nonlinearity and Spatial
		Frequency Response",
	JOURNAL = PHOTOSCIENGR,
	VOLUME = "15",
	NUMBER = "2",
	PAGES = "106--118",
	YEAR = 1971,
	ABSTRACT = "The photographic system, when considered as a
		communication channel, has many nonlinear elements.
		In addition to the nonlinearity between transmittance
		and exposure, there are several other important
		nonlinearities, such as development effects and those
		associated with the optical properties of the elements
		of the system.  Many of these nonlinear effects are
		sensitive to the spatial frequency of the information
		being transmitted through the system.  The classical
		methods, such as tone reproduction, granularity, and
		signal/noise ratio, for describing the photographic
		system apply to macroscopic areas and do not apply to
		microscopic detail.  With high definition systems, the
		errors introduced in analyzing a system without
		considering nonlinearity and spatial frequency can be
		very large.  For example, gamma which is a measure of
		a dc level response can be in error by a factor as
		large as 10 for predicting the relation between exposure
		and density for very small but well resolved detail.
		Methods for analyzing the complete photographic system
		(including the characteristics of the observer) including
		the nonlinearities and frequency response will be reviewed."
}

@ARTICLE{hiraoka++:science238,
	AUTHOR = "Hiraoka, Yasushi and Sedat, John W. and Agard, David A.",
	TITLE = "The Use of a Charge-Coupled Device for Quantitative
		Optical Microscopy of Biological Structures",
	JOURNAL = SCIENCE,
	VOLUME = "238",
	PAGES = "36--41",
	YEAR = 1987,
	ABSTRACT = "The properties of a charge-coupled device (CCD) and its
		application to the high-resolution analysis of biological
		structures by optical microscopy are described.  The CCD,
		with its high resolution, high sensitivity, wide dynamic
		range, photometric accuracy, and geometric stability, can
		provide data of such high quality that quantitative analysis
		on two- and three-dimensional microscopic images is
		possible.  For example, the three-dimensional imaging
		properties of an epifluorescence microscope have been
		quantitatively determined with the CCD.  This description
		of the imaging properties of the microscope, allow
		sophisticated computational image processing methods to be
		used that greatly improve the effective resolution obtainable
		for biological structures.  Image processing techniques
		revealed fine substructures in {\it Drosophila} embryonic
		diploid chromosomes in two and three dimensions.  The
		same approach can be extended to structures as small as
		yeast chromosomes or to other problems in structural cell
		biology."
}

@INPROCEEDINGS{hopwood:spie230,
	AUTHOR = "Hopwood, Ronald K.",
	TITLE = "Design Considerations for a Solid-State Image Sensing
		System",
	BOOKTITLE = "Minicomputers and Microprocessors in Optical Systems",
	PEDITOR = "Koliopoulos, Chris L. and Zweibaum, Frederic M.",
	ORGANIZATION = SPIE,
	VOLUME = "230",
	PAGES = "72--82",
	YEAR = 1980,
	ABSTRACT = "The intent of this paper is to develop an
		understanding of the design considerations for a
		solid-state image sensing system.  The method used
		is to individually discuss the operational and
		design factors for the following system components
		and considerations:  solid-state image sensors,
		illumination sources, common types of lenses, lens
		and image sensor selection, and the techniques
		involved in system evaluation.  The sensor will be
		discussed in terms of element resolution and
		configuration, spectral response, theory of operation,
		and video processing requirements.  Common types of
		illumination sources and lenses will be outlined as
		they apply to solid-state imaging systems.  The
		section on lens and image sensor selection has an
		example of how to proceed from an application concept
		to the selection of an array and lens.  System
		performance is evaluated in terms of the Modulation
		Transfer Function (MTF).  The MTF of each component
		part (i.e., lens, sensor, and video processing circuit)
		is considered from the standpoint of how each individual
		MTF combines to affect the MTF of the entire system.
		Experimental results are used to reinforce calculated
		MTF relationships.  Careful consideration must be given
		to how each component part affects the overall
		performance of a solid-state imaging system.  The
		Modulation Transfer Function is most commonly used
		to characterize the performance of an optical or
		electro-optical system."
}

@ARTICLE{horn:pieee72/12,
	AUTHOR = "Horn, Berthold K. P.",
	TITLE = "Extended Gaussian Images",
	JOURNAL = PIEEE,
	VOLUME = "72",
	NUMBER = "12",
	PAGES = "1671--1686",
	YEAR = 1984,
	ABSTRACT = "This is a primer on extended Gaussian images.
		Extended Gaussian images are useful for representing
		the shapes of surfaces.  They can be computed easily
		from:
		1. needle maps obtained using photometric stereo; or
		2. depth maps generated by ranging devices or binocular
		stereo.
		Importantly, they can also be determined simply from
		geometric models of the objects.  Extended Gaussian
		images can be of use in at least two of the tasks facing
		a machine vision system:
		1. recognition, and
		2. determining the attitude in space of an object.
		Here, the extended Gaussian image is defined and some
		of its properties discussed.  An elaboration for
		nonconvex objects is presented and several examples
		are shown."
}

@ARTICLE{hou+andrews:ieeeassp26/6,
	AUTHOR = "Hou, H. S. and Andrews, Harry C.",
	TITLE = "Cubic Splines for Image Interpolation and Digital Filtering",
	JOURNAL = IEEEASSP,
	VOLUME = "26",
	NUMBER = "6",
	PAGES = "508--517",
	YEAR = 1978,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{hou:spie575,
	AUTHOR = "Hou, H. S.",
	TITLE = "The Fast {Hartley} Transform",
	BOOKTITLE = "Applications of Digital Image Processing VIII",
	PEDITOR = "Tescher, Andrew G.",
	ORGANIZATION = SPIE,
	VOLUME = "575",
	PAGES = "24--32",
	YEAR = 1985,
	ABSTRACT = "The Fast Hartley Transform (FHT) is similar to the
		Cooley-Tukey Fast Fourier Transform (FFT) but performs
		much faster because it requires only real arithmetic
		computations compared to the complex arithmetic computations
		required by the FFT.  Through use of the FHT,
		Discrete Cosine Transforms (DCT) and
		Discrete Fourier Transforms (DFT) can be obtained.  The
		recursive nature of the FHT algorithm derived in this paper
		enables us to generate the next higher-order FHT from
		two identical lower-order FHTs.  In practice, this
		recursive relationship offers flexibility in programming
		different sizes of transforms, while the orderly structure
		of its signal flow graphs indicates an ease of implementation
		in VSLI."
}

@ARTICLE{huang++:pieee59/11,
	AUTHOR = "Huang, Thomas S. and Schreiber, William F. and
		Tretiak, Oleh J.",
	TITLE = "Image Processing",
	JOURNAL = PIEEE,
	VOLUME = "59",
	NUMBER = "11",
	PAGES = "1586--1609",
	YEAR = 1971,
	ABSTRACT = "Image processing techniques find applications in
		many areas, chief among which are image enhancement,
		pattern recognition, and efficient picture coding.  Some
		aspects of image processing are discussed---specifically:
		the mathematical operations one is likely to encounter, and
		ways of implementing them by optics and on digital computers;
		image description; and image quality evaluation.  Many
		old results are reviewed, some new ones presented, and
		several open questions are posed."
}

@ARTICLE{huck++:ssi1/2,
	AUTHOR = "Huck, F. O. and McCall, H. F. and Patterson, W. R. and
		Taylor, G. R.",
	TITLE = "The {Viking Mars} Lander Camera",
	JOURNAL = SSI,
	VOLUME = "1",
	NUMBER = "2",
	PAGES = "189--241",
	YEAR = "1975",
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{huck+park:ao14/10,
	AUTHOR = "Huck, Friedrich O. and Park, Stephen K.",
	TITLE = "Optical-Mechanical Line-Scan Imaging Process:  {Its}
		Information Capacity and Efficiency",
	JOURNAL = AO,
	VOLUME = "14",
	NUMBER = "10",
	PAGES = "2508--2520",
	YEAR = 1975,
	ABSTRACT = "An expression for the information capacity of the
		optical-mechanical line-scan imaging process is derived,
		which includes the effects of blurring of spatial detail,
		photosensor noise, aliasing, and quantization.  Both the
		information capacity for a fixed data density and the
		information efficiency (i.e., the ratio of information
		capacity to the data density) exhibit a distinct single
		maximum when displayed as a function of sampling rate,
		and the location of this maximum is determined by the system
		frequency response shape, SNR, and quantization interval."
}

@ARTICLE{huck++:ao20/11,
	AUTHOR = "Huck, Friedrich O. and Halyo, Nesim and Park, Stephen K.",
	TITLE = "Information Efficiency of Line-Scan Imaging Mechanisms",
	JOURNAL = AO,
	VOLUME = "20",
	NUMBER = "11",
	PAGES = "1990--2007",
	YEAR = 1981,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{huck++:nasa2302,
	AUTHOR = "Huck, Friedrich O. and Fales, Carl L. and
		Park, Stephen K. and Samms, Richard W.",
	TITLE = "Image-Plane Processing for Improved Computer Vision",
	BOOKTITLE = "NASA Conference Publication 2302",
	ORGANIZATION = NASA,
	PAGES = "19--34",
	MONTH = AUG,
	YEAR = 1983,
	ABSTRACT = "By properly combining optical design with image-plane
		processing, as suggested by the mechanism of human vision,
		it is possible to improve the performance of sensor-array
		imaging systems for edge detection and location.
		Two-dimensional band-pass filtering during image formation,
		instead of subsequent digital processing, optimizes edge
		enhancement and minimizes data transmission.  It also
		permits control of the spatial imaging system response to
		trade-off edge enhancement for sensitivity at low light
		levels.  Using information theory to optimize and assess
		performance leads to a spatial response shape close to
		that of human vision, and reveals that most of the
		information, up to about 94\%, is contained in the signal
		intensity transitions from which the location of edges is
		determined for raw primal sketches.  Furthermore, shading
		the lens transmittance to increase depth of field and
		using a hexagonal instead of square sensor-array lattice
		to decrease sensitivity to edge orientation improve edge
		information about 10\%."
}

@ARTICLE{huck++:ao23/18,
	AUTHOR = "Huck, Friedrich O. and Fales, Carl L. and
		Jobson, Daniel J. and Park, Stephen K. and
		Samms, Richard W.",
	TITLE = "Image-Plane Processing of Visual Information",
	JOURNAL = AO,
	VOLUME = "23",
	NUMBER = "18",
	PAGES = "3160--3167",
	YEAR = 1984,
	ABSTRACT = "Shannon's theory of information is used to optimize
		the optical design of sensor-array imaging systems which
		use neighborhood image-plane signal processing, similar
		to the lateral inhibitory preprocessing in natural vision,
		for enhancing edges and compressing dynamic range during
		image formation.  The resultant edge-enhancement, or
		bandpass-filter, response is found to be similar to that
		of (Marr's model of) human vision.  Comparisons of traits
		in natural vision with results from information theory
		suggest that image plane processing can improve visual
		information acquisition for pattern recognition when
		resolving power, sensitivity, and dynamic range are
		constrained.  The improvements that can be attained for
		constructing edge-enhanced images and primal sketches
		include reduced sensitivity to changes in light levels
		reduced data transmission, and reduced data processing."
}

@ARTICLE{huck++:josaa2/10,
	AUTHOR = "Huck, Friedrich O. and Fales, Carl L. and
		Halyo, Nesim and Samms, Richard W. and Stacy, Kathryn",
	TITLE = "Image Gathering and Processing: {Information} and
		Fidelity",
	JOURNAL = JOSAA,
	VOLUME = "2",
	NUMBER = "10",
	PAGES = "1644--1666",
	YEAR = 1985,
	ABSTRACT = "In this paper we formulate and use information
		and fidelity criteria to assess image gathering and
		processing, combining optical design with image-forming
		and edge-detection algorithms.  The optical design of
		the image-gathering system revolves around the relationship
		among sampling passband, spatial response, and
		signal-to-noise ratio (SNR).  Our formulations of
		information, fidelity, and optimal (Wiener) restoration
		account for the insufficient sampling (i.e., aliasing)
		common in image gathering as well as for the blurring and
		noise that conventional formulations account for.
		Performance analyses and simulations for ordinary
		optical-design constraints and random scenes indicate
		that (1) different image-forming algorithms prefer
		different optical designs; (2) informationally optimized
		designs maximize the robustness of optimal image
		restorations and lead to the highest-spatial-frequency
		channel (relative to the sampling passband) for which
		edge detection is reliable (if the SNR is sufficiently
		high); and (3) combining the informationally optimized
		design with a 3 by 3 lateral-inhibitory image-plane-processing
		algorithm leads to a spatial-response shape that approximates
		the optimal edge-detection response of (Marr's model of)
		human vision and thus reduces the data preprocessing and
		transmission required for machine vision."
}

@ARTICLE{huck++:josaa5/3,
	AUTHOR = "Huck, Friedrich O. and Fales, Carl L. and
		{McCormick}, Judith A. and Park, Stephen K.",
	TITLE = "Image-Gathering System Design for Information and
		Fidelity",
	JOURNAL = JOSAA,
	VOLUME = "5",
	NUMBER = "3",
	PAGES = "285--299",
	YEAR = 1988,
	ABSTRACT = "We continue the work by Huck {\it et al.} [J. Opt.
		Soc. Am. A {\bf 2}, 1644 (1985)] to assess image gathering
		and processing in terms of the information density of the
		acquired signal and of the fidelity of representations
		reproduced from this signal.  The assessment is
		constrained by the assumptions that the system is
		linear and isoplanatic and that the signal and noise
		amplitudes are Gaussian, wide-sense stationary, and
		statistically independent.  Within these constraints,
		it is found that (1) the combined process of image
		gathering and {\it reconstruction} (which is intended
		to reproduce the output of the image-gathering system)
		behaves as optical, or photographic, image formation
		in that the informationally optimized design of the
		image-gathering system ordinarily does not maximize the
		fidelity of the reconstructed image; (2) the combined
		process of image gathering and {\it restoration} (which
		is intended to reproduce the {\it input} to the
		image-gathering system) behaves more as a communication
		channel in that the informationally optimized design
		of the image-gathering system tends to maximize the
		fidelity of a variety of optimally restored representations
		ranging from images to edges; and (3) there exists an
		intuitively satisfying relationship among the
		informationally optimized design of image-gathering
		systems, the response and sensitivity of natural
		vision, and the reliable detection of edges."
}

@INPROCEEDINGS{huck++:vipttr,
	AUTHOR = "Huck, Friedrich O. and John, Sarah and McCormick, Judith A.
		and Narayanswamy, Ramkumar",
	TITLE = "Image Gathering and Coding for Digital Restoration:
		Information Efficiency and Visual Quality",
	BOOKTITLE = VIPTTR,
	ORGANIZATION = "NASA Conf.\ Pub.\ 3053",
	YEAR = 1989,
	PAGES = "11--91",
	ABSTRACT = "TO BE TYPED"
}

@MISC{huck+mccormick:cvgipsub,
	AUTHOR = "Huck, Friedrich O. and {McCormick}, Judith A.",
	TITLE = "Image Restoration for Fidelity and Visual Quality",
	NOTE = "Submitted for publication.",
	XJOURNAL = CVGIP
}

@INPROCEEDINGS{huck++:spie1360,
	AUTHOR = "Huck, Friedrich O. and John, Sarah and
		Reichenbach, Stephen E.",
	TITLE = "Information Theoretical Assessment of Image Gathering
		and Coding for Digital Restoration",
	BOOKTITLE = "Visual Communications and Image Processing V",
	PEDITOR = "Kunt, Murat",
	ORGANIZATION = "Proc.\ SPIE 1360",
	PAGES = "1590--1607",
	YEAR = 1990,
	ABSTRACT1 = "In this paper we are concerned with the end-to-end
		performance of image gathering, coding, and restoration
		as a whole rather than as a chain of independent tasks.
		Our approach evolves from the pivotal relationship that
		exists between the spectral information density of the
		transmitted signal and the restorability of images 
		from this signal.  The information theoretical assessment 
		accounts for the information density and efficiency of
		the acquired signal as a function of the image-gathering
		system design and the radiance-field statistics, and for
		the information efficiency and data compression that can
		be gained by combining image gathering with coding to
		reduce the signal redundancy and irrelevancy.  The
		redundancy reduction is concerned mostly with the
		statistical properties of the acquired signal, and the
		irrelevancy reduction is concerned mostly with the
		visual properties of the scene and the restored image.
		The results of this assessment lead to intuitively
		appealing insights about image gathering and coding for
		digital restoration.  Foremost is the realization that
		images can be restored with better quality and from
		less data as the information efficiency of the
		transmitted data is increased, providing that the
		restoration correctly accounts for the image gathering
		and coding processes and effectively suppresses the
		image-display degradations.",
	ABSTRACT2 = "High information efficiency,
		in turn, can be attained only by minimizing image-gathering
		degradations as well as signal redundancy. Another
		important realization is that the critical constraints
		imposed on both image gathering and natural vision limit
		the maximum acquired information density to $\sim\!4$
		binary information units (bifs).  This information density
		requires $\sim\!5$-bit encoding for transmission and
		recording when lateral inhibition is used to compress
		the dynamic range of the signal (irrelevancy reduction).
		This number of encoding levels is close (perhaps
		fortuitously) to the upper limit of the $\sim\!40$ intensity
		levels that each nerve fiber can transmit, via pulses,
		from the retina to the visual cortex within $\sim\!1/20$
		sec to avoid prolonging reaction times.  If the data are
		digitally restored as an image on film for `best' visual
		quality, then the information density may often be reduced
		to $\sim\!3$ bifs or even less, depending on the scene,
		without incurring perceptual degradations because of the
		practical limitations that are imposed on the restoration.
		These limitations are not likely to be found in the nervous
		system of human beings, so that the higher information
		density of $\sim\!4$ bifs that the eye can acquire
		probably contributes effectively to the improvement in
		visual quality that we always experience when we view a
		scene directly rather than through the media of image
		gathering and restoration."
}

@UNPUBLISHED{huck++:ieeeassp_subm,
	AUTHOR = "Huck, Friedrich O. and John, Sarah and
		Reichenbach, Stephen E.",
	TITLE = "Information Theoretical Assessment of Image Gathering
		and Coding for Digital Restoration",
	NOTE = "submitted for publication",
	XJOURNAL = IEEEASSP,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{hunt:ieeec22/9,
	AUTHOR = "Hunt, B. R.",
	TITLE = "The Application of Constrained Least Squares Estimation to
		Image Restoration by Digital Computer",
	JOURNAL = IEEEC,
	VOLUME = "22",
	NUMBER = "9",
	PAGES = "805--812",
	YEAR = 1973,
	ABSTRACT = "Constrained least squares estimation is a technique for
		solution of integral equations of the first kind.  The problem
		of image restoration requires the solution of an integral
		equation of the first kind.  However, application of
		constrained least squares estimation to image restoration
		requires the solution of extremely large linear systems
		of equations.  In this paper we demonstrate that, for
		convolution-type models of image restoration, special
		properties of the linear system of equations can be used to
		reduce the computational requirements.  The necessary
		computations can be carried out by the fast Fourier transform,
		and the constrained least squares estimate can be constructed
		in the discrete frequency domain.  A practical procedure for
		constrained least squares estimation is presented, and two
		examples are shown as output from a program for the CDC 7600
		computer which performs the constrained least squares
		restoration of digital images.",
	INDEX = "block circulant matrices,
		constrained estimation, 
		diagonalization of block circulant matrices,
		Fourier transforms,
		image restoration,
		integral equations,
		least squares estimation"
}

@ARTICLE{hunt:pieee63,
	AUTHOR = "Hunt, B. R.",
	TITLE = "Digital Image Processing",
	JOURNAL = PIEEE,
	VOLUME = "63",
	PAGES = "693--708",
	YEAR = 1975
}

@ARTICLE{hunt:ieeec26/3,
	AUTHOR = "Hunt, B. R.",
	TITLE = "Bayesian Methods in Nonlinear Digital Image Restoration",
	JOURNAL = IEEEC,
	VOLUME = "26",
	NUMBER = "3",
	PAGES = "219--229",
	YEAR = 1977,
	ABSTRACT = "Prior techniques in digital image restoration have assumed
		linear relations between the original blurred image intensity,
		the silver density recorded on film, and the film-grain noise.
		In this paper a model is used which explicitly includes
		nonlinear relations between intensity and film density, by use
		of the $D-log E$ curve.  Using Gaussian models for the image
		and noise statistics, a {\it maximum a posteriori} (Bayes)
		estimate of the restored image is derived.  The MAP estimate is
		nonlinear, and computer implementation of the estimator
		equations is achieved by a fast algorithm based on direct
		maximization of the posterior density function.  An example
		of the restoration method implemented on a digital image is
		shown.",
	INDEX = "image restoration,
		nonlinear processing of images,
		Bayesian estimation,
		optimization theory,
		fast algorithms"
}

@ARTICLE{jain+jain:ieeeac23/5,
	AUTHOR = "Jain, Anil K. and Jain, Jaswant R.",
	TITLE = "Partial Differential Equations and Finite Difference
		Methods in Image Processing---{Part II}: {Image} Restoration",
	JOURNAL = IEEEAC,
	VOLUME = "23",
	NUMBER = "5",
	PAGES = "817--834",
	YEAR = 1978,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "Application of Partial Differential Equation (PDE)
		models for restoration of noisy images is considered.  The
		hyperbolic, parabolic, and elliptic classes of PDE's yield
		recursive, semirecursive, and nonrecursive filtering
		algorithms.  The two-dimensional recursive filter is
		equivalent to solving two sets of filtering equations, one
		along the horizontal direction and other along the vertical
		direction.  The semirecursive filter can be implemented by
		first transforming the image data along one of its dimensions,
		say column, and then recursive filtering along each row
		independently.  The nonrecursive filter leads to Fourier
		domain Wiener filtering type transform domain algorithm.
		Comparisons of the different PDE model filters are made by
		implementing them on actual image data.  Performances
		of these filters are also compared with Fourier Wiener
		filtering and spatial averaging methods.  Performance
		bounds based on PDE model theory are calculated and
		implementation tradeoffs of different algorithms are
		discussed."
}

@ARTICLE{jain:pieee69/3,
	AUTHOR = "Jain, Anil K.",
	TITLE = "Image Data Compression: {A} Review",
	JOURNAL = PIEEE,
	VOLUME = "69",
	NUMBER = "3",
	PAGES = "349--389",
	YEAR = 1981,
	ABSTRACT = "With the continuing growth of modern communications
		technology, demand for image transmission and storage is
		increasing rapidly.  advances in computer technology for
		mass storage and digital processing have paved the way for
		implementing advanced data compression techniques to
		improve the efficiency of transmission and storage of
		images.  In this paper a large variety of algorithms for
		image data compression are considered.  Starting with
		simple techniques of sampling and pulse code modulation
		(PCM), state of the art algorithms for two-dimensional
		data transmission are reviewed.  Topics covered include
		differential PCM (DPCM) and predictive coding, transform
		coding, hybrid coding, interframe coding, adaptive
		techniques, and applications.  Effects of channel errors
		and other miscellaneous related topics are also considered.
		While most of the examples and image models have been
		specialized for visual images, the techniques discussed
		here could be easily adapted more generally for
		multidimensional data compression.  Our emphasis here is
		on fundamentals of the various techniques.  A comprehensive
		bibliography with comments is included for a reader interested
		in further details of the theoretical and experimental results
		discussed here."
}

@INPROCEEDINGS{jain+ranganath:icassp81,
	AUTHOR = "Jain, Anil K. and Ranganath, Surendra",
	TITLE = "Application of Two Dimensional Spectral Estimation in
		Image Restoration",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "1113--1116",
	YEAR = 1981,
	ABSTRACT = "In this paper we consider an application of
		spectral estimation to adaptive restoration of images
		degraded by additive white noise.  Three adaptive
		techniques of restoration are compared with a
		non-adaptive technique.  In the non-adaptive technique,
		the whole image is Wiener filtered by assuming a
		correlation model for the signal.  In the adaptive
		methods, a) the spectral shape of the signal is kept
		constant, but the variance is adaptively estimated,
		b) the power spectrum of each block is adaptively
		estimated, c) the data is adaptively decorrelated in
		one dimension and filtered along the other."
}

@INPROCEEDINGS{jain+ranganath:icassp82,
	AUTHOR = "Jain, Anil K. and Ranganath, Surendra",
	TITLE = "Image Restoration and Edge Extraction Based on 2-D
		Stochastic Models",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "1520--1523",
	YEAR = 1982,
	ABSTRACT = "In this paper we consider application of 2-D
		stochastic models discussed in [1] to develop non-causal
		FIR filters for restoration of images degraded by additive
		white noise.  The semicausal model of [1] is used to
		design masks for edge extraction from the noisy images.
		The results presented here indicate that good restorations
		and robust edge detection are possible using relatively
		simple algorithms"
}

@ARTICLE{jarvis++:cgip5,
	AUTHOR = "Jarvis, J. F.  and Judice, C. N., and Ninke, W. H.",
	TITLE = "A Survey of Techniques for the Display of Continuous
		Tone Pictures on Bilevel Displays",
	JOURNAL = CGIP,
	VOLUME = "5",
	PAGES = "13--40",
	YEAR = 1976,
	ABSTRACT = "Many displays are basically bilevel in nature with
		individual display cells, all of the same size, arranged
		in a rectangular array.  We present a survey of processing
		techniques for presenting continuous tone still images on
		such displays.  four techniques are covered in detail while
		several others are covered briefly.  All the techniques
		achieve the subjective effect of continuous tone by properly
		controlling only the spatial density of bilevel display
		states.

		The processing techniques consist of dividing an image into
		picture elements and comparing the intensity of each element
		with a threshold value.  If the element intensity is greater
		than the threshold, the corresponding display cell is set to
		the bright state; otherwise, the cell is set to the dark
		state.  In the {\it ordered-dither} technique, the threshold
		is spatially dependent, i.e., it is determined only by the
		coordinates of the element being processed.  In the remaining
		three techniques, {\it constrained average}, {\it
		dynamic threshold}, and {\it minimized average error},
		the threshold is determined by values of elements close
		to the one currently being processed.  The latter three
		thus require more processing and more storage than the first,
		but allow some edge emphasis.  Images processed by all the
		described techniques are exhibited."
}


@INPROCEEDINGS{john++:spie1309,
	AUTHOR = "John, Sarah and Rahman, Zia-ur and
		Huck, Friedrich O. and Reichenbach, Stephen E.",
	TITLE = "Information Theoretical Assessment of Digital Imaging
		Systems",
	BOOKTITLE = "Infrared Imaging Systems: Design, Analysis, Modeling,
		and Testing",
	PEDITOR = "Holst, Gerald C.",
	ORGANIZATION = "Proc.\ SPIE 1309",
	PAGES = "53--66",
	YEAR = 1990,
	ABSTRACT = " In this paper we are concerned with the end-to-end
		performance of image gathering, coding, and restoration
		as a whole rather than a chain of independent tasks.
		Our approach evolves from the pivotal relationship that
		exists between the spectral information density of the
		transmitted signal and the restorability of images from
		this signal.  The information theoretical assessment 
		accounts for (1) the information density and efficiency
		of the acquired signal as a function of the image-gathering
		system design and the radiance-field statistics, and
		(2) the improvement in information efficiency and data 
		compression that can be gained by combining image gathering
		with coding to reduce the signal redundancy and irrelevancy.
		The redundancy reduction is concerned mostly with the
		statistical properties of the acquired signal, and the
		irrelevancy reduction is concerned mostly with the visual
		properties of the scene and the restored image. The results
		of this assessment lead to intuitively appealing insights
		about the end-to-end performance of image gathering, coding,
		and restoration. Foremost is the realization that images
		can be restored with better quality and from less data as
		the information efficiency of the data is increased,
		providing that the restoration correctly accounts for the
		image gathering and coding processes and effectively
		suppresses the image-display degradations. High information
		efficiency, in turn, is attained by minimizing
		image-gathering degradations as well as signal redundancy.
		Further data compression can often be gained by matching
		the irrelevancy reduction to a specific restoration filter. "
}

@ARTICLE{johnson:photosciengr14/6,
	AUTHOR = "Johnson, C. B.",
	TITLE = "A Method for Characterizing Electro-Optical
		Device Modulation Transfer Functions",
	JOURNAL = PHOTOSCIENGR,
	VOLUME = "14",
	NUMBER = "6",
	PAGES = "413--415",
	YEAR = 1970,
	ABSTRACT = "It has been found that the equation
		$T(f) = \exp -(f/f_c)^n$, where $f$ is the spatial
		frequency in cycles/mm, can be used as the modulation
		transfer function of a wide variety of electro-optical
		devices.  Thus, the modulation transfer function of
		each device, $T(f)$, can be characterized by two numbers,
		$f_c$ and $n$.  Also, a general equation for the limiting
		resolution of staged devices is derived, and it is
		found to agree with observed limiting resolutions
		of two- and three-stage image-intensifier tubes.
		Measured modulation transfer functions of several
		types of electro-optical devices are given."
}

@ARTICLE{jones+coughlin:ao5/9,
	AUTHOR = "Jones, Robert A. and Coughlin, John F.",
	TITLE = "Elimination of Microdensitometer Degradation
		from Scans of Photographic Images",
	JOURNAL = AO,
	VOLUME = "5",
	NUMBER = "9",
	PAGES = "1411--1414",
	YEAR = 1966,
	ABSTRACT = "In microdensitometry, the tracing of a knife edge
		does not yield a step function.  Therefore, when a
		photographic image is traced the result is not a spatially
		true representation of the image. A computational procedure
		has been developed that corrects for microdensitometer
		effects.  This is achieved by obtaining the inverse
		Fourier transform of the reciprocal values of the
		microdensitometer modulation transfer function and
		convolving the resulting function with the digital output
		of the microdensitometer scan.  The result is the corrected
		scan data for the photographic image.  This technique
		has been applied successfully to edge gradient analysis for
		both analytic and experimental edges.  The compensation
		for microdensitometer degradation should have a number
		of applications."
}

@ARTICLE{jones:photosciengr11/2,
	AUTHOR = "Jones, Robert A.",
	TITLE = "An Automated Technique for Deriving {MTF}'s from
		Edge Traces",
	JOURNAL = PHOTOSCIENGR,
	VOLUME = "11",
	NUMBER = "2",
	PAGES = "102--106",
	YEAR = 1967,
	ABSTRACT = "An automated edge-gradient technique has been
		developed for fast, accurate determinations of the
		modulation transfer functions (MTF) of photographic
		systems.  Photographic edges resulting from brightness
		step edges in the object plane are obtained from
		either laboratory exposures or normal operational
		exposures.  A digitized microdensitometer is used to
		scan the edges and sensitometric exposures.  A computer
		program directs a high-speed computer to accept
		the edge-scan data, produce the proper microdensitometer
		correction, perform the nonlinear sensitometric conversion,
		obtain the smooth spread function, and determine the MTF.
		The technique has been tested using both artificial
		and experimental edges and found to operate reliably."
}

@ARTICLE{jones+yeadon:photosciengr13/4,
	AUTHOR = "Jones, Robert A. and Yeadon, Edward C.",
	TITLE = "Determination of the Spread Function from Noisy
		Edge Scans",
	JOURNAL = PHOTOSCIENGR,
	VOLUME = "13",
	NUMBER = "4",
	PAGES = "200--204",
	YEAR = 1969,
	ABSTRACT = "The most important portion of an automated edge
		gradient analysis technique is determining the spread
		function.  A procedure is described to produce the
		smooth spread function.  The combination of the smoothing
		and differentiation steps produce reliable results.
		Test results indicate the procedure to be accurate."
}

@ARTICLE{kalman++:cgw8/12,
	AUTHOR = "Kalman, Barry L. and Posdamer, Jeffrey L. and
		Pollack, Seymour V. and Laine, Andrew F. and
		Reichenbach, Stephen E.",
	TITLE = "Defense Mapping Goes to School",
	JOURNAL = CGW,
	VOLUME = "8",
	NUMBER = "12",
	PAGES = "27--30",
	YEAR = 1985
}

@ARTICLE{keys:ieeeassp29/6,
	AUTHOR = "Keys, Robert G.",
	TITLE = "Cubic Convolution Interpolation for Digital Image
		Processing",
	JOURNAL = IEEEASSP,
	VOLUME = "29",
	NUMBER = "6",
	PAGES = "1153--1160",
	YEAR = 1981,
	ABSTRACT = "Cubic convolution interpolation is a new technique
		for resampling discrete data.  It has a number of desirable
		features which make it useful for image processing.  The
		technique can be performed efficiently on a digital computer.
		The cubic convolution interpolation function converges
		uniformly to the function being interpolated as the
		sampling increment approaches zero.  With the appropriate
		boundary conditions and constraints on the interpolation
		kernel, it can be shown that the order of accuracy of the
		cubic convolution method is between that of linear
		interpolation and that of cubic splines.

		A one-dimensional interpolation function is derived in this
		paper.  A separable extension of this algorithm to two
		dimensions is applied to image data."
}

@ARTICLE{knox:josa66/11,
	AUTHOR = "Knox, Keith T.",
	TITLE = "Image Retrieval from Astronomical Speckle Patterns",
	JOURNAL = JOSA,
	VOLUME = "66",
	NUMBER = "11",
	PAGES = "1236--1239",
	YEAR = 1976,
	ABSTRACT = "A technique has recently been proposed for processing
		astronomical photographs to remove the effects of turbulence.
		The method involves averaging over many short-exposure
		photographs of an object to reconstruct a diffraction-limited
		image of the object.  A two-dimensional computer simulation
		of the reconstruction technique is presented.  The results
		indicate that diffraction-limited imaging with a 100 in.
		telescope is possible even with 2 arcsec seeing conditions."
}

@ARTICLE{knuth:tugboat8/2,
	AUTHOR = "Knuth, Donald E.",
	TITLE = "Fonts for Digital Halftones",
	JOURNAL = TUGBOAT,
	VOLUME = "8",
	NUMBER = "2",
	PAGES = "135--160",
	YEAR = 1987
}

@ARTICLE{knutsson++:ieeecom31/3,
	AUTHOR = "Knutsson, Hans E. and Wilson, Roland and
		Granlund, Goesta H.",
	TITLE = "Anisotropic Nonstationary Image Estimation and Its
		Applications:  {Part I}---{Restoration} of Noisy Images",
	JOURNAL = IEEECOM,
	VOLUME = "31",
	NUMBER = "3",
	PAGES = "388--397",
	YEAR = 1983,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "A new form of image estimator, which takes account of
		linear features, is derived using a signal equivalent
		formulation.  The estimator is shown to be a nonstationary
		linear combination of three stationary estimators.  The
		relation of the estimator to human visual physiology is
		discussed.  A method for estimating the nonstationary
		control information is described and shown to be effective
		when the estimation is made from noisy data.  A suboptimal
		approach which is computationally less demanding is presented
		and used in the restoration of a variety of images corrupted
		by additive white noise.  The results show that the method
		can improve the quality of noisy images even when the
		signal-to-noise ratio is very low."
}

@INPROCEEDINGS{kuan++:icassp82,
	AUTHOR = "Kuan, Darwin T. and Sawchuk, Alexander A. and
		Strand, Timothy C. and Chavel, Pierre",
	TITLE = "Nonstationary 2-{D} Recursive Filter for Speckle Reduction",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "1--4",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "Speckle noise exists in all types of coherent imagery
		such as synthetic aperture radar, acoustic imagery and
		laser illuminated imagery.  Speckle can be reduced by
		averaging over several uncorrelated speckle images of the same
		object when these are available.  In this paper, we
		attempt to reduce speckle noise from a single speckle
		image by using adaptive digital image restoration
		techniques.  Many speckle noise reduction algorithms assume
		speckle noise is multiplicative.  We model the speckle
		according the exact physical process of coherent image
		formation.  Thus, the model includes signal-dependent effects
		and accurately represents the statistical properties of
		speckle.  A linear minimum mean-square error filter is
		derived based on our speckle model and a nonstationary image
		model.  The filter responds adaptively to the signal-dependent
		variance of the original image.  The necessary parameters
		are estimated from the noisy image.  The 2-D recursive
		implementation of this filter is developed as a fast
		computation algorithm."
}

@INPROCEEDINGS{kuan++:cprip82,
	AUTHOR = "Kuan, Darwin T. and Sawchuk, Alexander A. and
		Strand, Timothy C. and Chavel, Pierre",
	TITLE = "Map Speckle Reduction Filter for Complex Amplitude
		Speckle Images",
	BOOKTITLE = CPRIP,
	ORGANIZATION = "IEEE",
	PAGES = "58--63",
	YEAR = 1982,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "Speckle is a granular noise that inherently exists in
		all types of coherent imaging systems.  Many speckle reduction
		techniques assume speckle noise is multiplicative.  In this
		paper, we instead model the speckle according to the exact
		physical process of coherent image formation.  Thus the
		model includes signal-dependent effects and accurately
		represents the higher order statistical properties of
		speckle that important to the restoration procedure.  A
		maximum {\it a posteriori} (MAP) speckle reduction filter
		is presented for digitally processed synthetic aperture
		radar (SAR) images, where both the amplitude and phase
		of the speckle image are preserved.  The MAP equations
		are nonlinear and can only be solved by iterative methods.
		Each iteration involves inverting a covariance matrix of
		large dimension and calculating the optimal updated
		estimate.  The procedure is computationally demanding and
		convergence is not guaranteed.  Fortunately, we are able
		to express the MAP equations in terms of the filtered
		estimate and filtered covariance matrix of a nonstationary
		2-D recursive filter.  The resulting MAP equation is a
		cubic equation, and has the same form as the MAP equation
		for a simplified independent optical speckle model where
		only speckle intensities are observable.  Thus the MAP
		equations can be easily solved iteratively using the 2-D
		recursive filter as a fast computation algorithm and
		imposing a one-point MAP constraint (solution of a cubic)
		equation) to optimize the estimate at each iteration.
		Experimental and simulation results are presented."
}

@ARTICLE{kuan++:ieeepami7/2,
	AUTHOR = "Kuan, Darwin T. and Sawchuk, Alexander A. and
		Strand, Timothy C. and Chavel, Pierre",
	TITLE = "Adaptive Noise Smoothing Filter for Images with
		Signal-Dependent Noise",
	JOURNAL = IEEEPAMI,
	VOLUME = "7",
	NUMBER = "2",
	PAGES = "165--177",
	YEAR = 1985,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "In this paper, we consider the restoration of images with
		signal-dependent noise.  The filter is noise smoothing and
		adapts to local changes in image statistics based on a
		nonstationary mean, nonstationary variance (NMNV) image
		model.  For images degraded by a class of uncorrelated,
		signal-dependent noise without blur, the adaptive noise
		smoothing filter becomes a point processor and is similar
		to Lee's local statistics algorithm [16].  The filter is able
		to adapt itself to the nonstationary local image statistics
		in the presence of different types of signal-dependent noise.
		For multiplicative noise, the adaptive noise smoothing
		filter is a systematic derivation of Lee's algorithm with
		some extensions that allow different estimators for the local
		image variance.  The advantage of the derivation is its easy
		extension to deal with various types of signal-dependent
		noise.  Film-grain and Poisson signal dependent restoration
		problems are also considered as examples.  All the
		nonstationary image statistical parameters needed for the
		filter can be estimated from the noisy image and no {\it
		a priori} information about the original image is required.",
	INDEX = "adaptive noise smoothing,
		image restoration,
		nonstationary image model,
		signal-dependent noise"
}

@ARTICLE{kumaresan+gupta:pieee74/5,
	AUTHOR = "Kumaresan, R. and Gupta, P. K.",
	TITLE = "Vector-Radix Algorithm for a 2-{D} Discrete {Hartley}
		Transform",
	JOURNAL = PIEEE,
	VOLUME = "74",
	NUMBER = "5",
	PAGES = "755--757",
	YEAR = 1986,
	ABSTRACT = "A new multidimensional Hartley transform is
		defined and a vector-radix algorithm for fast
		computation of the transform is developed.  The
		algorithm is shown to be faster (in terms of
		multiplication and addition count) when compared
		to other related algorithms."
}

@ARTICLE{lahart:josa69/10,
	AUTHOR = "Lahart, Martin J.",
	TITLE = "Local Image Restoration by a Least-Squares Method",
	JOURNAL = JOSA,
	VOLUME = "69",
	NUMBER = "10",
	PAGES = "1333--1339",
	YEAR = 1979,
	ABSTRACT = "Restoration of individual image points by the
		method of least squares is investigated.  We show
		that restorations computed point by point appear
		the same as global restorations produced by Fourier
		techniques.  Moreover, parameters that are related
		to noise, point-spread functions, or object texture
		can be varied easily from pixel to pixel allowing a
		flexibility that is achieved only with computational
		difficulty in global restoration techniques.  To restore
		individual pixels, only a few points in their neighborhood
		need to be considered, and the matrices that must be
		inverted are small enough for practical computation.
		The sizes of these matrices can be reduced especially
		if the blurring point-spread function has symmetries."
}

@MANUAL{laine+reichenbach:ips,
	AUTHOR = "Laine, Andrew F. and Reichenbach, Stephen E.",
	TITLE = "Image Processing Software",
	ORGANIZATION = WU,
	ADDRESS = WU_addr,
	EDITION = "Third",
	MONTH = "September",
	YEAR = 1985
}

@MISC{land:pc1_3_91,
	NOTE = "Steve Land, Earth Observation Satellite Company, USGS
		EROS Data Center, Sioux Falls, SD 57198. Personal
		communication, January 3, 1991."
}

@TECHREPORT{lansing+park:nasa2688,
	AUTHOR = "Lansing, Donald L. and Park, Stephen K.",
	TITLE = "Quantitative Analysis of the Reconstruction Performance
		of Interpolants",
	INSTITUTION = NASA,
	ADDRESS = NASA_addr,
	NUMBER = "2688",
	MONTH = "May",
	YEAR = 1987,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{lee:ieeepami2/2,
	AUTHOR = "Lee, J. S.",
	TITLE = "Digital Image Enhancement and Noise Filtering by
		Use of Local Statistics",
	JOURNAL = IEEEPAMI,
	VOLUME = "2",
	NUMBER = "2",
	PAGES = "165--168",
	YEAR = 1980,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{lester+sandor:c+g8/4,
	AUTHOR = "Lester, Lewis N. and Sandor, John",
	TITLE = "Computer Graphics on a Hexagonal Grid",
	JOURNAL = C+G,
	VOLUME = "8",
	NUMBER = "4",
	PAGES = "401--409",
	YEAR = 1984,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{li+eichmann:opticscomm56/3,
	AUTHOR = "Li, Yao and Eichmann, George",
	TITLE = "Coherent Optical Generation of Hartley Transform of
		Real Images",
	JOURNAL = OPTICSCOMM,
	VOLUME = "56",
	NUMBER = "3",
	PAGES = "150--154",
	YEAR = 1985,
	ABSTRACT = "A new method to generate optical Hartley transform (OHT)
		for 2D real images is proposed.  The method is based on
		polarization encoding of the coherent optical beam.
		Different coherent optical image processing techniques
		are discussed."
}

@ARTICLE{linfoot:josa45/10,
	AUTHOR = "Linfoot, E. H.",
	TITLE = "Information Theory and Optical Images",
	JOURNAL = JOSA,
	VOLUME = "45",
	NUMBER = "10",
	PAGES = "808--819",
	YEAR = 1955,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{linfoot:josa46/9,
	AUTHOR = "Linfoot, E. H.",
	TITLE = "Transmission Factors and Optical Design",
	JOURNAL = JOSA,
	VOLUME = "46",
	NUMBER = "9",
	PAGES = "740--752",
	YEAR = 1956,
	ABSTRACT = "This paper is concerned with formulating the
		requirements which must be fulfilled by a realistic
		theory of optical image evaluation, and with the analytical
		techniques which enable these requirements to be met to a
		greater or lesser extent.

		Some of the shortcomings of old and present-day methods
		of image assessment are enumerated and the above-mentioned
		requirements are outlined.  The Fourier treatment of
		optical images is extended to cover systems of fairly
		large aperture and field, working in polychromatic
		light, and the basic properties of their transmission
		factors (response functions) are developed.  The
		evaluation of optical images and of optical designs is
		discussed in terms of these transmission factors."
}

@ARTICLE{linfoot:physica24,
	AUTHOR = "Linfoot, E. H.",
	TITLE = "Optical Image Evaluation from the Standpoint of
		Communication Theory",
	JOURNAL = PHYSICA,
	VOLUME = "24",
	PAGES = "476--494",
	YEAR = 1958,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{linfoot:optact5/1-2,
	AUTHOR = "Linfoot, E. H.",
	TITLE = "Quality Evaluations in Optical Systems",
	JOURNAL = OPTACT,
	VOLUME = "5",
	NUMBER = "1--2",
	PAGES = "1--14",
	YEAR = 1958,
	ABSTRACT = "TO BE TYPED"
}


@ARTICLE{malvar:electletters,
	AUTHOR = "Malvar, H.",
	TITLE = "Fast Computation of Discrete Cosine Transform
		Through Fast Hartley Transform",
	JOURNAL = EL,
	VOLUME = "22",
	NUMBER = "7",
	PAGES = "352--353",
	YEAR = 1986,
	ABSTRACT = "A relationship between the discrete cosine transform (DCT)
		and the discrete Hartley transform (DHT) is derived.  It leads
		to a new fast and numerically stable algorithm for the DCT.",
	INDEX = "signal processing,
		fast Fourier transforms"
}

@ARTICLE{mannos+sakrison:ieeeit20/4,
	AUTHOR = "Mannos, James L. and Sakrison, David J.",
	TITLE = "The Effects of a Visual Fidelity Criterion on the
		Encoding of Images",
	JOURNAL = IEEEIT,
	VOLUME = "20",
	NUMBER = "4",
	PAGES = "525--536",
	YEAR = 1974,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{marmolin:ieeesmc16/3,
	AUTHOR = "Marmolin, Hans",
	TITLE = "Subjective {MSE} Measures",
	JOURNAL = IEEESMC,
	VOLUME = "16",
	NUMBER = "3",
	PAGES = "486--489",
	YEAR = 1986,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{marr+hildreth:prslb207,
	AUTHOR = "Marr, D. and Hildreth, E.",
	TITLE = "Theory of Edge Detection",
	JOURNAL = PRSLB,
	VOLUME = "207",
	PAGES = "187--217",
	YEAR = 1980
}

@ARTICLE{marr++:josa70/7,
	AUTHOR = "Marr, D. and Poggio, T. and Hildreth, E.",
	TITLE = "Smallest Channel in Early Human Vision",
	JOURNAL = JOSA,
	VOLUME = "70",
	NUMBER = "7",
	PAGES = "868--870",
	YEAR = 1980
}

@ARTICLE{max:ireit6/1,
	AUTHOR = "Max, Joel",
	TITLE = "Quantizing for Minimum Distortion",
	JOURNAL = IREIT,
	VOLUME = "6",
	NUMBER = "1",
	PAGES = "7--12",
	YEAR = 1960,
	ABSTRACT = "This paper discusses the problem of the minimization
		of the distortion of a signal by a quantizer when the
		number of output levels of the quantizer is fixed.  The
		distortion is defined as the expected value of some
		function of the error between the input and the output
		of the quantizer.  Equations are derived for the
		parameters of a quantizer with minimum distortion.  The
		equations are not soluble without recourse to numerical
		methods, so an algorithm is developed to simplify their
		numerical solution.  The case of an input signal with
		normally distributed amplitude and an expected squared
		error distortion measure is explicitly computed and
		values of the optimum quantizer parameters are tabulated.
		The optimization of a quantizer subject to the restriction
		that both input and output levels be equally spaced is
		also treated, and appropriate parameters are tabulated
		for the same case as above."
}

@INPROCEEDINGS{mazumdar++:ccvpr85,
	AUTHOR = "Mazumdar, M. and Sinha, B. K. and Li, C. C.",
	TITLE = "A Comparison of Several Estimates of Edge Point
		in Noisy Digital Data Across a Step Edge",
	BOOKTITLE = CCVPR,
	ORGANIZATION = IEEECS,
	PAGES = "27--33",
	YEAR = 1985,
	ABSTRACT = "The paper considers the problem of estimating
		the edge point from one-dimensional noisy digital
		data arising from an idealized signal possessing
		a single step edge.  Three estimation procedures
		are considered---method of moments, maximum likelihood
		and Bayes.  Monte Carlo results indicate that for
		moderately large samples, the maximum likelihood
		method gives very accurate results, irrespective of
		the location of the edge point and the magnitude of
		the signal-to-noise ratio."
}

@INPROCEEDINGS{mcclellan:ciss7,
	AUTHOR = "{McClellan}, James H.",
	TITLE = "The Design of Two-Dimensional Digital Filters by
		Transformations",
	BOOKTITLE = CISS,
	NUMBER = 7,
	PAGES = "247--251",
	YEAR = 1973
}

@ARTICLE{mcclellan+chan:ieeecas24/7,
	AUTHOR = "{McClellan}, James H. and Chan, David S.",
	TITLE = "A 2-{D} {FIR} Filter Structure Derived from the {Chebyshev}
		Recursion",
	JOURNAL = IEEECAS,
	VOLUME = "24",
	NUMBER = "7",
	PAGES = "372--378",
	YEAR = 1977,
	ABSTRACT = "A new structure is proposed for the implementation
		of 2-D FIR digital filters designed by transformations of 1-D
		filters.  This structure requires a minimum number of
		multiplications and uses directly as coefficients the
		impulse response samples of the 1-D prototype filter.
		The roundoff noise of the new structure is analyzed in
		detail and is shown to be superior to that of previous
		implementations for all examples studied."
}

@ARTICLE{mccormick++:josaa6/7,
	AUTHOR = "McCormick, Judith A. and Alter-Gartenberg, Rachel and
		Friedrich O. Huck",
	TITLE = "Image Gathering and Restoration: {Information} and
		Visual Quality",
	JOURNAL = JOSAA,
	VOLUME = "6",
	NUMBER = "7",
	PAGES = "987--1005",
	YEAR = 1989,
	ABSTRACT = "A method is investigated for optimizing the end-to-end
		performance of image gathering and restoration for visual
		quality.  To achieve this objective, one must inevitably
		confront the problems that the visual quality of restored
		images depends on perceptual rather than mathematical
		considerations and that these considerations vary with the
		target, the application, and the observer.  following the
		theoretical treatments presented in recent papers
		[J. Opt. Soc. Am. A {\bf 2}, 1644 (1985); {\bf 5}, 285
		(1988); {\bf 5}, 300 (1988)], the method adopted in this
		paper is to optimize image gathering informationally and
		to restore images interactively to obtain the visually
		preferred trade-off among fidelity, resolution, sharpness,
		and clarity.  The results demonstrate that this method leads
		to significant improvements in the visual quality obtained
		by the traditional digital processing methods.  These
		traditional methods allow a significant loss of visual quality
		to occur because they treat the design of the image-gathering
		system and the formulation of the image-restoration algorithm
		as two separate tasks and fail to account for the
		transformations between the continuous and the discrete
		representations in image gathering and reconstruction."
}

@ARTICLE{mcglamery:josa57/3,
	AUTHOR = "McGlamery, Benjamin L.",
	TITLE = "Restoration of Turbulence-Degraded Images",
	JOURNAL = JOSA,
	VOLUME = "57",
	NUMBER = "3",
	PAGES = "293--297",
	YEAR = 1967,
	ABSTRACT = "Turbulence-degraded images have been processed
		to obtain an improvement of their visual image quality.
		The initial objects were photographed through
		laboratory-generated turbulence.  The resulting
		transparencies of the degraded images were digitized
		by a photoelectric scanner and processed on a digital
		computer.  The processing consisted of applying corrections
		to the amplitude and phase coefficients of the two-dimensional
		Fourier series representing the degraded images.  The
		correction factors were obtained from the optical transfer
		function of the turbulence measured at the time the images
		were photographed.  The experiment was done for 5-msec and
		1-min exposure times.  The processed data were used to
		generate photographs.  The processed images were found to have
		significantly more visual detail than the original degraded
		images; the 5-msec-exposure restorations were superior to
		the 1-min-exposure restorations.",
	INDEX = "photography,
		image structure,
		atmospheric optics,
		computers"
}

@ARTICLE{meckelburg+lipka:electletters21/8,
	AUTHOR = "Mecklenburg, H. J. and Lipka, D.",
	TITLE = "Fast {Hartley} Transform Algorithm",
	JOURNAL = EL,
	VOLUME = "21",
	NUMBER = "8",
	PAGES = "341--343",
	YEAR = 1985,
	ABSTRACT = "The discrete Hartley transform is a new tool
		for the analysis, design and implementation of
		digital signal processing algorithms and systems.
		It is strictly symmetrical concerning the transformation
		and its inverse.  A new fast Hartley transform algorithm
		has been developed.  Applied to real signals, it is
		faster than a real fast Fourier transform, especially
		in the case of the inverse transformation.  The speed
		of operation for a fast convolution can thus be increased."
}

@ARTICLE{mecklenbrauker+mersereau:ieeecas23/7,
	AUTHOR = "Mecklenbr{\"{a}}uker, Wolfgang F. G. and
		Mersereau, Russel M.",
	TITLE = "{McClellan} Transformations for Two-Dimensional Digital
		Filtering:  {II}---{Implementation}",
	JOURNAL = IEEECAS,
	VOLUME = "23",
	NUMBER = "7",
	PAGES = "414--422",
	YEAR = 1976,
	ABSTRACT = "A family of 2-D structures is presented for implementing
		2-D FIR digital filters designed by means of a transformation
		of a 1-D design.  These implementations are computationally
		efficient for filters up to degree 50x50 and are
		straightforward to program or build in hardware.  Many
		details of the implementations are discussed such as its
		susceptibility to coefficient quantization and arithmetic
		roundoff.  A comparison is made between these implementations
		and other implementations for 2-D FIR filters."
}

@ARTICLE{mersereau++:ieeecas23/7,
	AUTHOR = "Mersereau, Russel M. and Mecklenbr{\"{a}}uker, Wolfgang F. G.
		and Quatieri, Thomas F.",
	TITLE = "{McClellan} Transformations for Two-Dimensional Digital
		Filtering:  {I}---{Design}",
	JOURNAL = IEEECAS,
	VOLUME = "23",
	NUMBER = "7",
	PAGES = "405--414",
	YEAR = 1976,
	ABSTRACT = "This paper discusses the design of two-dimensional (2-D)
		linear-phase FIR digital filters by transformations of
		one-dimensional (1-D) filters, using a technique first
		presented by McClellan.  His original transformations are
		generalized and several algorithms are presented for the
		design of the generalized transformations.  Examples are
		included to demonstrate the versatility of the design method."
}

@ARTICLE{mersereau:pieee67/6,
	AUTHOR = "Mersereau, Russel M.",
	TITLE = "The Processing of Hexagonally Sampled Two-Dimensional
		Signals",
	JOURNAL = PIEEE,
	VOLUME = "67",
	NUMBER = "6",
	PAGES = "930--949",
	YEAR = 1979,
	ABSTRACT = "Two-dimensional signals are normally processed
		as rectangularly sampled arrays; i.e., they are periodically
		sampled in each of two orthogonal independent variables.
		Another form of periodic sampling, hexagonal sampling,
		offers substantial savings in machine storage and
		arithmetic computations for many signal processing
		operations.  In this paper, methods for the processing
		of two-dimensional signals which have been sampled as
		dimensional hexagonal arrays are presented.  Included
		are methods for signal representation, linear system
		implementation, frequency response calculation, DFT
		calculation, filter design, and filter implementation.
		These algorithms bear strong resemblances to the corresponding
		results for rectangular arrays; however, there are also
		many important differences.  Some comparisons between the
		two methods for representing planar data will also be
		presented."
}

@ARTICLE{mersereau:ieeecas27/2,
	AUTHOR = "Mersereau, Russel M.",
	TITLE = "The Design of Arbitrary 2-{D} Zero-Phase {FIR} Filters Using
		Transformations",
	JOURNAL = IEEECAS,
	VOLUME = "27",
	NUMBER = "2",
	PAGES = "142--144",
	YEAR = 1980,
	ABSTRACT = "The design of 2-D FIR zero-phase filters by transformations
		is a popular and well-developed technique, but it suffers from
		the disadvantage that in its current form only filters with
		four-quadrant symmetry can be designed.  In this contribution
		a natural generalization is presented which allows the method
		to be used to design arbitrary zero-phase 2-D FIR filters.
		This generalization preserves the two most important features
		of the method---the decoupling of the design problem into
		one-dimensional and two-dimensional components, and the
		existence of an efficient structure for realizing the filter."
}

@ARTICLE{mersereau:ieeeassp29/5,
	AUTHOR = "Mersereau, Russel M. and Speake, Theresa C.",
	TITLE = "A Unified Treatment of {Cooley}-{Tukey} Algorithms
		for the Evaluation of Multidimensional DFT",
	JOURNAL = IEEEASSP,
	VOLUME = "29",
	NUMBER = "5",
	PAGES = "1011--1018",
	YEAR = 1981,
	ABSTRACT = "In this paper the Cooley-Tukey fast Fourier transform (FFT)
		algorithm is generalized to the multidimensional case in a
		natural way which allows for the evaluation of
		discrete Fourier transforms of rectangularly or
		hexagonally sampled signals or of signals which are
		sampled on an arbitrary periodic grid in either the
		spatial or Fourier domain.  This general algorithm
		incorporates both the traditional rectangular row-column
		and vector-radix algorithms as special cases.  This
		FFT algorithm is shown to result from the factorization
		of an integer matrix; for each factorization of that matrix,
		a different algorithm can be developed.  This paper presents
		the general algorithm, discusses its computational efficiency,
		and relates it to existing multi-dimensional FFT algorithms."
}

@ARTICLE{mertz+gray:bstj13,
	AUTHOR = "Mertz, Pierre and Gray, Frank",
	TITLE = "A Theory of Scanning and Its Relation to the
		Characteristics of the Transmitted Signal in
		Telephotography and Television",
	JOURNAL = bstj,
	VOLUME = "13",
	PAGES = "464--515",
	YEAR = 1934,
	ABSTRACT = "TO BE TYPED"
}

@MISC{meyer:pc1_2_91,
	NOTE = "David J. Meyer, TGS Technology Inc., USGS EROS Data
		Center, Sioux Falls, SD 57198. Personal communication,
		January 2, 1991."
}

@ARTICLE{mikhail++:photogram39/3,
	AUTHOR = "Mikhail, Edward M. and Akey, Mark L. and Mitchell,
		O. Robert",
	TITLE = "Detection and Sub-Pixel location of Photogrammetric
		Targets in Digital Images",
	JOURNAL = PHOTOGRAM,
	VOLUME = "39",
	NUMBER = "3",
	PAGES = "63--83",
	YEAR = 1984,
	ABSTRACT = "Data consist of aerial digital images with ground
		targets in the form of crosses of different dimensions
		and orientations.  Location and recognition of the
		targets relies on Fourier descriptors and on two-dimensional
		moments.  further processing employs least squares
		adjustment of the target shape in order to precisely
		determine the position ({\it X} and {\it Y}) and
		orientation $\theta$ of each cross to a fraction
		of a pixel accuracy.  results are given from tests
		with synthetic crosses on a real terrain digital
		data base.  Accuracies achieved have reached to within
		0.03--0.05 pixel.  Digital image compression has
		shown to cause cross targets to shift in location by
		as much as 0.5 pixel."
}

@ARTICLE{mitchell+netravali:cg22/4,
	AUTHOR = "Mitchell, Don P. and Netravali, Arun N.",
	TITLE = "Reconstruction Filters in Computer Graphics",
	JOURNAL = CG,
	VOLUME = "22",
	NUMBER = "4",
	PAGES = "221--228",
	YEAR = 1988,
	ABSTRACT = "Problems of signal processing arise in image
		synthesis because of transformations between continuous
		and discrete representations of 2D images.  Aliasing
		introduced by sampling has received much attention in
		graphics, but reconstruction of samples into a
		continuous representation can also cause aliasing as well
		as other defects in image quality.  The problem of
		designing a filter for use on images is discussed,
		and a new family of piecewise cubic filters are
		investigated as a practical demonstration.  Two
		interesting cubic filters are found, one having good
		antialiasing properties and the other having good
		image-quality properties.  It is also shown that
		reconstruction using derivative as well as amplitude
		values can greatly reduce aliasing.",
	INDEX = "computer graphics,
		picture/image generation,
		image processing,
		digitization"
}

@ARTICLE{modestino+fries:cgip6,
	AUTHOR = "Modestino, J. W. and Fries, R. W.",
	TITLE = "Edge Detection in Noisy Images Using Recursive Digital
		Filtering",
	JOURNAL = CGIP,
	VOLUME = "6",
	PAGES = "409--433",
	YEAR = 1977,
	ABSTRACT = "The problem of detecting edges in noisy digitized
		images is considered.  A stochastic model of edge
		structure is proposed and the edge detection problem
		formulated as one of least-mean-square spatial filtering.
		The resulting filtering structures are implemented
		as two-dimensional recursive digital filters.  Computer
		experiments with this class of edge detectors will
		be described.  The results indicate substantial advantages
		over conventional edge detectors in the presence of
		noise.  Applications to real-world imagery data
		are discussed."
}

@ARTICLE{modestino+fries:ieeeit26/1,
	AUTHOR = "Modestino, James W. and Fries, Robert W.",
	TITLE = "Construction and Properties of a Useful Two-Dimensional
		Random Field",
	JOURNAL = IEEEIT,
	VOLUME = "26",
	PAGES = "44--50",
	YEAR = 1980,
	ABSTRACT = "A two-dimensional homogeneous and isotropic random field
		is described which is generated by a polygonal partition
		process on the plane.  In particular, the plane is divided
		into elementary disjoint polygonal regions by a Poisson
		line process.  Gray levels within these elementary polygonal
		regions are assigned to have specified correlation with
		gray levels in contiguous regions.  Explicit evaluation of
		the resulting autocorrelation function and power spectral
		density is provided.  Several applications are described."
}

@ARTICLE{moldon:patternrec2,
	AUTHOR = "Moldon, John C.",
	TITLE = "High Resolution Image Estimation in a Turbulent Environment",
	JOURNAL = PATTERNREC,
	VOLUME = "2",
	PAGES = "79--90",
	YEAR = 1970,
	ABSTRACT = "The very small temporal and spatial correlation
		scales of wavefronts at optical frequencies severely limits
		the angular resolution in the usual telescope focal plane
		image when viewing through the turbulent atmosphere.
		Reliable determination of spatial frequencies beyond the
		nominal atmospheric cut off may still be possible if one
		takes a large number of independent measurements of the
		short-term mutual coherence and then averages the results
		in the proper manner."
}

@ARTICLE{morikawa++:ecj65a/11,
	AUTHOR = "Morikawa, Yoshitaka and Kaneda, Masahiro and
		Hamada, Hiroshi",
	TITLE = "A Method for Kernel Separation in the Multidimensional
		Discrete Fourier Transforms",
	JOURNAL = ECJ,
	VOLUME = "65A",
	NUMBER = "11",
	PAGES = "1--10",
	YEAR = 1982,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{morton+andrews:josa69/2,
	AUTHOR = "Morton, John Baird and Andrews, Harry C.",
	TITLE = "{\it A posteriori} Method of Image Restoration",
	JOURNAL = JOSA,
	VOLUME = "69",
	NUMBER = "2",
	PAGES = "280--290",
	YEAR = 1979,
	ABSTRACT = "Algorithms are developed which address the problem
		of estimating the magnitude and phase of the optical
		transfer function associated with a blurred image.
		The primary focus of the paper is on the estimate of
		the phase of the optical transfer function.  Once an
		estimate of the optical transfer function has been made,
		the corresponding blurred imagery is Wiener filtered
		to estimate the original unblurred object.  Results
		are demonstrated on real world photographically induced
		blurs.  Included is a mathematical bound on the phase of
		the optical transfer function."
}

@ARTICLE{murphy+silverman:ieeeac23/5,
	AUTHOR = "Murphy, Michael S. and Silverman, Leonard M.",
	TITLE = "Image Model Representation and Line-by-Line Recursive
		Restoration",
	JOURNAL = IEEEAC,
	VOLUME = "23",
	NUMBER = "5",
	PAGES = "809--816",
	YEAR = 1978,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "A new one dimensionally causal state-space image
		representation is developed and employed in deriving
		several line-by-line recursive restoration procedures
		for images degraded by blur and additive noise.  The
		optimal and two practical suboptimal restoration
		schemes---strip restoration and constrained optimal
		restoration---are included."
}

@ARTICLE{naderi+sawchuk:ao17/8,
	AUTHOR = "Naderi, F. and Sawchuk, A. A.",
	TITLE = "Estimation of Images Degraded by Film-Grain Noise",
	JOURNAL = AO,
	VOLUME = "17",
	NUMBER = "8",
	PAGES = "1228--1237",
	YEAR = 1978,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "Film-grain noise describes the intrinsic noise produced
		by a photographic emulsion during the process of image
		recording and reproduction.  In this paper we consider
		the restoration of images degraded by film-grain noise.
		First a detailed model for the over-all photographic imaging
		system is presented.  The model includes linear blurring
		effects and the signal-dependent effect of film-grain noise.
		The accuracy of this model is tested by simulating images
		according to it and comparing the results to images of
		similar targets that were actually recorded on film.  The
		restoration of images degraded by film-grain noise is
		then considered in the context of estimation theory.  A
		discrete Wiener filter is developed which explicitly
		allows for the signal dependence of the noise.  The filter
		adaptively alters its characteristics based on the
		nonstationary first order statistics of an image and is shown
		to have advantages over the conventional Wiener filter.
		Experimental results for modeling and the adaptive
		estimation filter are presented."
}

@UNPUBLISHED{narayanswamy++:icassp91,
	AUTHOR = "Narayanswamy, Ramkumar and Rahman, Zia-Ur and
		Reichenbach, Stephen E.",
	TITLE = "Restoration of Subband Coded Images",
	NOTE = " Accepted for presentation at the {\it International
		Conference on Acoustics, Speech, and Signal Processing}.",
	XBOOKTITLE = ICPR,
	XORGANIZATION = IEEECS,
	XPAGES = "1228--1237",
	XYEAR = 1991,
	ABSTRACT = "TO BE TYPED"
}

@TECHREPORT{nathan,
	AUTHOR = "Nathan, R.",
	TITLE = "Digital Video Handling",
	INSTITUTION = NASA,
	NUMBER = "32-877",
	YEAR = 1966,
	ABSTRACT = "A technique has been developed which makes it possible
		to perform accurate, detailed operations and analyses upon
		digitized pictorial data.  Television pictures transmitted
		from the {\it Ranger} and {\it Mariner} spacecraft have been
		significantly improved in clarity by correcting those system
		distortions which affect photometric, geometric, and
		frequency fidelity.  Various classes of structured noise
		have also been detected and removed digitally by means of
		newly devised two-dimensional filters.  Although mathematically
		the filters are easier to describe in the frequency domain,
		they are more effectively applied as a convolution operation
		on the original digitized photographs.  The cleaned-up,
		enhanced pictures are then used by the computer for further
		interpretive and statistical analyses."
}

@ARTICLE{netravali+prasada:pieee65/4,
	AUTHOR = "Netravali, Arun N. and Prasada, Birendra",
	TITLE = "Adaptive Quantization of Picture Signals Using Spatial
		Masking",
	JOURNAL = PIEEE,
	VOLUME = "65",
	NUMBER = "4",
	PAGES = "536--548",
	YEAR = 1977,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{oneill:byte,
	AUTHOR = "{O'Neill}, Mark A.",
	TITLE = "Faster Than Fast {Fourier}",
	JOURNAL = BYTE,
	PAGES = "293--300",
	YEAR = 1988,
	ABSTRACT = "The fast Hartley transform is twice as fast as the
		fast Fourier and uses only half the computer resources."
}

@ARTICLE{oppenheim+lim:pieee69/5,
	AUTHOR = "Oppenheim, Alan V. and Lim, Jae S.",
	TITLE = "The Importance of Phase in Signals",
	JOURNAL = PIEEE,
	VOLUME = "69",
	NUMBER = "5",
	PAGES = "529--541",
	YEAR = 1981,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{panter+dite:pire39/1,
	AUTHOR = "Panter, P. F. and Dite, W.",
	TITLE = "Quantization Distortion in Pulse-Count Modulation
		with Nonuniform Spacing Levels",
	JOURNAL = PIRE,
	VOLUME = "39",
	NUMBER = "1",
	PAGES = "44--48",
	YEAR = 1951,
	ABSTRACT = "It is shown that the distortion introduced in a
		pulse-count-modulation system due to quantization can
		be minimized by nonuniform spacing of levels.  Equations
		are derived for an arrangement of nonuniform level
		spacing that produces minimum distortion.  It is also
		shown that minimum distortion is significantly less than
		distortion resulting from uniform quantization when the
		crest factor is greater than four."
}

@ARTICLE{papoulis:pieee54/7,
	AUTHOR = "Papoulis, A.",
	TITLE = "Error Analysis in Sampling Theory",
	JOURNAL = PIEEE,
	VOLUME = "54",
	NUMBER = "7",
	PAGES = "947--955",
	YEAR = 1966,
	ABSTRACT = "A basic problem in signal theory is the reconstruction
		of a band-limited function $f(t)$ from its sampled value
		$f(nT)$.  Because of a number of errors, the computed or
		physically realized signal is only approximately equal to
		$f(t)$.  The most common sampling errors are: round-off of
		$f(nT)$, truncation of the series generating $f(t)$,
		aliasing of frequency components above half the sampling
		rate $1/T$, jitter in the recording times $nT$, loss of a
		number of sampled values, and imperfect filtering in the
		recovery of $f(t)$.  In the following we study the effect
		of these errors on the reconstructed signal and its Fourier
		transform."
}

@ARTICLE{park+schowengerdt:cvgip23,
	AUTHOR = "Park, Stephen K. and Schowengerdt, Robert A.",
	TITLE = "Image Reconstruction by Parametric Cubic Convolution",
	JOURNAL = CVGIP,
	VOLUME = "23",
	PAGES = "258--272",
	YEAR = 1983,
	ABSTRACT = "A parametric implementation of cubic convolution image
		reconstruction is presented which is generally superior to
		the standard algorithm and which can be optimized to the
		frequency content of the image."
}

@ARTICLE{park+schowengerdt:ao21/17,
	AUTHOR = "Park, Stephen K. and Schowengerdt, Robert A.",
	TITLE = "Image Sampling, Reconstruction, and the Effect of
		Sample-Scene Phasing",
	JOURNAL = AO,
	VOLUME = "21",
	NUMBER = "17",
	PAGES = "3142--3151",
	YEAR = 1982,
	ABSTRACT = "This paper is a 1-D analysis of the degradation caused by
		image sampling and interpolative reconstruction.  The analysis
		includes the sample-scene phase as an explicit random parameter
		and provides a complete characterization of this image
		degradation as the sum of two terms: one term accounts for the
		mean effect of undersampling (aliasing) and nonideal
		reconstruction averaged over all sample-scene phases; the
		other term accounts for variations about this mean.  The
		results of this paper have application to the design and
		performance analysis of image scanning, sampling and
		reconstruction. systems."
}

@ARTICLE{park++:ao23/15,
	AUTHOR = "Park, Stephen K. and Schowengerdt, Robert A. and Kaczynski,
		Mary-Anne",
	TITLE = "Modulation-Transfer-Function Analysis for Sampled Image
		Systems",
	JOURNAL = AO,
	VOLUME = "23",
	NUMBER = "15",
	PAGES = "2572--2582",
	YEAR = 1984,
	ABSTRACT = "Sampling generally causes the response of a digital imaging
		system to be locally shift-variant and not directly amenable
		to MTF analysis.  However, this paper demonstrates that a
		meaningful system response can be calculated by averaging over
		an ensemble of point-source system inputs to yield an MTF
		which accounts for the combined effects of image formation,
		sampling, and image reconstruction.  As an illustration, the
		MTF of the Landsat MSS system is analyzed to reveal an average
		effective IFOV which is significantly larger than the
		commonly accepted value, particularly in the along-track
		direction where undersampling contributes markedly to an MTF
		reduction and resultant increase in image blur."
}

@ARTICLE{park++:rpqne5a,
	AUTHOR = "Park, Stephen K. and Kegley, K. A. and Schiess, J. R.",
	TITLE = "Information Extraction From Multivariate Images",
	JOURNAL = RPQNE,
	VOLUME = "5A",
	EDITOR = "Thompson, Donald O. and Chimenti, Dale E.",
	PAGES = "417--427",
	YEAR = 1986
}

@ARTICLE{park+miller:cacm31/10,
	AUTHOR = "Park, Stephen K. and Miller, Keith W.",
	TITLE = "Random Number Generators: {Good} Ones Are Hard To Find",
	JOURNAL = CACM,
	VOLUME = "31",
	NUMBER = "10",
	YEAR = 1988,
	PAGES = "1192--1201",
	ALSO = "College of William and Mary Computer Science Department
		Technical Report WM-87-7",
	ABSTRACT = "We propose the widespread adoption of a good,
		portable minimal standard random number generator whose
		generally satisfactory performance is amply supported
		by years of theoretical analysis and experimental testing.
		The implementation of this Lehmer generator in a high
		level language on a wide variety of systems is demonstrated.
		Also, selected examples are presented of unsatisfactory
		generators which have appeared in recently published
		computer science textbooks or are supplied by popular
		programming environments."
}

@INPROCEEDINGS{park:vipttr,
	AUTHOR = "Park, Stephen K.",
	TITLE = "Linear Digital Imaging System Fidelity Analysis",
	BOOKTITLE = VIPTTR,
	ORGANIZATION = "NASA Conf.\ Pub.\ 3053",
	YEAR = 1989,
	PAGES = "3--10",
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{park+reichenbach:spse43,
	AUTHOR = "Park, Stephen K. and Reichenbach, Stephen E.",
	TITLE = "Design of Constrained Digital Filters for
		Restoration and Enhancement",
	BOOKTITLE = "SPSE's 43rd Annual Conf.",
	ORGANIZATION = SPSE,
	PAGES = "242--244",
	YEAR = 1990,
	XNOTE = "Summary Only"
}

@INPROCEEDINGS{park+reichenbach:spie1360,
	AUTHOR = "Park, Stephen K. and Reichenbach, Stephen E.",
	TITLE = "Digital Image Gathering and Minimum Mean-Square Error
		Restoration",
	BOOKTITLE = "Visual Communications and Image Processing V",
	PEDITOR = "Kunt, Murat",
	ORGANIZATION = "Proc.\ SPIE 1360",
	PAGES = "1578--1589",
	YEAR = 1990,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{pei+wu:electletters22/1,
	AUTHOR = "Pei, Soo-Chang and Wu, Ja-Ling",
	TITLE = "Split-Radix Fast {Hartley} Transform",
	JOURNAL = EL,
	VOLUME = "22",
	NUMBER = "1",
	PAGES = "26--27",
	YEAR = 1986,
	ABSTRACT = "The split radix is used to develop a fast Hartley
		transform algorithm, it is performed `in-place',
		and requires the lowest number of arithmetic operations
		compared with other related algorithms."
}

@ARTICLE{perkins:pieee75/8,
	AUTHOR = "Perkins, Michael G.",
	TITLE = "A Separable Hartley-Like Transform in Two or More Dimensions",
	JOURNAL = PIEEE,
	VOLUME = "75",
	NUMBER = "8",
	PAGES = "1127--1129",
	YEAR = 1987,
	ABSTRACT = "This letter introduces a discrete, separable,
		real-to-real transform, called the cas-cas transform.
		Theorems for the two-dimensional (2-D) case are presented,
		and the cas-cas transform is compared to the Hartley
		transform as an alternative way to convolve 2-D arrays
		and compute 2-D power spectra."
}

@ARTICLE{perkins:ieeecom36/6,
	AUTHOR = "Perkins, Michael G.",
	TITLE = "A Comparison of the Hartley, Cas-Cas, Fourier, and
		Discrete Cosine Transforms for Image Coding",
	JOURNAL = IEEECOM,
	VOLUME = "36",
	NUMBER = "6",
	PAGES = "758--761",
	YEAR = 1988,
	ABSTRACT = "The Hartley, Cas-Cas, Fourier, and discrete cosine
		transforms are compared for image coding.  The coding method
		used employs a marginal bit-allocation scheme and Lloyd-Max
		quantizers.  Gamma, Laplacian, and Gaussian models were
		compared for the distribution of the transform coefficients.
		The discrete cosine transform outperformed the other three
		transforms based on the mean square quantization error."
}

@ARTICLE{petersen+middleton:inf_cntrl5/4,
	AUTHOR = "Petersen, Daniel P. and Middleton, David",
	TITLE = "Sampling and Reconstruction of Wave-Number-Limited
		Functions in $N$-Dimensional Euclidean Spaces",
	JOURNAL = INFOCNTRL,
	VOLUME = "5",
	NUMBER = "4",
	PAGES = "279--323",
	YEAR = 1962,
	ABSTRACT = "The well-known Whittaker-Kotel'nikov-Shannon
		sampling theorem for frequency-bandlimited functions
		of time is extended to functions of multidimensional
		arguments.  It is shown that a function whose spectrum
		is restricted to a finite region of wave-number space
		may be reconstructed from its samples taken over a periodic
		lattice having suitably small repetition vectors.  The most
		efficient lattice (i.e., requiring minimum sampling points
		per unit hypervolume) is not in general rectangular, nor
		is a unique reconstruction function associated with a given
		sampling lattice.

		The above results also apply to homogeneous wave-number-limited
		stochastic processes in the sense of a vanishing mean-square
		error.  It is also found that, given a particular sampling
		lattice, the optimum (mean-square) presampling filter for
		nonwave-number-limited processes effects an ideal wave-number
		cutoff appropriate to the specified sampling lattice.

		Particular attention is paid to isotropic processes:
		minimum sampling lattices are specified up to eight-dimensional
		spaces, and a number of typical reconstruction functions
		are calculated."
}

@ARTICLE{petersen+middleton:inf_cntrl7/4,
	AUTHOR = "Petersen, Daniel P. and Middleton, David",
	TITLE = "Reconstruction of Multidimensional Stochastic Fields
		from Discrete Measurements of Amplitude and Gradient",
	JOURNAL = INFOCNTRL,
	VOLUME = "7",
	NUMBER = "4",
	PAGES = "445--477",
	YEAR = 1964,
	ABSTRACT = "Optimum weighting functions are derived for
		least-mean-square reconstruction of $N$-dimensional
		stochastic fields from discrete sample measurements
		of amplitude and gradient.  Exact interpolation can
		be achieved when the intensity spectrum of the field
		is wave-number-limited and the sampling lattice is
		periodic, provided that the spectral images induced by
		sampling overlap nowhere more than ($N+1$) times.
		Compared with conventional (amplitude-only) sampling,
		a network ($N+1$) times less dense is thus required.

		Examples include a rederivation of the one-dimensional
		bandlimited case, and the calculation of weighting functions
		and reconstruction errors for a second-order ``Butterworth''
		process under various postulated sampling schemes.
		Weighting functions are derived for a two-dimensional
		isotropic wave-number-limited process, sampled to yield
		a 3:1 spectral overlap."
}

@ARTICLE{pfeiffer:advimg5/10,
	AUTHOR = "Pfeiffer, David",
	TITLE = "The Case for the Embedded Imaging Approach",
	JOURNAL = ADVIMG,
	VOLUME = "5",
	NUMBER = "10",
	PAGES = "36--40",
	YEAR = 1990
}

@ARTICLE{phillips:jacm9,
	AUTHOR = "Phillips, David L.",
	TITLE = "A Technique for the Numerical Solution of Certain
		Integral Equations of the First Kind",
	JOURNAL = JACM,
	VOLUME = "9",
	NUMBER = "1",
	PAGES = "84--97",
	YEAR = 1962
}

@ARTICLE{picinbono+bouvet:ieeeit33/1,
	AUTHOR = "Picinbono, Bernard and Bouvet, Michel",
	TITLE = "Constrained Wiener Filtering",
	JOURNAL = IEEEIT,
	VOLUME = "33",
	NUMBER = "1",
	PAGES = "160--166",
	YEAR = 1987,
	ABSTRACT = "As is well-known, the introduction of causality
		conditions in wiener filtering problems completely
		changes their solution.  A constraint such as causality
		can be presented as a particular reduction of the
		observation space, and the constrained filter can always
		be obtained by projection onto this space.  However,
		it is sometimes simpler to use an indirect method
		which gives the impulse response of the constrained
		filter by an appropriate modification of the
		unconstrained response.  This method is presented
		and applied to many examples.  In particular, the
		structure of constrained prediction filters is
		analyzed, and it is shown that the constrained
		innovation can be expressed in terms of the unconstrained
		one by an appropriate filter."
}

@ARTICLE{prado:pieee73/12,
	AUTHOR = "Prado, Jacques",
	TITLE = "Comments on ``{T}he Fast {Hartley} Transform''",
	JOURNAL = PIEEE,
	VOLUME = "73",
	NUMBER = "12",
	PAGES = "1862--1863",
	YEAR = 1985,
	ABSTRACT = "In the above paper, Bracewell presents a new timing
		diagram for the computation of the DHT.  We present here
		an in-place version of the Fast Hartley Transform."
}

@INPROCEEDINGS{pratt:spie199,
	AUTHOR = "Pratt, William K.",
	TITLE = "Intelligent Image Processing Display Terminal",
	BOOKTITLE = "Advances in Display Technology",
 	PEDITOR = "Parsons, John R.",
	ORGANIZATION = SPIE,
	VOLUME = "199",
	PAGES = "189--194",
	YEAR = 1979,
	ABSTRACT = "An operational description of an intelligent image
		processing display terminal is given.  The terminal acts
		as an alphanumeric display, a raster graphics terminal,
		a color image display, and a real time image processor.
		The image processing function is accomplished by a unique
		form of spatial convolution."
}

@ARTICLE{price:cvgip36,
	AUTHOR = "Price, Keith",
	TITLE = "Anything You Can Do, {I} Can Do Better (No You Can't){\ldots}",
	JOURNAL = CVGIP,
	VOLUME = "36",
	PAGES = "387--390",
	YEAR = 1986,
	ABSTRACT = "Computer vision suffers from an overload of
		written information but a dearth of good evaluations
		and comparisons.  This paper discusses why some
		of the problems arise and offers some guidelines
		we should all follow."
}

@ARTICLE{rabedeau:josa59/10,
	AUTHOR = "Rabedeau, M. E.",
	TITLE = "Effect of Truncation of Line-Spread and Edge-Response
		Functions on the Computed Optical Transfer Function",
	JOURNAL = JOSA,
	VOLUME = "59",
	NUMBER = "10",
	PAGES = "1309--1314",
	YEAR = 1969,
	ABSTRACT = "The accuracy of optical transfer functions computed by
		Fourier transformation of the measured line-spread functions
		is limited by the necessary truncation of the line-spread
		functions.  Error of the optical transfer function due to
		truncation of the line-spread function is given for various
		wave-front aberrations and for various degrees of truncation.
		The additional error introduced by sampling the truncated
		line-spread function at the Nyquist rate has been found to be
		very small.  A procedure for reducing the error of the optical
		transfer function due to truncation of the line-spread
		function is given.",
	INDEX = "spread function,
		optical transfer function,
		modulation transfer,
		Fourier transforms"
}

@INPROCEEDINGS{rahman++:spse43,
	AUTHOR = "Rahman, Zia-ur and John, Sarah and Huck, Friedrich O.
		and Reichenbach, Stephen E.",
	TITLE = "Information Theoretical Assessment of Image Gathering
		and Coding for Digital Restoration",
	BOOKTITLE = "SPSE 43rd Annual Conf.",
	ORGANIZATION = SPSE,
	PAGES = "194",
	YEAR = 1990,
	XNOTE = "Summary Only",
	SUMMARY = "In this paper we are concerned with the end-to-end
		performance of image gathering, coding, and restoration
		as a whole rather than a chain of independent tasks.
		Our approach evolves from the pivotal relationship that
		exists between the spectral information density of the
		transmitted signal and the restorability of images 
		from this signal.$^{1,2}$  The information theoretical
		assessment accounts for (1) the information density and
		efficiency of the acquired signal as a function of the
		image-gathering system design and the radiance-field
		statistics, and (2) the information efficiency and data 
		compression that can be gained by combining image gathering
		with coding to reduce the signal redundancy and irrelevancy.
		The redundancy reduction is concerned mostly with the
		statistical properties of the acquired signal, and the
		irrelevancy reduction is concerned mostly with the visual
		properties of the scene and the restored image.  The
		results of this assessment lead to intuitively appealing
		insights about image gathering and coding for digital
		restoration.  Foremost is the realization that images
		can be restored with better quality and from less data
		as the information efficiency of the transmitted data
		is increased, provided that the restoration correctly
		accounts for the image gathering and coding processes
		and effectively suppresses the image-display degradations.
		High information-efficiency, in turn, can be attained
		only by minimizing image-gathering degradations as
		well as signal redundancy.
		\par
		The results also reveal intuitively appealing similarities
		between the preformance of image gathering and coding
		that is optimized for high information efficiency and
		the performance of image gathering and retinal processing
		in human vision.  The maximum information density that
		can ordinarily be attained within the critical constraints
		imposed on image gathering approaches $\sim$4 binary
		information units (bifs) and requires $\sim$5-bit encoding.
		This number of encoding levels corresponds (fortuitously?)
		closely to the upper limit of $\sim$40 intensity levels
		that each nerve fiber can transmit, via pulses, from the
		retina to the visual cortex.  This information density
		may be reduced to $\sim$3~bifs without perceptual
		degradations if the acquired signal is digitally restored
		on film within the critical constraints imposed on this
		process.  Since processing in the human visual system is
		probably not similarly constrained, the higher information
		density of $\sim$4~bifs perhaps contributes to the
		improvement in visual quality that we always experience
		when we view a scene directly rather than through the
		media of image gathering and restoration.
		\par
		1. F. O. Huck, C. L. Fales, N. Halyo, R. W. Samms,
		and K. Stacy, ``Image gathering and processing:
		Information and fidelity,'' J. Opt. Soc. Am. A2,
		pp.~1644--1666 (1985).
		2. J. A. McCormick, R. Alter-Gartenberg, and
		F. O. Huck, ``Image gathering and restoration:
		Information and visual quality,'' J. Opt. Soc. Am. A6,
		987-1005 (1989)."
}

@ARTICLE{rao+arce:josaa5/9,
	AUTHOR = "Rao, Tandhoni S. and Arce, Gonzalo R.",
	TITLE = "Halftone Patterns for Arbitrary Screen Periodicities",
	JOURNAL = JOSAA,
	VOLUME = "5",
	NUMBER = "9",
	PAGES = "1502--1511",
	YEAR = 1988,
	ABSTRACT = "Not typed in."
}

@TECHREPORT{reichenbach:wucv1,
	AUTHOR = "Reichenbach, Stephen E.",
	TITLE = "Software for the Standard Linear Format for Digital
		Cartographic Feature Data",
	INSTITUTION = WU,
	NUMBER = "WUCV-1",
	YEAR = 1986,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{reichenbach+park:osa88,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K.",
	TITLE = "Computer Generated Scenes and Simulated Imaging",
	BOOKTITLE = OSA,
	ORGANIZATION = "OSA Technical Digest 11",
	VOLUME = "11",
	PAGES = "170",
	YEAR = 1988,
	XNOTE = "Summary Only",
	ABSTRACT = "Computer-generated scenes and simulated imaging
		systems are flexible and precise tools that contribute
		rigour and clarity to digital image processing and
		computer vision research.",
	SUMMARY = "Image processing and computer vision research is
		frequently difficult to evaluate because it is based
		on an experimental approach that is inadequately defined
		or insufficiently detailed.  This paper suggests a
		model-based research paradigm for digital image processing
		and computer vision.  Specifically, we present techniques
		for generating artificial scenes and simulating imaging
		that form a versatile and precise research testbed.
		This approach is flexible---allowing for a variety
		of scenes and systems; accurate---providing exact control
		over all variables; and portable---facilitating replication
		on various computer systems.

		Two types of computer-generated scenes accurately model the
		important characteristics of real scenes.  {\it Fourier scenes}
		are two-dimensional Fourier series.  Techniques for generating
		ensembles of Fourier scenes allow precise control over
		important statistical characteristics.  {\it Digital scenes}
		are digital images with {\it super-resolution}---high
		resolution relative to the sampling rate.  Techniques for
		generating digital scenes provide precise control over
		spatial structure.

		The imaging-system simulation software provides a flexible
		end-to-end imaging environment that can be varied and
		controlled much more easily than physical systems.  The
		software simulates the important components of the imaging
		process, from the device point-spread-function, sampling,
		and noise in image formation to the image reconstruction
		of the display device."
}

@UNPUBLISHED{reichenbach:nrc,
	AUTHOR = "Reichenbach, Stephen E.",
	TITLE = "Focal-Plane Processing of Visual Information",
	NOTE = "NRC Award Proposal",
	YEAR = 1988
}

@ARTICLE{reichenbach++:josaa6/6,
	AUTHOR = "Reichenbach, Stephen E. and Burton, John C. and
		Miller, Keith W.",
	TITLE = "A Comparison of Algorithms for Computing the
		Two-Dimensional Discrete {Hartley} Transform",
	JOURNAL = JOSAA,
	VOLUME = "6",
	NUMBER = "6",
	PAGES = "818--823",
	YEAR = 1989,
	ABSTRACT = "Three methods have been described for computing the
		two-dimensional, discrete Hartley transform.  Two of
		these employ a separable transform; the third method,
		the vector-radix algorithm, does not require separability.
		In-place computation of the vector-radix method is
		described.  Operation counts and execution times indicate
		that the vector-radix method is fastest."
}

@INPROCEEDINGS{reichenbach+park:vipttr,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K.",
	TITLE = "Optimal Focal-Plane Restoration",
	BOOKTITLE = VIPTTR,
	ORGANIZATION = "NASA Conf.\ Pub.\ 3053",
	PAGES = "23--32",
	YEAR = 1989,
	ABSTRACT = "Image restoration can be implemented efficiently
		by calculating the convolution of the digital image
		and a small kernel during image acquisition.  Processing
		the image in the focal-plane in this way requires less
		computation than traditional Fourier-transform-based
		techniques such as the Wiener filter and constrained
		least-squares filter.  In this paper, the values of
		the convolution kernel that yield the restoration with
		minimum expected mean-square error are determined using
		a frequency analysis of the end-to-end imaging system.
		This development accounts for constraints on the size
		and shape of the spatial kernel and all the components
		of the imaging system.  Simulation results indicate the
		technique is effective and efficient."
}

@INPROCEEDINGS{reichenbach:larcgsw8,
	AUTHOR = "Reichenbach, Stephen E.",
	TITLE = "Optimal Focal-Plane Restoration",
	BOOKTITLE =  "Eight Annual Graduate Student Workshop",
	ORGANIZATION = "NASA Langley Research Center",
	YEAR = 1989,
	XNOTE = "SAME AS reichenbach+park:vipttr"
}

@INPROCEEDINGS{reichenbach+park:spie1199,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K.",
	TITLE = "Two-Parameter Cubic Convolution for Image Reconstruction",
	BOOKTITLE = "Visual Communications and Image Processing IV",
	PEDITOR = "Pearlman, William A.",
	ORGANIZATION = "Proc.\ SPIE 1199",
	PAGES = "833--840",
	YEAR = 1989,
	ABSTRACT = "This paper presents an analysis of a recently-proposed
		two-parameter piecewise-cubic convolution algorithm for
		image reconstruction.  The traditional cubic convolution
		algorithm is a one-parameter, interpolating function.
		With the second parameter, the algorithm can also be
		approximating.  The analysis leads to a Taylor series
		expansion for the average square error due to sampling
		and reconstruction as a function of the two parameters.
		This analysis indicates that the additional parameter
		does not improve the reconstruction fidelity---the optimal
		two-parameter convolution kernel is identical to the optimal
		kernel for the traditional one-parameter algorithm.
		Two methods for constructing the optimal cubic kernel are
		also reviewed."
}

@INPROCEEDINGS{reichenbach++:aipr18,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K. and
		Alter-Gartenberg, Rachel",
	TITLE = "Optimal Edge-Detection Kernels",
	ORGANIZATION = SPIE,
	BOOKTITLE = "Program of the Eighteenth Applied Imagery Pattern
		Recognition Workshop:  Combining Multiple Strategies for
		Vision",
	YEAR = 1989,
	XNOTE = "Abstract Only",
	ABSTRACT = "Many vision applications require high-speed edge
		detection.  This paper describes an efficient and effective
		edge-detection algorithm that improves on traditional methods
		and facilitates adaptive processing.  The algorithm is
		especially suited for fast, local edge-detection or
		application in a multi-resolution pyramid.
		Edge detection can be efficiently implemented by convolving
		a digital image with a small kernel.
		This approach requires relatively little processing and
		is easily implemented in parallel.
		Traditionally, directional derivatives and the Laplacian
		are estimated using standard kernels that do not account
		for the point-spread function of the image-gathering device,
		sampling effects, noise, or interpolation.
		In the algorithm described in this paper, the kernel values
		that yield the estimate with the minimum expected mean-square
		error are determined using a frequency-domain analysis that
		overcomes this limitation.  The derivation accounts for
		the spatial constraints on the kernel and the components
		of the end-to-end imaging process.  Because the operation
		is local and the development is conditioned on the
		character of the scene, the kernel values can be adapted
		either within an image or between images.  Because the
		algorithm accounts for other processing steps, it is
		well-suited for use in multi-resolution pyramids.
		Simulation experiments on artificial and digital scenes
		demonstrate that the algorithm yields estimates that are
		superior to traditional techniques and requires significantly
		less processing than the optimal Wiener-Fales characteristic
		filter [Huck et al., {\it J. Opt. Soc. Am. A} 2(10), pp.
		1644--66, and Fales et al., {\it J. Opt. Soc. Am. A} 5(3),
		pp. 300--314]."
}

@ARTICLE{reichenbach++:oe30/2,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K. and
		Narayanswamy, Ramkumar",
	TITLE = "Characterizing Digital Image Acquisition Devices",
	JOURNAL = OE,
	VOLUME = "30",
	NUMBER = "2",
	YEAR = 1990,
	PAGES = "170--177",
	ABSTRACT = "Despite the popularity of digital imaging devices
		(e.g., CCD array cameras) the problem of accurately
		characterizing the spatial frequency response of such
		systems has been largely neglected in the literature.
		This paper describes a simple method for accurately
		estimating the optical transfer function of digital
		image acquisition devices.  The method is based on the
		traditional knife-edge technique, but explicitly deals
		with fundamental sampled system considerations:
		insufficient and anisotropic sampling.  Results for both
		simulated and real imaging systems demonstrate the
		accuracy of the method."
}

@INPROCEEDINGS{reichenbach++:icpr90,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K. and
		Alter-Gartenberg, Rachel",
	TITLE = "Optimal, Small Kernels for Edge Detection",
	BOOKTITLE = ICPR,
	ORGANIZATION = IEEECS,
	VOLUME = "II",
	PAGES = "57--63",
	YEAR = 1990,
	ABSTRACT = "Many edge detection algorithms employ a differential
		characteristic such as the gradient or the Laplacian to
		detect brightness changes.  Although these characteristics
		are typically estimated by convolving a digital image
		with a small kernel, traditional small-kernel algorithms
		fail to account for significant aspects of the imaging
		process.  This paper develops an algorithm for defining
		small kernels that are conditioned on the important
		components of the imaging process: the nature of the scene,
		the point-spread function of the image-gathering device,
		sampling effects, noise, and post-filter interpolation.
		Subject to constraints on the spatial support of the kernel,
		the algorithm generates the kernel values that minimize
		the expected mean-square error of the estimate of the scene
		characteristic.  This development is consistent with the
		derivation of the spatially-unconstrained Wiener
		characteristic filter, but leads to a small,
		spatially-constrained convolution kernel.  Simulation
		experiments demonstrate that the algorithm is more flexible
		than traditional small-kernel techniques and yields more
		accurate estimates."
}

@UNPUBLISHED{reichenbach+park:ieeeassp,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K.",
	TITLE = "Small Convolution Kernels for High-Fidelity Image
		Restoration",
	NOTE = "Accepted for publication in the {\it IEEE Transactions
		on Acoustics, Speech, and Signal Processing}.",
	XJOURNAL = IEEEASSP,
	ABSTRACT = "TO BE TYPED"
}

@UNPUBLISHED{reichenbach++:ieeepami_subm,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K. and
		Alter-Gartenberg, Rachel",
	TITLE = "Designing Edge-Detection Kernels",
	NOTE = "Submitted for publication.",
	XNOTE = "Submitted for publication in the {\it IEEE Transactions
		on Pattern Analysis and Machine Intelligence}.",
	XJOURNAL = IEEEPAMI,
	ABSTRACT = "Commonly, edge-detection algorithms detect brightness
		changes associated with the edges of objects by convolving
		a digital image of the scene with a small kernel (or mask)
		that is a discrete, low-order approximation of a differential
		operator such as the gradient or Laplacian.  Small-kernel
		convolution is relatively efficient and simply implemented
		in parallel, but traditional edge-detection kernels are
		sub-optimal because they do not account for significant
		aspects of the imaging process.  In this paper, we develop
		an algorithm for designing small, edge-detection kernels
		that are conditioned on a comprehensive model of the imaging
		process.  The model accounts for the nature of the scene,
		the response of the image gathering device, sampling, sensor
		and quantization noise, and post-filter interpolation.
		Subject to user-defined constraints on the spatial support
		of the kernel, the algorithm generates the kernel values that
		minimize the expected mean-square error of the characteristic
		estimate.  Because the model is comprehensive, the algorithm
		is flexible and the kernels are effective.  We present several
		example kernels designed for scenes with different levels
		of detail, a variety of imaging systems, and different
		characteristic functions.  Simulation experiments demonstrate
		these kernels are more accurate than popular, traditional
		kernels."
}

@UNPUBLISHED{reichenbach+rahman:infosci_subm,
	AUTHOR = "Reichenbach, Stephen E. and Rahman, Zia-ur",
	TITLE = "Transform-Coding Image Compression for Information
		Efficiency",
	NOTE = "Submitted for publication.",
	XJOURNAL = INFOSCI,
	ABSTRACT = "TO BE TYPED"
}

@UNPUBLISHED{reichenbach+park:spie_subm,
	AUTHOR = "Reichenbach, Stephen E. and Park, Stephen K.",
	TITLE = "Artifical Scenes and Simulated Imaging",
	NOTE = "Submitted for publication.",
	XBOOKTITLE = "Stochastic Methods in Signal Processing, Image
		Processing, and Computer Vision",
	XPEDITOR = "Chen, Su-Shing",
	XORGANIZATION = SPIE,
	XVOLUME = "????",
	XPAGES = "???--???",
	XYEAR = 1991,
	XABSTRACT = "TO BE TYPED"
}

@ARTICLE{riemer+mcgillem:ao12/9,
	AUTHOR = "Riemer, Terry E. and {McGillem}, Clare D.",
	TITLE = "Constrained Optimization of Image Restoration Filters",
	JOURNAL = AO,
	VOLUME = "12",
	NUMBER = "9",
	PAGES = "2027--2029",
	YEAR = 1973
}

@ARTICLE{riemer+mcgillem:ieeeaes13/2,
	AUTHOR = "Riemer, Terry E. and {McGillem}, Clare D.",
	TITLE = "Optimum Constrained Image Restoration Filters",
	JOURNAL = IEEEAES,
	VOLUME = "13",
	NUMBER = "2",
	PAGES = "136--146",
	YEAR = 1977,
	ABSTRACT = "An optimum image restoration filter is described
		which minimizes the radius of gyration of the corrected
		or composite system point-spread function subject to
		constraints on the radius of gyration of the restoration
		filter point-spread function, the total noise power in the
		restored image, and the shape of the composite system
		frequency spectrum.  The filter function is obtained as the
		solution of simultaneous differential equations subject to
		nonlinear integral constraints.  Except for an assumption
		regarding the general shape of noise spectral density, the
		filter design is data independent.

		By constraining the radius of gyration of the restoration
		filter point-spread function, truncation errors resulting
		from edge effects are controlled.

		An iterative technique is introduced which virtually
		eliminates the sidelobes of the composite system
		point-spread function.  The resulting suboptimal
		restoration filter effectively suppresses undesirable
		secondary oscillations which may otherwise appear in the
		composite system point-spread function and introduce
		`ghosts' in the restored data.

		A detailed study of the restoration filter performance as
		a function of its parameter variations is described and a
		number of examples are provided to demonstrate the
		fundamental properties of the restoration filter."
}

@INPROCEEDINGS{rifman,
	AUTHOR = "Rifman, Samuel S.",
	TITLE = "Digital Rectification of {ERTS} Multispectral Imagery",
	BOOKTITLE = "Proc.\ Symp.\ Significant Results Obtained from ERTS-1",
	ORGANIZATION = "NASA SP-327",
	VOLUME = "I Sec.\ B",
	PAGES = "1131--1142",
	YEAR = 1973,
	ABSTRACT = "Rectified ERTS multispectral imagery have been
		produced utilizing all digital techniques, as the
		first step toward producing precision corrected imagery.
		Errors arising from attitude and ephemeris sources have
		been corrected, and the resultant image is represented
		in a meter/meter mapping utilizing an intensity ``resampling''
		technique.  early results fro available data indicate
		negligible degradation of the photometric and resolution
		properties of the source data as a consequence of the
		geometric correction process.  Work utilizing ground
		control points to produce precision rectified imagery,
		and including photometric corrections resulting from
		available sensor calibration data, is currently in progress."
}

@ARTICLE{rivard:ieeeassp25/3,
	AUTHOR = "Rivard, Glenn E.",
	TITLE = "Direct Fast {Fourier} Transform of Bivariate Functions",
	JOURNAL = IEEEASSP,
	VOLUME = "25",
	NUMBER = "3",
	PAGES = "250--252",
	YEAR = 1977,
	ABSTRACT = "A mathematical development is presented for a
		direct computation of a two-dimensional fast Fourier
		transform (FFT).  A generalized mathematical theory of
		holor algebra is used to manipulate coefficient arrays
		needed to generate computational equations.  The
		result is a set of equations which involve elements
		from throughout the two-dimensional array rather than
		operating on individual rows and columns.  Preliminary
		computer calculations verify the accuracy of the
		technique and demonstrate a modest saving of computation
		time as well."
}

@INPROCEEDINGS{roetling++:nasa/erc,
	AUTHOR = "Roetling, Paul G. and Haas, Roger C. and Kinzly, Robert E.",
	TITLE = "Some Practical Aspects of Measurement and Restoration
		of Motion-Degraded Images",
	BOOKTITLE = "Proc.\ NASA/ERC Seminar",
	ORGANIZATION = NASA,
	PAGES = "167--174",
	MONTH = DEC,
	YEAR =  1968,
	ABSTRACT = "This paper discusses several of the practical aspects
		of measurement of image quality and image enhancement for
		the case of images degraded by uncompensated image motion.
		Some theoretical limitations on the restoration process are
		considered and examples of attempts to restore detail blurred
		by image motion are shown.

		In practice one seldom has test charts available on the
		image of interest in order to perform a quality evaluation
		prior to image restoration.  For this reason the method
		of edge gradient analysis is now more or less commonly
		applied to evaluate image quality.  Examples of the
		application of edge gradient analysis to images blurred
		by uniform image motion and by vibration are shown and the
		importance of zero crossings of the modulation transfer
		function in the identification of the type of degradation
		is stressed.  Turning specifically to the case of uniform
		image motion, such as that obtained by failure of image
		motion-compensation system, we show that the location of
		the zeros of the modulation transfer function makes it
		theoretically impossible to restore a motion blurred
		image by any linear filtering technique without introducing
		some spurious structure near edges or producing ghost
		images in addition to the restored image.

		Some of the practical aspects of restoration attempts
		with motion-blurred pictures are demonstrated by examples
		utilizing the Lunar Orbiter I high resolution photographs
		which were badly blurred by image motion.  Two techniques,
		namely, coherent optical spatial filtering and an incoherent
		optical differentiation technique, are compared and results
		are shown illustrating both true and spurious enhancement
		and illustrating interpretation techniques which allow
		enhanced noise to be distinguished from true enhanced images.
		These results also illustrate the relative advantage or
		disadvantage of each enhancement technique for restoring
		various types of detail degraded by image motion."
}

@ARTICLE{sakrison:ieeeit21/3,
	AUTHOR = "Sakrison, David J.",
	TITLE = "Worst Sources and Robust Codes for Difference
		Distortion Measures",
	JOURNAL = IEEEIT,
	VOLUME = "21",
	NUMBER = "3",
	PAGES = "301--3097",
	YEAR =  1975,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{sakrison:ieeecom25/11,
	AUTHOR = "Sakrison, David J.",
	TITLE = "On the Role of the Observer and a Distortion Measure
		in Image Transmission",
	JOURNAL = IEEECOM,
	VOLUME = "25",
	NUMBER = "11",
	PAGES = "1251--1267",
	YEAR =  1977,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{saleh:ao13/8,
	AUTHOR = "Saleh, Bahaa E. A.",
	TITLE = "Trade Off Between Resolution and Noise in Restoration
		by Superposition of Images",
	JOURNAL = AO,
	VOLUME = "13",
	NUMBER = "8",
	PAGES = "1833--1838",
	YEAR =  1974,
	ABSTRACT = "The inversion technique of Backus and Gilbert is applied
		to the problem of restoration of optical objects by
		superposition of images.  The problem is formulated in the
		general case of space-variant systems.  Curves for the trade
		off between resolution and noise in restoring objects degraded
		by simple diffraction and susceptible to uncorrelated noise are
		obtained.  The technique is used to restore a test object
		whose image is sampled at the Nyquist rate and to which noise
		(simulated on a computer) is added.  Restorations
		corresponding to several points on the trade-off curve are
		obtained."
}

@ARTICLE{sawchuk:pieee60,
	AUTHOR = "Sawchuk, Alexander A.",
	TITLE = "Space-Variant Image Motion Degradation and Restoration",
	JOURNAL = PIEEE,
	VOLUME = "60",
	NUMBER = "7",
	PAGES = "854--861",
	YEAR =  1972,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "A description of motion degradation in linear incoherent
		optical systems is presented.  Given a mechanical description
		of the motion, an equivalent linear space-variant system
		containing all the motion effects is derived, and detailed
		examples of common types of variant and invariant motion
		are included.  following a review of restoration techniques
		for motion blur, a method for image restoration applicable to
		a large class of space-variant systems is presented.  This
		method is based on the decomposition of the degradation into
		geometrical coordinate distortions and a space-invariant
		operation.  A computer simulation of space-variant
		restoration is included."
}

@ARTICLE{schade:rcarev9,
	AUTHOR = "Schade, Otto H.",
	TITLE = "Electro-Optical Characteristics of Television Systems",
	JOURNAL = RCAREV,
	VOLUME = "9",
	PAGES = "5--37,245--286,490--531,490--531",
	YEAR =  1948,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schade:rcarev9/1,
	AUTHOR = "Schade, Otto H.",
	TITLE = "Electro-Optical Characteristics of Television Systems:
		{Characteristics} of Vision and Visual Systems",
	JOURNAL = RCAREV,
	VOLUME = "9",
	PAGES = "5--37",
	YEAR =  1948,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schade:rcarev9/2,
	AUTHOR = "Schade, Otto H.",
	TITLE = "Electro-Optical Characteristics of Television Systems:
		{Electro-Optical} Specifications for Television Systems",
	JOURNAL = RCAREV,
	VOLUME = "9",
	PAGES = "245--286",
	YEAR =  1948,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schade:rcarev9/3,
	AUTHOR = "Schade, Otto H.",
	TITLE = "Electro-Optical Characteristics of Television Systems:
		{Electro-Optical} Characteristics of Camera Systems",
	JOURNAL = RCAREV,
	VOLUME = "9",
	PAGES = "490--531",
	YEAR =  1948,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schade:rcarev9/4,
	AUTHOR = "Schade, Otto H.",
	TITLE = "Electro-Optical Characteristics of Television Systems:
		{Correlation} and Evaluation of Electro-Optical
		Characteristics of Imaging Systems",
	JOURNAL = RCAREV,
	VOLUME = "9",
	PAGES = "653--687",
	YEAR =  1948,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schafer+rabiner:pieee61/6,
	AUTHOR = "Schafer, Ronald W. and Rabiner, Lawrence R.",
	TITLE = "A Digital Signal Processing Approach to Interpolation",
	JOURNAL = PIEEE,
	VOLUME = "61",
	NUMBER = "6",
	PAGES = "692--702",
	YEAR =  1973,
	ABSTRACT = "TO BE TYPED"
}

@TECHREPORT{schmidt:usc,
	AUTHOR = "Schmidt, Ray",
	TITLE = "The USC-Image Processing Institute Data Base",
	INSTITUTION = "University of Southern California Image Processing
		Institute",
	NUMBER = "780",
	MONTH = oct,
	YEAR = 1977
}

@ARTICLE{schreiber:pieee55/3,
	AUTHOR = "Schreiber, William F.",
	TITLE = "Picture Coding",
	JOURNAL = PIEEE,
	VOLUME = "55",
	NUMBER = "3",
	PAGES = "320--330",
	YEAR =  1967,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{schreiber:pieee66/12,
	AUTHOR = "Schreiber, William F.",
	TITLE = "Image Processing for Quality Improvement",
	JOURNAL = PIEEE,
	VOLUME = "66",
	NUMBER = "12",
	PAGES = "1640--1651",
	YEAR =  1978,
	ABSTRACT = "In order to encourage the development of computer-based
		methods which produce better quality pictures, the long
		and successful history of image processing in photography
		and graphic arts is called to the attention of the
		computer fraternity.  Studies of contrast sensitivity
		and of the relationships among illumination, object
		reflectance, and image luminance are presented.  Homomorphic
		filtering is analyzed in this light.  Adaptive filtering
		methods which exploit perceptual phenomena as well as
		physical properties of imaging systems are given.  These
		methods attempt to permit the attainment of a very
		high degree of sharpening, equally visible throughout
		the tone scale as well as in image areas of quite different
		character, without the concomitant appearance of
		quality-destroying artifacts such as haloes or overshoots.
		Results are compared with linear and homomorphic nonadaptive
		sharpening."
}

@ARTICLE{schreiber:smptej93/8,
	AUTHOR = "Schreiber, William F.",
	TITLE = "Psychophysics and the Improvement of Television
		Image Quality",
	JOURNAL = SMPTEJ,
	VOLUME = "93",
	NUMBER = "8",
	PAGES = "717--725",
	YEAR =  1984,
	ABSTRACT = "Worthwhile improvement in television image quality
		is obtainable by signal processing at the receiver.
		However, improvement to the level demonstrated by NHK
		requires bandwidth expansion if only straightforward
		means are used, such as increasing the line and frame
		rates.  This paper discusses a number of methods for
		obtaining maximum quality for a given bandwidth.  Some
		of these methods take advantage of visual psychophysics,
		which is reviewed.  Others deal with the special
		characteristics of TV cameras, displays, and scanning
		patterns.  Quite complicated signal processing, expected
		to become practical in the next few years, is proposed
		to improve system performance."
}

@ARTICLE{schreiber+troxel:ieeepami7/2,
	AUTHOR = "Schreiber, William F. and Troxel, Donald E.",
	TITLE = "Transformation Between Continuous and Discrete
		Representations of Images: {A} Perceptual Approach",
	JOURNAL = IEEEPAMI,
	VOLUME = "7",
	NUMBER = "2",
	PAGES = "178--186",
	YEAR =  1985,
	ABSTRACT = "The transformation of image signals between the
		continuous domain of the real world and the discrete
		domain of modern data processing can have significant
		effect on quality and efficiency.  Analysis based on
		perceptual rather than mathematical considerations has
		been carried out.  A series of experiments based on the
		analysis has shown that substantial improvement over
		usual techniques can be achieved by the use of a cascade
		of a presharpening filter combined with Gaussian presampling
		and interpolation filters.  The resulting `sharpened
		Gaussian' filter, although not exactly circularly
		symmetrical, gives a high degree of isotropy.  Each
		element in the cascade is separable, so that computational
		efficiency is high.  A favorable tradeoff is achieved
		among sharpness, smoothness, and the effects of
		aliasing.  Subjective testing, in comparison with other
		commonly used filters, has shown the clear superiority
		of this filter."
}

@ARTICLE{schutten+vermeij:ieeepami2/2,
	AUTHOR = "Schutten, R. W. and Vermeij, G. F.",
	TITLE = "The Approximation of Image Blur Restoration
		Filters by Finite Impulse Responses",
	JOURNAL = IEEEPAMI,
	VOLUME = "2",
	NUMBER = "2",
	PAGES = "176--180",
	YEAR =  1980,
	ABSTRACT = "Image blur can often be modeled by a linear
		spatially invariant, symmetric point spread function.
		For this class of functions, several restoration filters
		are known in the literature.

		The approximation of their frequency transfer functions
		(ftf's) by the ftf's of small finite impulse response (FIR)
		filters has been studied.  Accurate approximations will be
		possible by $9\times9$ FIR's with 8-bit elements if the
		approximation is done in a weighted MMSE sense, and if
		the truncation of the element values will be carried out
		such that the errors are small.  A heuristic truncation
		algorithm MINIM will be described.  An example of restoration
		by a $9\times9$ will be shown.",
	INDEX = "approximation,
		finite impulse response,
		finite register length,
		image blur,
		restoration filter."
}

@ARTICLE{seitz:optengr27/7,
	AUTHOR = "Seitz, Peter",
	TITLE = "Optical Superresolution Using Solid-State Cameras and
		Digital Signal Processing",
	JOURNAL = OE,
	VOLUME = "27",
	NUMBER = "7",
	PAGES = "535--540",
	YEAR =  1988,
	ABSTRACT = "A common problem in optical metrology is the
		determination of the exact location of an edge (a
		black/white transition).  The use of cameras for this
		task has been restricted in the past because of their
		limited number of pixels and lack of methods for subpixel
		accuracy edge detection.  Analysis of the optical and
		electronic parts of modern solid-state cameras shows that
		it is possible to determine the exact location of an edge
		to subpixel accuracy, independently of the system's
		modulation transfer function.  A novel algorithm for
		this purpose is presented together with an expression
		for the precision of the edge location as a function
		of pixel noise and edge step height.  Experimental
		verification was carried out using a modified CCD camera
		coupled to an intelligent framestore (smart camera).
		Under optimum conditions the measured accuracy for the
		edge position was better than 1/140 of the pixel period,
		corresponding to less that 120nm on the sensor surface of
		the camera.  Applications of this novel method in
		metrology and micrometrology are discussed.",
	INDEX = "image processing,
		edge detection,
		metrology,
		micrometrology,
		superresolution,
		CCD camera"
}

@ARTICLE{shack:jrnbs56/5,
	AUTHOR = "Shack, Roland V.",
	TITLE = "Characteristics of an Image-Forming System",
	JOURNAL = JRNBS,
	VOLUME = "56",
	NUMBER = "5",
	PAGES = "245--260",
	YEAR =  1956,
	ABSTRACT = "Two general approaches to the analysis of an
		image-forming system are considered.  One depends
		on the image of a point object and the other on the
		Fourier transform of this image.  The two are developed
		independently and then coordinated, a practical
		characteristic function being determined for each approach.
		The relative merits of the two approaches are considered."
}

@ARTICLE{shannon:pire37/1,
	AUTHOR = "Shannon, Claude E.",
	TITLE = "Communication in the Presence of Noise",
	JOURNAL = PIRE,
	VOLUME = "37",
	NUMBER = "1",
	PAGES = "10--21",
	YEAR =  1949,
	ABSTRACT = "TO BE TYPED"
}

@INPROCEEDINGS{shannon:irencr,
	AUTHOR = "Shannon, Claude E.",
	TITLE = "Coding Theorems for a Discrete Source with a Fidelity
		Criterion",
	BOOKTITLE = IRENCR,
	PAGES = "Part 4, 142--163",
	MONTH = "March",
	YEAR =  1959,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{sieracki++:aem,
	AUTHOR = "Sieracki, Michael E. and Reichenbach, Stephen E. and
		Webb, Kenneth L.",
	TITLE = "Evaluation of Automated Threshold Selection Methods
		for Accurate Sizing of Microscopic Fluorescent Cells
		by Image Analysis",
	JOURNAL = "Applied and Environmental Microbiology",
	VOLUME = "55",
	NUMBER = "11",
	PAGES = "2762--2772",
	YEAR = 1989,
	ABSTRACT = "The accurate measurement of bacterial and protistan
		cell biomass is necessary for understanding their population
		and trophic dynamics in nature.  Direct measurement of
		fluorescently stained cells is often the method of choice.
		The tedium of making such measurements visually on the large
		numbers of cells required has prompted the use of automatic
		image analysis for this purpose.  Accurate measurements by
		image analysis requires an accurate, reliable method of
		segmenting the image, that is, distinguishing the brightly
		fluorescing cells from a dark background.  This is most
		commonly done by visually choosing a threshold intensity
		value which most closely coincides with the outline of the
		cells as perceived by the operator.  Ideally an automated
		method based on the cell image characteristics should be
		used.  Since the optical nature of edges in images of
		light-emitting, microscopic fluorescent objects is different
		from that of images generated by transmitted or reflected
		light, it seemed that automatic segmentation of such images
		may require special consideration.  We tested nine automated
		threshold selection methods using standard fluorescent
		microspheres ranging in size and fluorescence intensity and
		fluorochrome-stained samples of cells from cultures of
		cyanobacteria, flagellates, and ciliates.  The methods
		included several variations based on the maximum intensity
		gradient of the sphere profile (first derivative), the
		minimum in the second derivative of the sphere profile, the
		minimum of the image histogram, and the midpoint intensity.
		Our results indicate that thresholds determined visually and
		by first-derivative methods tended to overestimate the
		threshold, causing an underestimation of microsphere size.
		The method based on the minimum of the second derivative of
		the profile yielded the most accurate area estimates for
		spheres of different sizes and brightnesses and for four
		of the five cell types tested.  A simple model of the optical
		properties of fluorescing objects and the video acquisition
		system is described which explains how the second derivative
		best approximates the position of the edge."
}

@INPROCEEDINGS{sieracki++:osm/poster,
	AUTHOR = "Sieracki, Michael E. and Reichenbach, Stephen E. and
		Webb, Kenneth L.",
	TITLE = "An Accurate, Automated Thresholding Method for Sizing
		Microscopic Fluorescent Objects by Image Analysis",
	BOOKTITLE = "Proceedings of the Ocean Sciences Meeting",
	MONTH = jan,
	YEAR = 1988,
	ORGANIZATION = "American Society of Limnology and
		Oceanography/American Geophysical Union",
	PLACE = "New Orleans, LA",
	DATE = "January 18-22, 1988",
	PAGES = "1744",
	XNOTE = "Poster, Abstract Only",
	PINFO = "Eos, 68:1744",
	ABSTRACT = "The accurate measurement of fluorescently stained cells
		using image analysis requires an accurate, reliable method
		of distinguishing the bright cells from a dark background.
		This is most commonly done by visually choosing a threshold
		intensity value which most closely coincides with the cells'
		outline as perceived by the operator.  Ideally an automated
		method based on the cell image characteristics should be
		used.  Segmentation of images containing light-emitting,
		microscopic fluorescent objects require special consideration
		in image analysis.  We tested 9 automated threshold selection
		methods using standard fluorescent microspheres which
		ranged in size and fluorescence intensity.  The methods
		included several variations based on the maximum intensity
		gradient of the sphere profile (first derivative), the
		minimum in the second derivative of the sphere profile, the
		minimum of the image histogram, and the midpoint intensity.
		Our results indicate that visual selection tended to
		overestimate the threshold leading to an average
		underestimation of sphere area by 12\%.  Thresholds from
		methods based on the first derivative were highly correlated
		with the visual threshold ($r^2 = 0.95$ to $0.98$, except for
		a particularly poor method, $r^2 = 0.24$).  The method
		based on the minimum of the second derivative of the sphere
		profile yielded the most accurate area estimations for
		spheres of different sizes and brightnesses.  A simple
		model of the optical properties of fluorescing objects and
		the video acquisition system is described which explains
		how the second derivative best approximates the position
		of the sphere edge."
}

@INPROCEEDINGS{sieracki++:osm/inv,
	AUTHOR = "Sieracki, Michael E. and Reichenbach, Stephen E. and
		Webb, Kenneth L.",
	TITLE = "Use of Color Image Analysis to Count, Size, and Classify
		Pico- and Nanoplankton Cells by Trophic Mode",
	BOOKTITLE = "Proceedings of the Ocean Sciences Meeting",
	MONTH = jan,
	YEAR = 1988,
	ORGANIZATION = "American Society of Limnology and
		Oceanography/American Geophysical Union",
	PLACE = "New Orleans, LA",
	DATE = "January 18-22, 1988",
	PAGES = "1761",
	XNOTE = "Invited, Abstract Only",
	PINFO = "Eos, 68:1761",
	ABSTRACT = "Epifluorescence microscopy is a method which has
		greatly improved our ability to study the microbial plankton
		community.  Visual methods, however, involve a great
		investment of time for enumerating phototrophic and
		heterotrophic plankton populations.  The use of color video
		digitization combined with a powerful microcomputer has
		allowed us to automate the counting, sizing and trophic
		classification of these cells.  Accurate size measurements
		of fluorescing cells require accurate determination of
		the threshold brightness separating cells in the image
		from the background.  This determination is not simple
		and visual standardization using fluorescent microspheres
		does not ensure accurate cell measurement.  Algorithms
		are described which are being developed to more accurately
		define the edge of fluorescing cells.  Classification of
		nanoplankton cells on the basis of the presence of
		red-fluorescing chlorophyll has proven to be quite accurate.
		Misclassification was less than 5\% on the basis of either
		the average red brightness or the total red mass per cell
		for a mixture of phototrophic and heterotrophic
		flagellates stained with fluorochrome proflavine.  A
		similar type of image analysis can distinguish the number of
		ingested bacterial-sized fluorescent particles in
		microflagellates.  The blue area (of blue fluorescing
		$0.5 \mu m$ diameter microspheres) within the green
		fluorescing (proflavine stained) cells accurately
		correlated with the number of ingested particles counted
		visually for cells containing between 0 and 3 particles.
		Color image analysis is a powerful tool for studying
		populations and processes of the microbial plankton
		community."
}

@ARTICLE{simonds:ao20/4,
	AUTHOR = "Simonds, R. M.",
	TITLE = "Two-Dimensional Modulation Transfer Functions of
		Image Scanning Systems",
	JOURNAL = AO,
	VOLUME = "20",
	NUMBER = "4",
	PAGES = "619--622",
	YEAR =  1981,
	ABSTRACT = "Image data processing based on optical scanning and
		digital reconstruction frequently ignores artifacts
		produced by the scanning process itself.  Characterization
		of these artifacts by measurement of system modulation
		transfer function (MTF) using the traditional knife-edge
		scan technique produces only one section of the 2-D MTF,
		and interpretation of this as representative of the
		complete MTF may yield misleading results.  A theoretical
		analysis is presented which allows reconstruction of
		the complete 2-D MTF from a sequence of knife-edge
		measurements, and an experimental example is shown for
		the case of a vidicon camera based scanning system."
}

@ARTICLE{simpson:revsciinstr50/6,
	AUTHOR = "Simpson, Raymond W.",
	TITLE = "Noise in Large-Aperture Self-Scanned Diode Arrays",
	JOURNAL = REVSCIINSTR,
	VOLUME = "50",
	NUMBER = "6",
	PAGES = "730--732",
	YEAR =  1979,
	ABSTRACT = "An equation for the random noise of self-scanned
		silicon photodiode arrays is developed which includes
		significant terms not previously considered.  It is
		shown that, including these terms, the new 2.5-mm-high
		self-scanned arrays are only slightly noisier than older
		arrays; but because of their much greater aperture,
		they can detect much smaller light fluxes than the
		older arrays even when used with simple, inexpensive
		amplifiers."
}

@ARTICLE{slepian:josa57/7,
	AUTHOR = "Slepian, D.",
	TITLE = "Linear Least-Squares Filtering of Distorted Images",
	JOURNAL = JOSA,
	VOLUME = "57",
	NUMBER = "7",
	PAGES = "918--922",
	YEAR =  1967,
	ABSTRACT = "In the model studied here, the illuminance $f$
		of a distorted image is assumed to be the sum of a spatially
		stationary noise process and the result of a convolution
		of the illuminance $g$ of the undistorted image with an
		optical point spread function $k$.  The illuminance $\hat{g}$
		of a restored image is obtained by a linear filtering
		operation of $f$.  We determine the filter that minimizes
		the mean squared error between $\hat{g}$ and $g$.  The
		case in which $k$ is stochastic (e.g., observations made
		through a turbulent atmosphere) is our main concern.",
	INDEX = "image formation,
		spread function"
}

@ARTICLE{smith:siamjam14/1,
	AUTHOR = "Smith, Harvey A.",
	TITLE = "Improvement of the Resolution of a Linear Scanning Device",
	JOURNAL = SIAMJAM,
	VOLUME = "14",
	NUMBER = "1",
	PAGES = "23--41",
	YEAR = 1966
}

@ARTICLE{smith:ao11/6,
	AUTHOR = "Smith, P. L.",
	TITLE = "New Technique for Estimating the {MTF} of an Imaging
		System from its Edge Response",
	JOURNAL = AO,
	VOLUME = "11",
	NUMBER = "6",
	PAGES = "1424--1425",
	YEAR = 1972
}

@ARTICLE{sondhi:pieee60/7,
	AUTHOR = "Sondhi, Man Mohan",
	TITLE = "Image Restoration: {The} Removal of Spatially Invariant
		Degradations",
	JOURNAL = PIEEE,
	VOLUME = "60",
	NUMBER = "7",
	PAGES = "842--853",
	YEAR = 1972,
	ABSTRACT = "This is a review of techniques for {\it digital}
		restoration of images.  Optical and other analog processors
		are not discussed.  Restoration is considered from the point
		of view of space-domain as well as of spatial-frequency-domain
		descriptions of images. Consideration is restricted to
		degradations arising from noise and spatially invariant
		blurring.  However, many of the space-domain methods apply,
		with minor modifications, to spatially varying blur as well.
		Some examples of restoration are included to illustrate the
		methods discussed. Included also is a section on methods
		whose potential has not yet been exploited for image
		restoration."
}

@ARTICLE{sorensen++:ieeeassp33/4,
	AUTHOR = "Sorensen, Henrik V. and Jones, Douglas L. and
		Burrus, C. Sidney and Heideman, Michael T.",
	TITLE = "On Computing the Discrete {Hartley} Transform",
	JOURNAL = IEEEASSP,
	VOLUME = "33",
	NUMBER = "4",
	PAGES = "1231--1238",
	YEAR = 1985,
	ABSTRACT = "The discrete Hartley transform (DHT) is a real-valued
		transform closely related to the DFT of a real-valued
		sequence.  Bracewell has recently demonstrated a radix-2
		decimation-in-time fast Hartley transform (FHT)
		algorithm.  In this paper a complete set of fast algorithms
		for computing the DHT is developed, including
		decimation-in-frequency, radix-4, split-radix, prime factor,
		and Winograd transform algorithms.  The philosophies of
		all common FFT algorithms are shown to be equally applicable
		to the computation of the DHT, and the FHT algorithms closely
		resemble their FFT counterparts.  The operation counts for
		the FHT algorithms are determined and compared to the counts
		for corresponding real-valued FFT algorithms.  The FHT
		algorithms are shown to always require the same number of
		multiplications, the same storage, and a few more additions
		than the real-valued FFT algorithms.  Even though computation
		of the FHT takes more operations, in some situations the
		inherently real-valued nature of the discrete Hartley
		transform may justify this extra cost."
}

@INPROCEEDINGS{speake+mersereau:icassp81,
	AUTHOR = "Speake, Theresa C. and Mersereau, Russell M.",
	TITLE = "An Interpolation Technique for Periodically Sampled
		Two-Dimensional Signals",
	BOOKTITLE = ICASSP,
	ORGANIZATION = "IEEE",
	PAGES = "1010--1013",
	YEAR = 1981,
	ABSTRACT = "Two-dimensional signals are usually represented
		for the purpose of digital processing as rectangularly
		sampled functions of two orthogonal independent
		variables.  It has been previously noted that sampling a
		signal on a hexagonal grid can offer substantial savings
		in digital storage and computation.  In this paper these
		two sampling schemes will be generalized, via a matrix
		description, to include arbitrarily sampled 2-D signals.
		Using this matrix description and a generalized
		discrete Fourier transform, a technique will be
		presented for interpolating a set of sample points from
		one sampling grid to an alternative one.  Since the
		analog signal from which the original samples were
		obtained is frequently unavailable for resampling,
		the ability to easily convert from one sampling scheme
		to another can be important in the efficient processing of
		a particular signal."
}

@ARTICLE{stockham:pieee60/7,
	AUTHOR = "Stockham, Jr., Thomas G.",
	TITLE = "Image Processing in the Context of a Visual Model",
	JOURNAL = PIEEE,
	VOLUME = "60",
	NUMBER = "7",
	PAGES = "828--842",
	YEAR = 1972,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{stockham++:pieee63/4,
	AUTHOR = "Stockham, Jr., Thomas G. and Cannon, Thomas M. and
		Ingebretsen, Robert B.",
	TITLE = "Blind Deconvolution Through Digital Signal Processing",
	JOURNAL = PIEEE,
	VOLUME = "63",
	NUMBER = "4",
	PAGES = "678--692",
	YEAR = 1975,
	ABSTRACT = "This paper addresses the problem of deconvolving
		two signals when {\it both} are unknown.  The authors
		call this problem {\it blind} deconvolution.  The
		discussion develops two related solutions which can be
		applied through digital signal processing in certain
		practical cases.  The case of reverberated and resonated
		sound forms the center of the development.  The specific
		problem of restoring old acoustic recordings provides an
		experimental test.  The important effects of noise and
		non-stationary signals lead to the detailed part of the
		presentation.  In addition, the paper presents results
		for the case of images degraded by some common forms
		of blur."
}

@ARTICLE{stuller:cgip1,
	AUTHOR = "Stuller, John A.",
	TITLE = "An Algebraic Approach to Image Restoration Filter Design",
	JOURNAL = CGIP,
	VOLUME = "1",
	PAGES = "107--122",
	YEAR = 1972,
	ABSTRACT = "The image restoration problem in a linear imaging
		system is formulated as the problem of minimizing the 
		effective radius of the system point spread function
		subject to a constraint on relative noise gain.  The
		problem is solved by reducing the imaging system under
		consideration to an equivalent sampled system and subsequently
		optimizing the sampled system by algebraic techniques.
		The analysis applies to unsampled, line scanned, and
		sampled systems and explicitely ({\it sic.}) accounts
		for spectrum foldover.  Truncation problems are avoided
		in the discrete case by formulating the optimum processing
		array as the solution to a finite dimensional eigenvector
		equation."
}

@ARTICLE{switzer:math_stats36/6,
	AUTHOR = "Switzer, Paul",
	TITLE = "A Random Set Process in the Plane with a {Markovian}
		Property",
	JOURNAL = "Annals of Mathematical Statistics",
	VOLUME = "36",
	NUMBER = "6",
	PAGES = "1859--1863",
	YEAR = 1965
}

@ARTICLE{tabatabai+mitchell:ieeepami6/2,
	AUTHOR = "Tabatabai, Ali J. and Mitchell, O. Robert",
	TITLE = "Edge Location to Subpixel Values in Digital Imagery",
	JOURNAL = IEEEPAMI,
	VOLUME = "6",
	NUMBER = "2",
	PAGES = "188--201",
	YEAR = 1984,
	ABSTRACT = "A new method for locating edges in digital data to
		subpixel values and which is invariant to additive and
		multiplicative changes in the data is presented.  For
		one dimensional edge patterns an ideal edge is fit to
		the data by matching moments.  It is shown that the edge
		location is related to the so-called ``Christoffel
		numbers.''  Also presented is the study of the effect
		of additive noise on edge location.  The method is
		extended to include two-dimensional edge patterns
		where a line equation is derived to locate an edge.
		This in turn is compared with the standard Hueckel
		edge operator.  An application of the new edge operator
		as an edge detector is also provided and is compared
		with Sobel and Hueckel edge detectors in presence and
		absence of noise.",
	INDEX = "edge detection,
		edge location,
		Hueckel operator,
		moments"
}

@ARTICLE{talmi+simpson:ao19/9,
	AUTHOR = "Talmi, Yair and Simpson, R. W.",
	TITLE = "Self-Scanned Photodiode Array: {A} Multichannel
		Spectrometric Detector",
	JOURNAL = AO,
	VOLUME = "19",
	NUMBER = "9",
	PAGES = "1401--1414",
	YEAR = 1980,
	ABSTRACT = "The performance characteristics of a 1024-element
		self-scanned photodiode array, related to its use as a
		multichannel spectrometric detector are described.  The
		parameters discussed include spectral and temporal
		response, blooming, geometric accuracy, noise sources,
		dynamic range, signal integration, and spectral as well
		as spatial resolution."
}

@ARTICLE{tatian:josa55/8,
	AUTHOR = "Tatian, Berge",
	TITLE = "Method for Obtaining the Transfer Function from the Edge
		Response Function",
	JOURNAL = JOSA,
	VOLUME = "55",
	NUMBER = "8",
	PAGES = "1014--1019",
	YEAR = 1965,
	ABSTRACT = "The transfer function is expressed as a trigonometric
		series whose coefficients are proportional to the sampled
		values of the edge response function.  The series may be
		modified by means of added terms to take into account the
		known asymptotic behavior of the edge response function.
		Numerical results are given for pure defocusing."
}

@ARTICLE{sezan+tekalp_ed:oe29/5,
	EDITOR = "Sezan, M. Ibrahim and Tekalp, A. Murat",
	TITLE = "Image Restoration and Reconstruction",
	JOURNAL = OE,
	VOLUME = "29",
	NUMBER = "5",
	YEAR = 1990
}

@ARTICLE{sezan+tekalp:oe29/5,
	AUTHOR = "Sezan, M. Ibrahim and Tekalp, A. Murat",
	TITLE = "Survey of Recent Developments in Digital Image Restoration",
	JOURNAL = OE,
	VOLUME = "29",
	NUMBER = "5",
	YEAR = 1990
}

@ARTICLE{tescher+andrews:ao11/4,
	AUTHOR = "Tescher, A. G. and Andrews, H. C.",
	TITLE = "Data Compression and Enhancement of Sampled Images",
	JOURNAL = AO,
	VOLUME = "11",
	NUMBER = "4",
	PAGES = "919--925",
	YEAR = 1972,
	ABSTRACT = "A two-dimensional sampled image can be represented by
		an equal number of spatial frequencies in the Fourier domain.
		However, due to physical limitations of the sampling process,
		there exists an effective cutoff frequency beyond which no
		information is preserved.  The knowledge of this cutoff
		frequency is very important, since a considerable amount
		of additional noise can be introduced by frequency
		components above this cutoff.  Availability of a sharp
		edge within the image allows, within the linear theory,
		the estimation of the transfer function of the digitizing
		process itself.  This calculated transfer function may be
		used for image enhancement below the cutoff frequency.  In
		addition, significant amount of data compression may be
		achieved by removing all spatial frequency terms above
		the cutoff frequency.  An example of this technique is
		developed utilizing a tribar resolution chart sampled at
		$1024 \times 1024$ points."
}

@ARTICLE{torre+poggio:ieeepami8/2,
	AUTHOR = "Torre, Vincent and Poggio, Tomaso A.",
	TITLE = "On Edge Detection",
	JOURNAL = IEEEPAMI,
	VOLUME = "8",
	NUMBER = "2",
	PAGES = "147--163",
	YEAR = "1986",
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{trussell+civanlar:ieeeassp32/2,
	AUTHOR = "Trussell, H. Joel and Civanlar, Mehmet R.",
	TITLE = "The Feasible Solution in Signal Restoration",
	JOURNAL = IEEEASSP,
	VOLUME = "32",
	NUMBER = "2",
	PAGES = "201--212",
	YEAR = "1984",
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{twomey:jacm10,
	AUTHOR = "Twomey, S.",
	TITLE = "On the Numerical Solution of Fredholm Integral Equations
		of the First Kind by Inversion of the Linear System
		Produced by Quadrature",
	JOURNAL = JACM,
	VOLUME = "10",
	NUMBER = "1",
	PAGES = "97--101",
	YEAR = 1963
}

@INPROCEEDINGS{tzou+hsing:spie534,
	AUTHOR = "Tzou, Kou-Hu and Hsing, To R.",
	TITLE = "A Study of the Discrete {Hartley} transform for
		Image Compression Applications",
	BOOKTITLE = "Architectures and Algorithms for Digital Image
		Processing II",
	PEDITOR = "Corbett, Francis J.",
	ORGANIZATION = SPIE,
	VOLUME = "534",
	PAGES = "108--115",
	YEAR = 1985,
	ABSTRACT = "The discrete Hartley transform (DHT) and its fast
		algorithm were introduced recently.  One of the advantages
		of the DHT is that the forward and inverse transforms are
		of the same form except for a normalization constant.
		Therefore, the forward and inverse transform can be
		implemented by the subroutine or hardware when the
		normalization constant is properly taken care of.  In this
		paper, the applications of the DHT to image compression
		are studied.  The distribution of the DHT coefficients is
		tested using the Kolmogorov-Smirnov goodness-of-fit test.
		The compression efficiency of DHT coding is found to be
		about the same as discrete Fourier transform (DFT) coding.
		The DHT coding system incorporated with a human visual
		system model is also studied and this system offers about
		the same subjective image quality as a straight forward
		DCT coding system."
}

@ARTICLE{wallace+mitchell:ieeepami2/6,
	AUTHOR = "Wallace, Timothy P. and Mitchell, Owen R.",
	TITLE = "Analysis of Three-Dimensional Movement Using Fourier
		Descriptors",
	JOURNAL = IEEEPAMI,
	VOLUME = "2",
	NUMBER = "6",
	YEAR = 1980,
	ABSTRACT = "TO BE TYPED",
	INDEX = "Fourier descriptors,
		interpolation,
		shape analysis,
		shape normalization,
		tracking"
}

@ARTICLE{wang+wang:electletters23/5,
	AUTHOR = "Wang, Z. and Wang, Y.",
	TITLE = "Comparative Study of Time Efficiency of Several
		Algorithms for Discrete W Transform and
		Discrete {Hartley} Transform",
	JOURNAL = EL,
	VOLUME = "23",
	NUMBER = "5",
	YEAR = 1987,
	ABSTRACT = "Subroutines for several algorithms for the
		computation of the discrete W transform and the
		discrete Hartley transform are implemented in a
		YNC-M240D computer for testing of their time efficiency.
		Results show that the subroutines for the
		fast W transform algorithm reported recently are
		more efficient than subroutines for radix-2,
		radix-4 and the split radix fast Hartley transform
		algorithms."
}

@ARTICLE{watson+poirson:josaa3/12,
	AUTHOR = "Watson, Andrew B. and Poirson, Allen",
	TITLE = "A Separable Two-Dimensional Discrete {Hartley} Transform",
	JOURNAL = JOSAA,
	VOLUME = "3",
	NUMBER = "12",
	PAGES = "2001--2004",
	ALSO = "Also NASA Technical Memorandum 88203 (1985)",
	YEAR = 1986,
	ABSTRACT = "Bracewell has proposed the Discrete Hartley Transform (DHT)
		as a substitute for the Discrete Fourier Transform (DFT),
		particularly as a means of convolution [J.  Opt. Soc. Am. 73,
		1832 (1983)].  Here we show that the most natural extension of
		the DHT to two dimensions fails to be separable in the
		two dimensions, and is therefore inefficient.  We consider an
		alternative separable form, and derive a corresponding
		convolution theorem.  We also argue that the DHT is unlikely
		to provide faster convolution than the DFT."
}

@ARTICLE{wendland:smptej92/10,
	AUTHOR = "Wendland, Broder",
	TITLE = "Extended Definition Television with High Picture
		Quality",
	JOURNAL = SMPTEJ,
	VOLUME = "92",
	NUMBER = "10",
	PAGES = "1028--1035",
	YEAR = 1983,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{westerink+roufs:smptej98/2,
	AUTHOR = "Westerink, Joyce H. D. M. and Roufs, Jacques A. J.",
	TITLE = "Subjective Image Quality as a Function of Viewing
		Distance, Resolution, and Picture Size",
	JOURNAL = SMPTEJ,
	VOLUME = "98",
	NUMBER = "2",
	YEAR = 1989,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{wiejak++:cvgip32,
	AUTHOR = "Wiejak, J. S. and Buxton, H. and Buxton, B. F.",
	TITLE = "Convolution with Separable Masks for Early Image
		Processing",
	JOURNAL = CVGIP,
	VOLUME = "32",
	NUMBER = "3",
	PAGES = "279--290",
	YEAR = 1985,
	ABSTRACT = "Computational techniques for implementing the
		Marr-Hildreth edge detection operator, $-\nabla^{2}G(r)$,
		and its space-time extensions are considered.
		It is shown how this kind of convolution operation
		may be carried out simply and efficiently by factorizing
		the mask and performing the multidimensional convolution
		as a sequence of one-dimensional convolutions.  For a
		$d$-dimensional mask of size $n$, the computational
		effort required in order to carry out the sequence of
		1D convolutions varies roughly as $d^{2}n compared
		to $n^d$ for a multidimensional convolution.
		Computational examples carried out on a SIMD machine
		(an ICL Distributed Array Processor---DAP) are
		described and it is shown that convolution with masks
		of radius $8$ on $64 \times 64$ images can be carried out
		in $13$ ms in two dimensions (mask support $\approx 200$
		pixels) and $21$ ms in three dimensions (support
		$\approx 2000$ pixels).  A brief comparison is made
		with the FFT technique for performing the convolution."
}

@ARTICLE{woods+radewan:ieeeit23/4,
	AUTHOR = "Woods, John W. and Radewan, Clark H.",
	TITLE = "{Kalman} Filtering in Two Dimensions",
	JOURNAL = IEEEIT,
	VOLUME = "23",
	NUMBER = "4",
	PAGES = "473--482",
	YEAR = 1977,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "The Kalman filtering method is extended to two
		dimensions.  The resulting computational load is found
		to be excessive.  Two new approximations are then
		introduced.  One, called the strip processor, updates
		a line segment at a time; the other, called the reduced
		update Kalman filter, is a scalar processor.  The
		reduced update Kalman filter is shown to be optimum in
		that it minimizes the post update mean-square error (mse)
		under the constraint of updating only the nearby
		previously processed neighbors.  The resulting filter
		is a general two-dimensional recursive filter."
}

@ARTICLE{woods:ieeeit25/5,
	AUTHOR = "Woods, John W.",
	TITLE = "Correction to `{Kalman} Filtering in Two
		Dimensions'\thinspace",
	JOURNAL = IEEEIT,
	VOLUME = "25",
	NUMBER = "5",
	PAGES = "628--629",
	YEAR = 1979,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A."
}

@ARTICLE{woods+ingle:ieeeassp29/2,
	AUTHOR = "Woods, John W. and Ingle, Vinay K.",
	TITLE = "{Kalman} Filtering in Two Dimensions: {Further} Results",
	JOURNAL = IEEEASSP,
	VOLUME = "29",
	NUMBER = "2",
	PAGES = "188--197",
	YEAR = 1981,
	ALSO = "Also in {\it Digital Image Processing and Analysis:
		Volume 1:  Digital Image Processing}, edited by
		Chellappa, Rama and Sawchuk, Alexander A.",
	ABSTRACT = "The two-dimensional reduced update Kalman filter
		was recently introduced.  The corresponding scalar filtering
		equations were derived for the case of estimating a
		Gaussian signal in white Gaussian noise and were shown to
		constitute a general nonsymmetric half-plane recursive
		filter.  This paper extends the method to the
		deconvolution problem of image restoration.  This paper
		also provides a more thorough treatment of the uniquely
		two-dimensional boundary condition problems.  Numerical
		and subjective examples are presented."
}

@ARTICLE{yeadon++:photosciengr14/2,
	AUTHOR = "Yeadon, Edward C. and Jones, Robert A. and Kelly, J. T.",
	TITLE = "Confidence Limits for Individual Modulation Transfer
		Function Measurements Based upon the Phase Transfer
		Function",
	JOURNAL = PHOTOSCIENGR,
	VOLUME = "14",
	NUMBER = "2",
	PAGES = "153--156",
	YEAR = 1970,
	ABSTRACT = "Edge gradient analysis is a method of obtaining
		the optical transfer function (OTF) of a camera system
		from edge images recorded on photographic film.  The OTF
		is obtained as the Fourier transform of the line spread
		function, which is the derivative of a suitably corrected
		edge trace.  For good quality optical systems, the spread
		function is symmetrical and the phase of the complex OTF
		is either zero or linear with frequency, depending on the
		choice of spread function origin.  Thus, any observed
		nonlinear phase component can be interpreted as due to
		photographic noise (granularity) on the edge trace.  By
		making certain reasonable assumptions about the nature of
		this noise, the phase component of the OTF can be used to
		estimate the reliability with which the real part of the
		measured OTF represents the true modulation transfer
		function (MTF).  A short computer program embodying these
		principles has been written.  Tests with both real edge
		traces and synthetic noisy edges have proved the reliability
		of the procedure."
}

@INPROCEEDINGS{young:spie397,
	AUTHOR = "Young, Ian T.",
	TITLE = "The Use of Digital Image Processing Techniques for
		the Calibration of Quantitative Microscopes",
	BOOKTITLE = "Applications of Digital Image Processing",
 	PEDITOR = "Oosterlinck, Andr{\'e} and Tescher, Andrew G.",
	ORGANIZATION = SPIE,
	VOLUME = "397",
	PAGES = "326--335",
	YEAR = 1983,
	ABSTRACT = "In the construction of several new quantitative microscope
		systems we have developed techniques for the measurement and
		calibration of spatial resolution, image sampling density,
		signal-to-noise ratio, photometric response, and shading.
		The approach makes use of several commercially available
		test specimens, a test slide that was specially developed,
		and a number of algorithms to provide calibration of the
		complete system from the input specimen to the stored
		digital image including optical, electro-optical, analog,
		and digital sources of signal degradation."
}

@ARTICLE{zakhor+oppenheim:ieeeassp35/11,
	AUTHOR = "Zakhor, Avideh and Oppenheim, Alan V.",
	TITLE = "Quantization Errors in the Computation of the
		Discrete Hartley Transform",
	JOURNAL = IEEEASSP,
	VOLUME = "35",
	NUMBER = "11",
	PAGES = "1592--1602",
	YEAR = 1987,
	ABSTRACT = "TO BE TYPED"
}

@ARTICLE{zwicke+kiss:ieeepami5/2,
	AUTHOR = "Zwicke, Philip E. and Kiss, Jr., Imre",
	TITLE = "A New Implementation of the Mellin Transform and its
		Application to Radar Classification of Ships",
	JOURNAL = IEEEPAMI,
	VOLUME = "5",
	NUMBER = "2",
	PAGES = "191--199",
	YEAR = 1983,
	ABSTRACT = "TO BE TYPED",
	INDEX = "feature extraction,
		Fourier-Mellin transform,
		Mellin transform,
		modified Mellin transform,
		radar signatures,
		scale invariant,
		ship classification"
}

@MASTERSTHESIS{brown,
	AUTHOR = "Brown, Donald E.",
	TITLE = "Digital Image Restoration: {A} Comparative Analysis",
	SCHOOL = "George Washington University",
	YEAR = 1987
}

@PHDTHESIS{reichenbach:optimal,
	AUTHOR = "Reichenbach, Stephen E.",
	TITLE = "Small-Kernel Image Restoration",
	SCHOOL = "College of William and Mary",
	MONTH = "July",
	YEAR = 1989
}

@PHDTHESIS{wood,
	AUTHOR = "Wood, Lynnette",
	TITLE = "Restoration for Sampled Imaging Systems",
	SCHOOL = "University of Arizona",
	YEAR = 1986
}