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

EEG-Based Brain-Computer Interfaces Are Vulnerable to Backdoor Attacks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Meng, Lubin Huang, Jian Zeng, Zhigang Jiang, Xue Yu, Shan Jung, Tzyy-Ping Lin, Chin-Teng Chavarriaga, Ricardo 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 Wuhan China Brainnetome Center National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China La Jolla CA United States Center for Advanced Neurological Engineering Institute of Engineering in Medicine Ucsd La Jolla CA United States Centre of Artificial Intelligence Faculty of Engineering and Information Technology University of Technology Sydney Australia Zhaw DataLab Zürich University of Applied Sciences Winterthur8401 Switzerland

Research and development of electroencephalogram (EEG) based brain-computer interfaces (BCIs) have advanced rapidly, partly due to deeper understanding of the brain and wide adoption of sophisticated machine learning approaches for decoding the EEG signals. However, recent studies have shown that machine learning algorithms are vulnerable to adversarial attacks. This article proposes to use narrow period pulse for poisoning attack of EEG-based BCIs, which is implementable in practice and has never been considered before. One can create dangerous backdoors in the machine learning model by injecting poisoning samples into the training set. Test samples with the backdoor key will then be classified into the target class specified by the attacker. What most distinguishes our approach from previous ones is that the backdoor key does not need to be synchronized with the EEG trials, making it very easy to implement. The effectiveness and robustness of the backdoor attack approach is demonstrated, highlighting a critical security concern for EEG-based BCIs and calling for urgent attention to address it. Copyright © 2020, The Authors. All rights reserved.

关键词： Electroencephalography

Robust Semi-Global Leaderless Consensus and Containment control of Identical Linear Systems with Imperfect Actuators

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2018年第1期31卷 69-86页

作者： SHI Liangren ZHAO Zhiyun LIN Zongli Department of Automation Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai 200240 China Key Laboratory of Advanced Control and Optimization for Chemical Processes (East China University of Science and Technology) Ministry of Education Shanghai 200237 China Charles L. Brown Department of Electrical and Computer Engineering University of Virginia P.O. Box 400743 Charlottesville VA 22904-4743 USA

This paper investigates both the robust semi-global leaderless consensus problem and the robust semi-global containment control problem for a group of identical linear systems with imperfect actuators. The imperfect actuators are characterized by nonlinearities such as saturation and dead zone and there input output relationships are not precisely known. The dynamics of follower agents are also affected by the input additive disturbances. Low-and-high gain feedback consensus protocols are constructed to solve these problems. More specifically, it is shown that robust semi-global leaderless consensus can be achieved over a connected undirected graph and robust semi-global containment control can be achieved when each follower agent has access to the information of at least one leader agent. Numerical simulation illustrates the theoretical results.

关键词： Consensus containment control dead zone leaderless consensus multi-agent systems saturation

Low-latency federated learning over wireless channels with differential privacy

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wei, Kang Li, Jun Ma, Chuan Ding, Ming Chen, Cailian Jin, Shi Han, Zhu Poor, H. Vincent School of Electrical and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China Data61 CSIRO SydneyNSW2015 Australia The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul Korea Republic of The Department of Electrical and Computer Engineering Princeton University PrincetonNJ08544 United States

In federated learning (FL), model training is distributed over clients and local models are aggregated by a central server. The performance of uploaded models in such situations can vary widely due to imbalanced data distributions, potential demands on privacy protections, and quality of transmissions. In this paper, we aim to minimize FL training delay over wireless channels, constrained by overall training performance as well as each client's differential privacy (DP) requirement. We solve this problem in the framework of multi-agent multiarmed bandit (MAMAB) to deal with the situation where there are multiple clients confornting different unknown transmission environments, e.g., channel fading and interferences. Specifically, we first transform the long-term constraints on both training performance and each client's DP into a virtual queue based on the Lyapunov drift technique. Then, we convert the MAMAB to a max-min bipartite matching problem at each communication round, by estimating rewards with the upper confidence bound (UCB) approach. More importantly, we propose two efficient solutions to this matching problem, i.e., modified Hungarian algorithm and greedy matching with a better alternative (GMBA), in which the first one can achieve the optimal solution with a high complexity while the second one approaches a better tradeoff by enabling a verified low-complexity with little performance loss. In addition, we develop an upper bound on the expected regret of this MAMAB based FL framework, which shows a linear growth over the logarithm of communication rounds, justifying its theoretical feasibility. Extensive experimental results are conducted to validate the effectiveness of our proposed algorithms, and the impacts of various parameters on the FL performance over wireless edge networks are also discussed. Copyright © 2021, The Authors. All rights reserved.

