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

34th Asilomar Conference on Signals, Systems, and Computers

作者： Giguet, D Abousleman, GP Karam, LJ Arizona State Univ Dept Elect Engn Telecom Res Ctr Tempe AZ 85287 USA

ISBN: (纸本)0780365143

This paper presents the design of channel-optimized trellis-coded quantization (COTCQ) for channels with memory. The considered channel model is a binary channel with additive Markov noise. The proposed COTCQ stage exploits the channel memory by incorporating the characteristics of the correlated noise in the quantizer design. We investigate the performance of the memory-optimized COTCQ system for different bit error probabilities and noise correlation coefficients. We show that for a first-order Markov channel, COTCQ significantly outperforms channel-optimized scalar quantizer (COSQ), provided that an appropriate trellis is selected.

关键词： data compression trellis-coded quantization wireless communications

来源：评论

学校读者我要写书评

暂无评论

Minimizing Embedding Impact in Steganography using trellis-coded quantization

Minimizing Embedding Impact in Steganography using Trellis-C...

引用

Conference on Media Forensics and Security II

作者： Filler, Tomas Judas, Jan Fridrich, Jessica SUNY Binghamton Dept Elect & Comp Engn Binghamton NY 13902 USA

ISBN: (纸本)9780819479341

In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance with bounds derived from appropriate rate-distortion bounds. We assume that each cover element can be assigned a positive scalar expressing the impact of making an embedding change at that element (single-letter distortion). The problem is to embed a given payload with minimal possible average embedding impact. This task, which can be viewed as a generalization of matrix embedding or writing on wet paper, has been approached using heuristic and suboptimal tools in the past. Here, we propose a fast and very versatile solution to this problem that can theoretically achieve performance arbitrarily close to the bound. It is based on syndrome coding using linear convolutional codes with the optimal binary quantizer implemented using the Viterbi algorithm run in the dual domain. The complexity and memory requirements of the embedding algorithm are linear w.r.t. the number of cover elements. For practitioners, we include detailed algorithms for finding good codes and their implementation. Finally, we report extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel.

关键词： Steganography embedding impact matrix embedding wet paper codes trellis-coded quantization convolutional codes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Design of successively refinable trellis-coded quantizers

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1999年第5期45卷 1490-1497页

作者： Jafarkhani, H Tarokh, V AT&T Labs Res Red Bank NJ 07701 USA AT&T Shannon Labs Florham Pk NJ 07932 USA

We propose successively refinable trellis-coded quantizers for progressive transmission, (Progressive transmission is an essential component of image and multimedia browsing systems.) A new trellis structure which is scalable is used in the design of our trellis-coded quantizers. A hierarchical set partitioning is developed to preserve successive refinability. Two algorithms for designing trellis-coded quantizers which provide embedded bit streams are provided. The computational complexity of the proposed schemes is compared with that of trellis-coded quantization. Simulation results show excellent performances for memoryless sources.

关键词： embedded bit stream image browsing progressive transmission successive refinability trellis-coded quantization

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION AND EVALUATION OF trellis-coded QUANTIZERS FOR MEMORYLESS SOURCES

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1995年第3期41卷 853-859页

作者： VANDERVLEUTEN, RJ WEBER, JH DELFT UNIV TECHNOL DEPT ELECT ENGN INFORMAT THEORY GRP 2600 GA DELFT NETHERLANDS

New constructions of trellis waveform coders, trellis-coded quantizers, and trellis coded vector quantizers are proposed, The performances of the new quantizers are determined for the memoryless Laplacian, Gaussian, and uniform sources. They are better than (for the Gaussian and Laplacian sources) or equal to (for the uniform source) the best previously published results.

关键词： VECTOR quantization trellis WAVE-FORM CODING trellis-coded quantization MARKOV CHAIN SPECTRUM FAKE PROCESS trellis COMPLEXITY

来源：评论

学校读者我要写书评

暂无评论

LATTICE AND trellis quantization WITH LATTICE-BOUNDED AND trellis-BOUNDED CODEBOOKS - HIGH-RATE THEORY FOR MEMORYLESS SOURCES

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1993年第1期39卷 46-59页

作者： EYUBOGLU, MV FORNEY, GD NORTHEASTERN UNIV BOSTONMA 02115

High-rate lattice and trellis quantizers for nonuniform sources are introduced and analyzed. The performance of these quantizers is determined by two separable quantities, the granular gain and the boundary gain, which are determined by the shapes of the granular cells and of the support region, respectively. The granular gain and boundary gain are the duals of shaping and coding gain in data transmission applications. Using this duality, it is shown for Gaussian sources that the ultimate achievable boundary gain with high-rate lattice-bounded lattice codebooks is the same as the ultimate gain that can be obtained from variable-rate entropy coding. It is observed that if lattice codebooks can achieve the ultimate granular gain of 0.255 bit per dimension, then lattice-bounded lattice codebooks can approach the rate-distortion limit. Finally, the performance of lattice quantizers is compared to that of optimum vector quantizers.

