A. Said and W. Pearlman, "A New fast and Efficient Image coder Based on Set Partitioning in Hierarchical Trees," IEEE Trans. On Circuits and systems for Video Technology, vol 6, no.3, pp 243-250, June 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....This corresponds to the improvement suggested by Cover [6] by superposition of information. 4.3. Image Transmission We have simulated the transmission of images (video is currently being addressed) over the proposed EMCM system. We have used the state of the art embedded zerotree wavelet coder of [9] as the image coding platform. Due to the embedded nature of the bitstream, decoding is aborted when an error is detected, with the decoding quality depending on how far along the bitstream the error is detected. In this setting, the problem becomes how to optimally partition the bitstream into ....

A. Said and W. A. Pearlman, "A new fast and efficient image coder based on set partitioning in hierarchical trees," IEEE Trans. Circuits and Systems for Video Technology, 1995.

....errors and zero blocks. Fast compression performance is comparable with joint Photographers Expert Group (JPEG) for photographs, with GIF for graphics, and superior to the state of the art for composite images. SPIHT) An algorithm that operates through set partitioning in hierarchical trees [14] and accomplishes completely embedded coding. This algorithm uses the principles of partial ordering by magnitude, set partitioning by significance of magnitudes with respect to a sequence of octavely decreasing thresholds, ordered bit plane transmission, and self similarity across scale in an ....

Said, A., and Pearlman, W.A., "A new fast and efficient image coder based on set partitioning in hierarchical trees." IEEE Trans. on Circuits and Systems for Video Technology, Vol. 6, pp. 243-250, (1996).

