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

29th Picture Coding Symposium (PCS)

作者： Kim, Jaehwan Yang, Jungyoup Won, Kwanghyun Jeon, Byeungwoo Sungkyunkwan Univ Sch Informat & Commun Engn Suwon South Korea

ISBN: (纸本)9781457720482

In this paper, we propose a fast decision method scheme to reduce encoder complexity of high efficiency video coding. It is an early detection of SKIP mode in one CU-level based on the differential motion vector (DMV) and coded block flag (CBF). Experimental results show that the encoding complexity can be reduced by up to 34.55% in random access (RA) configuration and 36.48% in low delay (LD) configuration with only a little bit of rate increment compared to the high efficiency video coding test model (HM) 4.0 reference software.

关键词： encoding complexity differential movements Early Diagnosis Res judicata experimental model

来源：评论

学校读者我要写书评

暂无评论

Design of tree-structured multiple description vector quantizers

Design of tree-structured multiple description vector quanti...

引用

Data Compression Conference (DCC 2001)

作者： Cardinal, J Free Univ Brussels Dept Comp Sci B-1050 Brussels Belgium

ISBN: (纸本)0769510310

We present a new multiple description source coding scheme based oil tree-structured vector quantization (TSVQ). In this scheme, the codebook of each decoder is organized in a binary tree. The encoding is greedy and based on a sequence of binary decisions as in traditional TSVQ. Each binary decision of the encoder corresponds to adding information on one of the available channels and the encoding complexity can be shown to be proportional to the total bitrate. We describe the encoder structure for the two-channel case, and propose an entropy-constrained design algorithm based on marginal return analysis. Experimental results on a Gaussian source are presented for various design parameters and the generalization of the scheme to more than two channels is outlined.

关键词： binary decision 2-channel ENCODER encoding complexity Available channels quantizer Design Algorithm greedy method decoders Scheme

来源：评论

学校读者我要写书评

暂无评论

Modified Segment Constrained Vector Quantizer Design 23

Modified Segment Constrained Vector Quantizer Design

引用

23nd Signal Processing and Communications Applications Conference (SIU)

作者： Jahromi, Mohammad N. S. Demirciler, Kemal Hasan Kalyoncu Univ Dept Elect & Elect Engn Gaziantep Turkey Eastern Mediterranean Univ Dept Elect & Elect Engn TR-10 Trnc Mersin Turkey

ISBN: (纸本)9781467373869

In this paper, we modify the segment constrained vector quantizer (VQ), called Seg-VQ, by keeping the first segment length fixed and allowing the other segments design iteratively. As in Seg-VQ, in modified Seg-VQ the first principle component is used as a design reference for the initial line segment. However unlike Seg-VQ, in modified Seg-VQ the segment length of the first principle component is kept fixed at a fraction of the standard deviation of the projected input vectors onto the first principle component. The results show that by fixing the first segment at a proper length as a design scheme, Modified Seg-VQ improves the performance of Seg-VQ.

关键词： constrained vector quantization encoding complexity data compression

来源：评论

学校读者我要写书评

暂无评论

Error floor Analysis of LT Codes over the Additive White Gaussian Noise Channel

Error floor Analysis of LT Codes over the Additive White Gau...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Hussain, Iqbal Xiao, Ming Rasmussen, Lars K. KTH Royal Inst Technol Sch Elect Engn Commun Theory Lab Stockholm Sweden

ISBN: (纸本)9781424492688

We investigate the error floor performance of Luby Transform (LT) codes over the additive white Gaussian noise channel. We first derive a lower bound on the bit error rate for an LT code, which we subsequently use to show that the corresponding error floor is predominantly caused by low-degree variable nodes. Based on this observation, we propose a modified encoding scheme for LT codes that provides a lower error floor with no increase in encoding and decoding complexities. The convergence behavior of the proposed scheme is analyzed using extrinsic information transfer charts, and shown to be similar to the original LT code. Numerical examples demonstrate the improvements of the modified LT code as a stand-alone code and as a component code of a Raptor code.

