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

analysis of VVC Intra Prediction Block Partitioning Structure

Analysis of VVC Intra Prediction Block Partitioning Structur...

IEEE International Conference on Visual Communications and Image Processing (VCIP) - Visual Communications in the Era of AI and Limited Resources

作者： Saldanha, Mario Sanchez, Gustavo Marcon, Cesar Agostini, Luciano Univ Fed Pelotas Grad Program Comp PPGC Pelotas RS Brazil IF Farroupilha Alegrete Brazil Pontificial Catholic Univ Rio Grande do Sul Porto Alegre RS Brazil

ISBN: (纸本)9781728185514

This paper presents an encoding time and encoding efficiency analysis of the Quadtree with nested Multi-type Tree (QTMT) structure in the Versatile Video Coding (VVC) intra-frame prediction. The QTMT structure enables VVC to improve the compression performance compared to its predecessor standard at the cost of a higher encoding complexity. The intra-frame prediction time raised about 26 times compared to the HEVC reference software, and most of this time is related to the new block partitioning structure. Thus, this paper provides a detailed description of the VVC block partitioning structure and an in-depth analysis of the QTMT structure regarding coding time and coding efficiency. Based on the presented analyses, this paper can guide outcoming works focusing on the block partitioning of the VVC intra-frame prediction.

关键词： computational complexity analysis Compression efficiency analysis Block partitioning Versatile Video Coding

来源：评论

学校读者我要写书评

暂无评论

Network-Based Learning Through Particle Competition for Data Clustering

Network-Based Learning Through Particle Competition for Data...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Silva, Thiago C. Zhao, Liang Univ Sao Paulo Inst Math & Comp Sci ICMC Dept Comp Sci BR-13560970 Sao Carlos SP Brazil

ISBN: (纸本)9781424496365

Complex network provides a general scheme for machine learning. In this paper, we propose a competitive learning mechanism realized on large scale networks, where several particles walk in the network and compete with each other to occupy as many nodes as possible. Each particle can perform a random walk by choosing any neighbor to visit, a deterministic walk by choosing to visit the node with the highest domination, or a combination of them. A computational complexity analysis is developed of the proposed algorithm. Computer simulations performed on several real-world data sets, including a large scale data set, reveal attractive results when the model is applied for data clustering problems.

关键词： Algorithm design and analysis Analytical models computational complexity computational modeling Machine learning Mathematical model Neural networks competitive learning mechanism complex network complex networks computational complexity computational complexity analysis computer simulation data clustering deterministic algorithms deterministic walk large scale networks learning (artificial intelligence) machine learning network based learning particle competition pattern clustering random processes random walk real-world data sets

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Dynamic Battery Modeling for PHEV Applications

Comprehensive Dynamic Battery Modeling for PHEV Applications

引用

IEEE-Power-and-Energy-Society General Meeting

作者： Zhang, Hanlei Chow, Mo-Yuen N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27606 USA

ISBN: (纸本)9781424483570

With the increasing demand in PHEV safety, performance, etc., the PHEV applications require a battery model which can accurately reflect and predict the battery performance under different dynamic loads, environmental conditions, and battery conditions. An accurate battery model is the basis of the precise battery state (state of charge, state of health and state of function) estimation. And the precise battery state information can be used to enable the optimal control over the battery's charging/discharging process, therefore to manage the battery to its optimal usage, prolong the battery life, and enable vehicle to grid and vehicle to home applications fitting into the future smart grid scenario. One of the challenges in constructing such a model is to accurately reflect the highly nonlinear battery I-V performance, such as the battery's relaxation effect and the hysteresis effect. This paper will mainly focus on the relaxation effect modeling. The relaxation effect will be modeled through series connected RC circuits. Accuracy analysis demonstrates that with more RC circuit the battery model gives better accuracy, yet increases the total computational time. Therefore, to select an appropriate battery model for a certain PHEV application is formulated as a multi-objective optimization problem balancing between the model accuracy and the computational complexity within the constraints set by the minimum accuracy required and the maximum computational time allowed. This multi-objective optimization problem is mapped into a weighted optimization problem to solve.

关键词： Electric battery model plug-in hybrid electric vehicle (PHEV) battery relaxation effect accuracy analysis computational complexity analysis multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

ON THE TRADE-OFF OF ACCURACY AND computational complexity FOR CLASSIFYING NORMAL AND ABNORMAL ECG IN REMOTE CVD MONITORING SYSTEMS

ON THE TRADE-OFF OF ACCURACY AND COMPUTATIONAL COMPLEXITY FO...

引用

IEEE Workshop on Signal Processing Systems (SiPS)

作者： Chen, T. Mazomenos, E. Maharatna, K. Dasmahapatra, S. Niranjan, M. Univ Southampton Sch Elect & Comp Sci Southampton SO9 5NH Hants England

ISBN: (纸本)9780769548562;9781467329866

