Fast registration and reconstruction of aliased low-resolution frames by use of a modified maximum-likelihood approach

被引:9
作者
Alam, MS [1 ]
Bognar, JG
Cain, S
Yasuda, BJ
机构
[1] Purdue Univ, Dept Elect Engn, Ft Wayne, IN 46805 USA
[2] Indiana Univ, Grad Fac, Bloomington, IN 47404 USA
[3] Technol Sci Serv Inc, Dayton, OH 45437 USA
[4] Wright Lab, Sensor Technol Branch, WL AAJT, Wright Patterson AFB, Dayton, OH 45433 USA
关键词
D O I
10.1364/AO.37.001319
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
During the process of microscanning a controlled vibrating mirror typically is used to produce subpixel shifts in a sequence of forward-looking infrared (FLIR) images. If the FLIR is mounted on a moving platform, such as an aircraft, uncontrolled random vibrations associated with the platform can be used to generate the shifts. Iterative techniques such as the expectation-maximization (EM) approach by means of the maximum-likelihood algorithm can be used to generate high-resolution images from multiple randomly shifted aliased frames. In the maximum-likelihood approach the data are considered to be Poisson random variables and an EM algorithm is developed that iteratively estimates an unaliased image that is compensated for known imager-system blur while it simultaneously estimates the translational shifts. Although this algorithm yields high-resolution images from a sequence of randomly shifted frames, it requires significant computation time and cannot be implemented for real-time applications that use the currently available high-performance processors. The new image shifts are iteratively calculated by evaluation of a cost function that compares the shifted and interlaced data frames with the corresponding values in the algorithm's latest estimate of the high-resolution image. We present a registration algorithm that estimates the shifts in one step. The shift parameters provided by the new algorithm are accurate enough to eliminate the need for iterative recalculation of translational shifts. Using this shift information, we apply a simplified version of the EM algorithm to estimate a high-resolution image hom a given sequence of video frames. The proposed modified EM algorithm has been found to reduce significantly the computational burden when compared with the original EM algorithm, thus making it more attractive for practical implementation. Both simulation and experimental results are presented to verify the effectiveness of the proposed technique. (C) 1998 Optical Society of America.
引用
收藏
页码:1319 / 1328
页数:10
相关论文
共 19 条
[1]   High resolution infrared image reconstruction using multiple, randomly shifted, low resolution, aliased frames [J].
Alam, MS ;
Bognar, JG ;
Hardie, RC ;
Yasuda, BJ .
INFRARED IMAGING SYSTEMS: DESIGN, ANALYSIS, MODELLING, AND TESTING VIII, 1997, 3063 :102-112
[2]  
ALAM MS, IN PRESS 1996 ANN RE
[3]  
ARMSTRONG E, 1996, KP 1996 IRIS SPEC GR, V1, P359
[4]  
CAIN S, 1996, P 1996 IRIS SPEC GRO, V1, P377
[5]   ALIASING REDUCTION IN STARING INFRARED IMAGERS UTILIZING SUBPIXEL TECHNIQUES [J].
GILLETT, JC ;
STADTMILLER, TM ;
HARDIE, RC .
OPTICAL ENGINEERING, 1995, 34 (11) :3130-3137
[6]  
Gonzalez R.C., 1992, DIGITAL IMAGE PROCES
[7]  
Goodman J.W., 1996, Opt. Eng, V35, P1513, DOI DOI 10.1016/J.APSUSC.2017.08.033
[8]   Joint MAP registration and high-resolution image estimation using a sequence of undersampled images [J].
Hardie, RC ;
Barnard, KJ ;
Armstrong, EE .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1997, 6 (12) :1621-1633
[9]  
HUNG YP, 1990, SPIE, V1260, P36
[10]   IMPROVING RESOLUTION BY IMAGE REGISTRATION [J].
IRANI, M ;
PELEG, S .
CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1991, 53 (03) :231-239