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

ViGT: proposal-free video grounding with a learnable token in the transformer

Science China(Information Sciences) 2023年第10期66卷 196-212页

作者： Kun LI Dan GUO Meng WANG School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Institute of Artificial Intelligence Hefei Comprehensive National Science Center

The video grounding(VG) task aims to locate the queried action or event in an untrimmed video based on rich linguistic descriptions. Existing proposal-free methods are trapped in the complex interaction between video and query, overemphasizing cross-modal feature fusion and feature correlation for VG. In this paper, we propose a novel boundary regression paradigm that performs regression token learning in a transformer. Particularly, we present a simple but effective proposal-free framework, namely video grounding transformer(ViGT), which predicts the temporal boundary using a learnable regression token rather than multi-modal or cross-modal features. In ViGT, the benefits of a learnable token are manifested as follows.(1) The token is unrelated to the video or the query and avoids data bias toward the original video and query.(2) The token simultaneously performs global context aggregation from video and query ***, we employed a sharing feature encoder to project both video and query into a joint feature space before performing cross-modal co-attention(i.e., video-to-query attention and query-to-video attention) to highlight discriminative features in each modality. Furthermore, we concatenated a learnable regression token [REG] with the video and query features as the input of a vision-language transformer. Finally, we utilized the token [REG] to predict the target moment and visual features to constrain the foreground and background probabilities at each timestamp. The proposed ViGT performed well on three public datasets:ANet-Captions, TACoS, and YouCookⅡ. Extensive ablation studies and qualitative analysis further validated the interpretability of ViGT.

关键词： video grounding temporal sentence grounding boundary regression token learning proposal-free

来源：评论

学校读者我要写书评

暂无评论

A Reduced State Space Generation Method for Concurrent Systems Based on CPN-PR Model

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2328-2342页

作者： Zhong, Wenjie Sun, Tao Zhou, Jian-Tao Wang, Zhuowei Song, Xiaoyu Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot010000 China Guangdong University of Technology School of Computer Science and Technology Guangzhou China Portland State University Department of Electrical and Computer Engineering PortlandOR97207 United States

Colored Petri Nets (CPNs) provide descriptions of the concurrent behaviors for software and hardware. Model checking based on CPNs is an effective method to simulate and verify the concurrent behavior in system design. However, the model checking method traverses the full state space, which suffers from the state space explosion problem. A reduced state space generation method related to the property of concurrent systems is proposed. Specifically, we extend CPNs to define a property-related model (CPN-PR) and give a property-related analysis method whose results can be used to generate the CPN-PR model. A reduced state space generation method is developed based on enabled binding element filtering rules. The stutter trace equivalence between the state spaces of CPN and CPN-PR has been proven by showing that the reduced state space may not change the model checking result. A comparison experiment is conducted to demonstrate the effectiveness of our method. © 1982-2012 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Active Authorization Control of Deep Models Using Channel Pruning 17th

Active Authorization Control of Deep Models Using Channel P...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2022

作者： Wang, Linna Song, Yunfei Zhu, Yujia Xia, Daoxun School of Big Data and Computer Science Guizhou Normal University Guiyang550025 China Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang550025 China

ISBN: (纸本)9789819923847

In recent work, researchers have proposed deep neural network(DNN) model active authorization control protection strategies. Because active authorization strategies can prevent attackers from stealing models in advance, they have become a focus of DNN model copyright protection research. At present, most active authorization methods significantly reduce the accuracy by encrypting the parameters of a DNN model or modifying the structure of a DNN model, to prevent malicious infringers from using the model. The active authorization method of modifying the structure of a DNN model impacts the original task accuracy of the DNN model. Moreover, in active authorization methods that encrypt DNN model parameters, authorized users need to perform many calculations to decrypt the DNN model parameters. Therefore, this paper uses a channel pruning algorithm to control the authorization of the DNN model. In this work, the pruning rate or threshold is used as the secret key of the DNN model, the secret key is used to prune and fine-tune the original DNN model before the DNN model is distributed to authorized users, and the fine-tuned DNN model can restore performance similar to that of the original DNN model. Due to the advantages of the pruning mechanism, the DNN model retains the performance of the original task during the active authorization process, and reducing the number of calculations. We perform our work with the CIFAR-10 and CIFAR-100 datasets, and the experimental results show that we only need to prune a small number of channels in the DNN model to determine whether a user is authorized. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Meta-transfer Learning for Person Re-identification in Aerial Imagery 17th

Meta-transfer Learning for Person Re-identification in Aer...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2022

作者： Xu, Lili Peng, Houfu Wang, Linna Xia, Daoxun School of Big Data and Computer Science Guizhou Normal University Guiyang550025 China Engineering Laboratory for Applied Technology of Big Data in Education Guizhou Normal University Guiyang550025 China

ISBN: (纸本)9789819923847

