Share Email Print

Proceedings Paper

Optimal scheduling of capture times in a multiple-capture imaging system
Author(s): Ting Chen; Abbas El Gamal
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Several papers have discussed the idea of extending image sensor dynamic range by capturing several images during a normal exposure time. Most of these papers assume that the images are captured according to a uniform or an exponentially increasing exposure time schedule. Even though such schedules can be justified by certain implementation considerations, there has not been any systematic study of how capture time schedules should be optimally determined. In this paper we formulae the multiple capture time scheduling problem when the incident illumination probability density function (pdf) is completely known as a constrained optimization problem. We aim to find the capture times that maximize the average signal SNR. The formulation leads to a general upper bound on achievable average SNR using multiple capture for any given illumination pdf. For a uniform pdf, the average SNR is a concave function in capture times and therefore well-known convex optimization techniques can be applied to find the global optimum. For a general piece-wise uniform pdf, the average SNR is not necessarily concave. The cost function, however, is a Difference of Convex (D.C.) function and well-established D.C. or global optimization techniques can be used.

Paper Details

Date Published: 24 April 2002
PDF: 9 pages
Proc. SPIE 4669, Sensors and Camera Systems for Scientific, Industrial, and Digital Photography Applications III, (24 April 2002); doi: 10.1117/12.463433
Show Author Affiliations
Ting Chen, Stanford Univ. (United States)
Abbas El Gamal, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 4669:
Sensors and Camera Systems for Scientific, Industrial, and Digital Photography Applications III
Nitin Sampat; Morley M. Blouke; John Canosa; John Canosa; Nitin Sampat, Editor(s)

© SPIE. Terms of Use
Back to Top