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

fast encoding algorithm avoiding repetition of motion estimation in scalable video coding

ELECTRONICS LETTERS 2010年第4期46卷 280-281页

作者： Park, C. -S. Jung, S. -W. Choi, K. -S. Ko, S. -J. Korea Univ Sch Elect Engn Seoul 136701 South Korea

Proposed is a fast encoding algorithm which avoids the repetition of the motion estimation process in the current scalable video coding (SVC) codec. Experimental results show that the proposed algorithm can reduce encoding time by 29.69-37.80%, while the coding performance of the SVC codec adopting the proposed algorithm is exactly the same as that of the original one.

关键词： SVC codec fast encoding algorithm image enhancement motion estimation motion estimation scalable video coding video coding

来源：评论

学校读者我要写书评

暂无评论

fast encoding algorithm FOR VQ-BASED IMAGE-CODING

引用

ELECTRONICS LETTERS 1990年第19期26卷 1618-1619页

作者： HUANG, SH CHEN, SH NATL CHIAO TUNG UNIV DEPT COMMUN ENGNHSINCHU 30039TAIWAN

The encoding of a VQ-based image coding requires a full codebook search for each input vector to find out the best matched codeword. It is a time consuming process. A fast algorithm for vector quantising image data is... 详细信息

关键词： VQ-based image coding best matched codeword codebook search computerised picture processing data compression encoding fast algorithm fast encoding algorithm table lookup vector quantising image data

来源：评论

学校读者我要写书评

暂无评论

A fast vector quantization encoding algorithm using multiple projection axes

引用

SIGNAL PROCESSING 1999年第1期75卷 89-92页

作者： Baek, S Bae, M Sung, KM Seoul Natl Univ Sch Elect Engn Seoul South Korea

Computation of nearest neighbor generally requires a large number of expensive distance calculations. In this paper, we present an algorithm which uses multiple projection axes to accelerate the encoding process of VQ by eliminating the necessity of calculating many distances. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as a conventional full search algorithm. The simulation results confirm the effectiveness of the proposed algorithm. (C) 1999 Published by Elsevier Science B.V. All rights reserved.

关键词： multiple projection axes fast encoding algorithm vector quantization

来源：评论

学校读者我要写书评

暂无评论

Construction of protograph LDPC codes with circular generator matrices

引用

Journal of Systems Engineering and Electronics 2011年第5期22卷 840-847页

作者： Kaiyao Wang Yang Xiao Kiseon Kim Institute of Information Science Beijing Jiaotong University Beijing 100044 E R. China Department of Information and Communications Gwangju Institute of Science and Technology Gwangju 500-712 Korea

The application of protograph low density parity check （LDPC） codes involves the encoding complexity problem. Since the generator matrices are dense, and if the positions of ＂1＂ s are irregularity, the encoder needs to store every ＂1＂ of the generator matrices by using huge chip area. In order to solve this problem, we need to design the protograph LDPC codes with circular generator matrices. A theorem concerning the circulating property of generator matrices of nonsingular protograph LDPC codes is proposed. The circulating property of generator matrix of nonsingular protograph LDPC codes can be obtained from the corresponding quasi-cyclic parity check matrix. This paper gives a scheme of constructing protograph LDPC codes with circulating generator matrices, and it reveals that the fast encoding algorithm of protograph LDPC codes has lower encoding complexity under the condition of the proposed theorem. Simulation results in ad- ditive white Gaussian noise （AWGN） channels show that the bit error rate （BER） performance of the designed codes based on the proposed theorem is much better than that of GB20600 LDPC codes and Tanner LDPC codes.

关键词： protograph low density parity check (LDPC) codes cyclic matrices fast encoding algorithm bit error rate (BER) performance.

来源：评论

学校读者我要写书评

暂无评论

fast CU Splitting and Pruning for Suboptimal CU Partitioning in HEVC Intra Coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2013年第9期23卷 1555-1564页

作者： Cho, Seunghyun Kim, Munchurl Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305731 South Korea

