检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]四川大学计算机学院视觉合成重点学科实验室,成都610065
出 处:《四川大学学报(自然科学版)》2010年第6期1284-1288,共5页Journal of Sichuan University(Natural Science Edition)
基 金:国家自然科学基金(60705005);教育部新世纪人才支持计划(NCET-08-0370);博士点新教师基金(20070610031);高等学校博士学科点专项科研基金资助课题(20090181110052)
摘 要:文中提出了一种新的基于弱平行关系的灭点估计算法.算法的框架如下:在单幅图像中标记所有弱平行线段并计算其对应的弱平行关系度量值;选择那些具有较大弱平行关系度量值的弱平行线段,在图像上找到它们的伪灭点并用高斯分布模型和交叉迭代方法对选取的伪灭点进一步精确其对应的弱平行关系度量值;选择精化后的拥有较大弱平行关系度量值的伪灭点,用最小二次拟合方法来得到无穷远直线在图像平面上的投影直线.该方法避免了基于灭点的三维重建算法中要求先验得到平行关系的条件,而是以场景中更常见的无需先验知道的弱平行关系为三维重建基础,使算法具有了更广适用性和更好稳定性.The authors propose a novel algorithm for computing vanishing points from based on weak-parallel line segments and a concept of weak-parallel. The framework of t as follows, firstly, the line segments are obtained which are weak-parallel in the image, urements of weak-parallel between them is calculated; secondly, the pairwise line segm single image algorithm is en ents the meas- with large weak-parallel measurements are chosen to find the pseudo-vanishing points, and the points are confirmed by using Gaussian probability model and Cross-iteration method; finally, the pseudo-vanishing points with large weak-parallel measurements are selected to locate the projection of infinity line in the image plane. Compared to the 3-dimensional reconstruction algorithms partly based on strict parallel lines, the proposed algorithm is able to be used more widely and stably.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.37.17