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

arXiv 2025年

作者： Nawaz, Muhammad Nasir, Basma Zia, Tehseen Hussain, Zawar Moreira, Catarina Data Science Institute University of Technology Sydney Australia COMSATS University Islamabad Pakistan Medical Imaging and Diagnostics Lab National Center of Artificial Intelligence Pakistan Macquarie University Sydney Australia

Precise identification and localization of disease-specific features at the pixel-level are particularly important for early diagnosis, disease progression monitoring, and effective treatment in medical image analysis. However, conventional diagnostic AI systems lack decision transparency and cannot operate well in environments where there is a lack of pixel-level annotations. In this study, we propose a novel Generative Adversarial Networks (GANs)-based framework, TagGAN, which is tailored for weakly-supervised fine-grained disease map generation from purely image-level labeled data. TagGAN generates a pixel-level disease map during domain translation from an abnormal image to a normal representation. Later, this map is subtracted from the input abnormal image to convert it into its normal counterpart while preserving all the critical anatomical details. Our method is first to generate fine-grained disease maps to visualize disease lesions in a weekly supervised setting without requiring pixel-level annotations. This development enhances the interpretability of diagnostic AI by providing precise visualizations of disease-specific regions. It also introduces automated binary mask generation to assist radiologists. Empirical evaluations carried out on the benchmark datasets, CheXpert, TBX11K, and COVID-19, demonstrate the capability of TagGAN to outperform current top models in accurately identifying disease-specific pixels. This outcome highlights the capability of the proposed model to tag medical images, significantly reducing the workload for radiologists by eliminating the need for binary masks during training. Copyright © 2025, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Applicability of the Minimal Dominating Set for Influence Maximisation in Multilayer Networks

arXiv

引用

arXiv 2025年

作者： Czuba, Michal Jia, Mingshan Bródka, Piotr Musial, Katarzyna Department of Artificial Intelligence Wroclaw University of Science and Technology 27 wybrzeze Wyspiańskiego st Wroclaw50-370 Poland Complex Adaptive Systems Lab Data Science Institute School of Computer Science University of Technology Sydney UltimoNSW2007 Australia

The minimal dominating set (MDS) is a well-established concept in network controllability and has been successfully applied in various domains, including sensor placement, network resilience, and epidemic containment. In this study, we adapt the local-improvement MDS routine and explore its potential for enhancing seed selection for influence maximisation in multilayer networks (MLN). We employ the Linear Threshold Model (LTM), which offers an intuitive representation of influence spread or opinion dynamics by accounting for peer influence accumulation. To ensure interpretability, we utilise rank-refining seed selection methods, with the results further filtered with MDS. Our findings reveal that incorporating MDS into the seed selection process improves spread only within a specific range of situations. Notably, the improvement is observed for larger seed set budgets, lower activation thresholds, and when an"AND" strategy is used to aggregate influence across network layers. This scenario reflects situations where an individual does not require the majority of their acquaintances to hold a target opinion, but must be influenced across all social circles. Copyright © 2025, The Authors. All rights reserved.

关键词： Multilayers

来源：评论

学校读者我要写书评

暂无评论

Rethinking attention mechanism for enhanced pedestrian attribute recognition

引用

Neurocomputing 2025年 639卷

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350108 China Engineering Research Center of BigData Intelligence Ministry of Education Fujian Fuzhou350108 China Australian Artificial Intelligence Institute University of Technology Sydney SydneyNSW2007 Australia Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou University Fujian Fuzhou350108 China School of Electrical and Data Engineering University of Technology Sydney SydneyNSW2007 Australia

Pedestrian Attribute Recognition (PAR) plays a crucial role in various computer vision applications, demanding precise and reliable identification of attributes from pedestrian images. Traditional PAR methods, though effective in leveraging attention mechanisms, often suffer from the lack of direct supervision on attention, leading to potential overfitting and misallocation. This paper introduces a novel and model-agnostic approach, Attention-Aware Regularization (AAR), which rethinks the attention mechanism by integrating causal reasoning to provide direct supervision of attention maps. AAR employs perturbation techniques and a unique optimization objective to assess and refine attention quality, encouraging the model to prioritize attribute-specific regions. Our method demonstrates significant improvement in PAR performance by mitigating the effects of incorrect attention and fostering a more effective attention mechanism. Experiments on standard datasets showcase the superiority of our approach over existing methods, setting a new benchmark for attention-driven PAR models. © 2025 The Authors

关键词： Perturbation techniques

来源：评论

学校读者我要写书评

暂无评论

High-order diversity feature learning for pedestrian attribute recognition

引用

Neural Networks 2025年 188卷 107463页

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou China Australian Artificial Intelligence Institute University of Technology Sydney NSW Australia Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou University Fujian Fuzhou China School of Electrical and Data Engineering University of Technology Sydney NSW Australia

