Journal Article10.1108/02644401111109213
A static image coding algorithm based on contourlet Classified Hidden Markov Tree model
Fan Yonghui,Wang Gang,Liang Xiao +2 more
2
TL;DR: Wang et al. as mentioned in this paper used contourlet transform and CHMT model to redevelop traditional set partitioning in hierarchical trees (SPIHT) code algorithm, and by using these two methods, hope to decrease the distortion and increase the quality.
read more
Abstract: Purpose – Because of advantages such as multi‐scale and multi‐direction, contourlet transform is better at treating a 2‐D image than wavelet transform and the Classified Hidden Markov Tree (CHMT) model is able to analyze statistical character of coefficients, which means they can be analyzed more efficiently and effectively. So in this paper, the purpose is to use contourlet transform and CHMT model to redevelop traditional set partitioning in hierarchical trees (SPIHT) code algorithm, and by using these two methods, hope to decrease the distortion and increase the quality.Design/methodology/approach – In this paper, the algorithm is divided into two parts: code part and decode part. As all processes are operated in the contourlet domain, contourlet transform is finished at the beginning of the code part. SPIHT algorithm in the contourlet domain will code these contourlet coefficients. CHMT model will be built in decode part, it will optimize decoded coefficients by calculating their statistical relations...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
HVS-Based Image Compression Scheme in Wavelet-Contourlet Domain
TL;DR: An image compression scheme which exploits content-based quantization step considering the human visual system (HVS) in the Wavelet-Contourlet (DWT-CT) domain and guarantees low compression ratio and distortion as well.
4
Tunable-Q contourlet transform for image representation
TL;DR: In this article, a novel tunable-quality-factor (tunable-Q) contourlet transform for geometric image representation is proposed, which employs a new tunableQ decomposition defined in the frequency domain by which one can flexibly tune the bandwidth of decomposition channels.
3
References
A new, fast, and efficient image codec based on set partitioning in hierarchical trees
Amir Said,William A. Pearlman +1 more
TL;DR: The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods.
6.1K
Contourlets: A New Directional Multiresolution Image Representat ion
Minh N. Do,Martin Vetterli +1 more
- 01 Jan 2002
TL;DR: The contourlet transform as mentioned in this paper is designed to satisfy the anisotropy scaling relation for curves, and thus offers a fast and structured curuelet-like decomposition.
81
Contourlets: a new directional multiresolution image representation
Minh N. Do,Martin Vetterli +1 more
- 03 Nov 2002
TL;DR: In this paper, the contourlet transform is proposed to satisfy the anisotropy scaling relation for curves, and thus offers a fast and structured curvelet-like decomposition.
78
Development and Prospect of Image Multiscale Geometric Analysis
Tan Shan
- 01 Jan 2003
TL;DR: The mathematical and neurophysiological backgrounds of Image Multiscale Geometric Analysis are studied on this paper, and its development history, current and future challenges are reviewed in details.
60
A reduced Laplacian pyramid for lossless and progressive image communication
TL;DR: The Laplacian pyramid is appropriate for lossy image compression; conversely, the reduced-difference pyramid (RDP), having as many data as pixels, gives a better performance with lossless encoding.
60