Korean Journal of Remote Sensing (대한원격탐사학회지)

Korean Society of Remote Sensing (대한원격탐사학회)
권호 표지
DOI QR코드

DOI QR Code

A Fast Processing Algorithm for Lidar Data Compression Using Second Generation Wavelets

  • Pradhan B. (Institute for Advanced Technologies(ITMA), Faculty of Engineering, University Putra Malaysia) ;
  • Sandeep K. (Department of Mechanical Engineering, Institute of Technology, Banaras Hindu University(BHU)) ;
  • Mansor Shattri (Institute for Advanced Technologies(ITMA), Faculty of Engineering, University Putra Malaysia) ;
  • Ramli Abdul Rahman (Institute for Advanced Technologies(ITMA), Faculty of Engineering, University Putra Malaysia) ;
  • Mohamed Sharif Abdul Rashid B. (Institute for Advanced Technologies(ITMA), Faculty of Engineering, University Putra Malaysia)
  • Published : 2006.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

Keywords

References

  1. Abasolo, M. J., Blat, J., and De Giusti, A., 2000. A Hierarchial Tringulation for Multiresolution Terrain Models. The Journal of Computer Science & Technology (JCS&T), 1, 3
  2. Cohen, A., 2001. Applied and computational aspects of nonlinear wavelet approximation, Multivariate Approximation and Applications, N. Dyn, D. Leviatan, D. Levin, and A. Pinkus (eds.), Cambridge University Press, Cambridge, pp. 188-212
  3. Demaret, L., Dyn, N., Floater, M. S., and Iske, A., 2004. Adaptive thinning for terrain modelling and image compression, in Advances in Multiresolution for Geometric Modelling, N. A. Dodgson, M. S. Floater, and M. A. Sabin (eds.), Springer-Verlag, Heidelberg, pp. 321-340
  4. Donoho, D., 1999. Wedgelets: nearly-minimax estimation of edges, Annals of Stat., 27: 859-897 https://doi.org/10.1214/aos/1018031261
  5. Dyn, N., Levin, D., and Gregory, J. A., 1990. A butterfly subdivision scheme for surface interpolation with tension control, ACM Transaction on Graphics, 9: 160- 169 https://doi.org/10.1145/78956.78958
  6. Evans, W., Kirkpatrick, D., and Townsend, G., 2001. Right-Tringulated Irregular Networks. Algorithmica, Special Issue on Algorithms for Geographical Information Systems, 30(2): 264-286
  7. Junger, B. and Snoeyink, J., 1998. Selecting independent sets for terrain simplification. Proceedings of WSCG '98, Plzen, Czech Republic, February 1998, University of West Bohemia, pp. 157-164
  8. Kao, T., Mount, D. M., and Saalfeld, A., 1991. Dynamic maintenance of Delaunay triangulations: Proc. Auto-Carto IO, Baltimore, Maryland, p. 219-233
  9. Kiema, J. B. K. and Bahr, H.-P., 2001. Wavelet compression and the automatic classification of urban environments using high resolution multispectral imagery and laser scanning data, Geoinformatics, 5: 165-179 https://doi.org/10.1023/A:1011442332063
  10. Lawson, C. L., 1972. Generation of a triangular grid with application to contour plotting, California Institute of Technology, Jet Pollution Laboratory, Technical Memorandum No. 299
  11. Lee, D. T. and Schachter, B. J., 1980. Two algorithms for constructing a Delaunay triangulation, Intern. Jour. Computer and Information Sciences, 9(3): 219-242 https://doi.org/10.1007/BF00977785
  12. Macedonio, G. and Pareschi, M. T., 1991. An algorithm for the triangulation of arbitrary distributed points: applications to volume estimate and terrain fitting, Computers & Geosciences, 17(7): 859-874 https://doi.org/10.1016/0098-3004(91)90086-S
  13. Mirante, A. and Weingarten, N., 1982. The radial sweep algorithm for constructing triangulated irregular networks, IEEE Computer Graphics and Applications, 2(3): 11-21 https://doi.org/10.1109/MCG.1982.1674214
  14. Puppo, E., Davis, L., DeMenthon, D., and Teng, Y. A., 1992. Parallel terrain triangulation, Proc. 5th Intern. Symposium on Spatial Data Handling, v. 2, Charleston, South Carolina, p. 632-641
  15. Sibson, R., 1978. Locally equiangular triangulations, Computer Jour., 21(3): 243-245 https://doi.org/10.1093/comjnl/21.3.243
  16. Slone, R., Foos, D., and Whiting, B., 2000. Assessment of visually lossless irreversible image compression: comparison of three methods by using an image comparison workstation, Radiology, 215: 543-553 https://doi.org/10.1148/radiology.215.2.r00ap47543
  17. Sweldens, W., 1994. Construction and Applications of wavelets in Numerical Analysis, Unpublished PhD thesis, Dept. of Computer Science, Katholieke Universiteit Leuven, Belgium
  18. Sweldens, W., 1997. The lifting scheme: a construction of second generation wavelets, SIAM Journal on Mathematical Analysis, 29: 511-546 https://doi.org/10.1137/S0036141095289051
  19. Tsai, V. J. D. and Vonderohe, A. P., 1991. A generalized algorithm for the construction of Delaunay triangulations in Euclidean n-space, Proc. GIS/LIS '91, v. 2, Atlanta, Georgia, p. 562-571
  20. Tsai,V. J. D., 1993. Fast topological construction of Delaunay triangulations and Voronoi diagrams, Computer & Geosciences, 19(10): 1463-1474 https://doi.org/10.1016/0098-3004(93)90062-A
  21. Watson, D. F., 1981. Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, Computer Jour., 24(2): 167-172 https://doi.org/10.1093/comjnl/24.2.167
  22. Wu, J. and Amaratunga, K., 2003. Wavelet triangulated irregular networks, International Journal of Geographical Science, 17(3): 273- 289 https://doi.org/10.1080/1365881022000016016