J4 ›› 2013, Vol. 40 ›› Issue (4): 137-141.doi: 10.3969/j.issn.1001-2400.2013.04.023

• Original Articles • Previous Articles     Next Articles

Organizational evolutionary algorithm for occlusion recovery

PENG Yali1,2;LIU Fang1,2   

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. Research Inst. of Intelligent Information Processing, Xidian Univ., Xi'an  710071, China)
  • Received:2012-04-10 Online:2013-08-20 Published:2013-10-10
  • Contact: PENG Yali E-mail:pengylxa@gmail.com

Abstract:

To effectively recover the occlusion real position, an organizational evolutionary algorithm for occlusion recovery is presented in this paper. The occlusions are regarded as the variants and the objective function is obtained based on the property that the rank of the matrix consists of all the image points is 4. And the value searched by organizational evolutionary is taken as the occlusion position. The individual of population is evaluated by the objective function. After several generations, the best individual is regarded as the occlusion position. The algorithm does not need the initial value and treats all the images and image points uniformly. Simulation and real data show that the algorithm can efficiently recover the occlusion.

Key words: occlusion, organizational evolutionary algorithm, matrix recovery