关键词： Multi agent systems

End-to-end learning for high-precision lane keeping via multi-state model

学校读者我要写书评

暂无评论

CAAI Transactions on Intelligence technology 2018年第4期3卷 185-190页

作者： Wei Yuan Ming Yang Hao Li Chunxiang Wang Bing Wang Department of Automation Key Laboratory of System Control and Information ProcessingShanghai Jiao Tong UniversityMinistry of Education of ChinaShanghai 200240People’s Republic of China Department of Automation & SJTU-ParisTech Elite Institute of Technology Shanghai Jiao Tong UniversityShanghai 200240People’s Republic of China

High-precision lane keeping is essential for the future autonomous ***,due to the imbalanced and inaccurate datasets collected by human drivers,current end-to-end driving models have poor lane keeping the *** improve the precision of lane keeping,this study presents a novel multi-state model-based end-to-end lane keeping ***,three driving states will be defined:going straight,turning right and turning ***,the finite-state machine(FSM)table as well as three kinds of training datasets will be generated based on the three driving *** of collecting the dataset by human drivers,the accurate dataset will be collected by the high-performance path following ***,three sets of parameters based on 3DCNN-LSTM model will be trained for going straight,turning left and turning right,which will be combined with FSM table to form a multi-state *** study evaluates the multi-state model by testing it on five tracks and recording the lane keeping *** result shows the multi-state model-based end-to-end method performs the higher precision of lane keeping than the traditional single end-to-end model.

关键词： High-precision lane keeping

Robotic Trajectory Planning for Non-Destructive Testing Based on Surface 3D Point Cloud Data

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1965卷

作者： Zhen Zhang Hualiang Zhang Xiaolong Yu Yongsheng Deng Zheng Chen School of mechanical engineering and automation Northeastern University Shenyang China Key laboratory of industrial control network and system Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Hangzhou innovation institute Beihang University Hangzhou China School of information engineering Shenyang University of Chemical Technology Shenyang China

Robotics has been widely used in the field of non-destructive testing in recent years. However, for complex surfaces, manual teaching or offline programming is time-consuming and difficult to ensure high precision for non-destructive testing robot trajectory planning. Therefore, this work proposes a new method to generate non-destructive testing trajectory of the robot based on the pre-processed point cloud data. The workpiece surface is measured by 3D sensor to obtain the point cloud data. The trajectory line on workpiece surface is obtained by slicing pre-processed point cloud data. The dense trajectory points are obtained by isometric discretizing trajectory lines, and then they are compressed by Douglas-Peucker algorithm. The Principal Component Analysis (PCA) method is used to estimate the normal vector of the optimized trajectory points and unify their orientation. The pose of non-destructive testing robot can be obtained by biasing the trajectory points along their normal vectors finally.

关键词：

Velocity Coordination of Multi-vehicle Systems via Distributed Neighbor Selection

学校读者我要写书评

暂无评论

Velocity Coordination of Multi-vehicle Systems via Distribut...

International Conference on Intelligent Transportation

作者： Haibin Shao Lulu Pan Yugeng Xi Dewei Li Shu Lin Department of Automation and the Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Jiao Tong University China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781538670255

In this paper, we examine a data-driven control approach to coordination of multi-vehicle systems based on the distributed neighbor selection. The core of the proposed approach is to utilize a recently developed metric called relative tempo for distributed coordination which is computable from local measurable data for each vehicle in the network. The relative tempo between each agent and its neighbors is shown to be closely related to the directed spanning tree of the underlying network in a quantitative manner. Based on this fact, a local neighbor selection protocol is subsequently provided to construct the global refined communication structure which can both maintain the connectivity and increase the efficiency of the multi-vehicle coordination. The numerical study is finally provided to demonstrate the effectiveness of our approach.

