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

Utility-Oriented Underwater Image Quality Assessment Based on Transfer Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chen, Weiling Lin, Rongfu Liao, Honggang Zhao, Tiesong Gu, Ke Le Callet, Patrick Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information Fuzhou University Fuzhou350108 China Peng Cheng Laboratory Shenzhen518000 China The Faculty of Information Technology Beijing University of Technology Engineering Research Center of Intelligent Perception and Autonomous Control Ministry of Education Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing Artificial Intelligence Institute Beijing100124 China Équipe Image Perception et Interaction Laboratoire des Sciences du Numérique de Nantes Université de Nantes France

The widespread image applications have greatly promoted the vision-based tasks, in which the Image Quality Assessment (IQA) technique has become an increasingly significant issue. For user enjoyment in multimedia systems, the IQA exploits image fidelity and aesthetics to characterize user experience;while for other tasks such as popular object recognition, there exists a low correlation between utilities and perceptions. In such cases, the fidelity-based and aesthetics-based IQA methods cannot be directly applied. To address this issue, this paper proposes a utility-oriented IQA in object recognition. In particular, we initialize our research in the scenario of underwater fish detection, which is a critical task that has not yet been perfectly addressed. Based on this task, we build an Underwater Image Utility Database (UIUD) and a learning-based Underwater Image Utility Measure (UIUM). Inspired by the top-down design of fidelity-based IQA, we exploit the deep models of object recognition and transfer their features to our UIUM. Experiments validate that the proposed transfer-learning-based UIUM achieves promising performance in the recognition task. We envision our research provides insights to bridge the researches of IQA and computer vision. Copyright © 2022, The Authors. All rights reserved.

关键词： Multimedia systems

A Many-Objective Evolutionary Algorithm Assisted by Ideal Hyperplane

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Zhang, Zhixia Wen, Jie Wang, Hui Cai, Xingjuan Cui, Zhihua Zhang, Wensheng School of Computer Science and Technology Taiyuan University of Science and Technology China School of Information Engineering Nanchang Institute of Technology Nanchang330099 China State Key Laboratory of Intelligent Control and Management of Complex System Institute of Automation Chinese Academy of Sciences China State Key Lab. for Novel Software Technology Nanjing University China

In many-objective optimization problems (MaOPs), it is a difficult task for evolutionary algorithms to balance convergence and diversity while rapidly converging to the Pareto front. As the number of objectives increases, the difficulty of evolutionary algorithms increases with individual selection pressure. To address above problems, we propose a many-objective evolution algorithm assisted by an ideal hyperplane (MaOEA-IH). Firstly, the ideal hyperplane as a reference surface to guide the individual to search the Pareto front, which is established from the extremum of each dimension of the objective space. Secondly, a parallel p -norm mating selection strategy is proposed to improve convergence. In addition, two factors are considered in this strategy: 1) different p -norm are used to measure different spatial scales;2) individual selection uncertainty is defined by incorporating a probabilistic perturbation mechanism. Thirdly, the improved shift-based density estimation strategy is used as the evaluation criterion for environmental selection to improve the convergence and diversity of solution sets and enhance selection pressure. To verify the effectiveness of the proposed algorithm, MAOEA-IH is compared with seven excellent algorithms in three benchmark sets (DTLZ, WFG and MaF). The results show that the proposed MAOEA-IH is highly competitive in solving MaOPs. © 2022, The Authors. All rights reserved.

关键词： Geometry

Algorithm of improved marriage in honey bees optimization and convergence analysis

学校读者我要写书评

暂无评论

Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology 2007年第SUPPL. 1期27卷 80-84页

作者： Yang, Chen-Guang Cai, Tao Tu, Xu-Yan Department of Automatic Control School of Information Science and Technology Beijing Institute of Technology Beijing 100081 China Key Laboratory of Complex System Intelligent Control and Decision Beijing Institute of Technology Beijing 100081 China

One problem of marriage in honey bees optimization (MBO) is that its complex computation process will limit its applications. The paper proposed an improved marriage honey bees optimization (IMBO). By randomly initializing drones and restricting the condition of iteration, the calculation process becomes easier. The global convergence characteristic of IMBO is also proved based on the Markov chain theory. With different number of nodes, traveling salesman problem(TSP) is used to compare the IMBO with MBO and genetic algorithm(GA). Simulation results show that IMBO has better convergence performance.

关键词： Genetic algorithms

