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

An Improved early termination Sparse Interpolation algorithm for Multivariate Polynomials

Journal of Systems Science & Complexity 2018年第2期31卷 539-551页

作者： HUANG Qiaolong Key Laboratory of Mathematical Mechanization Academy of Mathematics and Systems Science Chinese Academy of Sciences

This paper presents an improved early termination algorithm for sparse black box multivariate polynomials, which reduces the interpolation problem into several sub-interpolation problems with less variables and fewer terms. Actually, all interpolations are eventually reduced to the interpolation of a list of polynomials with less terms than that of the original polynomial. Extensive experiments show that the new algorithm is much faster than the original algorithm.

关键词： Ben-Or and Tiwari＇s algorithm early termination algorithm recursive sparse interpolation

来源：评论

学校读者我要写书评

暂无评论

HEVC early termination methods for optimal CU decision utilizing encoding residual information

引用

JOURNAL OF REAL-TIME IMAGE PROCESSING 2019年第4期16卷 1147-1163页

作者： Lin, Ting-Lan Chou, Chi-Chan Liu, Zhaoyi Tung, Kun-Hsien Chung Yuan Christian Univ Dept Elect Engn 200 Zhongbei Rd Zhongli City 320 Taoyuan County Taiwan Beijing Inst Technol Sch Informat & Elect 5 Zhongguancunnan St Beijing 100081 Peoples R China

High-efficiency video coding (HEVC) utilizes a quadtree-structured coding unit (CU) for more possible sizes of basic blocks for later prediction. The exhaustive search for the optimal CU depth requires high complexity, which causes difficulties for real-time streaming. In the proposed method, we make use of the residual statistics of prediction units (PUs) in the current encoded CU to make a decision on CU early termination. The residual histogram is discussed, and the optimal early termination (ET) zone is designed;if the PU residual statistics fall in the ET zone, the early termination is triggered. The optimal parameters for the ET zone are solved and analyzed in the training stage, and can be estimated with table lookup and simple computations in the testing stage. Another early termination method using the neighboring SKIP information is also proposed. We use SKIP information from more meaningful CU neighbors defined and used in HEVC. We combine the proposed residual-based and SKIP-based algorithms with a state-of-the-art method. The experimental results show that compared to two state-of-the-art methods in both low delay (LP) and random access (RA) configurations, our preferred proposed combination can achieve the best BDBR results (0.737% in LP and 0.471% in RA) with a good corresponding TS performances (49.87% in LP and 54.96% in RA), making HEVC more suitable for real-time applications.

关键词： High-efficiency video coding (HEVC) Real-time video coding (Coding unit) decision early termination algorithm Residual distribution SKIP mode

来源：评论

学校读者我要写书评

暂无评论

Run-Time Deep Learning Enhanced Fast Coding Unit Decision for High Efficiency Video Coding

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2020年第3期29卷

作者： Li, Xin Gong, Na N Dakota State Univ Dept Comp Sci Fargo ND 58108 USA Univ S Alabama Dept Elect & Comp Engn Mobile AL 36688 USA

The state-of-the-art high efficiency video coding (HEVC/H.265) adopts the hierarchical quadtree-structured coding unit (CU) to enhance the coding efficiency. However, the computational complexity significantly increases because of the exhaustive rate-distortion (RD) optimization process to obtain the optimal coding tree unit (CTU) partition. In this paper, we propose a fast CU size decision algorithm to reduce the heavy computational burden in the encoding process. In order to achieve this, the CU splitting process is modeled as a three-stage binary classification problem according to the CU size from 64x64, 32x32 to 16x16. In each CU partition stage, a deep learning approach is applied. Appropriate and efficient features for training the deep learning models are extracted from spatial and pixel domains to eliminate the dependency on video content as well as on encoding configurations. Furthermore, the deep learning framework is built as a third-party library and embedded into the HEVC simulator to speed up the process. The experiment results show the proposed algorithm can achieve significant complexity reduction and it can reduce the encoding time by 49.65%(Low Delay) and 48.81% (Random Access) on average compared with the traditional HEVC encoders with a negligible degradation (2.78% loss in BDBR, 0.145dB loss in BDPSNR for Low Delay, and 2.68% loss in BDBR, 0.128dB loss in BDPSNR for Random Access) in the coding efficiency.