Person re-identification (Re-ID) aims to retrieve a person of interest across multiple nonoverlapping cameras. In the last few years, the construction of aerial person Re-ID datasets has been appealing because visual surveillance through unmanned aerial vehicle (UAV) platforms has become very valuable in real-world scenarios. However, great differences are exhibited between the pedestrian images captured by ground cameras and those captured by UAVs. Person Re-ID methods based on ground person images have difficulty when performing Re-ID based on aerial person images. In this paper, we first propose a novel meta-transfer learning method for person Re-ID in aerial imagery;this approach trains a generalisable Re-ID model to learn discriminative feature representations for aerial person images. Specifically, a meta-learning strategy is introduced to study a feature extractor, and a transfer learning strategy is introduced to utilise and further improve the acquired meta-knowledge. To overcome the convergence speed and recognition accuracy reductions caused by the presence of difficult categories in the given dataset, we propose a learning strategy based on curriculum sampling that is harmonised with our meta-transfer learning framework. In addition, a new metric formulation of sample similarity is introduced based on Mahalanobis distance to improve the optimisation of the model. Extensive comparative evaluation experiments are conducted on the large-scale aerial Re-ID dataset, and the results obtained show that our method achieves a Rank-1 accuracy of 63.63 % and a mean average precision (mAP) of 38.02 %, demonstrating its potential for completing person Re-ID in aerial images. Ablation studies also validate that each component contributes to improving the performance of the model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Facile synthesis of W-Mo bimetallic oxides with high adsorption properties from secondary resources

引用

Tungsten 2024年第4期6卷 806-820页

作者： Jia-Li Cheng Yang-Si Liu Xiao-Li Xi Zuo-Ren Nie Collaborative Innovation Center of Capital Resource-Recycling Material Technology College of Materials Science and EngineeringBeijing University of TechnologyBeijing100124China National Engineering Laboratory for Industrial Big-Data Application Technology Beijing University of TechnologyBeijing100124China Key Laboratory of Advanced Functional Materials Ministry of EducationBeijing University of TechnologyBeijing100124China

A simple solvothermal method was used to obtain W-Mo bimetallic oxides from W-Mo alloy scrap,and pure metal powders were also used as the raw materials to simulate *** products had a sea urchin-like structure with abundant oxygen vacancies and the products prepared at low temperatures forms a sosoloid resembling orthorhombic W_(0.4)Mo_(0.6)O_(3).The WMo bimetallic oxide prepared at the reaction temperature of 120℃exhibited excellent selective adsorption performance for methylene blue(MB),which the adsorption rate of MB reached 99%in 12 min and the adsorption rate reached 90%after6 adsorption *** the W-Mo molar ratio is 1:3,the maximum adsorption capacity of sample for MB can reach1148 mg·g^(-1).The adsorption process followed the Langmuir and pseudo-second-order models,which is surface-controlled monolayer *** experimental results show the feasibility of preparing W-Mo bimetal oxide products from pure materials and *** process is simple and effective,which offered a potential approach for secondary resource recycling and reusing.

关键词： W-Mo bimetallic oxide Oxygen vacancy Selective adsorption W-Mo alloy scrap Solvothermal

来源：评论

学校读者我要写书评

暂无评论

Representation learning via an integrated autoencoder for unsupervised domain adaptation

引用

Frontiers of Computer Science 2023年第5期17卷 75-87页

作者： Yi ZHU Xindong WU Jipeng QIANG Yunhao YUAN Yun LI School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230601China

The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target *** key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain ***,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain ***,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain *** address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called *** capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature *** higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain *** addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local *** results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.

关键词： unsupervised domain adaptation representation learning marginalized autoencoder convolutional autoen-coder sparse autoencoder

来源：评论

学校读者我要写书评

暂无评论

Resolution-Adaptive Representation Learning via Eliminating Abnormal Features for Cross-Resolution Person Re-Identification 14

Resolution-Adaptive Representation Learning via Eliminating ...

引用

14th International Conference on Information technology in Medicine and education, ITME 2024

作者： Lu, Xing Lai, Fengshan Cao, Zhixiang Xia, Daoxun Guizhou Normal University School of Big Data and Computer Science Guiyang China Guizhou Normal University Key Laboratory of Information and Computing Science Guizhou Province Guiyang China Guizhou Normal University Engineering Laboratory for Applied Technology of Big Data in Education Guiyang China

ISBN: (纸本)9798350356670

Cross-resolution person re-identification(CR-ReID) seeks to overcome the challenge of retrieving and matching specific person images across cameras with varying resolutions. Numerous existing studies utilize established CNNs and ViTs models to resize captured low-resolution (LR) images and align them with high-resolution (HR) image features. However, these methods overlook the potential feature connections between LR and HR images. Consequently, CNNs or ViTs tend to highlight outliers rather than the intended characteristics in LR image attention maps. In this work, we propose the abnormal feature elimination and reconfiguration transformer (ART) network, a novel network architecture, for robust cross-resolution person re-identification tasks. Our proposed method uses a resolution feature discriminator to learn resolution invariant features and outputs feature matrices of images with different resolutions. We utilize output feature matrices to model LR and HR image interactions through cross-resolution landmark agent attention. We aim to mitigate abnormal image features and prioritize the attention on the target person by learning representations from input images of various resolutions. Extensive evaluations on three real-world datasets confirm the excellent results of our approach. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Knowledge Graph for China's Genealogy1

