Original article published here, Posted on March 18, 2009 by lidar

  1. A positive feedback loop is beginning to develop with readers submitting information.
  2. There is a LIDAR textbook that I just became aware of and 2 new digital documentation conferences – one in VA and the other in Japan.
  3. TerraSim is working on an SBIR grant to improve the automation of extracting road networks.

As they say,”It’s nice when a plan comes together”. I am beginning to receive information from reader’s of In The Scan that they would like me to share with the 3D laser scanning community. Over time this is going to lead to better communication and more awareness of new developments. Please keep them coming.

A couple of quick items before getting into feature extraction. Professor Jie Shan from Purdue University would like me to pass on the availability of a text book, Topographic Laser Ranging and Scanning, co-authored with Charles Toth from the Center for Mapping at Ohio State. I am hoping to receive a copy so that I can do a more complete review, but this was the most popular title at the recent ASPRS meeting, and it certainly appears to cover a broad range of important topics. Thanks to both authors for making me aware of this.

A couple of conference updates. Short notice on the first. It comes from Michal Raphael at Direct Dimensions in Owings Mills, MD. Michal has only been in the laser scanning business for 14 years – a true pioneer with vision. He reports that there is a digital heritage conference, CAA 2009, next week in Williamsburg,VA.

Secondly, Doug Pritchard from the Digital Design Studio in Scotland reminded me of the Digital Documentation 2009 conference that he is organizing next month in Glasgow, and he told me of the CIPA Symposium in Kyoto, Japan October 11 – 15, 2009. I will add the new ones to the conference page.

Now, on to some cutting edge feature extraction research being conducted by Wilson Harvey on behalf of TerraSim. I briefly mentioned this last week. This work is being funded under an SBIR – Small Business Innovation Research grant involving the USACE Topographic Engineering Center – TEC. They are a leader in developing new survey engineering and mapping technology for the Army. Having worked with them in the past they are great group to get to know, and they can really help small business to incubate new technologies. If you have an applied research topic this might be a great place to promote it.

TerraSim is focused in this SBIR on improving the automation of extracting road networks from LiDAR and panchromatic/multispectral imagery. This has its obvious military value, but the goal is to also transfer the technology into the commercial GIS space. Wilson gave a detailed presentation last week at ASPRS. It was part of session number 57.

TerraSim is exploring 2 broad classes of detectable roads – one where the process exploits elevation differences using the LiDAR data and the DTM, and a second where they exploit oriented patterns and color changes. In the latter class they start by “training” the software using a known road surface, and then look for matches using the pan/intensity attributes. They are using image morphology techniques to simplify the matching. The demo that I saw on this technique was very impressive.

The following images illustrate the segments automatically obtained from the classification/filtering process, and the final results showing the automated vs. the ground truth. If you would like more details please let me know.

- See more at: http://blog.lidarnews.com/lidar-textbook-automated-road-network-extraction/#sthash.5n46fuDS.dpuf

LiDAR Textbook & Automated Road Network Extractio

LiDAR Textbook & Automated Road Network Extraction的更多相关文章

  1. Restoring Road Network

    D - Restoring Road Network Time limit : 2sec / Memory limit : 256MB Score : 500 points Problem State ...

  2. Restoring Road Network(Floyd算法的推广)

    个人心得:看懂题目花费了不少时间,后面实现确实时间有点仓促了,只是简单的做出了判断是否为真假的情况, 后面看了题解发现其实在判断时候其实能够一起解决的,算了,基础比较差还是慢慢的来吧. 题意概述: 就 ...

  3. Restoring Road Network Floyd

    问题 C: Restoring Road Network 时间限制: 1 Sec  内存限制: 128 MB提交: 731  解决: 149[提交] [状态] [讨论版] [命题人:admin] 题目 ...

  4. AtCoder Regular Contest 083 D: Restoring Road Network

    题意 有一张无向带权连通图(点数<=300),给出任意两点i,j之间的最短路长度dis[i][j].问是否存在一张这样的无向图.如果不存在输出-1.如果存在输出所有这样的无向图中边权和最小的一张 ...

  5. 【Atcoder】ARC083 D - Restoring Road Network

    [算法]图论,最短路? [题意]原图为无向连通图,现给定原图的最短路矩阵,求原图最小边权和,n<=300. [题解]要求最小边权和下,原图的所有边一定是所连两端点的最短路. 那么现在将所有最短路 ...

  6. 【AtCoder Beginner Contest 074 D】Restoring Road Network

    [链接]h在这里写链接 [题意] 给你任意两点之间的最短路. 让你求出原图. 或者输出原图不存在. 输出原图的边长总和的最小值. [题解] floyd算法. 先在原有的矩阵上. 做一遍floyd. 如 ...

  7. [Arc083D/At3535] Restoring Road Network - 最短路,结论

    [Arc083D/At3535] 有 \(N\) 个城市,城市与城市之间用长度为整数的无向道路连接. 现有一考古学家找到了一张 \(N×N\) 的表 \(A\) ,这张表代表了这 \(N\) 座城市两 ...

  8. POJ 3204 Ikki's Story I - Road Reconstruction

    Ikki's Story I - Road Reconstruction Time Limit: 2000MS   Memory Limit: 131072K Total Submissions: 7 ...

  9. POJ3204 Ikki's Story I - Road Reconstruction

    Ikki's Story I - Road Reconstruction Time Limit: 2000MS   Memory Limit: 131072K Total Submissions: 7 ...

随机推荐

  1. Kubernetes : 多节点 k8s 集群实践

    说明: 本文参考 『 Kubernetes 权威指南 』 第一章的案例. 需要说明的是, 这本书里有很多描述的东西和实践的案例不吻合. Kubernets 集群架构 架构图 Server List 节 ...

  2. [bzoj2763][JLOI2011]飞行路线——分层图最短路

    水题.不多说什么. #include <bits/stdc++.h> using namespace std; const int maxn = 10010; const int maxk ...

  3. bootstrap-datetimepicker年视图中endDate设置之后比正常时间提前两个月

    问题 bootstrap-datetimepicker年视图中endDate设置结束时间为2016-08,(即8月之后的日期不能选)而在日历上显示时为2016-06,相差两个月,即6月之后的日期不能选 ...

  4. HDU2444(判断是否为二分图,求最大匹配)

    The Accomodation of Students Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ( ...

  5. Codeforces 106 DIV2 ACD

    B表示完全看不懂..就不弄了.. E字符串先不管了.到时候系统学下字符串再处理 A #include <map> #include <set> #include <lis ...

  6. [转]C++ 指针和引用

    转自http://www.cnblogs.com/tangxiaobo199181/ 作者:算法生活 微信公众号:算法生活 出处:http://www.cnblogs.com/tangxiaobo19 ...

  7. win32 listctrl控件右键菜单的实现

    HMENU Menu_list,Menu_all; POINT point; HINSTANCE hInstance;//下面代码放到BOOL WINAPI DialogProc下 case WM_C ...

  8. Redis-4.0.8 readme.md

    This README is just a fast *quick start* document. You can find more detailed documentation at [redi ...

  9. hdu 1281(最小点覆盖数)

    棋盘游戏 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submis ...

  10. linux下IPTABLES配置详解 (防火墙命令)

    linux下IPTABLES配置详解 -A RH-Firewall-1-INPUT -p tcp -m state --state NEW -m tcp --dport 24000 -j ACCEPT ...