Abstract
Publisher Summary JPEG2000 and MPEG-4 Visual Texture Coding (VTC) are both wavelet-based and state of the art in still image coding. This chapter discusses sequential as well as parallel strategies for speeding up two selected implementations of MPEG-4 VTC and JPEG2000. Furthermore, the sequential and parallel performance of the improved versions is discussed and the efficiency of both algorithms is compared. The structure of MPEG-4 VTC zerotree coding in single and in multi quantization mode, on the contrary, allows a parallelization. These entropy coding methods are organized in two major stages. In the first stage, each wavelet coefficient is quantized and a zerotree symbol is computed for this coefficient. With minor changes, this part can be performed in parallel on a number of available CPUs. In the second major stage of SQ and MQ coding, the computed zerotree symbols and quantized coefficient values are binary arithmetic coded and written to the bitstream. This part is intrinsically sequential, which is due to the data dependencies within the arithmetic coder, but has only about 20% up to 35% runtime contribution to the overall SQ zerotree coding time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