Pedestrian attribute recognition (PAR) involves accurately identifying multiple attributes present in pedestrian images. There are two main approaches for PAR: part-based method and attention-based method. The former relies on existing segmentation or region detection methods to localize body parts and learn corresponding attribute-specific feature from the corresponding regions, where the performance heavily depends on the accuracy of body region localization. The latter adopts the embedded attention modules or transformer attention to exploit detailed feature. However, it can focus on certain body regions but often provide coarse attention, failing to capture fine-grained details, the learned feature may also be interfered with by irrelevant information. Meanwhile, these methods overlook the global contextual information. This work argues for replacing coarse attention with detailed attention and integrating it with global contextual feature from ViT to jointly represent attribute-specific regions. To tackle this issue, we propose a High-order Diversity Feature Learning (HDFL) method for PAR based on ViT. We utilize a polynomial predictor to design an Attribute-specific Detailed Feature Exploration (ADFE) module, which can construct the high-order statistics and gain more fine-grained feature. Our ADFE module is a parameter-friendly method that provides flexibility in deciding its utilization during the inference phase. A Soft-redundancy Perception Loss (SPLoss) is proposed to adaptively measure the redundancy between feature of different orders, which can promote diverse characterization of features. Experiments on several PAR datasets show that our method achieves a new state-of-the-art (SOTA) performance. On the most challenging PA100K dataset, our method outperforms previous SOTA by 1.69% and achieves the highest mA of 84.92%. © 2025 The Authors

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Empowering LLMs with Logical Reasoning: A Comprehensive Survey

arXiv

引用

arXiv 2025年

作者： Cheng, Fengxiang Li, Haoxuan Liu, Fenrong van Rooij, Robert Zhang, Kun Lin, Zhouchen Institute for Logic Language and Computation University of Amsterdam Netherlands Center for Data Science Peking University China Machine Learning Department MBZUAI Department of Philosophy Tsinghua University China Department of Philosophy CMU United States Institute for Artificial Intelligence Peking University China Peng Cheng Laboratory China National Key Lab of General AI School of Intelligence Science and Technology Peking University China

Large language models (LLMs) have achieved remarkable successes on various natural language tasks. However, recent studies have found that there are still significant challenges to the logical reasoning abilities of LLMs. This paper summarizes and categorizes the main challenges into two aspects: (1) Logical question answering, LLMs often fail to generate the correct answer within complex logical problem which requires sophisticated deductive, inductive or abductive reasoning given a collection of premises and constrains. (2) Logical consistency, LLMs are prone to producing responses contradicting themselves across different questions. For example, a state-of-the-art Macaw question-answering LLM answers Yes to both questions Is a magpie a bird? and Does a bird have wings? but answers No to Does a magpie have wings?. To facilitate this research direction, we comprehensively investigate the most cutting-edge methods and propose detailed taxonomies of these methods. Specifically, to accurately answer complex logic questions, previous methods can be categorized based on reliance on external solvers, prompts, pretraining, and fine-tuning. To avoid logical contradictions, we discuss concepts and solutions of various logical consistencies, including implication, negation, transitivity, factuality consistency, and their composites. In addition, we review commonly used benchmark datasets and evaluation metrics, and discuss promising research directions, such as extensions to modal logic to account for uncertainty, and efficient algorithms satisfying multiple logical consistencies simultaneously. © 2025, CC BY.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Cross-Domain Animal Pose Estimation with Skeleton Anomaly-Aware Learning

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Han, Le Chen, Kaixuan Zhao, Lei Jiang, Yangbo Wang, Pengfei Zheng, Nenggan Zhejiang Hangzhou310007 China Zhejiang University College of Computer Science and Technology Zhejiang Hangzhou310007 China Zhejiang University State Key Laboratory of Blockchain and Data Security Zhejiang Hangzhou310007 China Institute of Blockchain and Data Security. China Zhejiang University School of Software Technology Ningbo China Zhejiang University State Key Lab of Brain-Machine Intelligence Hangzhou310007 China Zhejiang Provincial Government ZJU Collaborative Innovation Center for Artificial Intelligence by MOE Hangzhou310007 China Bengbu University School of Computer and Information Engineering Bengbu233030 China

