No abstract

A novel statistical approach is undertaken for the adaptive estimation of the gain and bias nonuniformity in infrared focal-plane array sensors from scene data. The gain and the bias of each detector are regarded as random state variables modeled by a discrete-time Gauss-Markov process. The proposed Gauss-Markov framework provides a mechanism for capturing the slow and random drift in the fixed-pattern noise as the operational conditions of the sensor vary in time. With a temporal stochastic model for each detector's gain and bias at hand, a Kalman filter is derived that uses scene data, comprising the detector's readout values sampled over a short period of time, to optimally update the detector's gain and bias estimates as these parameters drift. The proposed technique relies on a certain spatiotemporal diversity condition in the data, which is satisfied when all detectors see approximately the same range of temperatures within the periods between successive estimation epochs. The performance of the proposed technique is thoroughly studied, and its utility in mitigating fixed-pattern noise is demonstrated with both real infrared and simulated imagery.

No abstract

It is, by now, well known that McIntyre's localized carrier-multiplication theory cannot explain the suppression of excess noise factor observed in avalanche photodiodes (APDs) that make use of thin multiplication regions. We demonstrate that a carrier multiplication model that incorporates the effects of dead space, as developed earlier by Hayat et al. provides excellent agreement with the impact-ionization and noise characteristics of thin InP, In/sub 0.52/Al/sub 0.48/As, GaAs, and Al/sub 0.2/Ga/sub 0.8/As APDs, with multiplication regions of different widths. We outline a general technique that facilitates the calculation of ionization coefficients for carriers that have traveled a distance exceeding the dead space (enabled carriers), directly from experimental excess-noise-factor data. These coefficients depend on the electric field in exponential fashion and are independent of multiplication width, as expected on physical grounds. The procedure for obtaining the ionization coefficients is used in conjunction with the dead-space-multiplication theory (DSMT) to predict excess noise factor versus mean-gain curves that are in excellent accord with experimental data for thin III-V APDs, for all multiplication-region widths. SECTION I.

We describe a new, to our knowledge, scene-based nonuniformity correction algorithm for array detectors. The algorithm relies on the ability to register a sequence of observed frames in the presence of the fixed-pattern noise caused by pixel-to-pixel nonuniformity. In low-to-moderate levels of nonuniformity, sufficiently accurate registration may be possible with standard scene-based registration techniques. If the registration is accurate, and motion exists between the frames, then groups of independent detectors can be identified that observe the same irradiance (or true scene value). These detector outputs are averaged to generate estimates of the true scene values. With these scene estimates, and the corresponding observed values through a given detector, a curve-fitting procedure is used to estimate the individual detector response parameters. These can then be used to correct for detector nonuniformity. The strength of the algorithm lies in its simplicity and low computational complexity. Experimental results, to illustrate the performance of the algorithm, include the use of visible-range imagery with simulated nonuniformity and infrared imagery with real nonuniformity.

No abstract

Abstract-A regeneration-theory approach is undertaken to analytically characterize the average overall completion time in a distributed system. The approach considers the heterogeneity in the processing rates of the nodes as well as the randomness in the delays imposed by the communication medium. The optimal one-shot load balancing policy is developed and subsequently extended to develop an autonomous and distributed load-balancing policy that can dynamically reallocate incoming external loads at each node. This adaptive and dynamic load balancing policy is implemented and evaluated in a two-node distributed system. The performance of the proposed dynamic load-balancing policy is compared to that of static policies as well as existing dynamic load-balancing policies by considering the average completion time per task and the system processing rate in the presence of random arrivals of the external loads.

No abstract