....based compression (e.g. JPEG [1] is memory efficient, since processing is based on small blocks. In this paper we investigate memory efficiency for wavelet based image coding algorithms, such as those that will make the core of the upcoming JPEG2000 standard [2] Algorithms such as those in [3, 4, 5], are representative of the state of the art in wavelet coders. These algorithms assume that the wavelet transform (WT) of the whole image is computed before coding, so that some useful global information (e.g. maximum and minimum coefficient values in one subband, energy per subband, etc) This ....

....approach to address overall (i.e. transform and coding) memory is to tile a large image into smaller subimages, which are then independently coded. This approach has well known drawbacks in terms of coding performance. The more efficient approach of [9] uses a standard algorithm (e.g. [3]) which buffers the whole image at the encoder, but then allows the bit stream to be re ordered before transmission so as to reduce the memory utilization at the decoder. Unlike prior work, we address both encoder and decoder memory utilization and consider a complete coding system. To address ....

[Article contains additional citation context not shown here]

A. Said and W. Pearlman, "A New Fast and Efficient Image Coder Based on Set Partitioning on Hierarchical Trees," IEEE Trans. Circuits and Systems for Video Technology, vol. 6, pp. 243--250, June 1996.

....the signal. The indicates that W#H can be interchanged while ;H denotes that apart from extension we also multiply the extended signal by ;1. The (0) denotes that we also need to account for the appearance of zeros as seen later on this chapter. 21 4. 1 Comparison between our method and [83, 92] for images: Barbara, Lena, Goldhill, Bike and Woman, the last two images are part of the test images for JPEG2000. We used five levels of vertical decomposition with the two decompositions in figure 4.3. Wehave also used two different filter banks, the 9 7 Daubechies and a 28 28 tap filter ....

....context formation. We exploit symmetry by using a sign flipping technique and wethus reduce the number of classes from nine to five. g 0 #g 1 are the signs of the wavelet coefficients at the corresponding locations. 87 5. 2 Comparison between our method and [8, 16, 71, 83] for images: Barbara, Lena, Goldhill, Bike and Woman, the last two images are part of the test images for JPEG2000. We used five levels dyadic decomposition with 97tapfilters. JPEG AR stands for JPEG compression with the addition of arithmetic coding. For algorithm [8] the numbers in ....

[Article contains additional citation context not shown here]

A. Said and W. Pearlman. "A New Fast and Efficient Image Coder Based on Set Partitioning on Hierarchical Trees". IEEE Trans. Circuits and Systems for Video Technology, 6(3):243--250, June 1996.

....of very large images acquired from scanners, and for the printout of images, as needed for example in the facsimile industry [4] Our goal is to design wavelet coders with similar characteristics in terms of memory. The memory requirements of all state of the art wavelet based algorithms [1, 2, 5] are typically of the order of the size of the input image (or the input tile, if tiling is performed) The whole image is buffered in memory, a wavelet transform is computed and then manipulation of the wavelet coefficients is done based on the assumption that the encoder has access at any given ....

....but obviously this will also result in a degradation of the coding performance. Our proposed algorithm operates in one pass and it requires only a small portion of the image to be available to start coding. Its efficiency for compression can be compared to other state of the art algorithms such as [1, 2, 5], with differences in performance of around 0:5dB. The price to be paid at this point is the loss of the embedding property, but clearly that should not be a factor if memory at the encoder or decoder is a premium. The algorithm is based on a progressive implementation of a generic wavelet ....

[Article contains additional citation context not shown here]

A. Said and W. Pearlman, "A New Fast and Efficient Image Coder Based on Set Partitioning on Hierarchical Trees," IEEE Trans. Circuits and Systems for Video Technology, vol. 6, pp. 243--250, June 1996.

.... DCT based approaches [2] Memory efficiency is in fact one of the key issues to be addressed before a widespread deployment of wavelet based techniques takes place and it is currently one area of major research activity within the JPEG2000 standardization process [3] Algorithms such as those in [4, 5, 6, 7, 8, 9, 10, 11], are representative of the state of the art in wavelet coders. All of these algorithms assume that the wavelet transform (WT) for the whole image has been computed so that all the corresponding coefficients are available in the coding process. Global image information 1 is used in various ways ....

.... (e.g. 7] initialization of the probability models used by a quantizer or arithmetic coder [8, 9, 10] or selection of specific decompositions of the signal [6] It is also worth noting that even if no global information has to be measured, algorithms that provide progressive transmission [4, 5] might require to store the complete set of wavelet coefficients. The above mentioned algorithms were developed with the goal of achieving competitive compression performance and thus memory utilization was not a major consideration in their development. As far as the encoder is concerned these ....

[Article contains additional citation context not shown here]

A. Said and W. Pearlman, "A New Fast and Efficient Image Coder Based on Set Partitioning on Hierarchical Trees," IEEE Trans. Circuits and Systems for Video Technology, vol. 6, pp. 243--250, June 1996.

....quantization have been reported in the recent literature. The first approach relies on a fixed quantization for all coefficients in a given band and a layered transmission of the coefficients using binary or low order (ternary, quaternary) arithmetic coding. Examples include the algorithms of [2, 3, 4]. Context based arithmetic coders were used in [3] while in [2, 4] context information was taken into account by using the zero tree data structure, which enables the joint transmission of zero valued coefficients present at the same spatial location across several frequency bands. The second ....

....approach relies on a fixed quantization for all coefficients in a given band and a layered transmission of the coefficients using binary or low order (ternary, quaternary) arithmetic coding. Examples include the algorithms of [2, 3, 4] Context based arithmetic coders were used in [3] while in [2, 4] context information was taken into account by using the zero tree data structure, which enables the joint transmission of zero valued coefficients present at the same spatial location across several frequency bands. The second approach for adaptivity relies on using different quantizers, and thus ....

[Article contains additional citation context not shown here]

A. Said and W. Pearlman, "A New Fast and Efficient Image Coder Based on Set Partitioning on Hierarchical Trees.," IEEE Trans. Circuits and Systems for Video Technology, vol. 6,

....Electronics Program (JSEP) under award N00014 96 1 0129, the Army Research Labs under grant No. DAAL01 96 2 003, and the National Science Foundation under grant NSF 92 122 (RIA 94) 1 INTRODUCTION An insightful observation regarding the class of high performance wavelet based image coders [2, 3, 4, 5, 6] is that they share a common feature a mechanism for modeling high band wavelet coefficients as a spatial mixture of different density energy clusters. These schemes differ mainly in their approach to characterizing and quantizing this mixture. The approaches used range from not bothering to ....

A. Said and W. A. Pearlman, "A new fast and efficient image coder based on set partitioning in hierarchical trees," IEEE Trans. Circuits and Systems for Video Technology, pp. 243--250, June 1996.

No context found.

A. Said and W. Pearlman, "A New fast and Efficient Image coder Based on Set Partitioning in Hierarchical Trees," IEEE Trans. On Circuits and systems for Video Technology, vol 6, no.3, pp 243-250, June 1996.

No context found.

A. Said and W. Pearlman, "A New fast and Efficient Image coder Based on Set Partitioning in Hierarchical Trees," IEEE Trans. On Circuits and systems for Video Technology, vol 6, no.3, pp 243-250, June 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC