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

arXiv 2024年

作者： Zhang, Beichen Li, Liang Zha, Zheng-Jun Luo, Jiebo Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Information Science and Technology University of Science and Technology of China Hefei230027 China The Department of Computer Science University of Rochester RochesterNY14627 United States

Active learning (AL) is designed to construct a high-quality labeled dataset by iteratively selecting the most informative samples. Such sampling heavily relies on data representation, while recently pre-training is popular for robust feature learning. However, as pre-training utilizes low-level pretext tasks that lack annotation, directly using pre-trained representation in AL is inadequate for determining the sampling score. To address this problem, we propose a downstream-pretext domain knowledge traceback (DOKT) method that traces the data interactions of downstream knowledge and pre-training guidance for selecting diverse and instructive samples near the decision boundary. DOKT consists of a traceback diversity indicator and a domain-based uncertainty estimator. The diversity indicator constructs two feature spaces based on the pre-training pretext model and the downstream knowledge from annotation, by which it locates the neighbors of unlabeled data from the downstream space in the pretext space to explore the interaction of samples. With this mechanism, DOKT unifies the data relations of low-level and high-level representations to estimate traceback diversity. Next, in the uncertainty estimator, domain mixing is designed to enforce perceptual perturbing to unlabeled samples with similar visual patches in the pretext space. Then the divergence of perturbed samples is measured to estimate the domain uncertainty. As a result, DOKT selects the most diverse and important samples based on these two modules. The experiments conducted on ten datasets show that our model outperforms other state-of-the-art methods and generalizes well to various application scenarios such as semantic segmentation and image captioning. Copyright © 2024, The Authors. All rights reserved.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

Direct Contrastive Learning for Incomplete Multi-view Clustering

Direct Contrastive Learning for Incomplete Multi-view Cluste...

引用

Chinese Control and Decision Conference, CCDC

作者： Kaiwu Zhang Yaoying Wang Shengxia Gao Shiqiang Du Xiangzhen He Key Laboratory of Linguistic and Cultural Computing of Ministry of Education Northwest Minzu University Lanzhou China Chinese National Information Technology Research Institute Northwest Minzu University Lanzhou China College of Mathematics and Computer Science Northwest Minzu University Lanzhou China Key Laboratory of Minzu Languages and Cultures Intelligent Information Processing Gansu Province Northwest Minzu University Lanzhou China

ISBN: (数字)9798350387780

ISBN: (纸本)9798350387797

Incomplete multi-view clustering (IMVC) is a emerging research topic. Although several attempts to solve IMVC have been proposed, they suffered from the following problems: (1) Most existing methods usually solve the dimensional collapse problem by adding additional projection heads, whereby the latent features are only effective in low-dimensional subspaces. However this approach will increase the complexity of the model. (2) Most existing methods typically use consistent learning and reconstruction learning on the same feature, which can result in irrelevant private information affecting the learning of the common representation. In this paper, a novel incomplete multi-view clustering framework based on direct contrastive learning is proposed to solve the above problems. Specifically, our method prevents dimensionality collapse without adding additional projection heads by utilizing sub-vectors of learned feature vectors for consistency learning. Furthermore, this framework reduces the adverse effects of inconsistent and useless private information by performing reconstruction loss and contrastive loss on the feature vector and its sub-vectors respectively. To handle incomplete data, a cross-view prediction mechanism is adopted to recover missing information. Extensive experimental results show the effectiveness of the proposed method and obtain significant performance improvements on public datasets.

关键词： Contrastive learning Vectors Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A news image captioning approach based on multimodal pointer-generator network

A news image captioning approach based on multimodal pointer...

引用

作者： Chen, Jingqiang Zhuge, Hai School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science and Network Engineering Guangzhou University Guangzhou China Department of Computer Science School of Engineering and Applied Science Aston University Birmingham United Kingdom Key Laboratory of Intelligent Information Processing Institute of Computing Technology University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing China

News image captioning aims to generate captions or descriptions for news images automatically, serving as draft captions for creating news image captions manually. News image captions are different from generic captions as news image captions contain more detailed information such as entity names and events. Therefore, both images on news and the accompanying text are the source of generating caption of news image. Pointer-generator network is a neural method defined for text summarization. This article proposes the Multimodal pointer-generation network by incorporating visual information into the original network for news image captioning. The multimodal attention mechanism is proposed by splitting attention into visual attention paid to the image and textual attention paid to the text. The multimodal pointer mechanism is proposed by using both textual attention and visual attention to compute pointer distributions, where visual attention is first transformed into textual attention via the word-image relationships. The multimodal coverage mechanism is defined to reduce repetitions of attentions or repetitions of pointer distributions. Experiments on the DailyMail test dataset and the out-of-domain BBC test dataset show that the proposed model outperforms the original pointer-generator network, the generic image captioning method, the extractive news image captioning method, and the LDA-based method according BLEU, METEOR, and ROUGL-L evaluations. Experiments also show that the proposed multimodal coverage mechanisms can improve the model, and that transforming visual attention to pointer distributions can improve the model. © 2020 John Wiley & Sons, Ltd.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, Xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