High Efficiency Video Coding (HEVC), a new video coding standard currently being established, adopts a quadtree-based Coding Unit (CU) block partitioning structure that is flexible in adapting various texture characteristics of images. However, this causes a dramatic increase in computational complexity compared to previous video coding standards due to the necessity of finding the best CU partitions. In this paper, a fast CU splitting and pruning method is presented for HEVC intra coding, which allows for significant reduction in computational complexity with small degradations in rate-distortion (RD) performance. The proposed fast splitting and pruning method is performed in two complementary steps: 1) early CU split decision and 2) early CU pruning decision. For CU blocks, the early CU splitting and pruning tests are performed at each CU depth level according to a Bayes decision rule method based on low-complexity RD costs and full RD costs, respectively. The statistical parameters for the early CU split and pruning tests are periodically updated on the fly for each CU depth level to cope with varying signal characteristics. Experimental results show that our proposed fast CU splitting and pruning method reduces the computational complexity of the current HM to about 50% in encoding time with only 0.6% increases in BD rate.

关键词： fast encoding algorithm HEVC intra prediction quad-tree coding

来源：评论

学校读者我要写书评

暂无评论

Square-type-first inter-CU tree search algorithm for acceleration of HEVC encoder

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2016年第2期12卷 419-432页

作者： Ahn, Yong-Jo Sim, Donggyu Kwangwoon Univ Dept Comp Engn 20 Gwangun Ro Seoul South Korea

In this paper, a fast inter-coding algorithm is proposed to reduce the computational load of HEVC encoders. The HEVC reference model (HM) employs the recursive depth-first-search (DFS) of the quad-tree search in terms of rate-distortion optimization in selecting the best coding modes for the best CU, PU, TU partitions, and many associated coding modes. The proposed algorithm evaluates the RD costs of the current CU only for its square-type PUs in the top-down search of the DFS. When the CU partition with the square-type PU is better than its sub-level CU partitions in terms of RD cost in bottom-up search of the DFS, the square type of current CU partition, along with its coding mode, is selected as the best partition. Otherwise, non-square-type PUs for the current CU level are evaluated. If the sub-partition is better than the CU with the non-square PUs, the sub-partition is finally selected as the optimum PU. Otherwise, the best non-square PU is selected as the best PU for the current level. Experimental results demonstrate that the proposed square-type-first inter-PU search can reduce the computational load in average encoding time by 66.7 % with 1-2 % BD loss over HM reference software. In addition, the proposed algorithm can yield an additional average time saving of 26.8-35.5 % against the three fast encoding algorithms adopted in HM.

关键词： Index HEVC fast encoding algorithm Inter-CU decision Square-type mode Video encoder

来源：评论

学校读者我要写书评

暂无评论

The Circulate Property of Generator Matrices of Protograph LDPC Codes

The Circulate Property of Generator Matrices of Protograph L...

引用

IET 3rd International Conference on Wireless, Mobile and Multimedia Networks

作者： Wang, Kaiyao Hu, Shaohai Xiao, Yang Kim, Kiseon Beijing Jiaotong Univ Inst Informat Sci Beijing 100044 Peoples R China Gwangju Inst Sci & Technol Dept Informat & Commun Gwangju 500712 South Korea

ISBN: (纸本)9781849192408

the LDPC application involves the problem encoding complexity Since the generator matrices are dense and with random positions of "Is", the encoder needs to store every "I" of the generator matrices by using huge chip area To solve problem, we need to design the LDPC codes with block cyclic generator matrices This paper reveals that the protograph LDPC codes can base lower encoding complexity under the condition of the proposed theorem that the parity check matrices of the LDPC codes are nonsingular and circulate The circulate property of generator matrix of protograph LDPC codes can be obtained from the quasi-cyclic parity check matrix of protograph LDPC codes Thus it can reduce the encoding complexity We give an algorithm of protograph LDPC codes with fast encoding based on the theorem, and it verifies that protograph LDPC codes with circulate property of generator matrices can simplify encoder hard vs are implementation

关键词： Protograph LDPC codes cyclic matrices fast encoding algorithm BER performance

来源：评论

学校读者我要写书评

暂无评论

Temporally correlated quadtree partition algorithm for fast intra coding in high efficiency video coding

引用

