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

fast algorithm Based on Rough LCU Minimum Depth Prediction and Early CU Partition Termination for HEVC Intra Coding

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2016年第2期E99A卷 634-638页

作者： Zhang, Mengmeng Zhang, Heng Liu, Zhi North China Univ Technol Beijing Peoples R China

The new generation video standard, i.e., High-efficiency Video Coding (HEVC), shows a significantly improved efficiency relative to the last standard, i.e., H.264. However, the quad tree structured coding units (CUs), which are adopted in HEVC to improve compression efficiency, cause high computational complexity. In this study, a novel fast algorithm is proposed for CU partition in intra coding to reduce the computational complexity. A rough minimum depth prediction of the largest CU method and an early termination method for CU partition based on the total coding bits of the current CU are employed. Many approaches have been proposed to reduce the encoding complexity of HEVC, but these methods do not use the total coding bits of the current CU as the main basis for judgment to judge the CU complexity. Compared with the reference software HM16.6, the proposed algorithm reduces encoding time by 45% on average and achieves an approximately 1.1% increase in Bjntegaard delta bit rate and a negligible peak signal-to-noise ratio loss.

关键词： CU partition fast algorithm depth prediction coding bits

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for discrete sine transform using first-order moment

A fast algorithm for discrete sine transform using first-ord...

引用

3rd International Conference on Image Analysis and Signal Processing, IASP 2011

作者： Luo, Tingting Liu, J.G. Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781612848808

A fast algorithm for discrete sine transform (DST) is proposed. Through derivation the traditional DST is transformed into the computation of a first-order moment, which can be implemented by a simple parallel structure without multiplications. The comparison with some existing methods on the computation and the hardware complexity shows the advantage of our method under certain conditions. The approach is also applicable to other discrete sine transforms. © 2011 IEEE.

关键词： Adders Arrays Clocks DST DST Fourier transforms Periodic structures Signal processing algorithms Synchronization Transforms discrete sine transform fast algorithm first-order moment first-order moment hardware complexity parallel structure structure M1 st

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for computing Chebyshev-Fourier moments

A fast algorithm for computing Chebyshev-Fourier moments

引用

2010 International Conference on Future Information Technology and Management Engineering, FITME 2010

作者： Jiang, Yongjing Ping, Ziliang Gao, Laibin School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing China College of Physics and Electronics Information University of Inner Mongolia Normal Huhhot Inner Mongolia China Department of Information and Technology University of Jilin Agricultural Changchun China

ISBN: (纸本)9781424490882

In this paper, the invariant orthogonal moments, Chebyshev-Fourier moments (CHFMs), and the computation of CHFMs are introduced. With the specific symmetrical or anti-symmetrical properties of the Chebyshev-Fourier (CHF) basis functions, a fast algorithm for computing the CHFMs is given. Both theoretical analysis and experimental testing show that the fast algorithm makes the time for computing the CHFMs shorter than the direct method. © 2010 IEEE.

关键词： Base functions Chebyshev-fourier moments fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for moving target localisation using FDA-MIMO radar

引用

JOURNAL OF ENGINEERING-JOE 2019年第19期2019卷 5749-5752页

作者： Xu, Jian Wang, Wen-Qin Cui, Can Huang, Bang Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu Sichuan Peoples R China Nanjing Univ Sci & Technol Sch Elect Engn & Optoelect Technol Nanjing Jiangsu Peoples R China

Target localisation using frequency diverse array (FDA) has drawn much attention owing to the additional degree of freedom in the range dimension. However, the Doppler effect was often ignored in previous FDA works because of the stationary target assumption, and in contrast, even stationary target localisation could be of quite a high computational complexity. In this study, a method is proposed that can jointly estimate range, angle, and Doppler for FDA multiple-input-multiple-output radar with low computational complexity. First, Doppler is estimated independently by utilising unstructured maximum likelihood method. Next, traditional two-dimensional (2D) MUSIC is divided into multiple one-dimensional (1D) MUSIC to estimate the angle. Then substituting the estimated angle into the former 2D MUSIC results in a 1D searching over range dimension to get the range estimation. The advantage of the proposed method was verified by simulation results.

