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

SSRN 2024年

作者： Sheng, Chuang Fu, Jun Zu, YanMin Deng, ZhongHua Li, Xi School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control Education Ministry Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518055 China School of Electronic Information Engineering Jingchu University of Technology Jingmen448000 China

Accurately predicting the performance degradation trend of fuel cells helps take measures in advance and prolong the service life of the stack, which led to the creation of a novel hybrid forecasting approach. The first grey model prediction method based on residual exponential smoothing optimization (ES-R-GM) can capture the voltage deterioration trend. The integration of two different ES techniques, specifically the double ES (ES2) and cubic ES (ES3), is explored to investigate their effect on improving the predictive accuracy of the GM model. The second method of the adaptive network fuzzy inference system (ANFIS) can characterize local nonlinear behaviour. The simulated annealing (SA) algorithm is utilized to optimize ANFIS results under different fuzzy rule selection strategies. The outcomes of the two types of prediction methods mentioned above are combined to create a hybrid prediction using the data fusion method and the moving window technique. Different hybrid methods are evaluated under general conditions and further detailed optimization. The proposed hybrid framework is verified by the data obtained from the experimental platform. Moreover, when applied to consistent public datasets, the hybrid approach maintains its robustness and accuracy compared with other prognostic methods. © 2024, The Authors. All rights reserved.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Novel low power supply DC-coupled 1.25 Gb/s laser diode driver

引用

Guti Dianzixue Yanjiu Yu Jinzhan/Research and Progress of Solid State Electronics 2006年第4期26卷 498-503页

作者： Fu, Shengmeng Chen, Zhaoyang Institute for Pattern Recognition and Artificial Intelligence Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory for Image Information Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

Since the DC-coupled interface between the driver and the laser diode makes it impossible for the conventional drivers to work with low power supply, an output stage has been proposed. A novel APC can suppress the output average optical power and extinction ratio within ±0.3 dBm and ±0.4 dB(-40°C to 100°C), respectively. The initialization time is not more than 0.6 μs because the fast binary search algorithm is incorporated into the APC. The burst-on delay and burst-off delay are less than 5 ns and meet the requirement of PON system. The chip is fabricated in TSMC 0.8 μm BiCMOS process and occupies an area of 1.56 mm × 1.67 mm with a power consumption of 105 mW.

关键词： Diodes

来源：评论

学校读者我要写书评

暂无评论

Sparse generalized canonical correlation analysis: Distributed alternating iteration based approach

arXiv

引用

arXiv 2020年

作者： Cai, Jia Lv, Kexin Huo, Junyi Huang, Xiaolin Yang, Jie School of Statistics and Mathematics Guangdong University of Finance & Economics Big Data and Educational Statistics Application Laboratory 21 Chisha Road Guangzhou Guangdong510320 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University MOE Key Laboratory of System Control and Information Processing 800 Dongchuan Road Shanghai200240 China School of Electronics and Computer Science University of Southampton University Road SouthamptonSO17 1BJ United Kingdom

Sparse canonical correlation analysis (CCA) is a useful statistical tool to detect latent information with sparse structures. However, sparse CCA works only for two datasets, i.e., there are only two views or two distinct objects. To overcome this limitation, in this paper, we propose a sparse generalized canonical correlation analysis (GCCA), which could detect the latent relations of multiview data with sparse structures. Moreover, the introduced sparsity could be considered as Laplace prior on the canonical variates. Specifically, we convert the GCCA into a linear system of equations and impose 1 minimization penalty for sparsity pursuit. This results in a nonconvex problem on Stiefel manifold, which is difficult to solve. Motivated by Boyd’s consensus problem, an algorithm based on distributed alternating iteration approach is developed and theoretical consistency analysis is investigated elaborately under mild conditions. Experiments on several synthetic and real world datasets demonstrate the effectiveness of the proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Statistical mechanics

来源：评论

学校读者我要写书评

暂无评论

Boosting discriminative model for moving cast shadow detection

引用

Jisuanji Xuebao/Chinese Journal of Computers 2007年第8期30卷 1295-1301页

作者： Zha, Yu-Fei Chu, Ying Wang, Xun Ma, Shi-Ping Bi, Du-Yan Signal and Information Processing Laboratory Engineering College Air Force Engineering University Xi'an 710038 China Key Laboratory for Image Processing and Intelligent Control Institute of Pattern Recognition and Artificial Intelligence Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Moving cast shadow causes serious problem while segmenting and extracting foreground from image sequences, due to the misclassification of moving shadow as foreground. This paper proposes a Boosting discriminative model to eliminate cast shadow on Discriminative Random Fields (DRFs). The method combines different features for Boosting to discriminate cast shadow from moving objects, then temporal and spatial coherence of shadow and foreground are incorporated on Discriminative Random Fields and the problem can be solved by graph cut. Firstly, moving objects are obtained by background subtraction;secondly, shadow candidates can be derived through pre-processing moving objects, in terms of the shadow physical property;thirdly, color information and texture information is derived by comparing shadow and foreground points in current image with corresponding points in background image, which are selected as features for Boosting;finally, temporal and spatial coherence of shadow and foreground is employed on Discriminative Random Fields and discriminate shadow and foreground by graph cut accurately.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Optimal Fault Detection Observer Design using Excluding Degree

