Parallelisable zero-tree image coding with significance maps

DOI10.1007/3-540-44681-8_96MaRDI QIDQ4790572zbMATH OpenFDO

Authors Rade Kutil

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500674

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies and applications (68U99)

Recommendations

• Approaches to zerotree image and video coding on MIMD architectures
• scientific article; zbMATH DE number 893995
• Multi-iteration wavelet zero-tree coding for image compression.
• Parallel lossless image compression using Huffman and arithmetic coding
• Embedded image coding using zerotrees of wavelet coefficients

Cited in

(8)

• Parallel coding of binary images
• Approaches to zerotree image and video coding on MIMD architectures
• Set partition coding and image wavelet coding systems. II: Image wavelet coding
• ParWave: Granularity in parallel wavelet packet video coding
• Bitplane Image Coding With Parallel Coefficient Processing
• scientific article; zbMATH DE number 893995 (Why is no real title available?)
• A zero-tree wavelets coding algorithm by preferentially encoding the neighbor of significant coefficients
• IMPLEMENTATION OF ZERO TREE WAVELET CODERS IN DSP PROCESSOR

This page was built for publication: Parallelisable zero-tree image coding with significance maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4790572)