Three Dimensional Point Cloud Compression and Decompression Using Polynomials of Degree One

• Main Authors: Ulfat Imdad, Muhammad Asif, Mirza Tahir Ahmad, Osama Sohaib, Muhammad Kashif Hanif, Muhammad Hasanain Chaudary
• Format: Article
• Language: English
• Published: MDPI AG 2019-02-01
• Series: Symmetry
• Subjects: 3D point cloud; compression; decompression; polynomials
• Online Access: https://www.mdpi.com/2073-8994/11/2/209

The availability of cheap depth range sensors has increased the use of an enormous amount of 3D information in hand-held and head-mounted devices. This has directed a large research community to optimize point cloud storage requirements by preserving the original structure of data with an acceptable attenuation rate. Point cloud compression algorithms were developed to occupy less storage space by focusing on features such as color, texture, and geometric information. In this work, we propose a novel lossy point cloud compression and decompression algorithm that optimizes storage space requirements by preserving geometric information of the scene. Segmentation is performed by using a region growing segmentation algorithm. The points under the boundary of the surfaces are discarded that can be recovered through the polynomial equations of degree one in the decompression phase. We have compared the proposed technique with existing techniques using publicly available datasets for indoor architectural scenes. The results show that the proposed novel technique outperformed all the techniques for compression rate and RMSE within an acceptable time scale.