An Innovative Control Approach for Cyber-Physical Transportation Systems: The Case of Monte-Carlo Workflow Computations

An Innovative Control Approach for Cyber-Physical Transporta...

引用

Euromicro Conference on Parallel, Distributed and Network-Based processing

作者： Vladislav Kashansky Sara Agha Hossein Kashani Javier Garcia-Blas Fabrizio Marozzo Hai Zhuge Xiaoping Sun Research Laboratory Eteronix GmbH Vienna Austria Institute of Production and Logistics Management Business School Johannes Kepler Universität Linz Austria ARCOS Group Universidad Carlos III de Madrid Leganes Spain DIMES Department University of Calabria Rende Italy Key Laboratory of Intelligent Information Processing Institute of Computing Technology (ICTCAS) Beijing China

Contemporarily, in light of the intelligent transportation systems (ITS) sector, the tendency can be observed that the solution of the multi-objective cyber-physical optimization problems with imperfect information takes an increasingly weighted role. In the present scientific work, the authors want to take these developments into account by introducing an innovative cyber-physical architectural design and corresponding the two-stage heuristic computing approach. It is utilized in synergy with the MCSA 1 1 Multi-tier Cyber-physical System Architecture and DCEx architectural principles for the workflow scheduling of Monte-Carlo simulation, which is based on the intelligent and sustainable route-order dispatching process model. Factors such as emissions, transport costs, risks, and the individual weighting of orders are reflected in the model. In particular, the authors define a stochastic ILP-based 2 2 Integer Linear Programming monte-carlo workflow model. They further propose two-stage scheduling heuristic with 6-HEFT DAG relaxation as first stage and apply state-of-the-art techniques as a part of SCIP framework to solve 2nd 1–0 ILP-based stage; evaluate the performance of the scheduling approach. The authors obtain preliminary results of the second stage behavior using a realistic heterogeneous computing scenario and corresponding constraint structures within MACS simulator engine 3 3 Modular Architecture for Complex computing Systems Analysis. The results from the experiments illustrate moderate complexity of the approach. Scalability of the model looks promising for the applicability in various industry-related scenarios and corresponding computing environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Facial Landmark Detector by Knowledge Distillation

Efficient Facial Landmark Detector by Knowledge Distillation

引用

International Conference on Automatic Face and Gesture Recognition

作者： Yuyang Sha Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Beijing CAS China

ISBN: (纸本)9781665431774

Facial landmark detection aims to locate some predefined points on human face images, which is the basis of many facial analysis tasks and applications. Compared with traditional methods, facial landmark detector based on deep learning has made significant progress in accuracy and efficiency. However, the model parameters and computational cost have not received enough attention, leading to the algorithm facing many challenges in practical applications. In this paper, we propose a novel method named efficient facial landmark detector (EFLD), which significantly compresses the model size and computational cost while achieving superior performance compared with state-of-the-art frameworks. We introduce a knowledge distillation framework suitable for facial landmark detection, which can transfer geometric information from the pre-trained teacher model to the lightweight student model. In addition, we integrate adversarial learning into the knowledge distillation framework to guide the student model to imitate the heatmap distribution generated by the teacher model. Extensive experiments demonstrate the superior performance of our approach against state-of-the-art methods.

关键词： Knowledge engineering Heating systems Computational modeling Face recognition Neural networks Detectors Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of PM-BDF2 method for quasiperiodic parabolic equations

arXiv

引用

arXiv 2024年

作者： Jiang, Kai Li, Meng Zhang, Juan Zhang, Lei Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Department of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China