Animal pose estimation is often constrained by the scarcity of annotations and the diversity of scenarios and species. The pseudo-label generation based unsupervised domain adaptation paradigm, which discriminates the predicted keypoints of unlabeled data based on the skeleton position consistency, has demonstrated effectiveness for such problems. However, existing methods generate pseudo-labels with massive false positives, because they cannot effectively distinguish sample pairs with the same errors. In this study, we propose a cross-domain animal pose estimation model from a novel perspective of skeleton anomaly learning. We construct a graph contrastive learning mechanism to acquire the skeleton anomaly-aware knowledge, which enables the generation of accurate pseudo-labels for target domain and imposes graph constraint on unlabeled data. And a skeleton anomaly-feedback based domain adaptation framework is designed to facilitate implicit alignment of object-specific features and joint training of cross-domain. Besides, we propose a novel rat pose dataset named UDARP-9.4K to address the gap of small-sized animal pose datasets encompassing diverse experimental scenarios. The related datasets are reviewed and evaluated in detail. Extensive experiments are conducted on UDARP-9.4K and two public datasets to demonstrate the superiority of the proposed model in cross-scenarios and cross-species animal pose estimation tasks. Further analysis reveals the effectiveness of the proposed model for skeleton structure feature learning. The UDARP-9.4K dataset is available here. © 1991-2012 IEEE.

关键词： Invertebrates

来源：评论

学校读者我要写书评

暂无评论

Deep learning models for enhanced in-field maize leaf disease diagnosis

Machine Learning with Applications

引用

machine Learning with Applications 2025年 20卷

作者： Joyce Nakatumba-Nabende Sudi Murindanyi Department of Computer Science College of Computing and Information Sciences Makerere University Uganda Makerere Center for Artificial Intelligence and Data Science Makerere University Uganda Marconi Machine Learning Lab College of Engineering Design Art and Technology Makerere University Uganda

Maize leaf diseases significantly threaten crop yields, and there is need for accurate, and accessible diagnostic tools. This research addresses this need by developing and evaluating deep learning (DL) and machine learning (ML) models for in-field classification and detection of four critical maize diseases: Maize Leaf Blight, Maize Lethal Necrosis, Maize Streak Virus, and Fall Armyworm damage. Utilizing field imagery captured via digital cameras and smartphones across Uganda, Tanzania, Ghana, and Namibia, we developed and compared custom Convolutional Neural Networks (CNNs), transfer learning (MobileNetV2, InceptionResNetV2), Vision Transformers (ViT), and classical ML models. For detection, a transformer-enhanced YOLOv10 architecture was implemented. Explainable AI (XAI) techniques (Grad-CAM, LIME) were incorporated to ensure model transparency. MobileNetV2 achieved the highest classification accuracy (97%), while the enhanced YOLOv10 reached a mean Average Precision (mAP) of 0.995 for object detection. The best models were integrated into a mobile application deployed on edge devices for real-time diagnosis by smallholder farmers in Uganda, with performance validated through field tests. This study demonstrates a powerful, interpretable, and field-deployable solution combining advanced DL, transformers, and XAI for effective maize health management.

关键词： Maize Disease classification Disease detection Deep learning models Explainable AI

来源：评论

学校读者我要写书评

暂无评论

Can Language Models Serve as Temporal Knowledge Bases?

Can Language Models Serve as Temporal Knowledge Bases?

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Ruilin Zhao, Feng Xu, Guandong Zhang, Sixiao Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1 and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) the capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

RETIA: Relation-Entity Twin-Interact Aggregation for Temporal Knowledge Graph Extrapolation 39

RETIA: Relation-Entity Twin-Interact Aggregation for Tempora...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Liu, Kangzheng Zhao, Feng Xu, Guandong Wang, Xianzhi Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China University of Technology Sydney Data Science and Machine Intelligence Lab Sydney Australia

ISBN: (纸本)9798350322279

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations;therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands"problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA. © 2023 IEEE.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Efficient image representation for object recognition via pivots selection

引用

Frontiers of Computer science 2015年第3期9卷 383-391页

作者： Bojun XIE Yi LIU HuiZHANG Jian YU Beijing Key Lab of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing 100044 China Key Lab of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071000 China

Patch-level features are essential for achieving good performance in computer vision tasks. Besides well- known pre-defined patch-level descriptors such as scalein- variant feature transform （SIFT） and histogram of oriented gradient （HOG）, the kernel descriptor （KD） method [1] of- fers a new way to ＂grow-up＂ features from a match-kernel defined over image patch pairs using kernel principal compo- nent analysis （KPCA） and yields impressive results. In this paper, we present efficient kernel descriptor （EKD） and efficient hierarchical kernel descriptor （EHKD）, which are built upon incomplete Cholesky decomposition. EKD au- tomatically selects a small number of pivot features for gener- ating patch-level features to achieve better computational effi- ciency. EHKD recursively applies EKD to form image-level features layer-by-layer. Perhaps due to parsimony, we find surprisingly that the EKD and EHKD approaches achieved competitive results on several public datasets compared with other state-of-the-art methods, at an improved efficiency over KD.

关键词： efficient kernel descriptor efficient hierarchi-cal kernel descriptor incomplete Cholesky decomposition,patch-level features image-level features

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：