引用

IEEE Transactions on Knowledge and data engineering 2023年第1期35卷 634-646页

作者： Wu, Xindong Jiang, Tingting Zhu, Yi Bu, Chenyang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Anhui Hefei230009 China Hefei University of Technology Research Institute of Big Knowledge Anhui Hefei230009 China Mininglamp Technology Mininglamp Academy of Sciences Beijing100102 China Hefei University of Technology School of Computer Science and Information Engineering Anhui Hefei230009 China Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Anhui Hefei230009 China

Genealogical knowledge graphs depict the relationships of family networks and the development of family histories. They can help researchers to analyze and understand genealogical data, search for genealogical descendant paths, and explore the origins of a family. However, the heterogenous, autonomous, complex, and evolving natures of genealogical data bring challenges to the development of contemporary genealogical knowledge graph models. Applying existing methods to genealogical data may be improper because general knowledge graph models lack in-depth domain knowledge. In this paper, we propose a genealogical knowledge graph model named Huapu-KG that combines HAO intelligence (human intelligence + artificial intelligence + organizational intelligence) to implement the construction and applications of genealogical knowledge graphs. Furthermore, challenges in constructing genealogical knowledge graphs are demonstrated, and experiments conducted on real-world genealogical datasets verify the feasibility and effectiveness of our proposed model. © 1989-2012 IEEE.

关键词： History

来源：评论

学校读者我要写书评

暂无评论

Self-Adaptive Imbalanced Domain Adaptation With Deep Sparse Autoencoder

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第5期4卷 1293-1304页

作者： Zhu, Yi Wu, Xindong Li, Yun Qiang, Jipeng Yuan, Yunhao Yangzhou University School of Information Engineering Yangzhou225012 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education of China Hefei230002 China

Domain adaptation aims to transfer knowledge between different domains to develop an effective hypothesis in the target domain with scarce labeled data, which is an effective method for remedying the problem of labeled data requirement in deep learning. In reality, it is unavoidable that the dataset has a large gap in the number of positive and negative instances across different categories in source and target domains, which is the imbalanced domain adaptation problem. However, since the imbalanced degree always varies greatly in different source- and target-domain datasets, most of the existing imbalanced domain adaptation models fix the imbalanced parameters, which cannot adapt to the change of the proportion between positive and negative instances in different domains. To address this problem, in this article, we propose a self-adaptive imbalanced domain adaptation method via a deep sparse autoencoder, which can adjust the model automatically according to the imbalanced extent for bridging the chasm of domains. More specifically, the self-adaptive imbalanced cross-entropy loss is designed for emphasizing more on minority categories and compensating the bias of training loss automatically. In addition, to alleviate the deficient problem of labeled data, we further propose the unlabeled information incorporating method by minimizing the distribution discrepancy of high-level representation space between the source and target domains. Experiments on several real-world datasets demonstrate the effectiveness of our method compared to other state-of-the-art methods. © 2020 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

Bootstrap-Based Layerwise Refining for Causal Structure Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2708-2722页

作者： Xiang, Guodu Wang, Hao Yu, Kui Guo, Xianjie Cao, Fuyuan Song, Yukun Hefei University of Technology Key Laboratory of Knowledge Engineering with the Big Data of Ministry of Education Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Shanxi University School of Computer and Information Technology Taiyuan030006 China

Learning causal structures from observational data is critical for causal discovery and many machine learning tasks. Traditional constraint-based methods first adopt conditional independence (CI) tests to learn a global skeleton layer by layer and then orient the undirected edges to obtain a causal structure. However, the reliability of these statistical tests largely depends on the quality of data samples. In real-life scenarios, the presence of data noise or limited samples often makes many CI tests unreliable at each layer in the skeleton learning phase, leading to an inaccurate skeleton. As the number of layers increases, the inaccurate skeleton will continue to impair the skeleton construction of subsequent layers. Furthermore, an unreliable skeleton hampers the skeleton orientation procedure, resulting in an unsatisfactory causal structure. In this article, we propose a Bootstrap-based layerwise refining (BLR) algorithm for causal structure learning, which includes two new procedures to solve the above problems. First, BLR utilizes a novel layerwise skeleton refining procedure to construct the global skeleton layer by layer based on the bootstrap sampling. Second, BLR employs a collective skeleton orientation procedure that incorporates scoring techniques to collectively orient the global skeleton. The experimental results show that BLR outperforms the state-of-the-art methods on the benchmark Bayesian Network datasets. © 2020 IEEE.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：