Learn More
For transmission and storage purposes, compression of 3D models is an indispensable component in graphics applications. Many existing compression schemes sacrificed computational complexity for compression efficiency. On the other hand, low computational complexity is the most sought functionality from the industry as of today. In this paper, we proposed a(More)
In this paper, we propose an efficient method of reindexing with rank in order to compress losslessly using Arithmetic Coding in indexed color images. The proposed algorithm performs compression of a converted ranked image, which is made up ranks instead of indices. As a result of simulation, it is verified that the proposed method increases compression(More)
  • 1