Hierarchical Context-based Pixel Ordering

Simple item page
dc.contributor.authorBar-Joseph, Ziven_US
dc.contributor.authorCohen-Or, Danielen_US
dc.date.accessioned2015-02-16T08:00:56Z
dc.date.available2015-02-16T08:00:56Z
dc.date.issued2003en_US
dc.description.abstractWe present a context-based scanning algorithm which reorders the input image using a hierarchical representationof the image. Our algorithm optimally orders (permutes) the leaves corresponding to the pixels, by minimizing thesum of distances between neighboring pixels. The reordering results in an improved autocorrelation betweennearby pixels which leads to a smoother image. This allows us, for the first time, to improve image compressionrates using context-based scans. The results presented in this paper greatly improve upon previous work in bothcompression rate and running time.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometryand Object Modeling I.3.6 [Computer Graphics]: Methodology and Techniquesen_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume22en_US
dc.identifier.doi10.1111/1467-8659.00682en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages349-358en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00682en_US
dc.publisherBlackwell Publishers, Inc and the Eurographics Associationen_US
dc.titleHierarchical Context-based Pixel Orderingen_US
Files
Collections
Issue 3