版权说明 操作指南
首页 > 成果 > 详情

Robust line segment matching across views via ranking the line-point graph

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Wei, Dong;Zhang, Yongjun*;Liu, Xinyi*;Li, Chang;Li, Zhuofan
通讯作者:
Zhang, Yongjun;Liu, Xinyi
作者机构:
[Zhang, YJ; Liu, Xinyi; Zhang, Yongjun; Wei, Dong] Wuhan Univ, Sch Remote Sensing & Informat Engn, Wuhan 430079, Peoples R China.
[Li, Zhuofan; Li, Chang] Cent China Normal Univ, Key Lab Geog Proc Anal & Simulat, Wuhan 430079, Peoples R China.
通讯机构:
[Zhang, YJ; Liu, XY] W
Wuhan Univ, Sch Remote Sensing & Informat Engn, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
3D reconstruction;Graph rank;Line segment matching;Scene plane theory
期刊:
ISPRS Journal of Photogrammetry and Remote Sensing
ISSN:
0924-2716
年:
2021
卷:
171
页码:
49-62
基金类别:
The association graph unifies the geometry constraints for pairwise candidates, in which the node represents the point or line candidate and the edge represents the geometry constraint. Compared with other graph based algorithm (Beder, 2004, McAuley et al., 2010, Yang and Liu, 2017), the association graph in GLSM is unique for two aspects: (1) the geometry constraint is manly based on the local coplanar assumption, and the edge between line and point candidate is able to be established. (2) The
机构署名:
本校为其他机构
院系归属:
城市与环境科学学院
摘要:
Line segment matching in two or multiple views is helpful to 3D reconstruction and pattern recognition. To fully utilize the geometry constraint of different features for line segment matching, a novel graph-based algorithm denoted as GLSM (Graph-based Line Segment Matching) is proposed in this paper, which includes: (1) the employment of three geometry types, i.e., homography, epipolar, and trifocal tensor, to constrain line and point candidates across views; (2) the method of unifying different geometry constraints into a line-point associati...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com