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

34th IEEE Workshop on Signal Processing Systems (SiPS)

作者： Filipe, Jose N. Carreira, J. Tavora, Luis M. N. Faria, Sergio M. M. Navarro, Antonio Assuncao, Pedro A. A. Inst Telecomunicacoes Coimbra Portugal Polytech Leiria ESTG Leiria Portugal Univ Aveiro Aveiro Portugal

ISBN: (纸本)9781728180991

The ever increasing demand for image and video content poses new requirements to support higher resolutions and richer representation formats, creating new challenges in coding algorithms. The forthcoming Versatile Video Coding (VVC) standard aims to increase the coding efficiency of existing algorithms and it is particularly suitable for Ultra-High Definition (UHD) resolutions and 360 degrees video. However, since coding efficiency gains are obtained at the cost of increased complexity, fast computational approaches are needed to cope with real-time requirements, such as parallel processing. Thus, this work presents a contribution towards efficient parallel encoding of 360 degrees video, based on coding complexity estimation and non-uniform data-level splitting (slice-based) for load balancing across multiple processors. A machine learning approach is proposed to estimate the complexity of intra coding VVC, using uncorrelated features, obtained through Principal Component Analysis (PCA) and Extremely Randomised Trees (ERT). Then, a complexity-balanced slice partition is devised, taking advantage of the clustered complexity inherent to Equirectangular Projection (ERP). It is shown that coding complexity is estimated with an accuracy of 92.25%, and the encoding time is reduced by 8.50%, when compared to the case where the 360 degrees frames are evenly split.

关键词： Video Coding complexity Load-balancing VVC complexity estimation

来源：评论

学校读者我要写书评

暂无评论

Tree-like multiple neural network models generator with a complexity estimation based decomposer

Tree-like multiple neural network models generator with a co...

引用

3rd IEEE Intelligent Data Acquisition and Advanced Computing Systems

作者： Madani, Kurosh Chebira, Abdennasser Rybnik, Mariusz Bouyoucef, El-Khier Univ Paris 12 Senart Inst Technol Signal & Intelligent Syst Lab Intelligence Instrumentat & Syst Div I2S F-77127 Lieusaint France

ISBN: (纸本)9780780394452

In this article we present a self organizing hybrid modular approach that is aimed at reduction of processing task complexity by decomposition of an initially complex problem into a set of simpler sub-problems. This approach hybridizes Artificial Neural Networks based artificial intelligence and complexity estimation loops in order to reach a higher level intelligent processing capabilities. In consequence, our approach mixtures learning, complexity estimation and specialized data processing modules in order to achieve a higher level self-organizing modular intelligent information processing system. Experimental results validating the presented approach are reported and discussed.

关键词： Artificial Neural Networks complexity estimation self-organization intelligent decomposer universal information processing

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Flexible complexity Control Method for Versatile Video Coding

引用

IEEE TRANSACTIONS ON BROADCASTING 2025年第1期71卷 96-110页

作者： Zhao, Yan Zhu, Chen Xu, Jun Lu, Guo Song, Li Ma, Siwei Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ MoE Key Lab Artificial Intelligence AI Inst Shanghai 200240 Peoples R China Peking Univ Natl Engn Res Ctr Visual Technol Sch Comp Sci Beijing 100871 Peoples R China

Recently, numerous complexity control approaches have been proposed to achieve the target encoding complexity. However, only few of them were developed for VVC encoders. This paper fills this gap by proposing an efficient and flexible complexity control approach for VVC. The support for both Acceleration Ratio Control (ARC) and Encoding Time Control (ETC) makes our method highly versatile for various applications. At first, we introduce a sequence-level complexity estimation model to merge the ARC and ETC tasks. Then, four key modules are involved for complexity control: complexity allocation, complexity estimation, encoding configuration decision, and feedback. Specifically, we hierarchically allocate the complexity budget to three coding levels: GOP, frame, and Basic Unit (BU). Each BU's allocation weight is decided by its SSIM distortion, whereby the perceptual quality can be ensured. The multi-complexity configurations are established by altering the partition depth and number of reference frames. Via tuning each BU's configuration according to its target acceleration ratio and adaptively updating the control strategies based on the feedback, our scheme can precisely realize any achievable acceleration targets within one-pass encoding. Moreover, each BU's un-accelerated reference encoding time, which is used to calculate its target acceleration ratio, is estimated by SVR models. Experiments prove that for both the ARC and ETC tasks, our scheme can precisely achieve a wide range of complexity targets (30% similar to 100%) with negligible RD loss in PSNR and SSIM, outperforming other state-of-the-art methods.

