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

Adaptive merge list construction for 3D-HEVC fast encoder

ELECTRONICS LETTERS 2016年第8期52卷 604-U90页

作者： Heo, Y. S. Bang, G. Park, G. H. Kyung Hee Univ Dept Comp Engn 1732 Deogyeong Daero Yongin 446701 Gyeonggi South Korea Elect & Telecommun Res Inst 218 Gajeong Ro Daejeon South Korea

Adaptive merge list construction for the fast encoder of three-dimensional high efficiency video coding (3D-HEVC) scheme is proposed in this Letter. The encoder complexity of 3D-HEVC has been unavoidably very high in comparison with HEVC, because it should handle the multiple view images and their corresponding depth images. Proposed method is designed to reduce the encoder-side computational complexity of the 3D-HEVC merging process through a fast decision with early termination arranged by two conditions. Simulation results show that the proposed method can reduce overall encoding time by 9.7% without coding losses in comparison with the recent 3D-HEVC HTM-14.0 fast encoder that consisted of every encoder optimisation algorithm informatively adopted in both HEVC and 3D-HEVC standardisation activities.

关键词： video coding optimisation computational complexity 3D-HEVC fast encoder adaptive merge list construction three-dimensional high efficiency video coding scheme encoder complexity 3D-HEVC merging process encoder optimisation algorithm

来源：评论

学校读者我要写书评

暂无评论

Compressed Sensing based Adaptive Video Coding for Resource Constrained Devices 12

Compressed Sensing based Adaptive Video Coding for Resource ...

引用

12th International Wireless Communications & Mobile Computing Conference (IWCMC)

作者： Rehman, Atif ur Shah, Ghalib A. Tahir, Muhammad Univ Engn & Technol Al Khawarizmi Inst Comp Sci Lahore 54000 Pakistan

ISBN: (纸本)9781509003044

Compressed Sensing(CS) based video coding techniques are low-complexity in general, but with marginal compression results. Also, wireless multimedia devices have serious resource constraints, with fluctuations in bandwidth(for up-link traffic) and available power. In this paper we propose a nested technique in which CS data is further compressed within the CS domain to give far better compression results. Our technique is block based and Sum of Absolute Difference(SAD) values are used to estimate the amount of motion in each Macro Block(MB). The MB's are suppressed in subsequent frames according to the estimated motion. Later in the paper, we propose an adaptive compression mechanism, which adjusts the amount of compression according to fluctuations in resources.

关键词： Video Compression encoder complexity Temporal Correlation Compressive Sensing Adaptive Compression Block Compressive Sensing

来源：评论

学校读者我要写书评

暂无评论

Temporal Correlation-based Fast Encoding Algorithm in HEVC Intra Frame Coding 5

Temporal Correlation-based Fast Encoding Algorithm in HEVC I...

引用

5th IEEE International Conference on Consumer Electronics Berlin

作者： Park, Sang-hyo Lee, Seung-ho Xu, Haiyan Jang, Euee S. Hanyang Univ Dept Comp & Software Seoul South Korea

ISBN: (纸本)9781479987481

In this paper, we propose a method that skips the complex encoding processes of coding unit (CU) for HEVC intra frame coding. To speed-up the encoding process that recursively explore all sizes of CUs, most researchers have exploited spatial information thus far. On the other hand, the temporal correlation among frames has not been thoroughly investigated. We exploited the temporal correlation as an early termination method, which skips ineffective unit sizes and associated cost. Simulation results are provided to verify the efficiency of the proposed method, showing a 32% time saving with a 0.2 % BD-rate loss on average compared to HEVC test model 10.0 under all-intra configuration.

关键词： Intra prediction CU size decision PU size decision TU size decision encoder complexity intra coding

来源：评论

学校读者我要写书评

暂无评论

Adaptive Search Range Determination for Geometry based Disparity and Motion Estimation of MVC

Adaptive Search Range Determination for Geometry based Dispa...

引用

Annual Summit and Conference of Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA)

作者： Boonthep, Narasak Chiracharit, Werapon Chamnongthai, Kosin King Mongkuts Univ Technol Thonburi Fac Engn Dept Elect & Telecommun Engn 126 Pracha Uthit Rd Bangkok 10140 Thailand

ISBN: (纸本)9786163618238

Multi-view video consists of a set of multiple video sequences from multiple viewpoints or view directions in the same scene. It contains extremely a large amount of data and some extra information to be stored or transmitted to the user and computational complexity of processing. In order to achieve a better coding performance in multi-view video coding (MVC), the search range for both motion estimation (ME) and disparity estimation (DE) are set twice as large as necessary for ME alone, which brings great computational complexity to the encoder. Search range (SR) of motion search constraints current block to search the matched block within a predefined area in the reference picture. This research proposed an algorithm to solve the redundancy reduction problem to get fast disparity and motion estimation for reducing complexity. We use geometry and adaptive search range by adjust macroblock (MB) type that suitable with window SR. Experimental results show that the proposed method can reduce the encoding time, so that the encoder complexity can be reduced but achieves almost the same compress quality. The encoding time reduce up more than 70%.

