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

Investigating EEG-Based Functional Connectivity Patterns for Multimodal Emotion Recognition

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wu, Xun Zheng, Wei-Long Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Qing Yuan Research Institute Shanghai Jiao Tong University 800 Dong Chuan Road Shanghai200240 China Clinical Data Animation Center Department of Neurology Massachusetts General Hospital Harvard Medical School 55 Fruit Street BostonMA United States

Compared with the rich studies on the motor brain-computer interface (BCI), the recently emerging affective BCI presents distinct challenges since the brain functional connectivity networks involving emotion are not well investigated. Previous studies on emotion recognition based on electroencephalography (EEG) signals mainly rely on single-channel-based feature extraction methods. In this paper, we propose a novel emotion-relevant critical subnetwork selection algorithm and investigate three EEG functional connectivity network features: strength, clustering coefficient, and eigenvector centrality. The discrimination ability of the EEG connectivity features in emotion recognition is evaluated on three public emotion EEG datasets: SEED, SEED-V, and DEAP. The strength feature achieves the best classification performance and outperforms the state-of-the-art differential entropy feature based on single-channel analysis for the EEG signals. The experimental results reveal that distinct functional connectivity patterns are exhibited for the five emotions of disgust, fear, sadness, happiness, and neutrality. Furthermore, we construct a multimodal emotion recognition model by combining the functional connectivity features from EEG and the features from eye movements or physiological signals using deep canonical correlation analysis. The classification accuracies of multimodal emotion recognition are 95.08 ± 6.42% on the SEED dataset, 84.51 ± 5.11% on the SEED-V dataset, and 85.34 ± 2.90% and 86.61 ± 3.76% for arousal and valence on the DEAP dataset, respectively. The results demonstrate the complementary representation properties of the EEG functional connectivity network features with eye movement data. In addition, we find that the brain networks constructed with fewer channels, i.e., 18 channels, achieve comparable performance with that of the 62-channel network with respect to multimodal emotion recognition and enable easier setups for BCI systems in real scenarios. Cop

关键词： Electrophysiology

Secure Intelligent Reflecting Surface Aided Integrated Sensing and Communication

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Hua, Meng Wu, Qingqing Chen, Wen Dobre, Octavia A. Swindlehurst, A. Lee The State Key Laboratory of Internet of Things for Smart City University of Macau 999078 China The Department of Electronic Engineering Shanghai Institute of Advanced Communications and Data Sciences Shanghai Jiao Tong University Minhang200240 China The Faculty of Engineering and Applied Science Memorial University St. John’sNLA1B 3X5 Canada The Center for Pervasive Communications and Computing University of California at Irvine IrvineCA92697 United States

In this paper, an intelligent reflecting surface (IRS) is leveraged to enhance the physical layer security of an integrated sensing and communication (ISAC) system in which the IRS is deployed to not only assist the downlink communication for multiple users, but also create a virtual line-of-sight (LoS) link for target sensing. In particular, we consider a challenging scenario where the target may be a suspicious eavesdropper that potentially intercepts the communication-user information transmitted by the base station (BS). To ensure the sensing quality while preventing the eavesdropping, dedicated sensing signals are transmitted by the BS. We investigate the joint design of the phase shifts at the IRS and the communication as well as radar beamformers at the BS to maximize the sensing beampattern gain towards the target, subject to the maximum information leakage to the eavesdropping target and the minimum signal-to-interference-plus-noise ratio (SINR) required by users. Based on the availability of perfect channel state information (CSI) of all involved user links and the accurate target location at the BS, two scenarios are considered and two different optimization algorithms are proposed. For the ideal scenario where the CSI of the user links and the target location are perfectly known at the BS, a penalty-based algorithm is proposed to obtain a high-quality solution. In particular, the beamformers are obtained with a semi-closed-form solution using Lagrange duality and the IRS phase shifts are solved for in closed form by applying the majorization-minimization (MM) method. On the other hand, for the more practical scenario where the CSI is imperfect and the target location is uncertain, a robust algorithm based on the S-procedure and sign-definiteness approaches is proposed. Simulation results demonstrate the effectiveness of the proposed scheme in achieving a trade-off between the communication quality and the sensing quality, and also show the tremendous pot

关键词： Channel state information

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

Deep Domain Adaptation for Pavement Crack Detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Huijun Yang, Chunhua Li, Ao Huang, Sheng Feng, Xin Ruan, Zhimin Ge, Yongxin College of Computer Science Chongqing University Chongqing400044 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Chongqing City Management College Chongqing401331 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing400044 China College of Computer Science And Engineering Chongqing University of Technology Chongqing400054 China Co. Ltd Chongqing400060 China

