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

hierarchical VIDEO coding SCHEME WITH SCALABILITY AND COMPATIBILITY

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 1994年第3期77卷 25-40页

作者： HANAMURA, T SEKIGUCHI, SI KAMEYAMA, W TOMINAGA, H MITSUBISHI ELECTR CORP ELECTR COMMUN SYST LABSITAMIHYOGO 664JAPAN

In this paper, functional requirements for the MPEG 2 coding method are presented and, as an implementation method of these requirements, a hierarchical video coding scheme is proposed. in the proposed coding method, the prediction efficiency is increased by introducing spatial prediction in addition to temporal prediction as used in the MPEG 1 coding method. The hierarchical scheme is also characterized by the following features. (1) The input format is an output device-independent noninterlaced video;(2) the coder has a hierarchical structure that permits the resolution level to be selected by the user;(3) by means of a small number of operations and a wide compensation area, the coder gives a motion-detection method which detects motion vectors of each layer and a coding method of motion vectors;and (4) the proposed coding system introduces the use of down/up sampling processes with no phase distortion. Furthermore, the coding data description method is realized as an extension of that used by MPEG 1 and thus retains the compatibility. Simulation experiments show that this coding method satisfies the functional requirements without any obvious decrease in coding efficiency.

关键词： VIDEO coding hierarchical coding ATM coding PROGRESSIVE SCAN SIGNALS hierarchical MOTION DETECTION

来源：评论

学校读者我要写书评

暂无评论

Uniform polar quantizer with three-stage hierarchical variable-length coding for measurement signals with Gaussian distribution

引用

MEASUREMENT 2016年 88卷 214-222页

作者： Dincic, Milan R. Peric, Zoran H. Denic, Dragan B. Univ Nis Fac Elect Engn Aleksandra Medvedeva 14 Nish 18000 Serbia

In this paper, a new model of the uniform polar quantizer with three-stage hierarchical coding is proposed, for the analog-to-digital (A/D) conversion of measurement signals with the Gaussian distribution. The aim is to design quantizer with small complexity which can achieve very good performances. Proposed model accomplishes this aim. Applied code uses variable-length codewords, in order to achieve compression. The proposed model achieves much better performances (for 2-3 dB higher SQNR (signal-to-quantization noise ratio) for the same bit-rate) compared to the uniform scalar quantizer. Due to its small complexity and very good performances, the proposed model is suitable for using in many measurement systems for A/D conversion of measurement signals. This model especially can be useful in measurement systems where transmission of measurement signals is performed (e.g. telemetry, telemedicine, wireless sensor networks, etc.). The proposed model is applied for compression of a vibration signal. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： A/D conversion of measurement signals Polar quantization hierarchical coding Gaussian distribution Signal compression Vibration signals

来源：评论

学校读者我要写书评

暂无评论

On hierarchical joint source-channel coding with degraded side information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第3期52卷 886-903页

作者： Steinberg, Y Merhav, N Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

We extend the setting of two-stage lossy source coding with successive refinement structures into a joint source-channel coding setting. In particular, we consider a problem where two descriptions of a memoryless source are to be transmitted across two independent memoryless channels and where the output of the channel corresponding to the first (coarse) description is also available to the decoder of the second (refinement) decoder. Side information (SI), correlated to the source, may also be available to the decoders. In such a case, we confine attention to degraded SI, in the sense that the source, the SI available at the refinement decoder, and the SI available at the coarse decoder form a Markov chain in this order. Our first result is a separation theorem asserting that in the limit of long blocks, no optimality is lost by first applying lossy successive-refinement source coding, regardless of the channels, and then applying good channel codes to each one of the resulting bitstreams, regardless of the source and the SI. It is also shown that (even noiseless) feedback from the output of the first channel to the input of the second encoder cannot improve performance, but may sometimes significantly facilitate the implementation of optimum codes. We provide two examples where single-letter codes (of unit block length) achieve optimum performance, if feedback from the channel output of the first stage is provided to the encoder of the refinement stage. In one of these examples, it is evident that if feedback is not provided, optimality cannot be achieved with unit length code. Motivated by these examples, we then investigate single-letter codes for this system. Necessary and sufficient conditions are furnished for the optimality of single-letter codes with and without feedback. A corollary of these conditions is that for the quadratic distortion measure, feedback is necessary to achieve optimality in single-letter codes, regardless of the source distribution and t

关键词： hierarchical coding joint source-channel coding side information (SI) successive refinement systematic coding Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

hierarchical Loss less Image coding Using Cellular Neural Network

Hierarchical Loss less Image Coding Using Cellular Neural Ne...

