DocumentCode
2553401
Title
Fast Covariance Matching Based on Genetic Algorithm
Author
Zhang, Xuguang ; Hu, Shuo ; Zhang, Limin ; Wu, Yuanhao
Author_Institution
Key Lab. of Ind. Comput. Control Eng. of Hebei Province, Yanshan Univ., Qinhuangdao, China
fYear
2010
fDate
23-25 Sept. 2010
Firstpage
1
Lastpage
4
Abstract
This paper proposes an effective framework to boost the efficiency of covariance matching. In this framework, covariance matrices are used to match object in complex environment by fusing multiple features. Then, Genetic Algorithm (GA) is employed to improve the processing speed of covariance matching. To take advantage of the property of GA for the optimization in large search spaces to covariance matching, a fitness function is designed using the distances between the covariance matrices of model and candidate regions. Experimental results show that the proposed approach can improve the processing speed of covariance matching observably. The computing speed of the proposed method is at least 7 times than that of exhaustive searching.
Keywords
covariance matrices; genetic algorithms; search problems; covariance matching; covariance matrices; exhaustive searching; fitness function; genetic algorithm; optimization; search space; Computational modeling; Covariance matrix; Feature extraction; Gallium; Genetic algorithms; Pixel; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-3708-5
Electronic_ISBN
978-1-4244-3709-2
Type
conf
DOI
10.1109/WICOM.2010.5600630
Filename
5600630
Link To Document