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

5th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2022

作者： Tao, Li Xiaoge, Li Chaodong, Wang Xianliang, Li Shuai, Gao Dan, Han Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Computer Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China Inspur Software Technology Co Ltd Software Development Project Management China Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Communication and Information Engineering Xian University of Posts and Telecommunications Shaanxi Xi'an710121 China

ISBN: (纸本)9781450396899

It is commonly agreed that a recommender system based on knowledge graph (KG) should not only use user-item interactions, but also take side information into account to deal with the problem of data sparsity. However, existing KG-based models present unique challenges that have the shortcoming of cold start and redundant iterations. To address the issue, we propose a Feature Fusion-based Knowledge Graph Attention network (FF-KGAT) for the recommendation. FF-KGAT handles the cold-start problem through introducing user characteristics to fully explore the information of users. Additionally, FF-KGAT introduces the feature fusion graph, which removes slight nodes to obtain fewer iterations. Experimental results show that the proposed model significantly outperforms baseline methods. Particularly, the ndcg is increased by 9.83% and 10.25% on two public datasets, compared with the best performance of existing methods. © 2022 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Shadow Removal from a Single Image Using an Enhanced Generative Adversarial network

Shadow Removal from a Single Image Using an Enhanced Generat...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Jing Zhang Weiwei Kong College of Computer Science Xi’an University of Posts and Telecommunications Xi’an China the Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and Telecommunications Xi’an China

Image shadow removal is challenging due to the diversity of shadows and the dependence on the background of the area covered by shadows. In this paper, we design an enhanced generative adversarial network (EGAN) to handle the shadow removal task. EGAN is a complicated generative adversarial network that may exploit previous info, like shadow masks and lightness estimation, for improving recovery capability. In addition, EGAN can effectively utilize the details of shadow regions and eliminate artifacts. EGAN owns three main advantages. First, EGAN employs stricter rules for discriminators, which can upgrade the instability of traditional GAN. Second, EGAN involves a completely unique enhanced attention module, which may efficiently pick up different types of previous info to accelerate the learning efficiency of image reconstruction. Finally, EGAN is essentially an original cascaded network, that is, DRDU, which is beneficial for efficiently detecting hierarchical features of image recovery. Simulation experiments are conducted to verify the effectiveness of the proposed method on two benchmark datasets including SRD and ISTD, the strengths of our proposed method are indicated over the current representative ones according to subjective performance and objective estimation indexes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network

Dual attention mechanism object tracking algorithm based on ...

引用

2021 International Conference on networking and network Applications, NaNA 2021

作者： Ma, Sugang Zhang, Zixian Zhang, Lei Chen, Yanping Yang, Xiaobao Pu, Lei Hou, Zhiqiang Xi'an University of Posts and Telecommunications School of Computer Science and Technology Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Information and Navigation Air Force Engineering University Shaanxi Xi'an710077 China School of Information Engineering Chang'an University Shaanxi Xi'an710064 China

ISBN: (纸本)9781665441582

In an effort to the problem of insufficient tracking performance of the Fully-convolutional Siamese network (SiamFC) in complex scenarios, a dual attention mechanism object tracking algorithm based on the Fully-convolutional Siamese network is proposed to improve the generalization capability of the tracker by ameliorating the robustness of the template characteristics. Firstly, a global context attention module is appended after the backbone network of SiamFC to ameliorate the power of original feature extraction from two dimensions of spatial and channel. Then, a coordinate attention module is introduced to augment the capability of feature extraction in the channel dimension. Finally, the model of the proposed algorithm is trained on the Got-10k dataset. Five related algorithms are tested on the OTB2015 dataset, the results of experiments manifest that our algorithm outperforms the baseline trackers, the success and precision rate of the proposed algorithm are improved by 3.3% and 6.3%. The average tracking speed is 145FPS, which can demand the requirement of real-time tracking. © 2021 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Disentangled Noisy Correspondence Learning

arXiv

引用

arXiv 2024年

作者： Dang, Zhuohang Luo, Minnan Wang, Jihong Jia, Chengyou Han, Haochen Wan, Herun Dai, Guang Chang, Xiaojun Wang, Jingdong The School of Computer Science and Technology The Ministry of Education Key Laboratory of Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China SGIT AI Lab State Grid Shaanxi Electric Power Company Limited State Grid Corporation of China Shaanxi China The School of Information Science and Technology University of Science and Technology China United Arab Emirates The Baidu Inc China

