检索结果-内蒙古大学图书馆

wavelet image coding based on significance extraction using morphological operations

IEE PROCEEDINGS-VISION image AND SIGNAL PROCESSING 1999年第4期146卷 206-210页

作者： Zhong, JM Leung, CH Tang, YY Univ Hong Kong Dept Elect & Elect Engn Hong Kong Hong Kong Peoples R China

An algorithm is proposed for improving Servetto et al.'s method of morphological representation of wavelet data (MRWD), which is among the most efficient wavelet-based image compression algorithms. In MRWD, morphological dilation is used to capture and encode the arbitrarily shaped clusters of significant coefficients within each subband and high compression is achieved. But there are still several deficiencies for rectification in MRWD. An efficient image compression algorithm is proposed, in which, for each subband, morphological dilation is first used to extract and encode the clustered significant coefficients, and the remaining space is encoded in an efficient way. Instead of encoding the large number of zeros one by one, only the small number of remaining significant coefficients and their positional information are encoded. Experimental results show that this improvement is very effective, especially for images with large and relatively smooth regions.

关键词： efficient image compression algorithm Combinatorial mathematics data compression transform coding positional information feature extraction significance extraction image representation Computer vision and image processing techniques wavelet image coding image coding wavelet-based image compression algorithms morphological representation Integral transforms in numerical analysis image and video coding wavelet data morphological dilation morphological operations mathematical morphology clustered significant coefficients wavelet transforms experimental results subband

来源：评论

学校读者我要写书评

暂无评论

Scalable line-based wavelet image coding in wireless sensor networks

引用

JOURNAL OF VISUAL COMMUNICATION AND image REPRESENTATION 2016年第PartB期40卷 418-431页

作者： Rein, Stephan Reisslein, Martin Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA

Existing scalable wavelet image coding approaches, such as set partitioning in hierarchical trees and its derivatives, employ a memory-intensive tree-based coding structure. Existing tree-based wavelet coding approaches are therefore not suitable for memory-constrained sensor nodes. In this paper, we introduce a scalable wavelet image coding approach based on a line structure that requires very little memory. The proposed line-based approach is suitable for scalable wavelet image coding in memory-constrained sensor nodes, requiring only a few kilobytes of memory for a 256 x 256 pixel image. The presented line based wavelet coding algorithm accesses the image data line by line and thus conforms with the data access patterns in current flash memory technology. Our performance evaluations demonstrate that the proposed scalable line-based image wavelet coding approach has no overhead compared to one run (non-scalable) wavelet image coding and has competitive compression performance compared to JPEG 2000 and the recent Google WebP image format. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Low-memory image coding Sensor node Scalable image compression wavelet image coding

来源：评论

学校读者我要写书评

暂无评论

Visual entropy gain for wavelet image coding

引用

IEEE SIGNAL PROCESSING LETTERS 2006年第9期13卷 553-556页

作者： Lee, Hyungkeuk Lee, Sanghoon Yonsei Univ Wireless Network Lab Seoul 120749 South Korea

wavelet image coding exhibits a robust error resilience performance by utilizing a naturally layered bitstream construction over a band-limited channel. In this letter, a new measure that appears to provide a better assessment of visual entropy for comparing and evaluating progressive image coders is defined based on a visual weight over the wavelet domain. This visual weight is characterized by the human visual system (HVS) over the frequency and spatial domains and is then utilized as a criterion for determining the coding order of wavelet coefficients, resulting in improved visual quality. A transmission gain, which is expressed by visual entropy, of up to about 23% can be obtained at a normalized channel throughput of about 0.3. In accordance with the subjective visual quality, a relatively high gain can be obtained at a low channel capacity.

关键词： foveation human visual system visual entropy visual entropy gain wavelet image coding

来源：评论

学校读者我要写书评

暂无评论

Progressive trellis-coded space-frequency quantization for wavelet image coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2002年第7期12卷 587-591页

作者： Seigneurbieux, P Xiong, ZX Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA

This paper addresses progressive wavelet image coding within the trellis-coded space-frequency quantization (TCSFQ) framework [1]. A method similar to that in [2] is used to approximately invert TCSFQ when decoding at rates lower than the encoding rate. Our experiments show that the loss incurred for progressive transmission is within I dB in peak signal-to-noise ratio and that the progressive coding performance of TCSFQ is competitive with that of the celebrated SPIHT coder [3] at all rates.

关键词： progressive image coding space-frequency quantization trellis-coded quantization wavelet image coding

来源：评论

学校读者我要写书评

暂无评论

Dilation-run wavelet image coding

引用

SIGNAL image AND VIDEO PROCESSING 2008年第3期2卷 225-239页

作者： Wu, Zheng He, Ming-Yi Ma, Kai-Kuang Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Northwestern Polytech Univ Dept Elect & Informat Engn Xian 710072 Peoples R China

The run-length coding and the morphological representation are two classical schemes for wavelet image coding. The run-length coders have the advantage of simplicity by recording the lengths of zero-runs between significant wavelet coefficients but at the expense of yielding an inferior rate-distortion performance. The morphology-based coders, on the other hand, utilize the morphological dilation operation to delineate the clusters of significant coefficients for improving coding performance. In this paper, a novel dilation-run image coding algorithm is developed by taking the advantages of both schemes, in which the clustered significant coefficients are extracted by using the morphological dilation operation and the insignificant coefficients between the extracted clusters are coded by using the run-length coding method. The proposed dilation-run image coder is implemented in the framework of bitplane coding for producing embedded bitstreams. Compared with several state-of-the-art wavelet image coding methods, the proposed dilation-run image coding method achieves comparable rate-distortion coding performance, especially more attractive for fingerprint type of imageries.

关键词： wavelet image coding Run-length coding Morphological dilation operation Bitplane coding

来源：评论

学校读者我要写书评

暂无评论

wavelet image coding by dilation-run algorithm

Wavelet image coding by dilation-run algorithm

引用

International Conference on image Processing (ICIP 2004)

作者： Wu, Z He, M Northwestern Polytech Univ Dept Elect & Informat Engn Xian 710072 Peoples R China

ISBN: (纸本)0780385543

This paper presents a novel wavelet image coder, dilation-run algorithm, which provides an embedded coder based on bit-plane coding technique. At each bit-plane, morphological dilation is used to extract and encode the clustering significant wavelet coefficients, and a run-length coding method is used to encode the positional information of each cluster. The experiment results show that our coder outperforms the zerotree coder SPIHT and is competitive with the morphology coders MRWD and SLCCA. For wavelet images with strong clustering feature, the new coder outperforms both the morphology coders above.

关键词： wavelet transforms image coding mathematical morphology image representation transform coding tree codes wavelet image coding dilation-run algorithm bit-plane coding technique morphological dilation run-length coding method zerotree coder clustering feature

来源：评论

学校读者我要写书评

暂无评论

Dual X-Tree wavelet image coding

Dual X-Tree Wavelet Image Coding

引用

IEEE 10th International Conference on Signal Processing

作者： Li, Li Cai, Canhui Huaqiao Univ Sch Informat Sci & Engn Quanzhou 362021 Fujian Peoples R China

ISBN: (纸本)9781424458981

The lack of directional selectivity has harmed the performance of traditional discrete wavelet transform based image coding, especially when the original image includes multidirectional textures. To offer a better compression ability for multidirectional textural images, a novel wavelet image coding scheme, called dual x-tree wavelet image coding is proposed in this paper. First, the 2-D dual-tree discrete wavelet transform (DDWT) is performed on the input image. Then the noise shaping procedure is exerted on the transform coefficients to get their sparse representation. Finally, an improved x-tree image coding algorithm is applied to encode the coefficients. Different from the common used noise shaping, we adopt a pruning phase to the procedure to make the coefficients better fit our dual x-tree encoder. To make good use of the strong correlation between two wavelet trees produced from DDWT, the dual wavelet trees are jointly encoded to improve the coding performance. Simulation results have demonstrated that the proposed algorithm achieves about 0.5dB gain over state-of-the-arts for multidirectional textural image at low bitrate.

