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

Successive refinement for the Wyner-Ziv problem and layered code design

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2005年第8期53卷 3269-3281页

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

We examine successive refinement for the Wyner-Ziv problem described in a recent paper by Steinberg and Merhav, where the authors showed that if the side information for all stages is identical, then the jointly Gaussian source with squared error distortion measure is successively refinable. We first extend this result to the case where the difference between the source and the side information is Gaussian and independent of the side information. As a byproduct, we give an alternative proof that the Wyner-Ziv problem for these sources has no rate loss-a result that was recently shown by Pradhan et al. through invoking the duality between the Gaussian Wyner-Ziv problem and the Costa problem. We then perform layered Wyner-Ziv code design for this general type of source based on nested scalar quantization, bit-plane coding, and low-density parity check (LDPC) code-based Slepian-Wolf coding (source coding with side information). We show that density evolution can be used to analyze the Slepian-Wolf code performance, provided that certain symmetry conditions, which have been dubbed dual symmetry, are satisfied by the hypothetical channel between the source and the side information. We also show that the dual symmetry condition is indeed satisfied by the hypothetical channel in our Slepian-Wolf coding setup. This justifies the use of density evolution in our LDPC code-based Slepian-Wolf code design for Wyner-Ziv coding. For the jointly Gaussian source, our layered coder performs 1.29 to 3.45 dB from the Wyner-Ziv bound for rates ranging from 0.47 to 4.68 bits per sample. When the side information is Laplacian and the source equals the side information plus an independent Gaussian noise term, our layered coder performs 1.33 to 3.90 dB from the Wyner-Ziv bound for rates ranging from 0.48 to 4.64 bits per sample.

关键词： bit-plane coding LDPC coding nested scalar quantization Slepian-Wolf coding successive refinement Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

Macroblock-based progressive fine granularity scalable video coding

引用

INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY 2003年第6期13卷 297-307页

作者： Wu, F Li, SP Sun, XY Zeng, B Zhang, YQ Microsoft Res Asia Beijing Peoples R China Harbin Inst Technol Harbin 150006 Peoples R China Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China

A novel highly efficient macroblock-based progressive fine granularity scalable (MBPFGS) video coding scheme that can optimally balance drifting errors and coding efficiency is proposed in this article. In order to improve coding efficiency, the existing PFGS video coding scheme uses a set of high-quality references to predict the enhancement layers. However, potential drifting errors may arise because high-quality references may not always be available at the decoder when channel bandwidth fluctuates. To solve this problem, we first analyze when drifting errors occur and how they will propagate. Then, an iterative model is established to estimate the drifting errors at the encoder. Meanwhile, three new INTER modes are proposed for the coding of macroblocks at the enhancement layers. One of these modes provides an effective and flexible method to reduce the drifting errors at low enhancement bit rates. Furthermore, we present a decision-making mechanism to select the proper coding mode for each macroblock at the enhancement layers. Experimental results show that the proposed techniques can dramatically reduce drifting errors at low enhancement bit rates, while significantly improving coding efficiency, up to 2.3 dB in average PSNR, compared with MPEG-4 FGS at moderate or high bit rates. (C) 2004 Wiley Periodicals, Inc.

关键词： layer-based coding bit-plane coding fine granularity scalability (FGS) progressive fine granularity scalability (PFGS) drifting error and reduction INTER coding mode

来源：评论

学校读者我要写书评

暂无评论

Efficient fine granularity scalability using adaptive leaky factor

引用

IEEE TRANSACTIONS ON BROADCASTING 2005年第4期51卷 512-519页

作者： Gao, YL Chau, LP Nanyang Technol Univ Sch Elect & Elect Engn Media Technol Lab Singapore 639798 Singapore

Fine Granularity Scalability (FGS) video coding has been adopted by the MPEG-4 standard for video streaming applications. In this paper, we propose a novel FGS coding scheme, which applied adaptive leaky factors for the enhancement layer prediction to further improve the coding efficiency of FGS. A flexible method that can dynamically determine the leaky factors according to the network conditions is also presented. With the proposed method, a better trade-off between the coding efficiency and drifting reduction can be achieved, and the coding performance is further improved compared with using a fixed leaky factor. Experimental results show that the proposed method can further improve the coding efficiency over a wide range of bitrate and packet loss ratio, and still keep the original characteristics, such as fine granularity, and bandwidth adaptation.