Optimal Fault Detection Observer Design using Excluding Degr...

引用

IEEE Conference on Decision and control

作者： Feng Xu Yiming Wan Ye Wang Division of Information Science and Technology Shenzhen International Graduate School Tsinghua University Shenzhen P.R. China School of Artificial Intelligence and Automation Huazhong University of Science and Technology and Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan P.R. China Department of Electrical and Electronic Engineering The University of Melbourne Parkville VIC Australia

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper proposes a novel optimal gain design method for robust fault detection using set-valued observers. First, a new fault detection performance specification is proposed for set-valued observers based on a new notion named the excluding degree of the origin from a zonotope. Second, a fractional programming problem is formulated to describe fault detection optimality of set-valued observers. Third, optimal fault detection gains are obtained by solving the fractional programming problem. Finally, numerical examples are used to illustrate the effectiveness of the proposed method.

关键词： Fault detection Design methodology Observers Programming Computational complexity Optimization Numerical stability

来源：评论

学校读者我要写书评

暂无评论

Hierarchical P systems with randomized right-hand sides of rules 18th

Hierarchical P systems with randomized right-hand sides of r...

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Alhazov, Artiom Freund, Rudolf Ivanov, Sergiu Institute of Mathematics and Computer Science Academy of Sciences of Moldova Academiei 5 Chişinău2028 Moldova Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Automation Huazhong University of Science and Technology Wuhan430074 China Faculty of Informatics TU Wien Favoritenstraße 9–11 Vienna1040 Austria LACL Université Paris Est – Créteil Val de Marne 61 av. Général de Gaulle Créteil94010 France TIMC-IMAG/DyCTiM Faculty of Medicine of Grenoble 5 avenue du Grand Sablon La Tronche38700 France

ISBN: (纸本)9783319733586

P systems are a model of hierarchically compartmentalized multiset rewriting. We introduce a novel kind of P systems in which rules are dynamically constructed in each step by non-deterministic pairing of left-hand and right-hand sides. We define three variants of right-hand side randomization and compare each of them with the power of conventional P systems. It turns out that all three variants enable non-cooperative P systems to generate exponential (and thus non-semi-linear) number languages. We also give a binary normal form for one of the variants of P systems with randomized rule right-hand sides. © 2018, Springer International Publishing AG.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Nuclear norm regularized coding with local position-patch and nonlocal similarity for face hallucination

引用

Digital Signal processing 2017年 64卷 107-120页

作者： Guangwei Gao Jian Yang Zhihui Lai Pu Huang Jielin Jiang Hao Gao Dong Yue Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing 210023 PR China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou 350121 PR China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 PR China College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 PR China Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing 210094 PR China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 PR China

Learning-based face hallucination methods have received much attention and progress in past few decades. Specially, position-patch based approaches have been proposed to replace the probabilistic graph-based or manifold learning-based ones. As opposed to the existing patch based methods, where the input image patch matrix is converted into vectors before combination coefficients calculation, in this paper, we propose to directly use the image matrix based regression model for combination coefficients computation to preserve the essential structural information of the input patch matrix. For each input low-resolution (LR) patch matrix, its combination coefficients over the training image patch matrices at the same position can be computed. Then the corresponding high-resolution (HR) patch matrix can be obtained with the LR training patches replaced by the corresponding HR ones. The nonlocal self-similarities are finally utilized to further improve the hallucination performance. Various experimental results on standard face databases indicate that our proposed method outperforms some state-of-the-art algorithms in terms of both visual quantity and objective metrics.

关键词： Face hallucination Position-patch Matrix based regression Nuclear norm Nonlocal similarity

来源：评论

学校读者我要写书评

暂无评论

Computationally Expensive High-Dimensional Multiobjective Optimization via Surrogate-Assisted Reformulation and Decomposition

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Pan, Linqiang Lin, Jianqing Wang, Handing He, Cheng Tan, Kay Chen Jin, Yaochu School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence Xidian University Xi’an China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Engineering Trustworth and General Artificial Intelligence Laboratory Westlake University Hangzhou China