关键词： AWGN channels AWGN channels Bit error rate Convergence Decoding encoding Generators LT codes Luby transform codes Peer to peer computing Raptor code additive white Gaussian noise channel bit error rate communication complexity component code convergence behavior decoding decoding complexity encoding complexity error floor analysis error floor performance error statistics extrinsic information transfer charts low-degree variable nodes modified encoding scheme stand-alone code transform coding

来源：评论

学校读者我要写书评

暂无评论

Implementation of a flexible encoder for structured low-density parity-check codes

Implementation of a flexible encoder for structured low-dens...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing

作者： Kopparthi, Sunitha Gruenbacher, Don M. Kansas State Univ Dept Elect & Comp Engn Manhattan KS 66506 USA

ISBN: (纸本)9781424411894

The hardware implementation of an encoder for randomly generated low-density parity-check (LDPC) codes requires large area. Using structured LDPC codes decreases the encoding complexity and also provides design flexibility. In this paper, an architecture for implementing an encoder is presented that adheres to the structured LDPC codes defined in the IEEE 802.16e standard. The design methodology is flexible in terms of both the code rate and code length. Results are provided for an implementation on a Stratix FPGA for codes with rates 1/2, 23, 3/4 and 5/6, and block lengths ranging from 576-2304. The number of logic elements, clock speed, and throughput of the encoder for the different code lengths are presented. The design achieves encoding rates in excess of 400 Mbps.

关键词： low density parity check codes ENCODER code length code rate encoding complexity BLOCK LENGTH FLEXIBLE

来源：评论

学校读者我要写书评

暂无评论

Comprehensive complexity Assessment of Emerging Learned Image Compression on CPU and GPU 48

Comprehensive Complexity Assessment of Emerging Learned Imag...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Pakdaman, Farhad Gabbouj, Moncef Tampere University Faculty of Information Technology and Communication Sciences Finland University of Mazandaran Faculty of Engineering and Technology Babolsar*** Iran

ISBN: (纸本)9781728163277

Learned Compression (LC) is the emerging technology for compressing image and video content, using deep neural networks. Despite being new, LC methods have already gained a compression efficiency comparable to state-of-the-art image compression, such as HEVC or even VVC. However, the existing solutions often require a huge computational complexity, which discourages their adoption in international standards or products. This paper provides a comprehensive complexity assessment of several notable methods, that shed light on the matter, and guide the future development of this field by presenting key findings. To do so, six existing methods have been evaluated for both encoding and decoding, on CPU and GPU platforms. Various aspects of complexity such as the overall complexity, share of each coding module, number of operations, number of parameters, most demanding GPU kernels, and memory requirements have been measured and compared on Kodak dataset. The reported results (1) quantify the complexity of LC methods, (2) fairly compare different methods, and (3) a major contribution of the work is identifying and quantifying the key factors affecting the complexity. © 2023 IEEE.

关键词： complexity assessment encoding complexity image coding Learned compression

来源：评论

学校读者我要写书评

暂无评论

Can a Noisy Encoder be Used to Communicate Reliably?

Can a Noisy Encoder be Used to Communicate Reliably?

引用

52nd Annual Allerton Conference on Communication, Control, and Computing

作者： Yang, Yaoqing Grover, Pulkit Kar, Soummya Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781479980093

In this paper the problem of reliable communication with a noisy encoder is examined. We explicitly provided the construction of the encoder and show that even when all logic gates that constitute the encoder are noisy, reliable communication with a positive rate is still possible. The encoding complexity is shown to be O(log 1/p(tar) / log 1/epsilon) per bit to achieve a target bit error rate p(tar), where epsilon denotes the error probability of each noisy gate. This complexity upper bound is shown to coincide with a lower bound in order sense, and is hence tight. The key technique in the proposed construction is to embed noisy decoders inside the noisy encoder, which are utilized repeatedly to prevent the bit error rate from escalating. The proposed noisy encoder has a direct application in noisy computing of a linear transform.