SCIENTIA IRANICA 2015年第6期22卷 2209-2222页

作者： Lin, Y. -C. Lai, J. -C. Natl Formosa Univ Dept Comp Sci & Informat Engn Yunlin 63201 Taiwan

HEVC is a new video coding standard, which has been developed by the JCT-VC (Joint Collaborative Team on Video Coding) for applications with ultra high definition video coding. In HEVC, there are three types of encoding block: the Coding Unit (CU), the Predict Unit (PU) and the Transform Unit (TU). If every block of video pixels goes through the complete mode decision process, a large amount of encoding time is required, limiting its applicability in real-time applications. This paper proposes a fast algorithm that can reduce significantly the computation time of intra coding for each Coding Unit (CU) block. In the proposed algorithm, depth information of the Coding Block Tree (CBT) from the previously encoded frame is used to help determine the current CU split depth, which can skip many unnecessary mode computations for some cases of block decomposition. Experimental results by HM10.1 show that the proposed method can provide about 20% time-saving and maintain a negligible degradation of coding efficiency. (C) 2015 Sharif University of Technology. All rights reserved.

关键词： High efficiency video coding fast coding-unit algorithm fast encoding algorithm Quadtree partition

来源：评论

学校读者我要写书评

暂无评论

The Circulate Property of Generator Matrices of Protograph LDPC Codes

The Circulate Property of Generator Matrices of Protograph L...

引用

2010 The IET 3rd International Conference on Wireless,Mobile & Multimedia Networks(第三届IET无线移动及多媒体网络国际会议 ICWMMN 2010)

作者： Shaohai Hu Yang Xiao Kaiyao Wang Kiseon Kim Institute of Information Science Beijing Jiaotong University Beijing 100044 China Dept.of Information and Communications Gwangju Institute of Science and Technology Gwangju 500-712

ISBN: (纸本)9781617822629

the LDPC application involves the problem: encoding complexity. Since the generator matrices are dense and with random positions of “1s”, the encoder needs to store every “1” of the generator matrices by using huge chip area. To solve problem, we need to design the LDPC codes with block cyclic generator matrices. This paper reveals that the protograph LDPC codes can have lower encoding complexity under the condition of the proposed theorem that the parity check matrices of the LDPC codes are nonsingular and circulate. The circulate property of generator matrix of protograph LDPC codes can be obtained from the quasi-cyclic parity check matrix of protograph LDPC codes. Thus it can reduce the encoding complexity. We give an algorithm of protograph LDPC codes with fast encoding based on the theorem, and it verifies that protograph LDPC codes with circulate property of generator matrices can simplify encoder hardware implementation.

关键词： Protograph LDPC codes cyclic matrices fast encoding algorithm BER performance

来源：评论

学校读者我要写书评

暂无评论

fast intra coding based on mode decision in high efficiency video coding

Fast intra coding based on mode decision in high efficiency ...

引用

2014 International Conference on Artificial Intelligence and Industrial Application (AIIA2014)

作者： Q.Li G.S.Tian C.Q.Gao Chongqing Key Laboratory of Signal and Information Processing(CQKLS&IP) Chongqing University of Posts and Telecommunications (CQUPT)

ISBN: (纸本)9781784660529

The latest high efficiency video coding(HEVC) standard has a significantly improved compression performance relative to H.264/AVC, only requiring a 50% bit-rate at the equal perceptual video quality, but with a significant encoder complexity increase. Hence it is necessary and inevitable to develop fast HEVC encoding algorithms for potential market adoption. In this paper, we propose a fast intra mode decision(FMD) for a HEVC encoder, which aims at reducing computation time and keeping the coding performance at the same time. Firstly, we use edge information of the current prediction unit(PU) instead of only the modes of the neighbor PUs to choose a reduced set of directions from the 35 prediction mode directions. Next, we use an early termination rate-distortion optimized(RDO) to further reduce complexity. Different picture resolutions, ranging from 416×240 to 2560×1600 are tested and experimental results show that the proposed algorithm can reduce 32.64% encoding time with only a 1.45% increase in BD rate.

关键词： fast encoding algorithm HEVC intra prediction edge information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：