Recurrent Attentional Reinforcement Learning for Machinery Fault Diagnosis

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Tang, Zhenhui Wang, Jingcheng Wu, Shunyu The Department of Automation The Key Laboratory of System Control and Information Processing Ministry of Education of China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University No.800 Dongchuan Road Shanghai200240 China The SJTU Sanya Yazhou Bay Institute of Deepsea Science and Technology Sanya572024 China The Autonomous Systems and Intelligent Control International Joint Research Center Xi’an Technological University Xi’an710021 China

Recognizing fault types of machinery system is a fundamental but challenging task in industrial application. Although remarkable progress has been attained by learning fault features and predicting the corresponded fault type with deep neural networks, the existing fault diagnosis pipelines usually learn non-discriminative information. Contextual sequence dependency between the localized time fragments is often ignored. To deal with these problem, a recurrent attention framework with reinforcement learning is proposed to find a series of informative features of local time fragments related to different faults in an iterative manner. Fault labels are further predicted on these time fragments. The proposed framework also explicitly models long-term dependencies among these attentional time fragments to capture historical fault information. Experiments on two typical machinery systems, bearing system and hydraulic system, show that the proposed framework achieves superior diagnosis performance and increases no computation burden on CPU. © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

A Performance-Based Model Recovery Anti-Windup Design for Linear systems Subject to Actuator Saturation

学校读者我要写书评

暂无评论

A Performance-Based Model Recovery Anti-Windup Design for Li...

American control Conference (ACC)

作者： Wenxin Lai Yuanlong Li Zongli Lin Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia Char-lottesville VA U.S.A.

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

In this paper, we investigate the problem of reference tracking for a class of linear systems subject to actuator saturation and propose a performance-based model recovery anti-windup strategy. We adopt the classic model recovery anti-windup framework and regard the states or one of the outputs of the anti-windup compensator as the tracking error, by which the difference between the unconstrained system and the saturated system is quantified. Then, instead of employing the commonly used $\mathcal{L}_system$ gain, we present the prescribed performance functions (PPFs) to characterize the real-time tracking error such that the system performance can be captured more specifically. In particular, to avoid singular issues arising from the occurrence of saturation, we modify the existing PPFs with an auxiliary system when saturation occurs. Based on these modified performance functions, we follow a modified prescribed performance control approach and design the remaining output of the anti-windup compensator. Such a design procedure is constructive, making it more promising for extension to nonlinear systems. Theoretical results establish the boundedness of all signals in the closed-loop system. Simulation results verify the effectiveness of our design strategy.

关键词： Linear systems Actuators Simulation system performance Stability analysis Real-time systems Trajectory

Giant-cavity-based quantum sensors with enhanced performance

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhu, Y.T. Wu, R.B. Peng, Z.H. Xue, Shibei Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China Center for intelligent and networked systems Department of Automation Tsinghua University Beijing100084 China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Key Laboratory for Matter Microstructure and Function of Hunan Province Department of Physics Synergetic Innovation Center for Quantum Effects and Applications Hunan Normal University Changsha410081 China

Recent progresses have revealed that quantum systems with multiple position-dependent couplings, e.g., giant atoms, can exhibit some unconventional phenomena, such as non-exponential decay etc. However, their potential applications are still open questions. In this paper, we propose a giant-cavity-based quantum sensor for the first time, whose performance can be greatly enhanced compared to traditional cavity-based sensors. In our proposal, two cavities couple to a dissipative reservoir at multiple points while they couple to a gain reservoir in a single-point way. To detecting a unknown parameter using this sensor, a waveguide is coupled to one of the cavities where detecting fields can pass through for homodyne detection. We find that multiple position-dependent couplings can induce an inherent non-reciprocal coupling between the cavities, which can enhance the performance of sensors. Output noise in our scheme can be reduced to the shot noise level, which is about one order magnitude lower than the results in Ref. [Lau and Clerk (2018)]. Besides, the signal-to-noise ratio per photon is also enhanced by about one order of magnitude. These results show that the multiple-point-coupling structure is beneficial to nowadays quantum devices. Copyright © 2022, The Authors. All rights reserved.

关键词： Couplings

Incremental Online Learning of Randomized Neural Network with Forward Regularization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Junda Hu, Minghui Li, Ning Al-Ali, Abdulaziz Suganthan, Ponnuthurai Nagaratnam The Key Laboratory of System Control and Information Processing Ministry of Education of China China The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The School of Electrical and Electronic Nanyang Technological University Singapore The KINDI Computing Research Center College of Engineering Qatar University Qatar