关键词： bit-plane coding fine granularity scalability (FGS) video streaming

来源：评论

学校读者我要写书评

暂无评论

A reduced-complexity image coding scheme using decision-directed wavelet-based contourlet transform

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2012年第7期23卷 1128-1143页

作者： Hung, Chao-Hsiung Hang, Hsueh-Ming Natl Chiao Tung Univ Dept Elect Engn Hsinchu Taiwan

Recently the wavelet-based contourlet transform (WBCT) is adopted for image coding because it matches better image textures of different orientations. However, its computational complexity is very high. In this paper, we propose three tools to enhance the WBCT coding scheme, in particular, on reducing its computational complexity. First, we propose short-length 2-D filters for directional transform. Second, the directional transform is applied to only a few selected subbands and the selection is done by a mean-shift-based decision procedure. Third, we fine-tune the context tables used by the arithmetic coder in WBCT coding to improve coding efficiency and to reduce computation. Simulations show that, at comparable coded image quality, the proposed scheme saves over 92% computing time of the original WBCT scheme. Comparing to the conventional 2-D wavelet coding schemes, it produces clearly better subjective image quality. (c) 2012 Elsevier Inc. All rights reserved.

关键词： Contourlet transform Wavelet-based contourlet transform bit-plane coding Directional filter bank Directional transform Wavelet transform Image coding Computational complexity reduction Adaptive Directional Transform

来源：评论

学校读者我要写书评

暂无评论

A 3D-DCT video encoder using advanced coding techniques for low power mobile device

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2017年 48卷 122-135页

作者： Park, Jeoong Sung Ogunfunmi, Tokunbo Santa Clara Univ 500 El Camino Real Santa Clara CA 95053 USA

The three-dimensional discrete cosine transform (3D-DCT) has been researched as an alternative to existing dominant video standards based on motion estimation and compensation. Since it does not need to search macro block for inter/intra prediction, 3D-DCT has great advantages for complexity. However, it has not been developed well because of poor video quality while video standards such as H.263(+) and HEVC have been blooming. In this paper, we propose a new 3D-DCT video coding as a new video solution for low power mobile technologies such as Internet of Things (loT) and Drone. We focus on overcoming drawbacks reported in previous research. We build a complete 3D-DCT video coding system by adopting existing advanced techniques and devising new coding algorithms to improve overall performance of 3DDCT. Experimental results show proposed 3D-DO outperforms H.264 low power profiles while offering less complexity. From GBD-PSNR, proposed 3D-DO provides better performance by average 4.6 dB. (C) 2017 Elsevier Inc. All rights reserved.

关键词： 3D-DCT bit-plane coding Video compression for low power

来源：评论

学校读者我要写书评

暂无评论

A high-performance JPEG2000 architecture

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2003年第3期13卷 209-218页

作者： Andra, K Chakrabarti, C Acharya, T Arizona State Univ Dept Elect Engn Res Ctr Tempe AZ 85287 USA

JPEG2000 is an upcoming compression standard for still images that has a feature set well tuned for diverse data dissemination. These features are possible due to adaptation of the discrete wavelet transform, intra-subband bit-plane,coding, and binary arithmetic coding in the standard. In this paper, we propose a system-level architecture capable of encoding and decoding the JPEG2000 core algorithm that has been defined in Part I of the standard. The key components include dedicated architectures for wavelet, bit plane, and arithmetic coders and memory interfacing between the coders. The system architecture has been implemented in VHDL and its performance evaluated for a set of images. The estimated area of the architecture, in 0.18-mu technology, is 3-min square and the estimated frequency of operation is 200 MHz.

关键词： binary arithmetic coding bit-plane coding JPEG2000 system architecture wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Embedded block coding in JPEG 2000

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2002年第1期17卷 49-72页

作者： Taubman, D Ordentlich, E Weinberger, M Seroussi, G Univ New S Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia GlobeSpan Santa Clara CA USA Hewlett Packard Labs Palo Alto CA USA