关键词： computational complexity direction-of-arrival estimation MIMO radar Doppler effect radar signal processing MIMO communication maximum likelihood estimation fast algorithm FDA-MIMO radar frequency diverse array range dimension Doppler effect previous FDA works stationary target assumption stationary target localisation high computational complexity FDA multiple-input-multiple-output radar low computational complexity maximum likelihood method two-dimensional MUSIC one-dimensional MUSIC estimated angle 2D MUSIC results range estimation

来源：评论

学校读者我要写书评

暂无评论

fast algorithm BASED ON TT-M FE METHOD FOR MODIFIED CAHN-HILLIARD EQUATION

引用

ROCKY MOUNTAIN JOURNAL OF MATHEMATICS 2021年第1期51卷 327-346页

作者： Wang, Danxia Wang, Xingxing Li, Yaqian Jia, Hongen Taiyuan Univ Technol Coll Math Taiyuan 030024 Peoples R China

We consider numerical methods for solving the modified Cahn-Hilliard equation involving strong nonlinearities. A fast algorithm based on time two-mesh (TT-M) finite element (FE) scheme is proposed to overcome the time-consuming computation of the nonlinear terms. The TT-M FE algorithm includes three main steps: Firstly, a nonlinear FE scheme is solved on a coarse time-mesh pi(c). Here, the FE method is used for spatial discretization and the implicit second-order theta scheme (containing both implicit Crank-Nicolson scheme and second-order backward difference method) is used for temporal discretization. Secondly, the Lagrange's interpolation is used to obtain the interpolation result on the fine time-mesh. Finally, a linearized FE system is solved on a fine time-mesh tau.(tau < tau(c)). The stability analysis and priori error estimates are provided in detail. Numerical examples are given to demonstrate the validity of the proposed scheme. The TT-M FE method is compared with the traditional Galerkin FE method and it is evident that the TT-M FE method can save the calculation time.

关键词： fast algorithm TT-M FE method modified Cahn-Hilliard equation stability priori error estimate CPU time

来源：评论

学校读者我要写书评

暂无评论

The three-dimensional fast algorithm of solving the electric field integral equation

The three-dimensional fast algorithm of solving the electric...

引用

4th International Symposium on Electromagnetic Compatibility

作者： Huang Hongxia Li Lin Gao Changzheng Zhao Zhibin N China Elect Power Univ Sch Elect & Elect Engn Baoding Peoples R China

ISBN: (纸本)9781424410224

A fast algorithm is introduced in this paper for three-dimensional conducing medium. The algorithm applies suitable approximation and parallel computation to MoM so that the computer memory and run time will be reduced significantly. Finally, we calculate a three-dimensional thin lossy plate as an example to approve the accuracy and efficiency of our algorithm.

关键词： MoM fast algorithm parallel computation

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for rotation and translation two-dimensional computed tomography accurate reconstruction

引用

Procedia Engineering 2010年 7卷 10-14页

作者： Fei Zhao Liyang Xie Ningxiang Wu Northeasten University No.11 Lane 3 WenHua Road HePing District Shenyang 110004 China

RT (rotation and translation) scan mode for 2D (two-dimensional) CT (computed tomography), based on multiple axes, can scan large-sized work pieces and components with paraxial X-ray beam. Compared with the traditional second generation scan mode of TR (translation and rotation), it can save about 3/4 times of the scan time. The accurate reconstruction algorithm by region, can remove the artifacts around inner and outer borders in general reconstruction images. But a mass of zero values participate back-projection operations, and slow down the accurate algorithm operation. In this paper, projection data are grouped according to the regions they located before being back-projected. Data are selected or not according to the regions ID determined in advance during back-projection. So zero values are kicked out by their locations, before doing some time-consuming works such as reading, judging or accumulating the values and so on. And computer simulations show that the reconstruction algorithm saves at least half of the operation time according to the number of rotation centers.