关键词： Protocols Vehicle dynamics control systems Topology Intelligent transportation systems Measurement Heuristic algorithms

Quantum hamiltonian identification with classical colored measurement noise

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Tan, Lingyu Dong, Daoyi Li, Dewei Xue, Shibei Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China School of Engineering and Information Technology University of New South Wales CanberraACT2600 Australia

In this paper, we present a Hamiltonian identification method for a closed quantum system whose time trace observables are measured with colored measurement noise. The dynamics of the quantum system are described by a Liouville equation which can be converted to a coherence vector representation. Since the measurement process is disturbed by classical colored noise, we introduce an augmented system model to describe the total dynamics, where the classical colored noise is parameterized. Based on the augmented system model as well as the measurement data, we can find a realization of the quantum system with unknown parameters by employing an Eigenstate Realization Algorithm. The unknown parameters can be identified using a transfer-function-based technique. An example of a two-qubit system with colored measurement noise is demonstrated to verify the effectiveness of our method. Copyright © 2019, The Authors. All rights reserved.

关键词： Quantum optics

On efficient and robust metrics for RANSAC hypotheses and 3D rigid registration

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yang, Jiaqi Huang, Zhiqiang Quan, Siwen Zhang, Qian Zhang, Yanning Cao, Zhiguo National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University China School of Software Northwestern Polytechnical University Xi’an710129 China School of Electronic and Control Engineering Chang’an University Xi’an710064 China School of Resources and Environment Hubei University Wuhan430062 China National Key Laboratory of Science and Technology on Multi-spectral Information Processing School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

This paper focuses on developing efficient and robust evaluation metrics for RANSAC hypotheses to achieve accurate 3D rigid registration. Estimating six-degree-of-freedom (6-DoF) pose from feature correspondences remains a popular approach to 3D rigid registration, where random sample consensus (RANSAC) is a de-facto choice to this problem. However, existing metrics for RANSAC hypotheses are either time-consuming or sensitive to common nuisances, parameter variations, and different application scenarios, resulting in performance deterioration in overall registration accuracy and speed. We alleviate this problem by first analyzing the contributions of inliers and outliers, and then proposing several efficient and robust metrics with different designing motivations for RANSAC hypotheses. Comparative experiments on four standard datasets with different nuisances and application scenarios verify that the proposed metrics can significantly improve the registration performance and are more robust than several state-of-the-art competitors, making them good gifts to practical applications. This work also draws an interesting conclusion, i.e., not all inliers are equal while all outliers should be equal, which may shed new light on this research problem. Copyright © 2020, The Authors. All rights reserved.

关键词： Deterioration

Convolutional ordinal regression forest for image ordinal estimation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhu, Haiping Shan, Hongming Zhang, Yuheng Che, Lingfu Xu, Xiaoyang Zhang, Junping Shi, Jianbo Wang, Fei-Yue The Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Institute of Science and Technology for Brain-inspired Intelligence MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China The Shanghai Center for Brain Science and Brain-inspired Technology Shanghai201210 China The GRASP Laboratory University of Pennsylvania PhiladelphiaPA United States The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The Institute of Systems Engineering Macau University of Science and Technology 999078 China The University of Chinese Academy of Sciences Beijing100049 China

Image ordinal estimation is to predict the ordinal label of a given image, which can be categorized as an ordinal regression problem. Recent methods formulate an ordinal regression problem as a series of binary classification problems. Such methods cannot ensure that the global ordinal relationship is preserved since the relationships among different binary classifiers are neglected. We propose a novel ordinal regression approach, termed Convolutional Ordinal Regression Forest or CORF, for image ordinal estimation, which can integrate ordinal regression and differentiable decision trees with a convolutional neural network for obtaining precise and stable global ordinal relationships. The advantages of the proposed CORF are twofold. First, instead of learning a series of binary classifiers independently, the proposed method aims at learning an ordinal distribution for ordinal regression by optimizing those binary classifiers simultaneously. Second, the differentiable decision trees in the proposed CORF can be trained together with the ordinal distribution in an end-to-end manner. The effectiveness of the proposed CORF is verified on two image ordinal estimation tasks, i.e. facial age estimation and image aesthetic assessment, showing significant improvements and better stability over the state-of-the-art ordinal regression methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Decision trees