Pedro Victor Vieira De Paiva
Abstract
Point clouds resulting from digital scanning are increasingly being used in the heritage field to create knowledge-based models, such as building information models (BIM). Nevertheless, the use of digital image processing techniques in point cloud unorganized data is not well explored yet because of the lack of information about point adjacency and corresponding difficulty in structuring and manipulating data. In this study we propose an approach to deal with image processing-like mathematical morphological operations in unorganized point cloud using the octree graph. Our method consists of three main steps, namely: (i) computing the best distance value between points in the cloud; (ii) constructing an octree from point cloud; and (iii) producing a graph using rectangular layout. We exemplify the use of the proposed methodology performing morphological operations in grayscale and color point clouds of historical buildings. Results prove the effectiveness of the octree representation, which can efficiently generate an adjacency map, demonstrated by the resulting images, and has the potential to be applied at different areas of 3D data analysis.
- [1] . 2015. Pixel and voxel representations of graphs. In International Symposium on Graph Drawing and Network Visualization. Springer, 472–486.Google Scholar
- [2] . 2003. Computing and rendering point set surfaces. IEEE Transactions on Visualization and Computer Graphics 9, 1 (2003), 3–15.Google ScholarDigital Library
- [3] . 2015. Morphological PDE and dilation/erosion semigroups on length spaces. In International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing. Springer, 509–521.Google Scholar
- [4] . 2020. Mathematical morphology directly applied to point cloud data. ISPRS Journal of Photogrammetry and Remote Sensing 168 (2020), 208–220.Google ScholarCross Ref
- [5] . 2008. Rectangular layouts and contact graphs. ACM Transactions on Algorithms (TALG) 4, 1 (2008), 8.Google Scholar
- [6] . 2014. Point morphology. ACM Transactions on Graphics (TOG) 33, 4 (2014), 45.Google ScholarDigital Library
- [7] . 2008. Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing. IEEE Trans. Image Processing 17, 7 (2008), 1047–1060.Google ScholarDigital Library
- [8] . 2016. Morphological PDEs on graphs for image processing on surfaces and point clouds. ISPRS International Journal of Geo-Information 5, 11 (2016), 213.Google ScholarCross Ref
- [9] . 2018. Towards efficient implementation of an octree for a large 3D point cloud. Sensors 18, 12 (2018), 4398.Google ScholarCross Ref
- [10] . 1992. Graph Morphology in Image Analysis. Marcel Dekker, New York, USA.Google Scholar
- [11] . 1992. Graph morphology. Journal of Visual Communication and Image Representation 3, 1 (1992), 24–38.Google ScholarDigital Library
- [12] . 1980. Oct-trees and their use in representing three-dimensional objects. Computer Graphics and Image Processing 14, 3 (1980), 249–270.Google ScholarCross Ref
- [13] . 2011. Efficient sparse voxel octrees. IEEE Transactions on Visualization and Computer Graphics 17, 8 (2011), 1048–1059.Google ScholarDigital Library
- [14] . 2020. Learning from synthetic point cloud data for historical buildings semantic segmentation. J. Comput. Cultural Heritage 13, 4 (2020).Google ScholarDigital Library
- [15] . 2009. Fast approximate nearest neighbors with automatic algorithm configuration. VISAPP (1) 2, 331–340 (2009), 2.Google Scholar
- [16] . 2020. Historical building point cloud segmentation combining hierarchical watershed transform and curvature analysis. Pattern Recognition Letters 135 (2020), 114–121.Google ScholarCross Ref
- [17] . 2000. An efficient parametric algorithm for octree traversal. In Journal of WSCG. 212–219.Google Scholar
- [18] . 2018. An automated mathematical morphology driven algorithm for water body extraction from remotely sensed images. ISPRS Journal of Photogrammetry and Remote Sensing 146 (2018), 11–21.Google ScholarCross Ref
- [19] . 2015. Automatic detection of zebra crossings from mobile LiDAR data. Optics & Laser Technology 70 (2015), 63–70.Google ScholarCross Ref
- [20] . 2015. Octree-based region growing for point cloud segmentation. ISPRS Journal of Photogrammetry and Remote Sensing 104 (2015), 88–100.Google ScholarCross Ref
- [21] . 1999. Airborne laser scanning–an introduction and overview. ISPRS Journal of Photogrammetry and Remote Sensing 54, 2 (1999), 68–82.Google ScholarCross Ref
- [22] . 2000. Elements of Photogrammetry with Applications in GIS. McGraw-Hill New York.Google Scholar
Index Terms
- Morphological Operations on Unorganized Point Clouds Using Octree Graphs
Recommendations
Morphological filtering on graphs
We study some basic morphological operators acting on the lattice of all subgraphs of an arbitrary (unweighted) graph G. To this end, we consider two dual adjunctions between the edge set and the vertex set of G. This allows us (i) to recover the ...
Star coloring of graphs
A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. The star chromatic number of an undirected graph G, denoted by χs(G), is ...
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique ...
Comments