电子学报
電子學報
전자학보
ACTA ELECTRONICA SINICA
2014年
12期
2422-2428
,共7页
多视几何%摄像机矩阵%全局最优%禁忌搜索
多視幾何%攝像機矩陣%全跼最優%禁忌搜索
다시궤하%섭상궤구진%전국최우%금기수색
multiview geometry%resection%global optimization%taboo search
摄像机矩阵估计是机器视觉的一个重要问题。在2范数误差代价函数模型下,最小二乘法简单而有效,但因误差代价函数非凸,容易陷入局部最优。在无穷范数误差代价函数模型下,凸优化方法理论上可以获得全局最优,但计算效率较低,其计算耗时随着问题规模的增大而急剧增加。现代优化论中的增强连续禁忌搜索(Enhanced continu-ous taboo search,ECTS)方法具有逃离局部最优的优良性质,因此本文在2范数误差代价函数模型下提出一种针对摄像机矩阵估计的ECTS算法。在ECTS置信区间序列构造及最大置信区间选择环节,本文提出了一种非迭代的方法获取包含全局最优解的凸包。在增强禁忌搜索环节,本文提出了一种基于伪凸函数的候选解邻域构造方法。同时,给出了本文算法以概率1收敛于全局最优的理论证明。对虚拟场景和真实场景的实验结果表明本文算法可以快速获取摄像机矩阵估计的全局最优解。
攝像機矩陣估計是機器視覺的一箇重要問題。在2範數誤差代價函數模型下,最小二乘法簡單而有效,但因誤差代價函數非凸,容易陷入跼部最優。在無窮範數誤差代價函數模型下,凸優化方法理論上可以穫得全跼最優,但計算效率較低,其計算耗時隨著問題規模的增大而急劇增加。現代優化論中的增彊連續禁忌搜索(Enhanced continu-ous taboo search,ECTS)方法具有逃離跼部最優的優良性質,因此本文在2範數誤差代價函數模型下提齣一種針對攝像機矩陣估計的ECTS算法。在ECTS置信區間序列構造及最大置信區間選擇環節,本文提齣瞭一種非迭代的方法穫取包含全跼最優解的凸包。在增彊禁忌搜索環節,本文提齣瞭一種基于偽凸函數的候選解鄰域構造方法。同時,給齣瞭本文算法以概率1收斂于全跼最優的理論證明。對虛擬場景和真實場景的實驗結果錶明本文算法可以快速穫取攝像機矩陣估計的全跼最優解。
섭상궤구진고계시궤기시각적일개중요문제。재2범수오차대개함수모형하,최소이승법간단이유효,단인오차대개함수비철,용역함입국부최우。재무궁범수오차대개함수모형하,철우화방법이론상가이획득전국최우,단계산효솔교저,기계산모시수착문제규모적증대이급극증가。현대우화론중적증강련속금기수색(Enhanced continu-ous taboo search,ECTS)방법구유도리국부최우적우량성질,인차본문재2범수오차대개함수모형하제출일충침대섭상궤구진고계적ECTS산법。재ECTS치신구간서렬구조급최대치신구간선택배절,본문제출료일충비질대적방법획취포함전국최우해적철포。재증강금기수색배절,본문제출료일충기우위철함수적후선해린역구조방법。동시,급출료본문산법이개솔1수렴우전국최우적이론증명。대허의장경화진실장경적실험결과표명본문산법가이쾌속획취섭상궤구진고계적전국최우해。
Resection is one of important issues in machine vision.Although L2 norm based least square method is reasonably fast,the globally optimal solution cannot be obtained theoretically due to its non-convexity of the objective function .Optimization using the L∞norm has been becoming an effective way to solve parameter estimation problems in multiview geometry .But the computational cost increases rapidly with the size of measurement data .In the paper,we propose a novel approach under the frame-work of enhanced continuous taboo search (ECTS)for resection in multiview geometry .ECTS is an optimization method in the do-main of artificial intelligence,which has an interesting ability of covering a wide solution space by promoting the search far away from current solution and consecutively decreasing the possibility of trapping in the local minima .We propose the corresponding ways in the key steps of ECTS,diversification and intensification .We also present theoretical proof to guarantee the global conver-gence of search with probability one .Experimental results validate that the ECTS can obtain the global optimum effectively and effi-ciently .Potentially,the novel ECTS framework can be employed in many applications of multi-view geometry .