Show simple item record

dc.contributor.authorKrajcevski, Pavelen_US
dc.contributor.authorManocha, Dineshen_US
dc.contributor.editorIngo Wald and Jonathan Ragan-Kelleyen_US
dc.date.accessioned2015-07-06T15:26:34Z
dc.date.available2015-07-06T15:26:34Z
dc.date.issued2014en_US
dc.identifier.isbn978-3-905674-60-6en_US
dc.identifier.issn2079-8679en_US
dc.identifier.urihttp://dx.doi.org/10.2312/hpg.20141095en_US
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/hpg.20141095
dc.description.abstractFast, high quality texture compression is becoming increasingly important for interactive applications and mobile GPUs. Modern high-quality compression formats define sets of pre-existing block partitions that allow disjoint subsets of pixels to be compressed independently. Efficient encoding algorithms must choose the best partitioning that fits the data being compressed. In this paper, we describe a new method for selecting the best partition for a given block by segmenting the entire image into superpixels prior to compression. We use the segmentation boundaries to determine a partitioning for each block and then use this partitioning to select the closest matching predefined partitioning. Using our method for BPTC compression results in up to 6x speed-up over prior methods while maintaining comparable visual quality.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleSegTC: Fast Texture Compression using Image Segmentationen_US
dc.description.seriesinformationEurographics/ ACM SIGGRAPH Symposium on High Performance Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record