A hybrid texture coding method for fast texture mappingopen access
- Authors
- Cui, Li; Kim, Hyungyu; Jang, Euee S.
- Issue Date
- Jun-2016
- Publisher
- Korean Institute of Information Scientists and Engineers
- Keywords
- Block matching; Spatial similarity; Texture compression
- Citation
- Journal of Computing Science and Engineering, v.10, no.2, pp.68 - 73
- Indexed
- SCOPUS
- Journal Title
- Journal of Computing Science and Engineering
- Volume
- 10
- Number
- 2
- Start Page
- 68
- End Page
- 73
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/154468
- DOI
- 10.5626/JCSE.2016.10.2.68
- ISSN
- 1976-4677
- Abstract
- 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.
- Files in This Item
-
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.