Fast algorithms for video target detection and tracking

被引:0
作者
Li, Changchun [1 ]
Si, Jennie [1 ]
Abousleman, Glen P. [2 ]
机构
[1] Arizona State Univ, Tempe, AZ 85287 USA
[2] Gen Dynam C4 Syst, Scottsdale, AZ 85257 USA
来源
SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION XVII | 2008年 / 6968卷
关键词
infrared video; target tracking; image registration; human recognition; cross correlation;
D O I
10.1117/12.777227
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper addresses two problems commonly associated with video target tracking system. First, video target detection and tracking usually require extensive searching in a large space to find the best matches for preregistered templates. Existing fast search methods cannot guarantee a global optimal match, which results in substandard performance. To obtain a true global match, a full search at the pixel or sub-pixel level is required. Obviously., this introduces significant computational overhead, which limits the implementation of these algorithms in real-time applications. In this paper, we propose a fast method to compute two-dimensional normalized cross-correlations to efficiently find the global optimal match result from a large image area. Comparisons and complexity analysis are provided to show the efficiency of the proposed algorithm. Second, another challenge commonly faced by detection and tracking systems is the accurate detection of target orientation in a two-dimensional image. This problem is motivated by applications where the walk-in and walk-out people need to be detected and a fast image registration method is needed to compensate the change in rotation, translation and size, which is natural since the target's distance from the camera is changing dramatically. To address this issue, we propose a novel and efficient eigenvector-based method to detect target orientation and apply it into automatic human recognition system. Experimental and real-world test results verify that the proposed fast algorithm achieves similar accuracy as the recursive registration method which is computationally expensive.
引用
收藏
页数:9
相关论文
共 8 条
[1]   A tutorial on Support Vector Machines for pattern recognition [J].
Burges, CJC .
DATA MINING AND KNOWLEDGE DISCOVERY, 1998, 2 (02) :121-167
[2]   FAST FOURIER-TRANSFORMS - A TUTORIAL REVIEW AND A STATE-OF-THE-ART [J].
DUHAMEL, P ;
VETTERLI, M .
SIGNAL PROCESSING, 1990, 19 (04) :259-299
[3]  
Gastaud M, 2002, IEEE WORKSHOP ON MOTION AND VIDEO COMPUTING (MOTION 2002), PROCEEDINGS, P90, DOI 10.1109/MOTION.2002.1182219
[4]   DISPLACEMENT MEASUREMENT AND ITS APPLICATION IN INTERFRAME IMAGE-CODING [J].
JAIN, JR ;
JAIN, AK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (12) :1799-1808
[5]  
KOGA T, 1981, NAT TEL C, P1
[6]   Distinctive image features from scale-invariant keypoints [J].
Lowe, DG .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 60 (02) :91-110
[7]  
Lucas B.D., 1981, P IM UND WORKSH, P121
[8]  
TSAI A, 2001, COMP VIS PATT REC 20