Bruce Merry
Abstract
Laser range scanning is commonly used in cultural heritage to create digital models of real-world artefacts. A large scanning campaign can produce billions of point samples—too many to be manipulated in memory on most computers. It is thus necessary to spatially partition the data so that it can be processed in bins or slices. We introduce a novel compression mechanism that exploits spatial coherence in the data to allow the bins to be computed with only 1.01 bytes of I/O traffic for each byte of input, compared to 2 or more for previous schemes. Additionally, the bins are loaded from the original files for processing rather than from a sorted copy, thus minimizing disk space requirements. We demonstrate that our method yields performance improvements in a typical point-processing task, while also using little memory and guaranteeing an upper bound on the number of samples held in-core.
- Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., and Taubin, G. 1999. The ball-pivoting algorithm for surface reconstruction. IEEE Trans. Visual. Comput. Graph. 5, 4 (October 1999), 349--359. Google Scholar
Digital Library
- Boesch, J. and Pajarola, R. 2009. Flexible configurable stream processing of point data. In Proceedings of the 17th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG 2009). 49--56.Google Scholar
- Bolitho, M., Kazhdan, M., Burns, R., and Hoppe, H. 2007. Multilevel streaming for out-of-core surface reconstruction. In Proceedings of the 5th Eurographics Symposium on Geometry Processing. Eurographics Association, 69--78. Google ScholarDigital Library
- Chiang, Y.-J., Silva, C. T., and Schroeder, W. J. 1998. Interactive out-of-core isosurface extraction. In Proceedings of the Conference on Visualization'98 (VIS'98). IEEE Computer Society Press, Los Alamitos, CA, 167--174. Google ScholarDigital Library
- Cignoni, P., Montani, C., Rocchini, C., and Scopigno, R. 2003. External memory management and simplification of huge meshes. IEEE Trans. Visual. Comput. Graph. 9, 4 (October 2003), 525--537. Google ScholarDigital Library
- Cuccuru, G., Gobbetti, E., Marton, F., Pajarola, R., and Pintus, R. 2009. Fast low-memory streaming MLS reconstruction of point-sampled surfaces. In Proceedings of Graphics Interface 2009. Canadian Information Processing Society, 15--22. Google ScholarDigital Library
- Duch, A., Estivill-Castro, V., and Martinez, C. 1998. Randomized K-dimensional binary search trees. In Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98). Springer-Verlag, Berlin, 199--208. Google ScholarDigital Library
- Elseberg, J., Magnenat, S., Siegwart, R., and Nüchter, A. 2012. Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration. J. Softw. Eng. Robot. 3, 1.Google Scholar
- Fiorin, V., Cignoni, P., and Scopigno, R. 2007. Out-of-core MLS reconstruction. In Proceedings of the 9th IASTED International Conference on Computer Graphics and Imaging (CGIM'07). 27--34. Google ScholarDigital Library
- Guennebaud, G. and Jacob, B. and others. 2010. Eigen v3. http://eigen.tuxfamily.org. (2010).Google Scholar
- Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W. 1992. Surface reconstruction from unorganized points. In Proceedings of the 19th Annual conference on Computer Graphics and Interactive Techniques (SIGGRAPH'92). ACM, New York, 71--78. Google ScholarDigital Library
- OpenMP Architecture Review Board. 2008. OpenMP Application Program Interface Version 3.0. http://www.openmp.org/mp-documents/spec30.pdf.Google Scholar
- Pajarola, R. 2005. Stream-processing points. In Proceedings of the Conference on Visualization'05. 239--246.Google Scholar
- Richter, R. and Döllner, J. 2010. Out-of-core real-time visualization of massive 3D point clouds. In Proceedings of the 7th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa (AFRIGRAPH'10). ACM, New York, 121--128. Google ScholarDigital Library
- Rüther, H., Held, C., Bhurtha, R., Schröder, R., and Wessels, S. 2011. Challenges in heritage documentation with terrestrial laser scanning. In Proceedings of the 1st AfricaGEO Conference.Google Scholar
- Wand, M., Berner, A., Bokeloh, M., Jenke, P., Fleck, A., Hoffmann, M., Maier, B., Staneker, D., Schilling, A., and Seidel, H.-P. 2008. Processing and interactive editing of huge point clouds from 3D scanners. Comput. Graph. 32, 2, 204--220. Google ScholarDigital Library
Index Terms
- Fast in-place binning of laser range-scanned point sets
Recommendations
On Clustering Validation in Metagenomics Sequence Binning
Advances in Bioinformatics and Computational BiologyAbstractIn clustering, one of the most challenging aspects is the validation, whose objective is to evaluate how good a clustering solution is. Sequence binning is a clustering task on metagenomic data analysis. The sequence clustering challenge is ...
MetaCoAG: Binning Metagenomic Contigs via Composition, Coverage and Assembly Graphs
Research in Computational Molecular BiologyAbstractMetagenomics has allowed us to obtain various genetic material from different species and gain valuable insights into microbial communities. Binning plays an important role in the early stages of metagenomic analysis pipelines. A typical pipeline ...
Health-Binning: Maximizing the Performance and the Endurance of Consumer-Level NAND Flash
SYSTOR '16: Proceedings of the 9th ACM International on Systems and Storage ConferenceIn recent years, the adoption of NAND flash in enterprise storage systems has been progressing rapidly. Todays all-flash storage arrays exhibit excellent I/O throughput, latency, storage density, and energy efficiency. However, the advancements in NAND ...
Comments