关键词： encoding error statistics telecommunication network reliability encoding complexity error probability linear transform noisy encoder reliable communication target bit error rate Bit error rate Decoding encoding Logic gates Noise measurement Parity check codes Reliability Bit error rate encoding complexity Error probability ENCODER Logic gates Noise parity check codes telecommunication network reliability Noise measurement DECODING coding

来源：评论

学校读者我要写书评

暂无评论

Design patterns for sorting 01

Design patterns for sorting

引用

32nd SIGCSE Technical Symposium on Computer Science Education

作者： Nguyen, D Wong, SB Rice Univ Dept Comp Sci Houston TX 77251 USA

ISBN: (纸本)1581133294

Drawing on Merritt's divide-and-conquer sorting taxonomy [1], we model comparison-based sorting as an abstract class with a template method to perform the sort by relegating the splitting and joining of arrays to its concrete subclasses. Comparison on objects is carried out via an abstract ordering strategy. This reduces code complexity and simplifies the analyses of the various concrete sorting algorithms. Performance measurements and visualizations can be added without modifying any code by utilizing the decorator design pattern. This object-oriented design not only provides the student a concrete way of unifying seemingly disparate sorting algorithms but also help him/her differentiate them at the proper level of abstraction.

关键词： design pattern sorting programs Sorting algorithm template process grade level of abstraction Visualization Concrete drawing Drawing encoding complexity ordering strategy Painters

来源：评论

学校读者我要写书评

暂无评论

Object-Cooperated Ternary Tree Partitioning Decision Method for Versatile Video Coding

引用

SENSORS 2022年第17期22卷 6328-6328页

作者： Lee, Sujin Park, Sang-hyo Jun, Dongsan Kyungpook Natl Univ Sch Comp Sci & Engn Daegu 41566 South Korea Dong A Univ Dept Comp Engn Busan 49315 South Korea

In this paper, we propose an object-cooperated decision method for efficient ternary tree (TT) partitioning that reduces the encoding complexity of versatile video coding (VVC). In most previous studies, the VVC complexity was reduced using decision schemes based on the encoding context, which do not apply object detecion models. We assume that high-level objects are important for deciding whether complex TT partitioning is required because they can provide hints on the characteristics of a video. Herein, we apply an object detection model that discovers and extracts the high-level object features-the number and ratio of objects from frames in a video sequence. Using the extracted features, we propose machine learning (ML)-based classifiers for each TT-split direction to efficiently reduce the encoding complexity of VVC and decide whether the TT-split process can be skipped in the vertical or horizontal direction. The TT-split decision of classifiers is formulated as a binary classification problem. Experimental results show that the proposed method more effectively decreases the encoding complexity of VVC than a state-of-the-art model based on ML.

关键词： ternary tree versatile video coding object detection encoding complexity machine learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive fractional motion and disparity estimation skipping in MV-HEVC

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2021年 79卷 103223-103223页

作者： Lee, Jin Young Park, Sang-hyo Sejong Univ Sch Intelligent Mechatron Engn Seoul South Korea Kyungpook Natl Univ Sch Comp Sci & Engn Daegu South Korea

MV-HEVC can efficiently compress multiview video data captured from different viewpoints. To achieve high coding efficiency, it consists of not only inter coding but also interview coding. The inter coding includes a motion estimation (ME) process that reduces temporal redundancies between consecutive frames, and the interview coding performs a disparity estimation (DE) that reduces interview redundancies between neighboring views. As a result, MV-HEVC needs high encoding complexity to perform both ME and DE. In order to reduce the complexity, this paper proposes an adaptive fractional ME and DE skipping method in a partitioned inter pre-diction unit (PU) mode, based on a result of a 2 N x 2 N inter PU coding. Experimental results show that the proposed method efficiently reduces the encoding complexity with negligible coding loss, compared to con-ventional methods.

关键词： encoding complexity Disparity estimation (DE) Motion estimation (ME) Interview coding MV-HEVC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：