Deep learning-based pavement cracks detection methods often require large-scale labels with detailed crack location information to learn accurate predictions. In practice, however, crack locations are very difficult to be manually annotated due to various visual patterns of pavement crack. In this paper, we propose a Deep Domain Adaptation-based Crack Detection Network (DDACDN), which learns domain invariant features by taking advantage of the source domain knowledge to predict the multi-category crack location information in the target domain, where only image-level labels are available. Specifically, DDACDN first extracts crack features from both the source and target domain by a two-branch weights-shared backbone network. And in an effort to achieve the cross-domain adaptation, an intermediate domain is constructed by aggregating the three-scale features from the feature space of each domain to adapt the crack features from the source domain to the target domain. Finally, the network involves the knowledge of both domains and is trained to recognize and localize pavement cracks. To facilitate accurate training and validation for domain adaptation, we use two challenging pavement crack datasets CQU-BPDD and RDD2020. Furthermore, we construct a new large-scale Bituminous Pavement Multi-label Disease dataset named CQU-BPMDD, which contains 38994 high-resolution pavement disease images to further evaluate the robustness of our model. Extensive experiments demonstrate that DDACDN outperforms state-of-the-art pavement crack detection methods in predicting the crack location on the target domain. Copyright © 2021, The Authors. All rights reserved.

关键词： Crack detection

Deep learning on image denoising: An overview

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Tian, Chunwei Fei, Lunke Zheng, Wenxian Xu, Yong Zuo, Wangmeng Lin, Chia-Wen Bio-Computing Research Center Harbin Institute of Technology Shenzhen Shenzhen Guangdong518055 China Shenzhen Key Laboratory of Visual Object Detection and Recognition Shenzhen Guangdong518055 China School of Computers Guangdong University of Technology Guangzhou Guangdong510006 China Tsinghua Shenzhen International Graduate School Shenzhen Guangdong518055 China Peng Cheng Laboratory Shenzhen Guangdong518055 China School of Computer Science and Technology Harbin Institute of Technology Harbin Heilongjiang150001 China Department of Electrical Engineering Institute of Communications Engineering National Tsing Hua University Hsinchu Taiwan

Deep learning techniques have obtained much attention in image denoising. However, deep learning methods of different types deal with the noise have enormous differences. Specifically, discriminative learning based on deep learning can well address the Gaussian noise. Optimization model methods based on deep learning have good effect on estimating of the real noise. So far, there are little related researches to summarize different deep learning techniques for image denoising. In this paper, we make such a comparative study of different deep techniques in image denoising. We first classify the (1) deep convolutional neural networks (CNNs) for additive white noisy images, (2) deep CNNs for real noisy images, (3) deep CNNs for blind denoising and (4) deep CNNs for hybrid noisy images, which is the combination of noisy, blurred and low-resolution images. Then, we analyze the motivations and principles of deep learning methods of different types. Next, we compare and verify the state-of-the-art methods on public denoising datasets in terms of quantitative and qualitative analysis. Finally, we point out some potential challenges and directions of future research. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

Adaptive Structure-Constrained Robust Latent Low-Rank Coding for Image Recovery

学校读者我要写书评

暂无评论

Adaptive Structure-Constrained Robust Latent Low-Rank Coding...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Lei Wang Sheng Li Yang Wang Zheng Zhang Zhengjun Zha Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science University of Georgia Athens GA Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information Science and Technology University of Science and Technology of China Hefei China

In this paper, we propose a robust representation learning model called Adaptive Structure-constrained Low-Rank Coding (AS-LRC) for the latent representation of data. To recover the underlying subspaces more accurately, AS-LRC seamlessly integrates an adaptive weighting based block-diagonal structure-constrained low-rank representation and the group sparse salient feature extraction into a unified framework. Specifically, AS-LRC performs the latent decomposition of given data into a low-rank reconstruction by a block-diagonal codes matrix, a group sparse locality-adaptive salient feature part and a sparse error part. To enforce the block-diagonal structures adaptive to different real datasets for the low-rank recovery, AS-LRC clearly computes an auto-weighting matrix based on the locality-adaptive features and multiplies by the low-rank coefficients for direct minimization at the same time. This encourages the codes to be block-diagonal and can avoid the tricky issue of choosing optimal neighborhood size or kernel width for the weight assignment, suffered in most local geometrical structures-preserving low-rank coding methods. In addition, our AS-LRC selects the L2, 1-norm on the projection for extracting group sparse features rather than learning low-rank features by Nuclear-norm regularization, which can make learnt features robust to noise and outliers in samples, and can also make the feature coding process efficient. Extensive visualizations and numerical results demonstrate the effectiveness of our AS-LRC for image representation and recovery.

关键词：

A robust and generalized framework for adversarial graph embedding

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Li, Jianxin Fu, Xingcheng Peng, Hao Wang, Senzhang Zhu, Shijie Sun, Qingyun Yu, Philip S. He, Lifang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100083 China State Key Laboratory of Software Development Environment Beihang University Beijing100083 China School of Computer Science and Engineering Central South University Changsha410083 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States Department of Computer Science and Engineering Lehigh University BethlehemPA18015 United States