关键词： computational complexity image sequences motion estimation video coding MVC adaptive search range determination adjust macroblock type disparity estimation encoder complexity encoding time geometry based disparity matched block motion search constraints current block multiple video sequences multiview video coding redundancy reduction problem reference picture Computational complexity Decision support systems Encoding Geometry Motion estimation Video coding

来源：评论

学校读者我要写书评

暂无评论

Distributed source coding using symbol-based and non-binary turbo codes - applications to wireless sensor networks

引用

IET COMMUNICATIONS 2008年第8期2卷 1089-1097页

作者： Zamani, Mahdi Lahouti, Farshad Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Univ Tehran Sch Elect & Comp Engn Ctr Excellence Appl Electromagnet Syst Tehran Iran

A simple but powerful scheme for distributed source coding (DSC) based on the concept of binning and syndromes and non traditional turbo codes is proposed. The previous works on the compression with side information using turbo codes and the binning technique are focused on binary turbo codes. The source is considered to be binary or is converted to a binary stream. This conversion, however, reduces the redundancy that could be exploited by the compression algorithm. To achieve higher compression efficiency, the authors propose using a scheme based on a turbo decoder that decides over symbols rather than bits. In the same direction and for further performance improvement, at the cost of increased encoder complexity, they also present a DSC scheme based on non-binary turbo codes. The results demonstrate improved performance. Based on the suggested algorithms, a scheme for gathering real data in wireless sensor networks and assess the corresponding energy savings is proposed.

关键词： distributed source coding wireless sensor network wireless sensor networks source coding symbol-based turbo codes turbo decoder binary codes nonbinary turbo codes binary stream compression algorithm encoder complexity binning technique energy savings turbo codes

来源：评论

学校读者我要写书评

暂无评论

Feature-based intra-/intercoding mode selection for H.264/AVC

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2007年第4期17卷 441-453页

作者： Kim, Changsung Kuo, C. -C. Jay QUALCOMM MediaFLO Technol San Diego CA 92121 USA Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA Univ So Calif Integrated Media Syst Ctr Los Angeles CA 90089 USA

A fast feature-based intra/inter coding mode selection scheme for the H.264/AVC video coding standard is proposed in this paper. First, three features are extracted from a macroblock to form a feature space. Then, the feature space is partitioned into three regions, i.e., risk-free, risk-tolerable, and risk-intolerable regions, where the risk is calculated using the rate-distortion (RD) performance loss due to wrong mode decision as well as the probability distribution of inter/intra modes in the feature space obtained from an off-line training process. Depending on the region where the feature vector of a macroblock is located, we can apply mechanisms of different complexity for final mode decision. To calculate the likelihood function of the risk, both parametric and non-parametric density estimation schemes are developed to offer different rate-distortion-complexity tradeoffs. It is demonstrated by experimental results that the proposed algorithm can save approximately 20%-32% of the total encoding time of H.264 (JM7.3a) with little degradation in the rate-distortion performance.

关键词： Bayes-risk minimization coding mode prediction density estimation encoder complexity H264/AVC mode decision

来源：评论

学校读者我要写书评

暂无评论

complexity scalable motion estimation for H.264/AVC

Complexity scalable motion estimation for H.264/AVC

引用

Conferenceon Visual Communications and Image Processing 2006

作者： Kim, C Xin, J Vetro, A Kuo, CCJ Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)0819461172

A new complexity-scalable framework for motion estimation is proposed to efficiently reduce the motion-complexity of encoding process, with focus on long term memory motion-compensated prediction of the H.264 video coding standard in this work. The objective is to provide a complexity scalable scheme for the given motion estimation algorithm such that it reduces the encoding complexity to the desired level with insignificant penalty in rate-distortion performance. In principle, the proposed algorithm adaptively allocates available motion-complexity budget to macroblock based on estimated impact towards overall rate-distortion (RD) performance subject to the given encoding time limit. To estimate macroblock-wise tradeoff between RD coding gain (J) and motion-complexity (C), the correlation of J-C curve between current macroblock and collocated macroblock in previous frame is exploited to predict initial motion-complexity budget of current macroblock. The initial budget is adaptively assigned to each blocksize and block-partition successively and motion-complexity budget is updated at the end of every encoding unit for remaining ones. Based on experiment, proposed J - C slope based allocation is better than uniform motion-complexity allocation scheme in terms of RDC tradeoff. It is demonstrated by experimental results that the proposed algorithm can reduce the H.264 motion estimation complexity to the desired level with little degradation in the rate-distortion performance.

关键词： H.264/AVC complex scalable fast motion estimation encoder complexity motion-complexity allocation