引用

17th International Conference on Neural Information Processing

作者： Takenouchi, Seiya Aomori, Hisashi Otake, Tsuyoshi Tanaka, Mamoru Matsuda, Ichiro Itoh, Susumu Tokyo Univ Sci Dept Elect Engn 2641 Yamazaki Noda Chiba 2788510 Japan Tamagawa Univ Dept Software Sci Tokyo 1948610 Japan Sophia Univ Dept Informat & Commun Sci Tokyo 1028610 Japan

ISBN: (纸本)9783642175367

In this paper, a novel hierarchical lossless image coding scheme using the cellular neural network (CNN) is proposed. The coding architecture of the proposed method is based on the lifting scheme that is one of the scalable coding framework for still images, and its coding performance strongly depends on the prediction ability. To cope with this spontaneously characteristic, an image interpolation is modeled by an optimal problem that minimizes the prediction error. To achieve the high accuracy prediction with a low coding rate, two types of templates are used for dealing with the local structure of the image, and the CNN parameters are decided by the minimum coding rate learning. In the coding layer, the arithmetic coder with context modeling is used for obtaining a high coding efficiency. Experimental results in various standard test images suggest that the coding performance of our proposed method is better than that of conventional hierarchical coding schemes.

关键词： discrete-time cellular neural network hierarchical coding context modeling

来源：评论

学校读者我要写书评

暂无评论

Improved hierarchical lossless video coding 15

Improved Hierarchical lossless video coding

引用

15th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA)

作者： Ammous, D. Kammoun, F. Masmoudi, N. Univ Sfax Natl Sch Engineers Sfax Lab Elect & Technol Informat Circuit & Syst Team C&S Sfax Tunisia

ISBN: (纸本)9781479959075

Lossy video coding can be achieved by using the H.264 Advanced Video coding. Some methods have been proposed to transform this coder into a lossless one. The hierarchical lossless video coding structure with new intra algorithm prediction was proposed to reach this goal. In this paper we proposed some enhancements of this method to improve the coding efficiency. The simulation results show that the proposed enhancements reduce the total bit of the coded sequence and the execution time.

关键词： H.264/AVC Lossless video coding hierarchical coding DPCM FRExt

来源：评论

学校读者我要写书评

暂无评论

coding and Common Reconstruction

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第11期55卷 4995-5010页

作者： Steinberg, Yossef Technion Israel Inst Technol Dept Elect Engn IL-32000 Technion Haifa Israel

This work studies problems of source and joint source-channel coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as the common reconstruction constraint (CR), is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy source coding with side information at the decoder (the Wyner-Ziv problem), distributed source coding, and joint source-channel coding for networks, the destination can exploit the information it receives in a manner that cannot be exactly reproduced at the sender side. Some applications, like the transmission of sensitive medical information, may require that both sides-the sender and the receiver-will share a common version of the compressed data, for the purpose of future discussions or consulting. The purpose of this work is to study the implications of CR constraints on the achievable rates in scenarios of lossy source coding and lossy transmission of sources. Three problems are examined: source coding with side information at the decoder, simultaneous transmission of data and state over state-dependent channels, and joint source-channel coding for the degraded broadcast channel. Single-letter characterizations of the optimal performance are developed for these problems, under corresponding CR constraints. Implications of this constraint on problems of joint source-channel coding in networks are discussed.

关键词： Broadcast channel common reconstruction (CR) Gel'fand-Pinsker channel hierarchical coding joint source-channel coding source coding with side information successive refinement state-dependent channels Wyner-Ziv problem

来源：评论

学校读者我要写书评

暂无评论

Packet loss resilience of MPEG-2 scalable video coding algorithms

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1996年第5期6卷 426-435页

作者： Aravind, R Civanlar, MR Reibman, AR AT&T BELL LABS RES VISUAL COMMUN RES DEPT HOLMDEL NJ 07733 USA

Transmission of compressed video over packet networks with nonreliable transport benefits when packet loss resilience is incorporated into the video coding, One promising approach to packet loss resilience, particularly for transmission over networks offering dual priorities such as asynchronous transfer mode (ATM) networks, is based on layered coding which uses at least two bitstreams to encode video, The base-layer bitstream, which can be decoded independently to produce a lower quality picture, is transmitted over a high priority channel, The enhancement-layer bitstream(s) contain less important information, so that packet losses are more easily tolerated, The MPEG-2 International Standard provides four methods to produce a layered video bitstream: data partitioning, signal-to-noise ratio scalability, spatial scalability, and temporal scalability, Each of these techniques was included in the standard in part for motivations other than loss resilience, This paper compares the performance of these techniques (excluding temporal scalability) under various loss rates using realistic length video material and discusses their relative merits taking implementation issues into consideration. Nonlayered MPEG-2 coding gives generally unacceptable video quality for packet loss ratios of 10(-3) for small (single ATM cell) packet sizes, Better performance can be obtained using layered coding and dual-priority transmission, With data partitioning, the simplest to implement among the three, cell loss ratios of 10(-4) in the low-priority layer are definitely acceptable, while for SNR scalable encoding, cell loss ratios of 10(-3) are generally invisible, even to experienced viewers, Spatial scalable encoding can provide even better visual quality under packet losses;however, it has a high implementation complexity.

