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. © 2010 IEEE.
Author supplied keywords
Cite
CITATION STYLE
Zhang, X., Hu, S., Zhang, L., & Wu, Y. (2010). Fast covariance matching based on Genetic Algorithm. In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2010. https://doi.org/10.1109/WICOM.2010.5600630
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.