A hybrid texture coding method for fast texture mapping

Citations

SCOPUS

1

초록

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.

키워드

Block matchingSpatial similarityTexture compressionCompression ratio (machinery)Computational complexityComputational efficiencyEconomic and social effectsMotion compensationBlock MatchingCompression efficiencyHigh compression ratioHigher compression ratiosQuality of rendering resultsReal-time applicationSpatial similarityTexture compressionMapping
제목
A hybrid texture coding method for fast texture mapping
저자
Cui, LiKim, HyungyuJang, Euee S.
DOI
10.5626/JCSE.2016.10.2.68
발행일
2016-06
유형
Article
저널명
Journal of Computing Science and Engineering
10
2
페이지
68 ~ 73

파일 다운로드