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

Wireless personal training tracker for sports shooting 5

学校读者我要写书评

暂无评论

Wireless personal training tracker for sports shooting

5th Scientific School on Dynamics of Complex Networks and their Applications, DCNA 2021

作者： Antipov, Vladimir Badarin, Artem Neuroscience and Cognitive Technology Laboratory Center for Technologies in Robotics and Mechatronics Components Innopolis University Innopolis Russia Lobachevsky University Nizhny Novgorod Russia Neuroscience and Cognitive Technology Laboratory Center for Technologies in Robotics and Mechatronics Components Innopolis University Innopolis Russia Center for Neurotechnology and Machine Learning Immanuel Kant Baltic Federal University Kaliningrad Russia

ISBN: (纸本)9781665442824

The article describes the process of developing a wireless software arrapat complex for measuring and logging various aspects of sports shooting training. The purpose of the development is to optimize and personalize the training process. This paper proposes an approach that allows synchronization up to 1 ms over a wireless network. As well as a method of writing a large amount of this on a microSD flash drive with minimal latency. © 2021 IEEE

关键词： Sports

CI-GNN: A Granger Causality-Inspired Graph Neural Network for Interpretable Brain Network-Based Psychiatric Diagnosis

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zheng, Kaizhong Yu, Shujian Chen, Badong National Key Laboratory of Human-Machine Hybrid Augmented Intelligence National Engineering Research Center for Visual Information and Applications Institute of Artificial Intelligence and Robotics Xi'an Jiaotong University Xi’an China Department of Computer Science Vrije Universiteit Amsterdam Amsterdam Netherlands Machine Learning Group UiT - Arctic University of Norway Tromsø Norway