Cross-modal retrieval is crucial in understanding latent correspondences across modalities. However, existing methods implicitly assume well-matched training data, which is impractical as real-world data inevitably involves imperfect alignments, i.e., noisy correspondences. Although some works explore similarity-based strategies to address such noise, they suffer from sub-optimal similarity predictions influenced by modality-exclusive information (MEI), e.g., background noise in images and abstract definitions in texts. This issue arises as MEI is not shared across modalities, thus aligning it in training can markedly mislead similarity predictions. Moreover, although intuitive, directly applying previous cross-modal disentanglement methods suffers from limited noise tolerance and disentanglement efficacy. Inspired by the robustness of information bottlenecks against noise, we introduce DisNCL, a novel information-theoretic framework for feature Disentanglement in Noisy Correspondence Learning, to adaptively balance the extraction of MII and MEI with certifiable optimal cross-modal disentanglement efficacy. DisNCL then enhances similarity predictions in modality-invariant subspace, thereby greatly boosting similarity-based alleviation strategy for noisy correspondences. Furthermore, DisNCL introduces soft matching targets to model noisy many-to-many relationships inherent in multi-modal input for noise-robust and accurate cross-modal alignment. Extensive experiments confirm DisNCL's efficacy by 2% average recall improvement. Mutual information estimation and visualization results show that DisNCL learns meaningful MII/MEI subspaces, validating our theoretical analyses. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Real-Time Semantic Segmentation Algorithm Based on Tversky Loss Function and Mixed Pooling

Real-Time Semantic Segmentation Algorithm Based on Tversky L...

引用

International Conference on networking and network Applications (NaNA)

作者： Peng Xu Ziyi Zhao Sugang Ma Xi'an Science and Technology Museum Xi'an Shaanxi China School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an Shaanxi China

In recent years, semantic segmentation methods based on deep learning have made remarkable developments. Despite achieving high segmentation accuracy, the performance of real-time segmentation methods cannot satisfy real-world applications. In order to achieve a balance between segmentation accuracy and speed, a real-time semantic segmentation algorithm based on Tversky loss function and mixed pooling is proposed in this paper. A Short-Term Dense Concatenate network (STDC network) is used to construct the encoder, and a mixed pooling module is used for the final part of the encoder, which uses strip pooling and average pooling to enhance the feature representation while expanding the receptive field. Additionally, a Tversky-based loss function is used for the detail guidance module of the backbone network in the encoder, and a joint loss function is used to supervise the whole network's training. We achieved 76.9% mIoU at 110.7 FPS on the Cityscapes dataset, a 2.4% improvement in accuracy over the benchmark algorithm STDCSeg, and 72.2% mIoU at 177.6 FPS on the Camvid dataset, satisfied the requirements of the real-time segmentation task.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive Loose Optimization for Robust Question Answering

arXiv

引用

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Wang, Zewei Kong, Dechen Hu, Min Han, Ting Liu, Jun The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The China Mobile Research Institute China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Question answering methods are well-known for leveraging data bias, such as the language prior in visual question answering and the position bias in machine reading comprehension (extractive question answering). Current debiasing methods often come at the cost of significant in-distribution performance to achieve favorable out-of-distribution generalization ability, while non-debiasing methods sacrifice a considerable amount of out-of-distribution performance in order to obtain high in-distribution performance. Therefore, it is challenging for them to deal with the complicated changing real-world situations. In this paper, we propose a simple yet effective novel loss function with adaptive loose optimization, which seeks to make the best of both worlds for question answering. Our main technical contribution is to reduce the loss adaptively according to the ratio between the previous and the current optimization state on mini-batch training data. This loose optimization can be used to prevent non-debiasing methods from overlearning data bias while enabling debiasing methods to maintain slight bias learning. Experiments on the visual question answering datasets, including VQA v2, VQA-CP v1, VQA-CP v2, GQA-OOD, and the extractive question answering dataset SQuAD demonstrate that our approach enables QA methods to obtain state-of-the-art in- and out-of-distribution performance in most cases. The source code has been released publicly in https://***/reml-group/ALO. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Generating Action-conditioned Prompts for Open-vocabulary Video Action Recognition 24

Generating Action-conditioned Prompts for Open-vocabulary Vi...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Jia, Chengyou Luo, Minnan Chang, Xiaojun Dang, Zhuohang Han, Mingfei Wang, Mengmeng Dai, Guang Dang, Sizhe Wang, Jingdong School of Computer Science and Technology MOEKLINNS Lab Xi'an Jiaotong University Shaanxi Xi'an China University of Science and Technology of China Anhui Hefei China School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China ReLER Lab AAII University of Technology Sydney SydneyNSW Australia Zhejiang University of Technology College of Computer Science and Technology China SGIT AI Lab State Grid Corporation of China Beijing China Baidu Inc Beijing China United Arab Emirates Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China SGIT AI Lab State Grid Corporation of China China School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798400706868

