TY - GEN
T1 - Progressive constrained energy minimization for subpixel detection
AU - Wang, Yulei
AU - Schultz, Robert
AU - Chen, Shih Yu
AU - Liu, Chunhong
AU - Chang, Chein I.
PY - 2013
Y1 - 2013
N2 - Constrained energy minimization (CEM) has been widely used for subpixel detection. It makes use of the sample correlation matrix R by suppressing the background thus enhancing detection of targets of interest. In many real world problems, implementing target detection on a timely basis is crucial, specifically moving targets. However, since the calculation of the sample correlation matrix R needs the complete data set prior to its use in detection, CEM is prevented from being implemented as a real time processing algorithm. In order to resolve this dilemma, the sample correlation matrix R must be replaced with a causal sample correlation matrix formed by only those data samples that have been visited and the currently being processed data sample. This causality is a pre-requisite to real time processing. By virtue of such causality, designing and developing a real time processing version of CEM becomes feasible. This paper presents a progressive CEM (PCEM) where the causal sample correlation matrix can be updated sample by sample. Accordingly, PCEM allows the CEM to be implemented as a causal CEM (C-CEM) as well as real time (RT) CEM via a recursive update equation in real time.
AB - Constrained energy minimization (CEM) has been widely used for subpixel detection. It makes use of the sample correlation matrix R by suppressing the background thus enhancing detection of targets of interest. In many real world problems, implementing target detection on a timely basis is crucial, specifically moving targets. However, since the calculation of the sample correlation matrix R needs the complete data set prior to its use in detection, CEM is prevented from being implemented as a real time processing algorithm. In order to resolve this dilemma, the sample correlation matrix R must be replaced with a causal sample correlation matrix formed by only those data samples that have been visited and the currently being processed data sample. This causality is a pre-requisite to real time processing. By virtue of such causality, designing and developing a real time processing version of CEM becomes feasible. This paper presents a progressive CEM (PCEM) where the causal sample correlation matrix can be updated sample by sample. Accordingly, PCEM allows the CEM to be implemented as a causal CEM (C-CEM) as well as real time (RT) CEM via a recursive update equation in real time.
UR - http://www.scopus.com/inward/record.url?scp=84881133234&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881133234&partnerID=8YFLogxK
U2 - 10.1117/12.2015447
DO - 10.1117/12.2015447
M3 - Conference contribution
AN - SCOPUS:84881133234
SN - 9780819495341
T3 - Proceedings of SPIE - The International Society for Optical Engineering
BT - Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIX
T2 - Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIX
Y2 - 29 April 2013 through 2 May 2013
ER -