This paper describes the embedded block coding algorithm at the heart of the JPEG 2000 image compression standard, The paper discusses key considerations which led to the development and adoption of this algorithm, and also investigates performance and complexity issues, The JPEG 2000 coding system achieves excellent compression performance, somewhat higher (and, in some cases, substantially higher) than that of SPIHT with arithmetic coding, a popular benchmark for comparison The algorithm utilizes the same low complexity binary arithmetic coding engine as JBIG2. Together with careful design of the bit-plane coding primitives, this enables comparable execution speed to that observed with the simpler variant of SPIHT without arithmetic coding. The coder offers additional advantages including memory locality, spatial random access and ease of geometric manipulation. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： JPEG 2000 image compression scalable compression embedded coding bit-plane coding arithmetic coding wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Texture segmentation in the joint photographic expert group 2000 domain

引用

IET IMAGE PROCESSING 2011年第6期5卷 554-559页

作者： Hsin, H. -C. Natl United Univ Dept Comp Sci & Informat Engn Taipei Taiwan

Image segmentation is an important task in many image processing systems. For efficient transmission over a band-limited channel, original images are often compressed before being stored in databases. In order to avoid the burden of decompressing an image, it is desirable to extract features directly from a code stream. This approach saves computational time significantly. The look up table used for the MQ coder defined in joint photographic expert group 2000 (JPEG2000) called the MQ table provides probability models for bit-plane coding of wavelet coefficients, the wavelet histogram information can be obtained directly from a JPEG2000 code stream. Thus, the MQ feature based on the MQ table is proposed to segment an image in the JPEG2000 domain directly. Experimental results of clustering these features by using the simple K-means algorithm show the potential of MQ feature.

关键词： texture segmentation band-limited channel data compression image processing systems code stream Computer vision and image processing techniques Image and video coding image coding MQ feature image segmentation pattern clustering wavelet coefficients feature extraction joint photographic expert group 2000 domain image compression image texture Computational complexity computational complexity /(-means algorithm computational time JPEG2000 code stream bit-plane coding wavelet histogram information

来源：评论

学校读者我要写书评

暂无评论

Subtitle enhancement in MPEG-4 for very low bit rate streaming video

Subtitle enhancement in MPEG-4 for very low bit rate streami...

引用

Conference on Image and Video Communications and Processing

作者： Truong, TK Chen, SH I Shou Univ Dept Informat Engn Kaohsiung 84008 Taiwan

ISBN: (纸本)0819448222

This paper develops a bit-plane coding technique to achieve the. subtitle enhancement in MTEG-4 for very low bit rate streaming video. The original video frame that contains subtitle information is encoded by the use of MPEG-4 codec and then the MTEG-4 decoded Y frame is subtracted from the original one to generate a residue. Because the subtitle information usually appears on the special region of a video frame, one can pre-set the position of the subtitle region and just process this residue subtitle region for subtitle enhancement. The pixel value of the residue subtitle region will be transferred from decimal number to binary number. Thus one can obtain 8 bit-planes of the residue subtitle region. For each bit-plane, (RUN, EOP) symbols are formed and then encoded via the variable length coding to produce the output bitstream. It has been shown that such a bit-plane coding technique is very efficient and its decoding procedure can be easily performed. From various experimental results, using MSB, MSB-1 and MSB-2 planes can obtain a satisfied subtitle visual enhancement with only increasing 5% bit rate.

关键词： bit-plane coding subtitle enhancement MPEG-4

来源：评论

学校读者我要写书评

暂无评论

Pattern-based error recovery of low resolution subbands in JPEG2000

Pattern-based error recovery of low resolution subbands in J...

引用

IEEE International Conference on Image Processing (ICIP 2007)

作者： Aminlou, Alireza Hajari, Nasim Badakhshannoory, Hossein Hashemi, Mahmoud Reza Fatemi, Omid Univ Tehran Sch Elect & Comp Engn Multimedia Proc Lab Tehran Iran

ISBN: (纸本)9781424414369

Digital image transmission is widely used in consumer products, such as digital cameras and cellular phones, where low bit rate coding is required. In any low bit rate encoder, such as the JPEG2000 standard, data truncation (during the encoding process), and data loss (during transmission) will result in lost bit-planes, which will be normally replaced by zeros. In this paper a new algorithm has been proposed, which recovers the lost/truncated lower bit-planes of coefficients in the LL subband of a wavelet transform in a JPEG2000 stream using the data available in higher bit-planes of the same coefficient and its eight neighbors. Simulation results indicate that the proposed algorithm achieves 5.40-8.77 dB improvement with respect to zero filling data recovery method.

关键词： error recovery JPEG2000 bit-plane coding data truncation discrete wavelet transform

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：