• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10B
• /
• pp.919-927
• /
• 2008

The growing availability of broadband multimedia applications are providing strict real-time services and enabling users to feel much interactivity as well as 'sense of presence'. In that sense, there would be increased demand for what network and system have to do to fulfill the user expectations. In this paper, we implement a real-time multimedia application which make use of real-time DXT CODEC and investigate what the challenges of networking and system are. We carry out various experiments over a research network test-bed to evaluate the performance of our proposals.