Quality-driven Poisson-guided Autoscanning
文献类型：期刊论文
| 作者 | Wu, Shihao; Sun, Wei; Long, Pinxin; Huang, Hui; Cohen-Or, Daniel; Gong, Minglun; Deussen, Oliver; Chen, Baoquan |
| 刊名 | ACM TRANSACTIONS ON GRAPHICS
 |
| 出版日期 | 2014 |
| 英文摘要 | We present a quality-driven, Poisson-guided autonomous scanning method. Unlike previous scan planning techniques, we do not aim to minimize the number of scans needed to cover the object's surface, but rather to ensure the high quality scanning of the model. This goal is achieved by placing the scanner at strategically selected Next-Best-Views (NBVs) to ensure progressively capturing the geometric details of the object, until both completeness and high fidelity are reached. The technique is based on the analysis of a Poisson field and its geometric relation with an input scan. We generate a confidence map that reflects the quality/fidelity of the estimated Poisson iso-surface. The confidence map guides the generation of a viewing vector field, which is then used for computing a set of NBVs. We applied the algorithm on two different robotic platforms, a PR2 mobile robot and a one-arm industry robot. We demonstrated the advantages of our method through a number of autonomous high quality scannings of complex physical objects, as well as performance comparisons against state-of-the-art methods. |
| 收录类别 | SCI |
| 原文出处 | http://dl.acm.org/citation.cfm?doid=2661229.2661242 |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/5980]  |
| 专题 | 深圳先进技术研究院_数字所 |
| 作者单位 | ACM TRANSACTIONS ON GRAPHICS |
| 推荐引用方式 GB/T 7714 | Wu, Shihao,Sun, Wei,Long, Pinxin,et al. Quality-driven Poisson-guided Autoscanning[J]. ACM TRANSACTIONS ON GRAPHICS,2014. |
| APA | Wu, Shihao.,Sun, Wei.,Long, Pinxin.,Huang, Hui.,Cohen-Or, Daniel.,...&Chen, Baoquan.(2014).Quality-driven Poisson-guided Autoscanning.ACM TRANSACTIONS ON GRAPHICS. |
| MLA | Wu, Shihao,et al."Quality-driven Poisson-guided Autoscanning".ACM TRANSACTIONS ON GRAPHICS (2014). |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。