Three-dimensional range geometry compression via reduced entropy encoding of the image

The embedding approach of three-dimensional range geometry in two-dimensional images has led to a significant increase in the 3D-data compression ratio with respect to the image compression techniques development. With this approach, the main issue changed to maximum capacity utilization in the images, such as the number of color channels and bit depth. This was attained by reducing the number of interference patterns used as well as exploiting more powerful compression algorithms, such as free lossless image format. But this paper points out that compared to using conventional compression algorithms, modifying the mentioned process (two-dimensional image creation and compression) and finding the structure of the image data and its corresponding redundancy is preferable. Due to this effort, we will see a significant reduction in entropy of the information contained in the image, and this will create a new opportunity for improvement in lossless compression. Experimental evaluation and results verify the overall robustness of the proposed method. For example, a significant 0.29 bit per point ratio can be achieved for an object with a continuous smooth surface.