来源：评论

学校读者我要写书评

暂无评论

A novel fast inter-prediction mode decision for H.264/AVC

A novel fast inter-prediction mode decision for H.264/AVC

引用

Conference on Multimedia on Mobile Devices II

作者： Guo, Y Li, HQ Pei, SB Chen, CW Univ Sci & Technol China Dept Elect Engn & Informat Sci MOE Microsoft Key Lab Multimedia Comp & Commun Hefei 230027 Anhui Peoples R China Florida Inst Technol Dept Elect & Comp Engn Melbourne FL 32901 USA

ISBN: (纸本)0819461148

Video coding in wireless environment requires lower computational complexity and lower energy consumption than that used in storage oriented or network oriented application. Although H.264/AVC standard provides considerable higher compression efficiency as compared to the previous standards, its complexity is significantly increased at the same time. In a H.264/AVC encoder, the most time-consuming components are variable block sizes motion estimation and mode decision using rate-distortion optimization (RDO). In this paper, we propose a novel fast inter-prediction mode decision by exploiting high correlation between rate-distortion costs (RD cost) of macroblocks in the current inter frame and their co-located macroblocks in the previous inter frame. Using this new algorithm, we can reduce a number of inter mode candidates and skip motion estimation for these modes. In addition, our algorithm can also decrease a number of tested intra modes. Simulation results show that our approach can save 20% to 50% encoding time, with a negligible PSNR loss less than 0. 1 dB and bit rate increase no more than 2% for almost all the test sequences.

关键词： video coding H.264/AVC standard mobile device inter prediction Rate Distortion Optimization (RDO) mode decision RD cost encoder complexity

来源：评论

学校读者我要写书评

暂无评论

Bayes-risk minimized intra/inter coding mode prediction for H.264

Bayes-risk minimized intra/inter coding mode prediction for ...

引用

Conference on Image and Video Communications and Processing 2005

作者： Kim, C Kuo, CCJ Univ So Calif Integrated Media Syst Ctr Los Angeles CA 90089 USA

ISBN: (纸本)0819456586

A feature-based coding mode prediction method is proposed to reduce the encoder complexity of the H.264 video coding standard in this work. The current H.264 reference codes employ exhaustive search to find the best mode that optimizes the rate-distortion performance among all possible intra/inter predictive modes. To develop a fast binary intra/inter-mode prediction scheme, we consider the expected risk of choosing the wrong mode in a multi-dimensional feature space. The proposed algorithm consists of three steps. First, three features are extracted from the current macroblock. Second, the expected risk is calculated for the corresponding partition in the trained feature vector space, which is used to decide where the feature vector lies in one of the three regions depending on the expected risk, i.e. risk-free, risk-tolerable, and risk-intolerable regions. Finally, depending on the region to which the feature vector belongs, we can apply mechanisms of different complexities for final mode decision. For the likelihood estimation of the risk, parametric and non-parametric density estimation schemes are compared in terms of the rate-distortion-complexity tradeoff. It is demonstrated by experimental results that the proposed algorithm can save approximately 20-32% of the total encoding time of H.264 (JM7.3a) with little degradation in the rate-distortion performance.

关键词： H.264/AVC coding mode prediction Bayes-risk minimization density estimation mode decision encoder complexity

来源：评论

学校读者我要写书评

暂无评论

Fast intra-mode decision in H.264 video coding using simple directional masks

Fast intra-mode decision in H.264 video coding using simple ...

引用

Conference on Visual Communications and Image Processing 2005

作者： Kim, J Jeong, J Hanyang Univ Dept Elect & Comp Engn Seoul 133791 South Korea

ISBN: (纸本)0819459763

The H.264/AVC standard improves coding efficiency significantly compared with existing standards. This is at the expense of great computational complexity at the encoder. H.264/AVC adopts rate-distortion optimization (RDO) technique to obtain the best result while maximizing visual quality and minimizing bitrates. To carry out RDO, the encoder undergoes all possible combinations of coding modes exhaustively. H.264/AVC exploits directional spatial correlation with adjacent blocks for intra prediction. There are 9 directional modes for 4x4 luma blocks, 4 directional modes for 16x16 macroblocks and 8x8 chroma. blocks, respectively. To determine the appropriate direction, based on the RDO computation, the number of mode combinations in each MB is 592. For a fast intra mode decision, we propose an algorithm to reduce the number of RDO computations using simple directional masks and adjacent mode information. The proposed method carries out 4 RDO calculations at the most for 4x4 luma blocks, and 2 RDO computations for 16x16 luma. blocks and 8x8 chroma blocks, respectively. We verified the proposed algorithm by implementing on JM reference software and comparing with the case of exhaustive search. Simulation results show the proposed method reduces the ending time up to 70% with negligible loss of PSNR and bitrate increase.

关键词： intra prediction H.264/AVC video coding encoder complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：