Embedded image coding using zerotrees of wavelet coefficients

Shapiro, J.M.

doi:10.1109/78.258085

Cited by 4,102 publications

(458 citation statements)

References 29 publications

Supporting

Mentioning

441

Contrasting

Unclassified

Order By: Relevance

“…With these CMOS sensors, one can reduce the power drawn from commercial camera batteries by discarding the requirement for codec chips to be able to perform compression. Another application is to trade off the compression rate against number of measurements (Shapiro 1993;Said & Pearlman 1996).…”

Section: Introductionmentioning

confidence: 99%

“…For example, the wavelet transform can provide a sparse representation of realworld images, because there are many small values on each scale for the smooth regions of the images, and there are a few large values for the edges. The fundamental technique in modern image compression (Shapiro 1993;Said & Pearlman 1996) is to retain only the large-value wavelet coefficients. The wavelet transform was adopted for the JPEG2000 standard for image compression.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The application of compressive sampling to radio astronomy

Cornwell

Hoog

2011

A&A

103

114

View full text Add to dashboard Cite

Compressive sampling is a new paradigm for sampling, based on sparseness of signals or signal representations. It is much less restrictive than Nyquist-Shannon sampling theory and thus explains and systematises the widespread experience that methods such as the Högbom CLEAN can violate the Nyquist-Shannon sampling requirements. In this paper, a CS-based deconvolution method for extended sources is introduced. This method can reconstruct both point sources and extended sources (using the isotropic undecimated wavelet transform as a basis function for the reconstruction step). We compare this CS-based deconvolution method with two CLEANbased deconvolution methods: the Högbom CLEAN and the multiscale CLEAN. This new method shows the best performance in deconvolving extended sources for both uniform and natural weighting of the sampled visibilities. Both visual and numerical results of the comparison are provided.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

The application of compressive sampling to radio astronomy

Cornwell

Hoog

2011

A&A

103

114

View full text Add to dashboard Cite

show abstract

“…To achieve better performance wavelet transform require filters that combine desirable properties like orthogonality and symmetry. The most well known techniques are Embedded Zerotree Wavelet by (Shapiro, 1993) and the Set Partitioning in Hierarchical trees (Said and Pearlman, 1996).…”

Section: Wavelet Transformmentioning

confidence: 99%

Self Organizing Map Cluster Approach for Wavelet Based Medical Image Compression

Sridevi¹

2012

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Digital medical powerful tools for diagnosis, treatment and surgery and plays a vital role in modern healthcare delivery. Large storage capacity is needed for storing these images and for transmitting them. This leads to the strong demand for digital medical image compression and reliable transmission. In this study, we have applied three compression methods to medical images. In all the methods discrete wavelet transform is applied followed by the corresponding compression methods. The experiments are carried on three medical images and the quality of reconstructed images is evaluated based on Compression Ratio (CR) and Peak Signal to Noise Ratio. The results show that the SOM algorithm has higher compression ratio than FCM and FKM while maintaining the image quality and preserving the information. The results show that the SOM algorithm outperforms the existing methods FCM and FKM for medical image compression.

show abstract

“…One layer of Zerotree algorithm process The number of cycle of the process above is determined by the number of the lifting wavelet transform layers. We divide the wavelet coefficients into three classifications, zero roots, subtree of zero roots, important value [1] . While a coefficient is less than threshold of the layer and in the first half section of coefficient column, we could classify it as zero root or subtree of zero roots.…”

Section: Zerotree Codingmentioning

confidence: 99%

“…And this paper mainly proposes a data compression algorithm for vibration data transmission in wireless sensor network. We utilize the Zerotree algorithm (EZW [1] ) to process one-dimensional vibration data and combine the existing lifting algorithm with it. In the process of compression we apply the lifting wavelets and Zerotree coding to filter the vibration data.…”

Section: Introductionmentioning

confidence: 99%