Multimedia Tools and Applications

, Volume 77, Issue 21, pp 29077–29097 | Cite as

Robust watermarking of airborne LiDAR data

  • Bogdan Lipuš
  • Borut Žalik


This paper presents a novel robust approach developed specially for watermarking airborne LiDAR data, which consist of a large cloud of geo-referenced points and has some unique characteristics. The approach consists of the following steps: (1) Defining the marker circular areas, in which the watermark bit will be embedded; (2) Dividing the marker circular areas uniformly into smaller circular areas by applying the sunflower seed distribution algorithm; (3) Using the points in these smaller circular areas to construct the input values for the Discrete Cosine Transformation (DCT); (4) Changing the last DCT coefficient; (5) Perform Inverse Discrete Cosine Transformation (IDCT), and perturbing the points within smaller circular areas according to the output values from this inverse transformation. Applying our approach, the watermark was dispersed into a set of points within the marker circular areas. The watermark bits are embedded multiple times in different marker circular areas. Thus, the robustness of the watermark was increased against various attacks. The watermark extraction process is practically the same, except in the final step, in which only the sign of each last DCT coefficient is checked, and decisions are made about the value of the watermark bits. Several experiments were performed to analyse the robustness of our watermarking schema against the most probable attacks.


3D point-sampled geometry Digital watermarking Security 3D point cloud authentication and identification Data hiding Light Detection And Ranging (LiDAR) 



This work was supported by the Slovenian Research Agency under Grants P2-0041 and J2-6764.


  1. 1.
    Agarwal P, Prabhakaran B (2009) Robust blind watermarking of point-sampled geometry. IEEE Trans Inf Forensics Secur 4(1):36–48CrossRefGoogle Scholar
  2. 2.
    Ahmed N, Natarajan T, Rao KR (1974) Discrete cosine transfom. IEEE Trans Comput 23(1):90–93CrossRefzbMATHGoogle Scholar
  3. 3.
    American Society for Photogrammetry and Remote Sensing (ASPRS) (2016) Las 1.4 format standard. Available online at: (accessed 25 August 2016)
  4. 4.
    Chen B, Wornell GW (2001) Quantization index modulation: a class of provably good methods for digital watermarking and information embedding. IEEE Trans Inf Theory 47(4):1423–1443MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cotting D, Weyrich T, Pauly M, Gross M (2004) Robust watermarking of point-sampled geometry. In: Shape Modeling Applications, 2004. Proceedings, pp 233–242Google Scholar
  6. 6.
    Cox I, Miller M, Bloom J, Fridrich J, Kalker T (2007) Digital watermarking and steganography. Morgan Kaufmann, BurlingtonGoogle Scholar
  7. 7.
    Dugelay J, Baskurt A, Daoudi M (2008) 3D object processing: compression, indexing and watermarking. Wiley, New YorkCrossRefGoogle Scholar
  8. 8.
    Gao X, Zhang C, Wei Y, Li W (2010) A highly adaptable capacity and invisibility 3d watermarking based on four-points sets. In: Proceedings of the 12th ACM workshop on Multimedia and security. ACM, pp 137–146Google Scholar
  9. 9.
    Gao X, Zhang C, Huang Y, Deng Z (2012) A robust high-capacity affine-transformation-invariant scheme for watermarking 3D geometric models. ACM Trans Multimed Comput Commun Appl (TOMM) 8(2S):34Google Scholar
  10. 10.
    Horvat D, Žalik B, Mongus D (2016) Context-dependent detection of non-linearly distributed points for vegetation classification in airborne LiDAR. ISPRS J Photogramm Remote Sens 116:1–14CrossRefGoogle Scholar
  11. 11.
    Isenburg M (2013) LASZip: lossless compression of Lidar data. Photogramm Eng Remote Sens 79(2):209–217CrossRefGoogle Scholar
  12. 12.
    Itier V, Puech W (2016) High capacity data hiding for 3d point clouds based on static arithmetic coding. Multimed Tool Appl:1–25Google Scholar
  13. 13.
    Ke Q, Dong-Qing X (2011) An high-capacity steganographic scheme for 3D point cloud models using self-similarity partition. Int J Model Optim 1(1):13CrossRefGoogle Scholar
  14. 14.
    Ke Q, Dong-Qing X (2013) A self-similarity based robust watermarking scheme for 3D point cloud models. Information 16(6):3621Google Scholar
  15. 15.
    Ke Q, Dong-Qing X, Da-Fang Z (2010) A robust watermarking scheme for 3D point cloud models using self-similarity partition. In: 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, pp 287–291Google Scholar
  16. 16.
    Lipuš B, Žalik B (2012) Lossy las file compression using uniform space division. Electron Lett 48(20):1278–1279CrossRefGoogle Scholar
  17. 17.
    Lipuš B, Žalik B (2015) Lossless progressive compression of lidar data using hierarchical grid level distribution. Remote Sens Lett 6(3):190–198CrossRefGoogle Scholar
  18. 18.
    Lukač N, Žalik B (2015) Fast approximate k-nearest neighbours search using GPGPU. In: GPU Computing and Applications. Springer, pp 221–234Google Scholar
  19. 19.
    Luo H, Lu ZM, Pan JS (2006) A reversible data hiding scheme for 3D point cloud model. In: International Symposium on Signal Processing and Information Technology, pp 863–867Google Scholar
  20. 20.
    Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1):3–30CrossRefzbMATHGoogle Scholar
  21. 21.
    Mongus D, Žalik B (2011) Efficient method for lossless lidar data compression. Int J Remote Sens 32(9):2507–2518CrossRefGoogle Scholar
  22. 22.
    Mongus D, Lukač N, Žalik B (2014) Ground and building extraction from LiDAR data based on differential morphological profiles and locally fitted surfaces. ISPRS J Photogramm Remote Sens 93:145–156CrossRefGoogle Scholar
  23. 23.
    Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: International Conference on Computer Vision Theory and Application, pp 331–340Google Scholar
  24. 24.
    Muja M, Lowe DG (2012) Fast matching of binary features. In: Computer and Robot Vision, pp 404–410Google Scholar
  25. 25.
    Muja M, Lowe DG (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans Pattern Anal Mach Intell 36(11):2227–2240CrossRefGoogle Scholar
  26. 26.
    Prusinkiewicz P, Lindenmayer A (2012) The algorithmic beauty of plants. Springer, BerlinzbMATHGoogle Scholar
  27. 27.
    Rahmes M, Wilder K, Fox K (2013) A multi-resolution fractal additive scheme for blind watermarking of 3D point data. In: SPIE Defense, Security, and Sensing, pp 87,570G–87,570GGoogle Scholar
  28. 28.
    Rupnik B, Mongus D, Žalik B (2015) Point density evaluation of airborne LiDAR datasets. J Universal Comput Sci 21(4):587–603MathSciNetGoogle Scholar
  29. 29.
    Rusu RB, Cousins S (2011) 3D is here: Point cloud library (PCL). In: 2011 IEEE International Conference on Robotics and Automation, pp 1–4Google Scholar
  30. 30.
    Shan J, Toth CK (2009) Topographic laser ranging and scanning: principles and processing. CRC Press, Boca RatonGoogle Scholar
  31. 31.
    Shih FY (2007) Digital watermarking and steganography: fundamentals and techniques. CRC Press, Boca RatonGoogle Scholar
  32. 32.
    Vogel H (1979) A better way to construct the sunflower head. Math Biosci 44 (3-4):179–189CrossRefGoogle Scholar
  33. 33.
    Wang CM, Wang PC (2005) Data hiding approach for point-sampled geometry. IEICE Trans Commun 88(1):190–194CrossRefGoogle Scholar
  34. 34.
    Wang CM, Wang PC (2006) Steganography on point-sampled geometry. Comput Graph 30(2):244–254MathSciNetCrossRefGoogle Scholar
  35. 35.
    Wang PC, Wang CM (2007) Reversible data hiding for point-sampled geometry. J Inf Sci Eng 23(6):1889–1900MathSciNetGoogle Scholar
  36. 36.
    Wang K, Lavoué G, Denis F, Baskurt A (2008) A comprehensive survey on three-dimensional mesh watermarking. IEEE Trans Multimedia 10(8):1513–1527CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Faculty of Electrical Engineering and Computer ScienceUniversity of MariborMariborSlovenia

Personalised recommendations