检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何楚[1,2] 杨芳[1] 石博[1] 徐新[1] 廖明生
机构地区:[1]武汉大学电子信息学院,武汉430072 [2]测绘遥感信息工程国家重点实验室,武汉430072
出 处:《哈尔滨工业大学学报》2013年第10期111-117,共7页Journal of Harbin Institute of Technology
基 金:国家重点基础研究发展计划项目(2013CB733404);国家自然科学基金资助项目(41371342;61331016);中国博士后科学基金资助(2011118);中国博士后科学基金特别资助(2012T50671)
摘 要:为了改善足迹跟踪算法在夹角较小的交叉路口容易出现将两足尖合并和不易检测波谷的问题,提出了一种新的立体路网提取算法.算法分为3个步骤:首先用足迹跟踪算法提取道路基元,然后在足迹图结构上建立道路模型,最后通过立体反演层次推理实现道路分层.结果表明:该算法通过对波峰合并的角度选择和波谷检测的偏差校正提高了道路基元提取的准确性,并结合立体反演推理算法实现了道路连接、高度设置和分层.最后在Google Earth提供的真实数据上进行实验验证了该算法能有效地体现立体交叉路口的层次,并能保证提取出来的道路的正确性、完整性.A new three-step method called stereoscopic intersection extraction based on footprint graph model is proposed in this paper. Firstly, the primitives are extracted by footprint, then the road model is built based on the graph of primitives, finally, the road lamination is realized by referring and reasoning. Though the footprint algorithm presented by Hu can be used to extract road primitives, there exist two problems, one is that two toes which are adjacent can be easily considered as one toe, and the other is that troughs are not likely to be detected, we solved these two problems by making some improvements. Then we use stereoscopic inferring algorithm to link the roads, set the heights of the roads and realize lamination. At last, we experiment on the dataset of Google earth, as a result, this algorithm can reflect the levels of the roads effectively, what' s more, the correctness being guaranteed, this algorithm still has strong robustness.
关 键 词:足迹跟踪 立体路网 交叉路口 道路提取 层次推理
分 类 号:TP75[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62