关键词： wavelet image coding dual-tree discrete wavelet transform noise shaping dual x-tree

来源：评论

学校读者我要写书评

暂无评论

wavelet image coding Using Cluster Growing Embedding

Wavelet Image Coding Using Cluster Growing Embedding

引用

2000年第16届世界计算机大会

作者： Yuxin Liu Yanda Li Department of Automation Tsinghua University

A novel embedded image coding method denoted as Cluster Growing Embedding(CGE) is proposed in this *** to some of state-of-the-art wavelet image coding algorithms,CGE can encode images efficiently by exploiting the self-similarity cross subband in the wavelet *** utilizing morphological dilation, CGE forms significance clusters in each wavelet subband,and then exploits the parent-child relationship between subbands to encode the significance map information of one image.A salient new feature of CGE is that it tries to first encode the significance bits in the neighborhood of those already formed clusters. Therefore,CGE is more compatible to the functionality of embedded coding.

关键词： Cluster Growing Embedding(CGE) wavelet image coding Morphological Dilation

来源：评论

学校读者我要写书评

暂无评论

Rate Control Algorithms for Non-Embedded wavelet-Based image coding

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL image AND VIDEO TECHNOLOGY 2012年第2期68卷 203-216页

作者： Lopez Granado, Otoniel Mario Onofre Martinez-Rach, Miguel Pinol Peral, Pablo Oliver Gil, Jose Perez Malumbres, Manuel Miguel Hernandez Univ Elche 03205 Spain Univ Politecn Valencia Valencia 46222 Spain

During the last decade, there has been an increasing interest in the design of very fast wavelet image encoders focused on specific applications like interactive real-time image and video systems, running on power-constrained devices such as digital cameras, mobile phones where coding delay and/or available computing resources (working memory and power processing) are critical for proper operation. In order to reduce complexity, most of these fast wavelet image encoders are non-(SNR)-embedded and as a consequence, precise rate control is not supported. In this work, we propose some simple rate control algorithms for these kind of encoders and we analyze their impact to determine if, despite their inclusion, the global encoder is still competitive with respect to popular embedded encoders like SPIHT and JPEG2000. In this study we focus on the non-embedded LTW encoder, showing that the increase in complexity due to the rate control algorithm inclusion, maintains LTW competitive with respect to SPIHT and JPEG2000 in terms of R/D performance, coding delay and memory consumption.

关键词： wavelet image coding Fast image coding Rate control Non-embedded coding

来源：评论

学校读者我要写书评

暂无评论

Level-by-Level Adaptive Disparity Compensated Prediction in wavelet Domain for Stereo image coding 18th

Level-by-Level Adaptive Disparity Compensated Prediction in ...

引用

18th International Conference on image Analysis and Processing (ICIAP)

作者： Li, Shigao Jia, Liming Wuhan Polytech Univ Sch Math & Comp Sci Wuhan 430023 Hubei Peoples R China

ISBN: (纸本)9783319232348;9783319232331

Disparity compensation prediction and transform coding are incorporated into a hybrid coding to reduce the bit-rate of multi-view images. However, aliasing and inaccurate displacement impair the performance of disparity compensation, especially in wavelet domain. In this paper, we propose a level-by-level adaptive disparity compensated prediction scheme for scalable stereo image coding. To get spatial scalable feature, wavelet transform is first applied to the target image of a stereo image pair. A separable 2-D filter applied to the reference image is optimized for each resolution layer by minimizing the energy of the prediction high-bands of the target image. To form a multi-resolution representation, similar processes are then applied to the low-band image pairs generated by the prior resolution layer iteratively. Experimental results show that the proposed scheme can provide significant coding gain compared to other scalable coding scheme.

关键词： Disparity compensation image compression Stereo image coding wavelet image coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：