关键词： complexity theory Encoding estimation Resource management Visualization Standards Partitioning algorithms Distortion Copper Video recording Versatile video coding (VVC) complexity control complexity estimation block partition motion estimation

来源：评论

学校读者我要写书评

暂无评论

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2025年 255卷

作者： Wang, Tao Khoo, Shin Yee Ong, Zhi Chao Siow, Pei Yi Wang, Teng Univ Malaya Fac Engn Dept Mech Engn Kuala Lumpur 50603 Malaysia Univ Malaya Fac Engn Ctr Res Ind CRI 4 0 4 0 Kuala Lumpur 50603 Malaysia

Entropy-based methods are widely used in machinery fault diagnosis for characterizing system disorder and complexity. However, conventional entropy techniques often fail to capture local signal variations when analyzing relationships between vectors, especially in complex settings. This leads to incomplete representations of subtle features and dynamic behaviors, resulting in inaccurate estimations of system complexity and affecting diagnostic accuracy and reliability. To address these limitations, a novel distance similarity entropy (DSEn) is proposed in this paper: (1) It leverages element-wise distance to precisely capture local shifts and subtle distortions between subsequences. (2) It employs a Gaussian kernel function for vector similarity, enhancing signal pattern analysis by preserving subtle differences and mitigating the impact of outliers. (3) It uses probability density estimation of distance similarities between adjacent vectors to track changes in internal signal patterns, enabling more accurate and sensitive estimations of signal complexity. Synthetic signal experiments demonstrate that DSEn excels in detecting dynamic time series changes and characterizing signal complexity. Tests on two bearing datasets reveal that DSEn's extracted features show significant differences, highlighted by Hedges' g effect size. Compared to other commonly used entropies (SampEn, PermEn, FuzzEn, DistEn, etc.), DSEn shows superior fault identification accuracy, computational efficiency, and noise resistance.

关键词： complexity estimation Element-wise distance Fault diagnosis Feature extraction Gaussian kernel function Rolling bearing

来源：评论

学校读者我要写书评

暂无评论

ON THE EFFICIENCY OF SUBSUMPTION ALGORITHMS

引用

JOURNAL OF THE ACM 1985年第2期32卷 280-295页

作者： GOTTLOB, G LEITSCH, A VIENNA TECH UNIV A-1040 VIENNAAUSTRIA WIRTSCHAFTSUNIV WIEN VIENNAAUSTRIA

The costs of subsumption algorithms are analyzed by an estimation of the maximal number of unification attempts (worst-case unification complexity) made for deciding whether a clause C subsumes a clause D. For this purpose the clauses C and D are characterized by the following parameters: number of variables in C, number of literals in C, number of literals in D, and maximal length of the literals. The worst-case unification complexity immediately yields a lower bound for the worst-case time ***, two well-known algorithms (Chang-Lee, Stillman) are investigated. Both algorithms are shown to have a very high worst-case time complexity. Then, a new subsumption algorithm is defined, which is based on an analysis of the connection between variables and predicates in C. An upper bound for the worst-case unification complexity of this algorithm, which is much lower than the lower bounds for the two other algorithms, is derived. Examples in which exponential costs are reduced to polynomial costs are discussed. Finally, the asymptotic growth of the worst-case complexity for all discussed algorithms is shown in a table (for several combinations of the parameters).

关键词： complexity estimation new algorithm subsumption

来源：评论

学校读者我要写书评

暂无评论

estimation of the cool executive function using frontal electroencephalogram signals in first-episode schizophrenia patients

引用

BIOMEDICAL ENGINEERING ONLINE 2016年第1期15卷 1-14页

作者： Yu, Yi Zhao, Yun Si, Yajing Ren, Qiongqiong Ren, Wu Jing, Changqin Zhang, Hongxing Xinxiang Med Univ Dept Biomed Engn Xinxiang Henan Peoples R China Xinxiang Med Univ Dept Psychol Xinxiang Henan Peoples R China Xinxiang Med Univ Dept Life Sci & Technol Xinxiang Henan Peoples R China

Background: In schizophrenia, executive dysfunction is the most critical cognitive impairment, and is associated with abnormal neural activities, especially in the frontal lobes. complexity estimation using electroencephalogram (EEG) recording based on nonlinear dynamics and task performance tests have been widely used to estimate executive dysfunction in schizophrenia. Methods: The present study estimated the cool executive function based on fractal dimension (FD) values of EEG data recorded from first-episode schizophrenia patients and healthy controls during the performance of three cool executive function tasks, namely, the Trail Making Test-A (TMT-A), Trail Making Test-B (TMT-B), and Tower of Hanoi tasks. Results: The results show that the complexity of the frontal EEG signals that were measured using FD was different in first-episode schizophrenia patients during the manipulation of executive function. However, no differences between patients and controls were found in the FD values of the EEG data that was recorded during the performance of the Tower of Hanoi task. Conclusions: These results suggest that cool executive function exhibits little impairment in first-episode schizophrenia patients.