Online learning of deep neural networks suffers from challenges such as hysteretic non-incremental updating, increasing memory usage, past retrospective retraining, and catastrophic forgetting. To alleviate these drawbacks and achieve progressive immediate decision-making, we propose a novel Incremental Online Learning (IOL) process of Randomized Neural Networks (Randomized NN), a framework facilitating continuous improvements to Randomized NN performance in restrictive online scenarios. Within the framework, we further introduce IOL with ridge regularization (-R) and IOL with forward regularization (-F). -R generates stepwise incremental updates without retrospective retraining and avoids catastrophic forgetting. Moreover, we substituted -R with -F as it enhanced precognition learning ability using semi-supervision and realized better online regrets to offline global experts compared to -R during IOL. The algorithms of IOL for Randomized NN with -R/-F on non-stationary batch stream were derived respectively, featuring recursive weight updates and variable learning rates. Additionally, we conducted a detailed analysis and theoretically derived relative cumulative regret bounds of the Randomized NN learners with -R/-F in IOL under adversarial assumptions using a novel methodology and presented several corollaries, from which we observed the superiority on online learning acceleration and regret bounds of employing -F in IOL. Finally, our proposed methods were rigorously examined across regression and classification tasks on diverse datasets, which distinctly validated the efficacy of IOL frameworks of Randomized NN and the advantages of forward regularization. Copyright © 2024, The Authors. All rights reserved.

关键词：

Joint Offloading Decision and Resource Allocation for Vehicular Fog-Edge Computing Networks: A Contract-Stackelberg Approach

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Yuwei Yang, Bo Wu, Hao Han, Qiaoni Chen, Cailian Guan, Xinping The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Huawei Technologies Co. Ltd China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The Department of Automation Tianjin University Tianjin 300072 China

With the popularity of mobile devices and development of computationally intensive applications, researchers are focusing on offloading computation to Mobile Edge Computing (MEC) server due to its high computational efficiency and low communication delay. As the computing resources of an MEC server are limited, vehicles in the urban area who have abundant idle resources should be fully utilized. However, offloading computing tasks to vehicles faces many challenging issues. In this paper, we introduce a vehicular fog-edge computing paradigm and formulate it as a multi-stage Stackelberg game to deal with these issues. Specifically, vehicles are not obligated to share resources, let alone disclose their private information (e.g., stay time and the amount of resources). Therefore, in the first stage, we design a contract-based incentive mechanism to motivate vehicles to contribute their idle resources. Next, due to the complicated interactions among vehicles, road-side unit (RSU), MEC server and mobile device users, it is challenging to coordinate the resources of all parties and design a transaction mechanism to make all entities benefit. In the second and third stages, based on Stackelberg game, we develop pricing strategies that maximize the utilities of all parties. The analytical forms of optimal strategies for each stage are given. Simulation results demonstrate the effectiveness of our proposed incentive mechanism, reveal the trends of energy consumption and offloading decisions of users with various parameters, and present the performance comparison between our framework and existing MEC offloading paradigm in vehicular networks. © 2022, CC BY.

关键词： Fog computing

Self-Organized Criticality in C. Elegans Neural Network

学校读者我要写书评

暂无评论

Self-Organized Criticality in C. Elegans Neural Network

Chinese control Conference (CCC)

作者： Xiao Gu Jian Liu Ye Yuan Peng Zhao Kuankuan Xin Tao Fang Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai China Shanghai Engineering Research Centre of Intelligent Control and Management Shanghai China Institute of Machine Intelligence University of Shanghai for Science and Technology Shanghai China Queensland Brain Institute The University of Queensland Brisbane QLD Australia

The self-organized criticality is a fundamental property for organisms to perform normal functional activities. Extensive large-scale biological neural network researches have found the existence of self-organized criticality through avalanche phenomenon, which is typical characteristic of self-organized criticality. However, such research method is not suitable for small-scale biological neural network, because number of neurons in small-scale biological neural network is not large enough to support the emergence of avalanche phenomenon. It has been demonstrated that branching parameter can also be used to describe the propagation of activity in the neural network. Here, in this paper, the C. elegans neural network composed of 302 neurons is selected to investigate the existence of self-organized criticality using branching parameter. Based on the obtained connectome of C. elegans, a directed graph model is constructed to simulate the gradient potential of neurons and the activity of C. elegans, then, the existence of self-organized criticality in the neural network of C. elegans is proved by using branching parameter method. Meanwhile, the result is further confirmed by analyzing the calcium activity data of C. elegans obtained from biological experiments.

关键词：