Share This Article:

Compression of LiDAR Data Using Spatial Clustering and Optimal Plane-Fitting

Abstract Full-Text HTML XML Download Download as PDF (Size:1699KB) PP. 58-62
DOI: 10.4236/ars.2013.22008    6,378 Downloads   8,987 Views   Citations
Author(s)    Leave a comment

ABSTRACT

With the advancement in geospatial data acquisition technology, large sizes of digital data are being collected for our world. These include air- and space-borne imagery, LiDAR data, sonar data, terrestrial laser-scanning data, etc. LiDAR sensors generate huge datasets of point of multiple returns. Because of its large size, LiDAR data has costly storage and computational requirements. In this article, a LiDAR compression method based on spatial clustering and optimal filtering is presented. The method consists of classification and spatial clustering of the study area image and creation of the optimal planes in the LiDAR dataset through first-order plane-fitting. First-order plane-fitting is equivalent to the Eigen value problem of the covariance matrix. The Eigen value of the covariance matrix represents the spatial variation along the direction of the corresponding eigenvector. The eigenvector of the minimum Eigen value is the estimated normal vector of the surface formed by the LiDAR point and its neighbors. The ratio of the minimum Eigen value and the sum of the Eigen values approximates the change of local curvature, which determines the deviation of the surface formed by a LiDAR point and its neighbors from the tangential plane formed at that neighborhood. If the minimum Eigen value is close to zero for example, then the surface consisting of the point and its neighbors is a plane. The objective of this ongoing research work is basically to develop a LiDAR compression method that can be used in the future at the data acquisition phase to help remove fake returns and redundant points.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

T. Ali, "Compression of LiDAR Data Using Spatial Clustering and Optimal Plane-Fitting," Advances in Remote Sensing, Vol. 2 No. 2, 2013, pp. 58-62. doi: 10.4236/ars.2013.22008.

References

[1] N. Memon, K. Sayood and S. Magliveras, “Lossless Compression of Multispectral Image Data,” IEEE Transactions on Geoscience and Remote Sensing, Vol. 32, No. 2, 1994, pp. 282-289. doi:10.1109/36.295043
[2] D. A. Algarni, “Compression of Remotely Sensed Data Using JPEG,” International Archives of Photogrammetry and Remote Sensing, Vol. 31, No. B3, 1996, pp. 24-28.
[3] Z. Li, X. Yuan and K. Lam, “Effects of JPEG Compression on the Accuracy of Photogrammetric Point Determination,” Journal of Photogrammetric Engineering and Remote Sensing, Vol. 68, No. 8, 2002, pp. 847-853.
[4] T. A. Ali, “On the Selection of Appropriate Interpolation Method for Creating Coastal Terrain Models from LiDAR Data,” Proceedings of the American Congress on Surveying and Mapping (ACSM) Conference, Nashville, 16-21 April 2004, 18p.
[5] J. Wu and K. Amaratunga, “Wavelet Triangulated Irregular Networks,” International Journal of Geographical Information Science, Vol. 17, No. 3, 2003, pp. 273-289. doi:10.1080/1365881022000016016
[6] B. Pradhan, S. Mansor, A. Ramli, A. Sharif and K. Sandeep, “LIDAR Data Compression Using Wavelets,” Proceedings of Society of Photo-Optical Instrumentation Engineers (SPIE) Conference, Bruges, 19-22 September 2005, pp. 768-786.
[7] B. Pradhan, S. Kumar, S. Mansor, A. Ramli and A. Sharif, “Light Detection and Ranging (LIDAR) Data Compression,” KMITL Science and Technology Journal, Vol. 5, No. 3, 2005, pp. 515-526.
[8] T. A. Ali and A. Mehrabian, “A Novel Computational Paradigm for Creating a Triangular Irregular Network (TIN) from LiDAR Data,” Nonlinear Analysis: Theory, Methods and Applications, Vol. 71, No. 12, 2009, pp. 624-629. doi:10.1016/j.na.2008.11.081
[9] L. Shapiro and G. Stockman, “Computer Vision,” Prentice-Hall, New Jersey, 2001.
[10] D. Dori and W. Liu, “Sparse Pixel Vectorization: An Algorithm and Its Performance Evaluation,” IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 21, No. 3, 1999, pp. 202-215. doi:10.1109/34.754586
[11] K. Zalik and B. Zalik, “A Sweep-Line Algorithm for Spatial Clustering,” Advances in Engineering Software, Vol. 40, No. 1, 2009, pp. 445-451. doi:10.1016/j.advengsoft.2008.06.003
[12] K.-H. Bae and D. Lichti, “A Method for Automated Registration of Unorganized Point Clouds,” ISPRS Journal of Photogrammetry & Remote Sensing, Vol. 63, No. 1, 2008, pp. 36-54. doi:10.1016/j.isprsjprs.2007.05.012

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.