Please use this identifier to cite or link to this item:
|Title:||Efficient constraint evaluation algorithms for hierarchical next-best-view planning||Authors:||Low, K.-L.
|Issue Date:||2007||Citation:||Low, K.-L.,Lastra, A. (2007). Efficient constraint evaluation algorithms for hierarchical next-best-view planning. Proceedings - Third International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2006 : 830-837. ScholarBank@NUS Repository. https://doi.org/10.1109/3DPVT.2006.52||Abstract:||We recently proposed a new and efficient next-bestview algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evaluating the view metric function by using an adaptive hierarchical approach to exploit the various spatial coherences inherent in the acquisition constraints and quality requirements. The impressive speedups have allowed our NBV algorithm to become the first to be able to exhaustively evaluate a large set of 3D views with respect to a large set of surfaces, and to include many practical acquisition constraints and quality requirements. The success of the algorithm is greatly dependent on the implementation efficiency of the constraint and quality evaluations. In this paper, we describe the algorithmic details of the hierarchical view evaluation, and present efficient algorithms that evaluate sensing constraints and surface sampling densities between a view volume and a surface patch instead of simply between a single view point and a surface point. The presentation here provides examples for the design of efficient algorithms for new sensing constraints. © 2006 IEEE.||Source Title:||Proceedings - Third International Symposium on 3D Data Processing, Visualization, and Transmission, 3DPVT 2006||URI:||http://scholarbank.nus.edu.sg/handle/10635/40921||ISBN:||0769528252||DOI:||10.1109/3DPVT.2006.52|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 21, 2019
checked on Apr 19, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.