Exploring open-vocabulary video action recognition is a promising venture, which aims to recognize previously unseen actions within any arbitrary set of categories. Existing methods typically adapt pretrained image-text models to the video domain, capitalizing on their inherent strengths in generalization. A common thread among such methods is the augmentation of visual embeddings with temporal information to improve the recognition of seen actions. Yet, they compromise with standard less-informative action descriptions, thus faltering when confronted with novel actions. Drawing inspiration from human cognitive processes, we argue that augmenting text embeddings with human prior knowledge is pivotal for open-vocabulary video action recognition. To realize this, we innovatively blend video models with Large Language Models (LLMs) to devise Action-conditioned Prompts. Specifically, we harness the knowledge in LLMs to produce a set of descriptive sentences that contain distinctive features for identifying given actions. Building upon this foundation, we further introduce a multi-modal action knowledge alignment mechanism to align concepts in video and textual knowledge encapsulated within the prompts. Extensive experiments on various video benchmarks, including zero-shot, few-shot, and base-to-novel generalization settings, demonstrate that our method not only sets new SOTA performance but also possesses excellent interpretability. © 2024 ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Prediction Method Based on MODWT-EMD for Time Series in Wireless Sensor networks 16

A Hybrid Prediction Method Based on MODWT-EMD for Time Serie...

引用

16th IEEE International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2021

作者： Wang, Zhongmin Jia, Jingwen Gao, Cong Chen, Yanping Xia, Hong Xi'an University of Posts and Telecommunications Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an China Xi'an University of Posts and Telecommunications School of Computer Science Technology Xi'an China Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an China

ISBN: (纸本)9781665405539

Time series is the main form of sensor data. Time series prediction is conducive to reduce the energy consumption of sensor nodes and increase the service life. As time cost and computation cost of the existing hybrid prediction methods for time series are not good, this paper proposes a hybrid prediction method based on MODWT-EMD for time series. Firstly, the original time series is decomposed into multiple frequency components by Maximal Overlapping Discrete Wavelet Transform (MODWT). Secondly, the multiple frequency components are decomposed successively by Empirical Mode Decomposition (EMD) to obtain IMF components and residuals. IMFs and residuals contain the feature information of time series. Then, the importance of the extracted feature information is scored and sorted by random forest. We select feature information with a higher score. Finally, the selected feature information is input into Bi-GRU for training. We predicted the original time series by the trained Bi-GRU and obtained the prediction results. The experimental results show that the method proposed in this paper can predict the time series effectively. © 2021 IEEE.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Learnable Convolutional Attention network for Knowledge Graph Completion

SSRN

引用

SSRN 2023年

作者： Shang, Bin Zhao, Yinliang Liu, Jun School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China Shaanxi Province Key Laboratory of Satellite and Terrestrial Network Tech. R&D Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Shaanxi Xi’an710049 China

Recently, graph convolutional networks (GCNs) and graph attention networks (GATs) have been widely used in knowledge graph completion (KGC), which aims to solve the incompleteness of knowledge graphs (KGs). However, GCNs based KGC models tend to stack redundant information when one entity have several noisy neighbors. GATs based KGC models may focus on certain neighbors and lead to weakening of structural information. Furthermore, relations in KGs have their specific semantics and should be considered when aggregating neighbor information (message passing). To address the above limitations, we propose a learnable convolutional attention network for knowledge graph completion named LCA-KGC. LCA-KGC introduces a knowledge graph convolutional attention network by using the convolution operation before the attention mechanism to ensure the structural information acquisition and avoid the redundant information stacking. Furthermore, to complete the autonomous switching of GNNs types and eliminate the necessity of pre-validating the local structure of KGs, LCA-KGC designs a learnable knowledge graph convolutional attention network by comprising three types of GNNs in one learnable formulation. Moreover, a learnable message function is proposed to emphasize relational semantics when aggregating neighbor information. Extensive experiments on standard KG datasets validate the effectiveness of the proposed innovations, and LCA-KGC achieves state-of-the-art (SOTA) performance compared to existing approaches (e.g., compared to SOTA approaches, LCA-KGC improves MRR from 0.360 to 0.372 on FB15k-237 dataset, and Hits@3 from 0.561 to 0.581 on YAGO3-10 dataset). © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haonan Miao Peizheng Zhao Yuqi Sun Fang Nan Xiaolong Zhang Yaqiang Wu Feng Tian School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China School of Advanced Technology Xi’an Jiaotong-Liverpool University Suzhou China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students’ gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods.

关键词： Three-dimensional displays Estimation Focusing Signal processing Acoustics Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：