Remote cardiovascular disease monitoring systems are characterised from a limited number of available leads and limited processing capabilities. In this paper, we investigate the trade-off between accuracy and computational complexity in order to derive the best strategy for classifying the ECG signal into normal or abnormal in such systems, with the spectral energy contained in the constituent waves of the ECG signal, as the primary feature for classification. Five established classifiers are considered and through exhaustive simulations the maximum accuracy is derived for each classifier. Based on 104 ECG records, we present a systematic analysis of the trade-off between computational complexity and accuracy, which allow us to deduce the best classification strategy considering only a small number of available leads.

关键词： ECG Classification Discrete Wavelet Transform computational complexity analysis Remote Healthcare Applications

来源：评论

学校读者我要写书评

暂无评论

TWO EFFICIENT IMPLEMENTATION FORMS OF UNSCENTED KALMAN FILTER

引用

CONTROL AND INTELLIGENT SYSTEMS 2011年第1期39卷 1-11页

作者： Lue, Shaolin Zhang, Rong Department of Precision Instruments and Mechanology Tsinghua University Beijing 100084 China

Two efficient implementation forms of unscented Kalman filter (UKF) are proposed. They respectively utilize Cholesky factors and modified Cholesky factors to update state covariance. In these new forms, sequential measurement processing will be used. Van der Merwe's square root form of UKF is elaborated further. The computational complexity of all the forms for UKF are analysed. It is also shown that in some cases the UDU T form is faster than the standard UKF. Simulation examples are used to test all the forms' numerical robustness of covariance update and gain computation. It will be shown that the square root forms and the UDU T form have better numerical robustness than the standard form. Also it is demonstrated that for some problems the weight values of sigma points can influence the numerical robustness of UKF.

关键词： Unscented Kalman filter nonlinear filter computational complexity analysis numerical robustness analysis

来源：评论

学校读者我要写书评

暂无评论

Multicriteria movement synchronization scheduling problems and algorithms

引用

OPTIMIZATION 2012年第8期61卷 1039-1073页

作者： Tarapata, Zbigniew Mil Univ Technol Cybernet Fac PL-00908 Warsaw Poland

This article deals with multicriteria optimization models and algorithms of movement scheduling for many objects to synchronize their movement (2CMSS problem). The model consists of two parts: (1) node-disjoint path planning visiting specified nodes for K objects with a given vector of intermediate nodes for each one (NDSP problem);(2) movement synchronization in some intermediate nodes (MS problem). For synchronous movement, two categories of criteria are defined: time of movement and 'distance' of K-moved objects from the movement pattern. We defined the problem as a discrete-continuous, non-linear, two-criteria mathematical programming problem. We proposed to use a two-stage algorithm to solve the 2CMSS problem (as lexicographic solution): At first we have to find the vector of node-disjoint shortest paths for K objects visiting intermediate nodes to set optimal paths under the assumption that we use maximal possible velocities on each arc belonging to a path for each object (solution of the NDSP problem), and next we try to decrease the values of velocities to optimize the second criterion (synchronization, solution of the MS problem). Experimental analyses of effectiveness and complexity of the algorithms are presented.

关键词： node-disjoint paths movement planning and synchronization approximation algorithms transport optimization computational complexity analysis CGF systems

来源：评论

学校读者我要写书评

暂无评论

Performance of Bit-Level Decoding Algorithms for Binary LTE Turbo Codes with Early Stopping

引用

ISTANBUL UNIVERSITY-JOURNAL OF ELECTRICAL AND ELECTRONICS ENGINEERING 2017年第2期17卷 3399-3415页

作者： Beeharry, Yogesh Fowdur, Tulsi Pawan Soyjaudah, Krishnaraj M. S. Univ Mauritius Dept Elect & Elect Engn Reduit Mauritius

Turbo codes apply an iterative message passing mechanism between two concatenated decoders. Their astounding performance has led to their widespread adoption in several communication standards such as Long Term Evolution, and Code Division for Multiple Access 2000. This paper gives an overview of three bit-level decoding MaxLog-MAP algorithms with Sign Difference Ratio-based early stopping that can be used with Long Term Evolution Turbo Codes. A detailed computational complexity analysis is given for the three methods. It is observed that the complexity of the decoding methods decrease significantly as the E-b/N-0 increases when Sign Difference Ratio is used. Moreover, the Bit Error Rate performance of the methods was also assessed and compared for different modulation schemes. Results show that the different methods perform differently in the waterfall and error-floor regions with different modulation schemes. Moreover, the computational complexity analysis show that Method 2 requires fewer overall number of computations compared to Methods 1 and 3.

关键词： LTE Turbo Codes Max-Log-MAP Turbo Decoding computational complexity analysis

来源：评论

学校读者我要写书评

暂无评论

Comprehensive dynamic battery modeling for PHEV applications

Comprehensive dynamic battery modeling for PHEV applications

引用

IEEE Power and Energy Society General Meeting

作者： Hanlei Zhang Mo-Yuen Chow Department of Electrical and Computer Engineering North Carolina State University Raleigh 27606 USA

ISBN: (纸本)9781424465491;9781424483570

关键词： Electric battery model accuracy analysis battery relaxation effect computational complexity analysis multi-objective optimization plug-in hybrid electric vehicle (PHEV) Batteries relaxation effect accuracy analysis R-C NETWORKS complexity analysis Battery Life vehicle

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：