CAJ | 학술논문

为了提高计算机视觉领域中核心问题之一的基础矩阵估算的效率,基于条纹边界编码约束实现了一种快速估算方法.与传统的基于代数最小二乘法算法不同,该算法利用Hough变换将Hough半径作为最优化过程的最小化因子.在特定条纹边界编码的结构光投影系统模型下,利用条纹编码的共面性构造线性约束,采用Hough变换将同码像素映射到Hough空间,其交点的半径可作为最优化评价函数的最小化因子.再通过Levenberg-Marquardt最优化迭代过程估算出基本矩阵的全局最优解.实验结果表明了该算法的正确性,并证明了其可有效提高估算精度与效率.
위료제고계산궤시각영역중핵심문제지일적기출구진고산적효솔,기우조문변계편마약속실현료일충쾌속고산방법.여전통적기우대수최소이승법산법불동,해산법이용Hough변환장Hough반경작위최우화과정적최소화인자.재특정조문변계편마적결구광투영계통모형하,이용조문편마적공면성구조선성약속,채용Hough변환장동마상소영사도Hough공간,기교점적반경가작위최우화평개함수적최소화인자.재통과Levenberg-Marquardt최우화질대과정고산출기본구진적전국최우해.실험결과표명료해산법적정학성,병증명료기가유효제고고산정도여효솔.
In order to improve the performance of estimating the fundamental matrix, a key problem arising in stereo vision, a novel method based on stripe constraints is presented. In contrast to traditional methods based on algebraic least-square algorithms, the proposed approach aims to minimize a cost function that is derived from the minimum radius of the Hough transform. In a structured-light system with a particular stripe code pattern, there are linear constraints that the points with the same code are on the same surface. Using the Hough transform, the pixels with the same code map to the Hough space, and the radius of the intersections can be defined as the evaluation function in the optimization progress. The global optimum solution of the fundamental matrix can be estimated using a Levenberg-Marquardt optimization iterative process based on the Hough transform radius. Results illustrate the validity of this algorithm, and prove that this method can obtain good performance with high efficiency.