关键词： HEVC/H.265 coding unit size decision early termination algorithm deep learning

来源：评论

学校读者我要写书评

暂无评论

HEVC coding-unit decision algorithm using tree-block classification and statistical data analysis

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2017年第6期76卷 9051-9072页

作者： Liu, Zhaoyi Lin, Ting-Lan Chou, Chi-Chan Beijing Inst Technol Sch Informat & Elect 5 Zhongguancunnan St Beijing 100081 Peoples R China Chung Yuan Christian Univ Dept Elect Engn 200 Zhongbei Rd Zhongli City 320 Taoyuan County Taiwan

We propose a fast coding unit (CU) depth decision algorithm in the High Efficiency Video Coding (HEVC) procedure based on statistical analysis. First, we derive a set of optimized weights of surrounding CU decisions to predict the current CU decision for 3 different Largest Coding Unit (LCU) classes. Second, for a given predicted current CU decision, we analyze the possible true current CU decisions, aiming to find the correspondence. A corresponding table is found and can be used to achieve target prediction accuracy. Third, for early termination of the encoding processes, the 3 early termination methods in a state-of-the-art work, as well as their different combinations, are evaluated. We show that using one of them is sufficient for saving time while encoding to keep the implementation complexity low. Compared with full CU search in HEVC standards, the proposed method reduces the encoding time by 57 and 49 % on average with Low Delay and Random Access profiles, respectively, with acceptable bitrate and PSNR performances. Compared with two state-of-the-art methods, the encoding time reduction is up to 23 and 13 % with Low Delay profile, 7 and 3 % with Random Access profile, on average, whereas the performances of bitrate and PSNR are similar.

关键词： HEVC (high-efficiency video coding) CU (coding unit) decision early termination algorithm Statistical analysis LCU (largest coding unit) classification

来源：评论

学校读者我要写书评

暂无评论

HEVC fast CU mode decision using spatial SKIP mode information 3

HEVC fast CU mode decision using spatial SKIP mode informati...

引用

3rd IEEE Global Conference on Consumer Electronics (GCCE)

作者： Lin, Ting-Lan Chou, Chi-Chan Liao, Chin-Chie Tsai, Wei-Lin Chen, Shih-Lun Chung Yuan Christian Univ Dept Elect Engn 200 Zhongbei Rd Zhongli City 320 Taoyuan County Taiwan

ISBN: (纸本)9781479951451

HEVC (High Efficiency Video Coding) standard is ready to be launched for consumer electronics. With better coding efficiency, the coding complexity is high. We propose a fast CU (Coding Unit) depth decision algorithm based on SKIP mode information in the neighboring block to early terminate the CU splitting. Compared to the HEVC standard software, the proposed method can save by up to 41% of the time. The proposed method also saves by up to 16% of the time compared to a state-of-the-art work. The proposed method introduces very negligible losses in the video PSNR and bitrate.

关键词： HEVC (High Efficiency Video Coding) CU (Coding Unit) decision early termination algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved Method for Fast Motion Estimation in Joint Multi-view Video Coding

An Improved Method for Fast Motion Estimation in Joint Multi...

引用

6th International Congress on Image and Signal Processing (CISP)

作者： Ma, Xiaoyu Jiang, Xiuhua Du, Xiangkun Commun Univ China Informat Engn Sch Beijing Peoples R China

ISBN: (纸本)9781479927630