关键词： SOURCE CODING VECTOR quantization LATTICE quantization trellis-coded quantization trellis-coded MODULATION SHAPING

来源：评论

学校读者我要写书评

暂无评论

Comparison of different methods of classification in subband coding of images

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1997年第11期6卷 1473-1486页

作者： Joshi, RL Jafarkhani, H Kasner, JH Fischer, TR Farvardin, N Marcellin, MW Bamberger, RH WASHINGTON STATE UNIV SCH ELECT ENGN & COMP SCI PULLMAN WA 99164 USA UNIV MARYLAND SYST RES INST COLLEGE PK MD 20742 USA UNIV MARYLAND DEPT ELECT ENGN COLLEGE PK MD 20742 USA UNIV ARIZONA DEPT ELECT & COMP ENGN TUCSON AZ 85721 USA

This paper investigates various classification techniques, applied to subband coding of images, as a way of exploiting the nonstationary nature of image subbands, The advantages of subband classification are characterized in a rate-distortion framework in terms of ''classification gain'' and overall ''subband classification gain.'' Two algorithms, maximum classification gain and equal mean-normalized standard deviation classification, which allow unequal number of blocks in each class, are presented, The dependence between the classification maps from different subbands is exploited either directly while encoding the classification maps or indirectly by constraining the classification maps, The trade-off between the classification gain and the amount of side information is explored, Coding results for a subband image coder based on classification are presented, The simulation results demonstrate the value of classification in subband coding.

关键词： arithmetic code classification image coding subband trellis-coded quantization wavelet

来源：评论

学校读者我要写书评

暂无评论

A low-complexity method for fixed-rate entropy-constrained vector quantization

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2006年第6期54卷 1030-1037页

作者： Nikneshan, S Khandani, AK Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

This paper describes a new approach to fixed-rate entropy-constrained vector quantization (FEVQ) for stationary memoryless sources where the structure of codewords are derived from a variable-length scalar quantizer. We formulate the quantization search operation as a zero-one integer-optimization problem, and show that the resulting integer program can be closely approximated by solving a simple linear program. The result is a Lagrange formulation which adjoins the constraint on the entropy (codeword length) to the distortion. Unlike the previously known methods with a fixed Lagrange multiplier, we use an iterative algorithm to optimize the underlying objective function, while updating the Lagrange multiplier until the constraint on the overall rate is satisfied. The key feature of the new method is the substantial reduction in the number of iterations in comparison with previous related methods. In order to achieve some packing gain, we combine the process of trellis-coded quantization with that of FEVQ. This results in an iterative application of the Viterbi algorithm on the underlying trellis for selecting the Lagrange multiplier. Numerical results are presented which demonstrate substantial improvement in comparison with the alternative methods reported in the literature.

关键词： entropy coding linear programming source coding trellis-coded quantization vector quantization

来源：评论

学校读者我要写书评

暂无评论

Minimizing Additive Distortion in Steganography Using Syndrome-trellis Codes

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2011年第3期6卷 920-935页

作者： Filler, Tomas Judas, Jan Fridrich, Jessica SUNY Binghamton Dept Elect & Comp Engn Binghamton NY 13902 USA

This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation. Let every possible value of every stego element be assigned a scalar expressing the distortion of an embedding change done by replacing the cover element by this value. The total distortion is assumed to be a sum of per-element distortions. Both the payload-limited sender (minimizing the total distortion while embedding a fixed payload) and the distortion-limited sender (maximizing the payload while introducing a fixed total distortion) are considered. Without any loss of performance, the nonbinary case is decomposed into several binary cases by replacing individual bits in cover elements. The binary case is approached using a novel syndrome-coding scheme based on dual convolutional codes equipped with the Viterbi algorithm. This fast and very versatile solution achieves state-of-the-art results in steganographic applications while having linear time and space complexity w.r.t. the number of cover elements. We report extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel. Practical merit of this approach is validated by constructing and testing adaptive embedding schemes for digital images in raster and transform domains. Most current coding schemes used in steganography (matrix embedding, wet paper codes, etc.) and many new ones can be implemented using this framework.

关键词： Coding loss convolutional codes embedding impact matrix embedding steganography trellis-coded quantization wet paper codes

来源：评论

学校读者我要写书评

暂无评论

Space-frequency adaptive subband image coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 1998年第8期45卷 1168-1173页

作者： Nuri, V TeraLog Inc Mountain View CA 94041 USA

In this brief, a high-quality, space-frequency adaptive, subband image codec is presented. The algorithm jointly optimizes space and frequency segmentation of an image. First, wavelet packets are formed to localize the high-energy frequency bands. Then, the subband coefficients are further classified to maximize the coding gain. The design target is the minimization of Lagrangian cost functions: the cost is the distortion in l(2) norm and the constraint is the coding mtc. The resultant mapping is used to quantize the subband coefficients with trellis coded quantization. This is followed by adaptive arithmetic coding producing the final compressed bitstream. The described approach is tested on several images, and the results are compared to some other compression techniques.

关键词： classification filter banks rate distortion theory trellis-coded quantization wavelet distortion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：