In recent decades, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed to solve computationally expensive multiobjective optimization problems (EMOPs). Nevertheless, designing an SAEA to handle high-dimensional EMOPs and balance convergence, diversity, and computational complexity remains challenging. Here, we propose a two-phase SAEA (TP-SAEA), which follows the idea of convergence first and diversity second, for solving high-dimensional EMOPs. In Phase I, a surrogate-assisted problem reformulation method is proposed to fast-track the Pareto optimal set in association with some reference solutions. Specifically, the high-dimensional EMOP is reformulated into an expensive single-objective one with low-dimensional decision space. Then, the surrogate-assisted optimization is utilized to obtain well-converged solutions. In Phase II, the high-dimensional EMOP is decomposed into two subproblems to explore subregions of the decision space that can effectively promote the diversity of the solutions. The two subproblems are optimized independently via surrogate-assisted optimization, aiming to push the population towards different regions of the Pareto optimal front. Experiments are conducted on EMOPs with 100 to 500 decision variables compared with four state-of-the-art SAEAs. The proposed TP-SAEA obtains well-converged and diverse solutions with only 509 real function evaluations. Moreover, its superiority is examined in six real-world instances with up to 12,000 decision variables. IEEE

关键词： Iron

来源：评论

学校读者我要写书评

暂无评论

T-TIME: Test-Time information Maximization Ensemble for Plug-and-Play BCIs

arXiv

引用

arXiv 2024年

作者： Li, Siyang Wang, Ziwei Luo, Hanbin Ding, Lieyun Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China Henan Key Laboratory of Brain Science and Brain Computer Interface Technology School of Electrical and Information Engineering Zhengzhou University China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

Objective: An electroencephalogram (EEG)-based brain-computer interface (BCI) enables direct communication between the human brain and a computer. Due to individual differences and non-stationarity of EEG signals, such BCIs usually require a subject-specific calibration session before each use, which is time-consuming and user-unfriendly. Transfer learning (TL) has been proposed to shorten or eliminate this calibration, but existing TL approaches mainly consider offline settings, where all unlabeled EEG trials from the new user are available. Methods: This paper proposes Test-Time information Maximization Ensemble (T-TIME) to accommodate the most challenging online TL scenario, where unlabeled EEG data from the new user arrive in a stream, and immediate classification is performed. T-TIME initializes multiple classifiers from the aligned source data. When an unlabeled test EEG trial arrives, T-TIME first predicts its labels using ensemble learning, and then updates each classifier by conditional entropy minimization and adaptive marginal distribution regularization. Our code is publicized. Results: Extensive experiments on three public motor imagery based BCI datasets demonstrated that T-TIME outperformed about 20 classical and state-of-the-art TL approaches. Significance: To our knowledge, this is the first work on test time adaptation for calibration-free EEG-based BCIs, making plug-and-play BCIs possible. © 2024, CC BY.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Sample Weighted Gradient Regularization for Source-Free Domain Adaptation

SSRN

引用

SSRN 2024年

作者： Long, Yunchong Xu, Bingrong Zhang, Qingyong Yin, Jianhua Zeng, Zhigang School of Automation Wuhan University of Technology Wuhan430070 China Intelligent Transportation Systems Research Center Wuhan University of Technology Wuhan430063 China The Engineering Research Center of Transportation Information and Safety Ministry of Education Wuhan430063 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control Education Ministry of China Wuhan430074 China

Conventional Domain Adaptation(DA) algorithms typically rely on access to the source data,which may not always be practical due to privacy concerns or limited storage *** address these challenges,Source-Free Domain Adaptation(SFDA) has emerged as an alternative that relies solely on a pre-trained source model rather than the actual source *** SFDA,pseudo-label supervised learning is commonly employed and initially plays a significant role in enhancing model performance during the early stages of target domain ***,as adaptation progresses,the performance can stagnate or even deteriorate due to the noise inherent in pseudo-labels,a phenomenon known as Confirmation *** noise present in target domain pseudo-labels introduces additional uncertainty and overfitting risks to the *** this study,a novel framework named Sample Weighted Gradient Regularization (SWGR) was introduced to tackle this *** first propose the Label Uncertainty Estimation Metric (LUEM),a reweighting strategy that assesses the reliability of *** metric evaluates label uncertainty from both the source domain pre-trained model and spatial distribution of target domain samples,allowing the model to achieve improved cross-domain transfer performance with high-confidence samples in the target domain. Additionally,we impose a constraint on the gradient descent process of the total loss function in the form of an inequality to prevent entropy from *** Gradient Regularization eliminates overfitting while also guiding the model in lowering prediction uncertainty *** approach reduces the uncertainty in the target domain and enhances the model's generalization *** results demonstrate that our method surpasses competing SFDA approaches and even outperforms many traditional DA methods which require extensive amounts of source domain data. © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：