There is a recent trend to leverage the power of graph neural networks (GNNs) for brain-network based psychiatric diagnosis, which, in turn, also motivates an urgent need for psychiatrists to fully understand the decision behavior of the used GNNs. However, most of the existing GNN explainers are either post-hoc in which another interpretive model needs to be created to explain a well-trained GNN, or do not consider the causal relationship between the extracted explanation and the decision, such that the explanation itself contains spurious correlations and suffers from weak faithfulness. In this work, we propose a granger causality-inspired graph neural network (CI-GNN), a built-in interpretable model that is able to identify the most influential subgraph (i.e., functional connectivity within brain regions) that is causally related to the decision (e.g., major depressive disorder patients or healthy controls), without the training of an auxillary interpretive network. CI-GNN learns disentangled subgraph-level representations α and β that encode, respectively, the causal and non-causal aspects of original graph under a graph variational autoencoder framework, regularized by a conditional mutual information (CMI) constraint. We theoretically justify the validity of the CMI regulation in capturing the causal relationship. We also empirically evaluate the performance of CI-GNN against three baseline GNNs and four state-of-the-art GNN explainers on synthetic data and three large-scale brain disease datasets. We observe that CI-GNN achieves the best performance in a wide range of metrics and provides more reliable and concise explanations which have clinical evidence. The source code and implementation details of CI-GNN are freely available at GitHub repository (https://***/ZKZ-Brain/CI-GNN/). Copyright © 2023, The Authors. All rights reserved.

关键词： Diagnosis

Deep Convolutional Neural Networks with Zero-Padding: Feature Extraction and learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Han, Zhi Liu, Baichen Lin, Shao-Bo Zhou, Ding-Xuan State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China Center of Intelligent Decision-Making and Machine Learning School of Management Xi’an Jiaotong University Xi’an China School of Mathematics and Statistics University of Sydney SydneyNSW2006 Australia

This paper studies the performance of deep convolutional neural networks (DCNNs) with zero-padding in feature extraction and learning. After verifying the roles of zero-padding in enabling translation-equivalence, and pooling in its translation-invariance driven nature, we show that with similar number of free parameters, any deep fully connected networks (DFCNs) can be represented by DCNNs with zero-padding. This demonstrates that DCNNs with zero-padding is essentially better than DFCNs in feature extraction. Consequently, we derive universal consistency of DCNNs with zero-padding and show its translation-invariance in the learning process. All our theoretical results are verified by numerical experiments including both toy simulations and real-data running. © 2023, CC0.

关键词： Feature extraction

Knowledge-aware Graph Transformer for Pedestrian Trajectory Prediction

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Yu Zhang, Yuexin Li, Kunming Qiao, Yongliang Worrall, Stewart Li, You-Fu Kong, He Shenzhen518055 China Department of Mechanical Engineering City University of Hong Kong Hong Kong School of Automation Guangdong Polytechnic Normal University Guangzhou510665 China Australian Centre for Field Robotics The University of Sydney NSW2006 Australia Australian Institute for Machine Learning The University of Adelaide SA5005 Australia Shenzhen Key Laboratory of Control Theory and Intelligent Systems SUSTech Shenzhen518055 China Guangdong Provincial Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities SUSTech Shenzhen518055 China

Predicting pedestrian motion trajectories is crucial for path planning and motion control of autonomous vehicles. Accurately forecasting crowd trajectories is challenging due to the uncertain nature of human motions in different environments. For training, recent deep learning-based prediction approaches mainly utilize information like trajectory history and interactions between pedestrians, among others. This can limit the prediction performance across various scenarios since the discrepancies between training datasets have not been properly incorporated. To overcome this limitation, this paper proposes a graph transformer structure to improve prediction performance, capturing the differences between the various sites and scenarios contained in the datasets. In particular, a self-attention mechanism and a domain adaption module have been designed to improve the generalization ability of the model. Moreover, an additional metric considering crossdataset sequences is introduced for training and performance evaluation purposes. The proposed framework is validated and compared against existing methods using popular public datasets, i.e., ETH and UCY. Experimental results demonstrate the improved performance of our proposed scheme. © 2024, CC BY.

关键词： Trajectories

Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Zhiyu Han, Zhi Tang, Yandong Zhao, Xi-Le Wang, Yao State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China University of Chinese Academy of Sciences Beijing100049 China University of Electronic Science and Technology of China Chengdu610051 China Center for Intelligent Decision-making and Machine Learning School of Management Xi’an Jiaotong University Xi’an710049 China

This paper considers the problem of recovering a tensor with an underlying low-tubal-rank structure from a small number of corrupted linear measurements. Traditional approaches tackling such a problem require the computation of tensor Singular Value Decomposition (t-SVD), which is a computationally intensive process, rendering them impractical for dealing with large-scale tensors. Aiming to address this challenge, we propose an efficient and effective low-tubal-rank tensor recovery method based on a factorization procedure akin to the Burer-Monteiro (BM) method. Precisely, our fundamental approach involves decomposing a large tensor into two smaller factor tensors, followed by solving the problem through factorized gradient descent (FGD). This strategy eliminates the need for t-SVD computation, thereby reducing computational costs and storage requirements. We provide rigorous theoretical analysis to ensure the convergence of FGD under both noise-free and noisy situations. Additionally, it is worth noting that our method does not require the precise estimation of the tensor tubal-rank. Even in cases where the tubal-rank is slightly overestimated, our approach continues to demonstrate robust performance. A series of experiments have been carried out to demonstrate that, as compared to other popular ones, our approach exhibits superior performance in multiple scenarios, in terms of the faster computational speed and the smaller convergence error. Copyright © 2024, The Authors. All rights reserved.

关键词： Singular value decomposition

Changing functional connectivity during solving cognitive tasks: fNIRS study

学校读者我要写书评

暂无评论

Changing functional connectivity during solving cognitive ta...

Saratov Fall Meeting 2021: Computational Biophysics and Nanobiophotonics

作者： Badarin, A.A. Antipov, V.M. Grubov, V.V. Kurkin, S.A. Neuroscience and Cognivite Technology Laboratory Center for Technologies in Robotics and Mechatronics Components Innopolis University Universitetskaya Str. 1 Innopolis 420500 Russia Center for Neurotechnology and Machine Learning Immanuel Kant Baltic Federal University A. Nevskogo ul. 14 Kaliningrad236016 Russia Department of Theoretical Cybernetics Saint Petersburg State University University Embankment 7/9 Saint Petersburg199034 Russia

ISBN: (数字)9781510653702

ISBN: (纸本)9781510653696

In this paper, we present an analysis of the dynamics of functional connectivity of the cerebral cortical network using near-infrared spectroscopy during human solutions to simple cognitive tasks. A task-based on the Sternberg paradigm was chosen to provide a cognitive load. We identified statistically significant changes in the communication forces obtained on the basis of the analysis of oxyhemoglobin signals during the experiment. We found that in the course of the experiment, there is a restructuring of the functional network, which is accompanied by a decrease in the average connectivity strength between the cortical areas under study. We showed that there is a correlation between the subjective evaluation of fatigue degree and the characteristics of the identified functional neural network. © 2022 SPIE.

关键词： Near infrared spectroscopy

A Structured Prediction Approach for Robot Imitation learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Duan, Anqing Batzianoulis, Iason Camoriano, Raffaello Rosasco, Lorenzo Pucci, Daniele Billard, Aude Robotics and Machine Intelligence Laboratory The Hong Kong Polytechnic University Hong Kong Learning Algorithms and Systems Laboratory École Polytechnique Fédérale de Lausanne Lausanne Switzerland Visual And Multimodal Applied Learning Laboratory Politecnico di Torino Turin Italy DIBRIS Università degli Studi di Genova Genoa Italy Laboratory for Computational and Statistical Learning IIT@MIT Istituto Italiano di Tecnologia Massachusetts Institute of Technology CambridgeMA United States Center Università di Genova Genoa Italy Dynamic Interaction Control research line Italian Institute of Technology Genoa Italy

We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised learning that enables learning models to operate on output spaces with complex structures. Through the lens of structured prediction, we show how robots can learn to imitate trajectories belonging to not only Euclidean spaces but also Riemannian manifolds. Exploiting ideas from information theory, we propose a class of loss functions based on the f-divergence to measure the information loss between the demonstrated and reproduced probabilistic trajectories. Different types of f-divergence will result in different policies, which we call imitation modes. Furthermore, our approach enables the incorporation of spatial and temporal trajectory modulation, which is necessary for robots to be adaptive to the change in working conditions. We benchmark our algorithm against state-of-the-art methods in terms of trajectory reproduction and adaptation. The quantitative evaluation shows that our approach outperforms other algorithms regarding both accuracy and efficiency. We also report real-world experimental results on learning manifold trajectories in a polishing task with a KUKA LWR robot arm, illustrating the effectiveness of our algorithmic framework. Copyright © 2023, The Authors. All rights reserved.

关键词： Trajectories

Exploration via Planning for Information about the Optimal Trajectory

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Mehta, Viraj Char, Ian Abbate, Joseph Conlin, Rory Boyer, Mark D. Ermon, Stefano Schneider, Jeff Neiswanger, Willie Robotics Institute United States Machine Learning Department Carnegie Mellon University United States Princeton Plasma Physics Laboratory United States Princeton University United States Computer Science Department Stanford University United States

Many potential applications of reinforcement learning (RL) are stymied by the large numbers of samples required to learn an effective policy. This is especially true when applying RL to real-world control tasks, e.g. in the sciences or robotics, where executing a policy in the environment is costly. In popular RL algorithms, agents typically explore either by adding stochasticity to a reward-maximizing policy or by attempting to gather maximal information about environment dynamics without taking the given task into account. In this work, we develop a method that allows us to plan for exploration while taking both the task and the current knowledge about the dynamics into account. The key insight to our approach is to plan an action sequence that maximizes the expected information gain about the optimal trajectory for the task at hand. We demonstrate that our method learns strong policies with 2x fewer samples than strong exploration baselines and 200x fewer samples than model free methods on a diverse set of low-to-medium dimensional control tasks in both the open-loop and closed-loop control settings.1 Copyright © 2022, The Authors. All rights reserved.

关键词： Reinforcement learning

Portable tracker for neurophysiological research of sport shooting

学校读者我要写书评

暂无评论

Portable tracker for neurophysiological research of sport sh...

Saratov Fall Meeting 2021: Computational Biophysics and Nanobiophotonics

作者： Antipov, V.M. Badarin, A.A. Grubov, V.V. Kazantsev, V.B. Hramov, A.E. Neuroscience and Cognivite Technology Laboratory Center for Technologies in Robotics and Mechatronics Components Innopolis University Universitetskaya Str. 1 Innopolis 420500 Russia Laboratory of Advanced Methods for High-Dimensional Data Analysis Lobachevsky State University of Nizhni Novgorod 23 Gagarin ave. Nizhny Novgorod603950 Russia Center for Neurotechnology and Machine Learning Immanuel Kant Baltic Federal University A. Nevskogo ul. 14 Kaliningrad236016 Russia Neurotechnology Deparment Lobachevsky State University of Nizhny Novgorod Nizhny Novgorod603022 Russia

ISBN: (数字)9781510653702

ISBN: (纸本)9781510653696

In this work we present the development process of a wireless portable module. It is developed to record various characteristics during sport shooting, such as automatic detection of the moment of shot and barrel movement during aiming, taking into account the peculiarities of its use in neurophysiological research. We propose an approach allowing to synchronize devices in a wireless local network with high accuracy (synchronization accuracy was 2 ms), as well as a method of logging the recorded data at a sampling rate of up to 2 kHz on an onboard flash drive. © 2022 SPIE.

关键词： Neurophysiology