关键词： Packet loss LOSS RATIO Packet switched networks hierarchical coding Scalability scalable video coding Data partitioning Video compression Resilience bit stream

来源：评论

学校读者我要写书评

暂无评论

Optimal wiener interpolation filters for multiresolution coding of images

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 1997年第2期7卷 443-447页

作者： Sikora, T Laboratory of Chromatography DEPg.Fac.Quimica Universidad Nacional Autonoma de Mexico Circuito interior Cd Universitaria/CP 04510 Mexico D.F.Mexico

A design approach is presented which allows the optimization of coefficients for symmetric and separable finite impulse response (FIR) interpolation filters for multiresolution coding schemes, The interpolation filters serve as optimal inverse filters in the Wiener sense and are designed to match the characteristics of the specific filters used for decimation as well as for the statistics of ''typical'' images to be reconstructed, Applied to the coding of test images in a four-level progressive pyramid scheme, the optimal interpolation filters generated substantially improved rate-distortion results compared to conventional filters.

关键词： hierarchical coding image coding image decimation image interpolation inverse filtering Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

Efficient, low-complexity image coding with a set-partitioning embedded block coder

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2004年第11期14卷 1219-1235页

作者： Pearlman, WA Islam, A Nagaraj, N Said, A Rensselaer Polytech Inst Dept Elect Comp & Syst Engn Troy NY 12180 USA Nokia Inc Irvington TX 75039 USA GE John F Welch Technol Ctr Bangalore 560066 Karnataka India Hewlett Packard Labs Palo Alto CA 94304 USA

We propose an embedded, block-based, image wavelet transform coding algorithm of low complexity. It uses a recursive set-partitioning procedure to sort subsets of wavelet coefficients by maximum magnitude with respect to thresholds that are integer powers of two. It exploits two fundamental characteristics of an image transform-the well-defined hierarchical structure, and energy clustering in frequency and in space. The two partition strategies allow for versatile and efficient coding of several image transform structures, including dyadic, blocks inside subbands, wavelet packets, and discrete cosine transform (DCT). We describe the use of this coding algorithm in several implementations, including reversible (lossless) coding and its adaptation for color images, and show extensive comparisons with other state-of-the-art coders, such as set partitioning in hierarchical trees (SPIHT) and JPEG2000. We conclude that this algorithm, in addition to being very flexible, retains all the desirable features of these algorithms and is highly competitive to them in compression efficiency.

关键词： color image coding embedded coding entropy coding hierarchical coding image coding lossless coding wavelet coding

来源：评论

学校读者我要写书评

暂无评论

coding problems for channels with partial state information at the transmitter

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第12期53卷 4521-4536页

作者： Cemal, Yakup Steinberg, Yossef AudioCodes Ltd IL-70151 Lod Israel Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

Channel coding for single-user channels with rate-limited, coded, partial channel state information at the transmitter and full side information (SI) at the receiver is studied. In the first part of the current work, we consider joint source-channel state channel coding. In particular, we deal with lossy transmission of a source, over a cost-constrained state controlled channel where the receiver gets full SI and the transmitter receive coded partial SI. We derive a single-letter characterization of the achievable distortion-cost triples. From this characterization, a separation principle follows for both, coding of the main source and the transmitter SI. In the second part, we consider channel coding when the transmitter receives multiple partial, rate-limited descriptions of the state, and the receiver gets full SI. Two rate-limited descriptions of the state sequence are generated and conveyed to the transmitter, where each description can be lost independently during this transmission. For three different possible partial SI at the transmitter, we explore a channel coding strategy with three different forward channel rates. Inner and outer bounds are derived on the set of achievable partial description and forward channel rates. Furthermore, special cases where the inner bound is tight are studied. Similarities between coding of SI as multiple partial descriptions and the multiple description problem of source coding theory are pointed out.

关键词： coded side information (SI) excess rate hierarchical coding joint source-channel coding multiple description state-controlled channels successive refinement

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：