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

• 研究论文 • 上一篇    下一篇

一种组织进化的遮挡点恢复算法

彭亚丽1,2;刘芳1,2   

  1. (1. 西安电子科技大学 计算机学院,陕西 西安  710071;
    2. 西安电子科技大学 智能信息处理研究所,陕西 西安  710071)
  • 收稿日期:2012-04-10 出版日期:2013-08-20 发布日期:2013-10-10
  • 通讯作者: 彭亚丽
  • 作者简介:彭亚丽(1979-),女,西安电子科技大学博士研究生,E-mail: pengyxa@gmail.com.
  • 基金资助:

    国家自然科学基金资助项目(60805016);陕西省自然科学基础研究计划资助项目(2011JM8014);中央高校基本科研业务费资助项目(GK201302029)

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

摘要:

为了有效恢复遮挡点的真实位置,提出了一种组织进化的遮挡点恢复算法,该算法利用所有图像点构成一个秩4矩阵的特性,将遮挡点当作变量,建立遮挡点恢复的目标函数;然后利用组织进化算法对遮挡点进行全局搜索,将搜索的值作为遮挡点的位置,再利用所构造的目标函数对种群中的个体进行评价.经过多代进化,最后取最优值作为遮挡点的真实图像位置.该算法的优点是不需要取初始值,且平等地看待了来自同一场景中的所有图像及图像点.模拟实验和真实实验结果表明,该算法能够较好地恢复出遮挡点的位置,具有较小的重投影误差.

关键词: 遮挡点, 组织进化算法, 矩阵恢复

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

Baidu
map