关键词： Executive dysfunction complexity estimation The cool executive function Fractal dimension (FD)

来源：评论

学校读者我要写书评

暂无评论

complexity Control in the HEVC Intracoding for Industrial Video Applications

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第3期15卷 1437-1449页

作者： Zhang, Jia Kwong, Sam Tak Wu Zhao, Tiesong Ip, Horace Ho Shing City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Fuzhou Univ Coll Phys & Informat Engn Fuzhou 350116 Fujian Peoples R China

A large number of industrial video applications are expected to work in real-time and power-constrained scenarios. For such applications, the coding complexity has a great impact on their performance. In this paper, we propose a complexity control method in the high-efficiency video coding intracoding to facilitate these video applications. The proposed method is performed on the coding tree unit (CTU) level, which consists of three steps, namely complexity estimation, complexity allocation, and prediction unit (PU) adaption. In the first step, a complexity estimation model is proposed to estimate the coding complexity of each CTU based on the sum of absolute transformed difference. Then, the complexity budget is allocated to each CTU proportionally to its estimated coding complexity. In PU adaption, only a subset of PU sizes are selected for the CTU according to its allocated complexity and prediction performance. A feedback-based error elimination scheme removes the complexity error during the encoding process. Experimental results show that the proposed method is able to adjust the complexity ratio from 100% to 20%. Meanwhile, the rate-distortion performance and complexity control accuracy of the proposed method are superior to those of the state-of-the-art methods.

关键词： complexity control complexity estimation complexity allocation high-efficiency video coding (HEVC) prediction unit (PU) adaption

来源：评论

学校读者我要写书评

暂无评论

High throughput entropy decoder design for H.265/HEVC

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2017年第7期76卷 9877-9890页

作者： Choi, Jung-Ah Ho, Yo-Sung GIST 123 Cheomdangwagi Ro Gwangju 61005 South Korea

The H.265/high efficiency video coding (HEVC) standard employs context-based adaptive binary arithmetic coding (CABAC) as a single entropy coding method. Despite the high coding efficiency of CABAC, its context modeling process limits the throughput and prevents effective parallelization, particularly at the decoder. In this paper, we design a new joint rate distortion-decoding complexity (RDDC) cost function to improve the throughput performance at the H.265/HEVC decoder side. The proposed RDDC cost function includes the complexity term based on a newly designed complexity model using the linear regression. Experimental results show that the proposed method reduces the number of context-coded bins up to 19.8 % without significant coding loss.

关键词： H.265/high efficiency video coding (HEVC) Throughput improvement complexity estimation Linear regression Entropy coding CABAC

来源：评论

学校读者我要写书评

暂无评论

Estimating Scene complexity by One and Two Local Observations

引用

AUTOMATION AND REMOTE CONTROL 2019年第8期80卷 1471-1486页

作者： Karkishchenko, A. N. Res & Design Bur Robot & Control Syst Taganrog Russia

The formal problem to estimate the complexity of a scene with numerous obstacles and mobile objects is considered. By assumption there is only limited information on the location of obstacles in a small part of the scene, which is obtained by the sensor systems of one or more objects. Upper and lower bounds for the complexity of the scene are derived for one and two observations of the local domains.

关键词： mobile object scene triangulation local complexity integral complexity complexity estimation

来源：评论

学校读者我要写书评

暂无评论

PARALLEL ALGORITHM FOR MOLECULAR-DYNAMICS INTEGRATION

引用

PARALLEL COMPUTING 1993年第9期19卷 1029-1039页

作者： TROBEC, R JEREBIC, I JANEZIC, D INST CHEM 61116 LJUBLJANASLOVENIA

A new parallel implementation of a long-range interaction problem on the ring topology for a MIMD computer system is presented. The algorithm was applied for the implementation of a forces integrator in the molecular dynamics. The complexity estimation is made and also measured time results are given. It is shown that for each number of particles N there exists an optimal number of processors p. Time complexity O(N2) of a sequential algorithm is reduced to O(N2/p) With the proposed parallel implementation. The time requirement for the optimal sequential algorithm is proportional to N2/2 and the time requirement for the proposed parallel algorithm is proportional to N2/(2p).

关键词： PARALLEL ALGORITHM TRANSPUTER RING TOPOLOGY LONG-RANGE INTERACTIONS MOLECULAR DYNAMICS complexity estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：