关键词： Industrial CT RT scan mode Large-sized work pieces Accurate reconstruction fast algorithm

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for Completion State Calculating of Wire Rope Cable Bridge

Fast Algorithm for Completion State Calculating of Wire Rope...

引用

作者： Yang Feng Dan Song Minghui Li Power China Northwest Engineering Corporation Limited

When determining the completion state of the main cable of a cableway bridge,although the catenary theory can accurately consider the nonlinear mechanical effect of the cable,the iterative calculation is cumbersome and not convenient for engineering *** the calculation based on the parabola theory is simple,the calculation accuracy for long cables is *** this paper,based on catenary theory and considering the calculation accuracy and avoiding iterative calculation,a fast algorithm for the completion state of the main cable of the wire rope cableway bridge is *** results show that the bridge state can be quickly and accurately determined by approximating the horizontal component of the cable tension and avoiding multiple iterative *** proposed algorithm can be used in engineering design and construction.

关键词： fast algorithm Wire rope Cable Bridge Catenary theory Parabola theory

来源：评论

学校读者我要写书评

暂无评论

fast algorithm for Heating Injection Mold by Water

Fast Algorithm for Heating Injection Mold by Water

引用

作者： Hong Liu Haojie Chen Fei Chen Juntao Gao College of Mechanical Engineering Zhejiang University of Technology

This paper puts forward a fast algorithm for heating injection mold by water accordance with these problems that the computing is enormous to simulate heating injection mold and there is a limitation for velocity of hot water that it should not be too larger otherwise simulating algorithm will be failure. The method does the similarity transformation to construct similarity model whose solution is the same with the mathematics model for the problem of heating injection mold by water, and the simulation time will be reduced greatly at the precondition of keeping precision using the similarity model. The first step of similarity transformation is time similarity transforming for the fluid governing equation describing the moving of hot water in the time area, i.e., actual heating time area for mold heating is transformed to heating time area of similarity model while keeping spatial domain unchanged. Meanwhile it does the same transformation for the heat conduction governing equation in the time area, also keeping spatial domain unchanged. In this way the similarity model of the origin mathematics model for fluid-solid coupling problem of heating mold by water is obtained. Simulating the similarity model could obtain mold temperature field after heating fast. The paper shows that the fast algorithm has good application value through examples.

关键词： fast algorithm Mold heating Similarity transformation Athematics model

来源：评论

学校读者我要写书评

暂无评论

fast algorithm BASED ON SOLE- AND MULTI-DEPTH MEASUREMENTS FOR HEVC INTRA CODING

FAST ALGORITHM BASED ON SOLE- AND MULTI-DEPTH MEASUREMENTS F...

引用

IEEE International Conference on Image Processing

作者： Gang He Jing Hu Yunsong Li Wenxin Yu Xidian University Southwest University of Science and Technology

ISBN: (纸本)9781467399623

In High Efficiency Video Coding (HEVC), intra coding plays an important role, but also involves huge computational complexity due to a flexible coding unit (CU) structure and a large number of prediction modes. This paper presents a fast algorithm based on the sole- and multi-depth measurements to reduce the complexity from CU and prediction mode decisions. For the CU decision, evaluation results with sole and multiple depths are utilized to judge if the CU is a heterogeneous, homogeneous, or depth prominent one, where fast CU decisions are made. For the prediction mode decision, the tendencies for different CU sizes are detected based on multiple depths. The number of searching modes is decreased adaptively for the depth with fewer tendencies. Experimental results show the proposed algorithm reduces 61.49% computational complexity, with 0.75% bit-rate increasing, which is more efficient than state-of-the-arts.

关键词： HEVC fast algorithm Intra prediction Copper High efficiency video coding complexity classes algorithms tendencies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：