Numerically solving parabolic equations with quasiperiodic coefficients is a significant challenge due to the potential formation of space-filling quasiperiodic structures that lack translational symmetry or decay. In this paper, we introduce a highly accurate numerical method for solving time-dependent quasiperiodic parabolic equations. We discretize the spatial variables using the projection method (PM) and the time variable with the second-order backward differentiation formula (BDF2). We provide a complexity analysis for the resulting PM-BDF2 method. Furthermore, we conduct a detailed convergence analysis, demonstrating that the proposed method exhibits spectral accuracy in space and second-order accuracy in time. Numerical results in both one and two dimensions validate these convergence results, highlighting the PMBDF2 method as a highly efficient algorithm for addressing quasiperiodic parabolic equations. Copyright © 2024, The Authors. All rights reserved.

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

PROJECTION METHOD FOR QUASIPERIODIC ELLIPTIC EQUATIONS AND APPLICATION TO QUASIPERIODIC HOMOGENIZATION

arXiv

引用

arXiv 2024年

作者： Jiang, Kai Li, Meng Zhang, Juan Zhang, Lei Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China

In this study, we address the challenge of solving elliptic equations with quasiperiodic coefficients. To achieve accurate and efficient computation, we introduce the projection method, which enables the embedding of quasiperiodic systems into higher-dimensional periodic systems. To enhance the computational efficiency, we propose a compressed storage strategy for the stiffness matrix by its multi-level block circulant structure, significantly reducing memory requirements. Furthermore, we design a diagonal preconditioner to efficiently solve the resulting high-dimensional linear system by reducing the condition number of the stiffness matrix. These techniques collectively contribute to the computational effectiveness of our proposed approach. Convergence analysis shows the spectral accuracy of the proposed method. We demonstrate the effectiveness and accuracy of our approach through a series of numerical examples. Moreover, we apply our method to achieve a highly accurate computation of the homogenized coefficients for a quasiperiodic multiscale elliptic *** Codes 65D05, 65D15, 65F08, 35B15, 35B27 Copyright © 2024, The Authors. All rights reserved.

关键词： Stiffness matrix

来源：评论

学校读者我要写书评

暂无评论

DAMPER: A Dual-Stage Medical Report Generation Framework with Coarse-Grained MeSH Alignment and Fine-Grained Hypergraph Matching

arXiv

引用

arXiv 2024年

作者： Huang, Xiaofei Chen, Wenting Liu, Jie Lu, Qisheng Luo, Xiaoling Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Medical report generation is crucial for clinical diagnosis and patient management, summarizing diagnoses and recommendations based on medical imaging. However, existing work often overlook the clinical pipeline involved in report writing, where physicians typically conduct an initial quick review followed by a detailed examination. Moreover, current alignment methods may lead to misaligned relationships. To address these issues, we propose DAMPER, a dual-stage framework for medical report generation that mimics the clinical pipeline of report writing in two stages. In the first stage, a MeSH-Guided Coarse-Grained Alignment (MCG) stage that aligns chest X-ray (CXR) image features with medical subject headings (MeSH) features to generate a rough keyphrase representation of the overall impression. In the second stage, a Hypergraph-Enhanced Fine-Grained Alignment (HFG) stage that constructs hypergraphs for image patches and report annotations, modeling high-order relationships within each modality and performing hypergraph matching to capture semantic correlations between image regions and textual phrases. Finally,the coarse-grained visual features, generated MeSH representations, and visual hypergraph features are fed into a report decoder to produce the final medical report. Extensive experiments on public datasets demonstrate the effectiveness of DAMPER in generating comprehensive and accurate medical reports, outperforming state-of-the-art methods across various evaluation metrics. Copyright © 2024, The Authors. All rights reserved.

关键词： Coarse-grained modeling

来源：评论

学校读者我要写书评

暂无评论

Rephrasing the Reference for Non-Autoregressive Machine Translation

arXiv

引用

arXiv 2022年

作者： Shao, Chenze Zhang, Jinchao Zhou, Jie Feng, Yang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Pattern Recognition Center WeChat AI Tencent Inc China

Non-autoregressive neural machine translation (NAT) models suffer from the multi-modality problem that there may exist multiple possible translations of a source sentence, so the reference sentence may be inappropriate for the training when the NAT output is closer to other translations. In response to this problem, we introduce a rephraser to provide a better training target for NAT by rephrasing the reference sentence according to the NAT output. As we train NAT based on the rephraser output rather than the reference sentence, the rephraser output should fit well with the NAT output and not deviate too far from the reference, which can be quantified as reward functions and optimized by reinforcement learning. Experiments on major WMT benchmarks and NAT baselines show that our approach consistently improves the translation quality of NAT. Specifically, our best variant achieves comparable performance to the autoregressive Transformer, while being 14.7 times more efficient in inference. Copyright © 2022, The Authors. All rights reserved.

关键词： Neural machine translation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：