An improved method for the TZSearch fast motion estimation algorithm in the Joint Multi-view Video Coding (JMVC) is proposed in this work. It is based on early terminating the calculation of Sum of Absolute Difference (SAD) and increasing the number of predicted motion vectors to reduce the inter-view redundancy and save the encoding time. Experimental results show that the proposed method has much more reduction in encoding time than the original TZSearch method in the JMVC, under the conditions of the encoding bit-rate and Peak Signal to Noise Ratio (PSNR) barely changed.

关键词： JMVC Motion Estimation algorithm early termination algorithm Disparity Vector

来源：评论

学校读者我要写书评

暂无评论

An Improved Method for Fast Motion Estimation in Joint Multi-view Video Coding

An Improved Method for Fast Motion Estimation in Joint Multi...

引用

International Congress on Image and Signal Processing

作者： Xiaoyu Ma Xiuhua Jiang Xiangkun Du Information Engineering School Communication University of China Beijing China

ISBN: (纸本)9781479927654

关键词： JMVC Motion Estimation algorithm early termination algorithm Disparity Vector

来源：评论

学校读者我要写书评

暂无评论

Efficient computation of correlation coefficient using negative reference in template matching applications

引用

IET IMAGE PROCESSING 2012年第2期6卷 197-204页

作者： Bilal, M. Masud, S. Lahore Univ Management Sci Dept Comp Sci & Engn Sect U DHA Lahore 54792 Pakistan

Design and implementation of a new early termination algorithm for efficient calculation of correlation coefficient for template matching is presented. The proposed algorithm correlates the candidates against 'negative' (bit-inverted) version of reference instead of the original to implement a low cost early termination criterion. Around 10% computational savings have been demonstrated while using the proposed algorithm to compute normalised correlation as error metric for motion estimation in software implementation of H.264 video encoder. The algorithm lends itself to efficient hardware implementation because of its simple cost function. Further hardware savings have been realised by noting that the multiplication products generated by the proposed negative reference correlation algorithm tend to have low magnitudes with significantly less variance than those generated by other schemes. This allows a low-precision summation stage to accumulate majority of the multiplication products without losing the precision of results. Results of the hardware implementation on Xilinx Virtex-5 FPGA have been provided. The overall design is shown to consume around 85% less logic resources and operate at 140% higher speed than existing architectures.

关键词： early termination algorithm data compression H.264 video encoder field programmable gate arrays Computer vision and image processing techniques Image and video coding correlation coefficient low-precision summation stage motion estimation Logic circuits image matching template matching video coding Logic and switching circuits Xilinx Virtex-5 FPGA negative reference correlation algorithm Video signal processing correlation methods low cost early termination criterion

来源：评论

学校读者我要写书评

暂无评论

early termination algorithms for correlation coefficient based block matching

Early termination algorithms for correlation coefficient bas...

引用

IEEE International Conference on Image Processing (ICIP 2007)

作者： Mahmood, Arif Khan, Sohaib Lahore Univ Management Sci Dept Comp Sci Lahore Pakistan

ISBN: (纸本)9781424414369

Block based motion compensation techniques make frequent use of early termination algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well studied in the context of Sum of Absolute Differences (SAD) match measure and are effective in eliminating a large percentage of computations. As compared to SAD, the correlation coefficient (p) is a more robust measure but has high computational cost because no ETAs for p have been reported in literature. In this paper, we propose two types of ETAs for correlation coefficient: growth based and the bound based. In growth based ETA, p is computed as a monotonically decreasing measure. At a specific search location, when the partial value of p falls below the yet known maxima, remaining calculations are discarded. In bound based ETA, a new upper-bound on p is derived which is tighter than the currently used Cauchy-Schwartz inequality. The search locations where the proposed bound falls shorter than the yet known maxima are eliminated from the search space. Both types of algorithms are implemented in a cascade and tested on a commercial video dataset. In our experiments, up to 88% computations are found to be eliminated. In terms of execution time, our algorithm is up to 13.7 times faster than the FFTW based implementation and up to 4.6 times faster than the current best known spatial domain technique.

关键词： video coding block motion estimation fast correlation algorithms correlation coefficient early termination algorithm bounds on correlation coefficient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：