Graph embedding is essential for graph mining tasks. With the prevalence of graph data in real-world applications, many methods have been proposed in recent years to learn high quality graph embedding vectors various types of graphs. However, most existing methods usually randomly select the negative samples from the original graph to enhance the training data without considering the noise. In addition, most of these methods only focus on the explicit graph structures and cannot fully capture complex semantics of edges such as various relationships or asymmetry. In order to address these issues, we propose a robust and generalized framework for adversarial graph embedding based on generative adversarial networks. Inspired by generative adversarial network, we propose a robust and generalized framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution, and enables the discriminator and generator to jointly learn each node's robust and generalized representation. Based on this framework, we propose three models to handle three types of graph data and derive the corresponding optimization algorithms, i.e., UG-AGE and DG-AGE for undirected and directed homogeneous graphs, respectively, and HIN-AGE for heterogeneous information networks. Extensive experiments show that our methods consistently and significantly outperform existing state-of-the-art methods across multiple graph mining tasks, including link prediction, node classification, and graph reconstruction. Copyright © 2021, The Authors. All rights reserved.

关键词： Directed graphs

Time-Aware Missing Traffic Flow Prediction for Sensors with Privacy-Preservation

学校读者我要写书评

暂无评论

Time-Aware Missing Traffic Flow Prediction for Sensors with ...

作者： Lianyong Qi Fan Wang Xiaolong Xu Wanchun Dou Xuyun Zhang Mohammad R.Khosravi Xiaokang Zhou School of Computer Science Qufu Normal University School of Computer and Software Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Nanjing University of Information Science and Technology State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Department of Computing Macquarie University Department of Computer Engineering Persian Gulf University Department of Electrical and Electronic Engineering Shiraz University of Technology Faculty of Data Science Shiga University

With the continuous development of Io T, a number of sensors establish on the roadside to monitor traffic conditions in real time. The continuously traffic data generated by these sensors makes traffic management feasible. However, loss of data may occur due to inevitable sensor failure, impeding traffic managers to understand traffic dynamics clearly. In this situation, it is becoming a necessity to predict missing traffic flow accurately for effective traffic management. Furthermore, the traffic sensor data are often distributed and stored by different agencies,which inhibits the multi-party sensor data sharing significantly due to privacy concerns. Therefore, it has become a major obstacle to balance the tradeoff between data sharing and vehicle privacy. In light of these challenges, we propose a privacyaware and accurate missing traffic flow prediction approach based on time-aware Locality-Sensitive Hashing technique. At last, we deploy a set of experiments based on a real traffic dataset. Experimental reports demonstrate the feasibility of our proposal in terms of traffic flow prediction accuracy and efficiency while guaranteeing sensor data privacy.

关键词： Traffic flow prediction Multi-party sensors Privacy Locality-Sensitive Hashing

LMVD: A Large-Scale Multimodal Vlog dataset for Depression Detection in the Wild

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Lang Chen, Kai Zhao, Junnan Wang, Yimeng Pei, Ercheng Chen, Haifeng Jiang, Jiewei Zhang, Shiqing Zhang, Jie Wang, Zhongmin He, Tao Tiwari, Prayag The School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China The Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China The Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China The School of Electronic Engineering Xi’an University of Posts and Telecommunications Xi’an710121 China The College of Electronic Information and Artificial Intelligence Shaanxi University of Science and Technology Xi’an710016 China The Institute of Intelligent Information Processing Taizhou University Zhejiang Taizhou318000 China The School of Education Shenzhen University Shenzhen518060 China The School of Information Technology Halmstad University Halmstad Sweden

Depression can significantly impact many aspects of an individual’s life, including their personal and social functioning, academic and work performance, and overall quality of life. Many researchers within the field of affective computing are adopting deep learning technology to explore potential patterns related to the detection of depression. However, because of subjects’ privacy protection concerns, that data in this area is still scarce, presenting a challenge for the deep discriminative models used in detecting depression. To navigate these obstacles, a large-scale multimodal vlog dataset (LMVD), for depression recognition in the wild is built. In LMVD, which has 1823 samples with 214 hours of the 1475 participants captured from four multimedia platforms (Sina Weibo, Bilibili, Tiktok, and YouTube). A novel architecture termed MDDformer to learn the non-verbal behaviors of individuals is proposed. Extensive validations are performed on the LMVD dataset, demonstrating superior performance for depression detection. We anticipate that the LMVD will contribute a valuable function to the depression detection community. The data and code will released at the link: https://***/helang818/LMVD/. © 2024, CC BY-NC-ND.

关键词： Deep learning