Arrow Research search

Author name cluster

Fu Zhang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

10 papers
1 author row

Possible papers

10

AAAI Conference 2026 Conference Paper

6DAttack: Backdoor Attacks in the 6DoF Pose Estimation

  • Jihui Guo
  • Zongmin Zhang
  • Zhen Sun
  • Yuhao Yang
  • Jinlin Wu
  • Fu Zhang
  • Xinlei He

Recent advances in deep learning have enabled highly accurate six-degree-of-freedom (6DoF) object pose estimation, leading to its widespread use in real-world applications such as robotics, augmented reality, virtual reality, and autonomous systems. However, backdoor attacks pose a major security risk to deep learning models. By injecting malicious triggers into training data, an attacker can cause a model to perform normally on benign inputs but behave incorrectly under specific conditions. While most research on backdoor attacks has focused on 2D vision tasks, their impact on 6DoF pose estimation remains largely unexplored. Furthermore, unlike traditional backdoors that only change the object class, backdoors against 6DoF pose estimation must additionally control continuous pose parameters, such as translation and rotation, making existing 2D backdoor attack methods not directly applicable to this setting. To address this gap, we propose a novel backdoor attack framework (6DAttack) that exposes vulnerabilities in 6DoF pose estimation. 6DAttack uses synthetic and real 3D objects of varying shapes as triggers and assigns target poses to induce controlled erroneous pose outputs while maintaining normal behavior on clean inputs. We evaluated this attack on multiple models (including PVNet, DenseFusion, and PoseDiffusion) and datasets (including LINEMOD, YCB-Video, and CO3D). Experimental results demonstrate that 6DAttack achieves extremely high attack success rates (ASRs) without compromising performance on legitimate tasks. Across various models and objects, the backdoored models achieve up to 100% ADD accuracy on clean data, while also achieving 100% ASR under trigger conditions. The accuracy of controlled erroneous pose output is also extremely high, with triggered samples achieving 97.70% ADD-P. These results demonstrate that the backdoor can be reliably implanted and activated, achieving a high ASR under trigger conditions while maintaining a negligible impact on benign data. Furthermore, we evaluate a representative defense and show that it remains ineffective under 6DAttack. Overall, our findings reveal a potentially serious and previously underexplored threat to modern 6DoF pose estimation models.

AAAI Conference 2026 Conference Paper

A Boundary Token Graph for Zero-Shot Relation Triplet Extraction Involving Discontinuous Entities

  • Kailun Lyu
  • Zehan Li
  • Fu Zhang
  • Jingwei Cheng

Zero-Shot Relation Triplet Extraction (ZSRTE) aims to extract head-tail entity pairs and their corresponding relations from sentences, where the relations available during inference are not seen during training. Existing methods typically assume that entities are continuous; however, in practice, entities can be discontinuous, which poses challenges to these approaches. To address this issue, we are the first to discuss and study the ZSRTE task involving discontinuous entities, and propose an innovative BoG framework, which is based on our proposed Boundary Token Graph structure. This method first predicts and adds edges between boundary tokens of (dis)continuous entities to construct a token graph, and then innovatively transforms the relation triplet extraction task into a process of finding paths in the graph. Additionally, we design a Boundary Token-Aware Prompt for each relation to further enhance the interaction between boundary tokens and relation semantics. Experimental results on four ZSRTE datasets—with or without discontinuous entities—consistently demonstrate that our method outperforms previous approaches, achieving state-of-the-art results.

AAAI Conference 2026 Conference Paper

VCGD: Visual Clue Guided Decoding with Caption Model for Mitigating Hallucination in Multimodal Large Language Models

  • Guoqing Chen
  • Fu Zhang
  • Bingqian Liu
  • Chenglong Lu
  • Jingwei Cheng

Multimodal large language models (MLLMs) demonstrate strong capabilities in multimodal understanding, reasoning, and interaction but still face the fundamental limitation of hallucinations, where they generate erroneous or fabricated information. Most existing research induces hallucinations by manually perturbing visual or instruction inputs, then uses output differences or model-generated descriptions as references to mitigate hallucinations and improve responsevisual consistency. However, these methods are constrained by model capabilities and prone to hallucination propagation. We propose Visual Clue Guided Decoding (VCGD), a novel decoding strategy that introduces an auxiliary Caption Model to generate precise visual clues during decoding for guiding model generation. It further incorporates image confidence constraints to critically suppress hallucination propagation during generation, thereby significantly improving content reliability and visual consistency. Specifically, VCGD leverages high-quality visual descriptions to guide MLLMs in correcting perceptual biases while generating answers. Furthermore, we introduce a Reinforcement Learning-based training paradigm for the Caption Model, in which a Reward Agent provides feedback on the quality of visual clues, further enhancing the accuracy of visual information. Extensive experiments across multiple benchmark datasets and state-of-the-art MLLMs demonstrate that VCGD significantly reduces hallucination rates and improves cross-modal consistency. Our method exhibits strong generalizability and scalability, offering an effective decoding enhancement strategy that can be seamlessly integrated into existing multimodal frameworks.

EAAI Journal 2025 Journal Article

A self-supervised method for learning path-augmented knowledge graph embedding

  • Tong Shen
  • Fu Zhang
  • Jingwei Cheng

Knowledge graphs (KGs) consist of factual triples that describe relations between entities in the real world. Knowledge graph embedding (KGE) aims to map entities and relations into constantly low-dimensional vectors, which is important for lots of downstream tasks (e. g. , KG completion and information retrieval). Current KGE methods primarily rely on explicit structural patterns, neglecting latent contextual semantics behind those structures and resulting in sub-optimal performance. While some methods incorporate additional data (e. g. , textual descriptions), such dependencies limit applicability due to additional data requirements. Furthermore, most KGE models suffer from limited supervision with sparse labeled triples, restricting their capacity to learn comprehensive semantic features. Inspired by the simple but effective self-supervised language model word2vec, one interesting question is: Can KGE be performed as a simple self-supervised language model? To achieve this, we innovatively propose a self-supervised KGE framework that learns entity and relation embeddings by adapting word2vec’s skip-gram objective to path sequences extracted from KGs. Our framework employs separate embedding spaces for entities and relations with an entity-relation mapping mechanism for effective interaction between the two embedding spaces. Further, to enhance the training efficiency, we introduce a markov chain-based negative sampling strategy, which generates semantically meaningful negative samples by preserving the structural contexts along KG paths. Our framework, which is the first attempt to follow the context-based self-supervised idea of language models to conduct KGE tasks, addresses the constraints of label-dependent supervised KGE techniques and obviates the requirement for external information, while simultaneously enabling effective extraction of the implicit contextual semantics inherent in triple structures. Experiments on two widely-used KGE datasets show state-of-the-art performance, demonstrating our framework’s ability to learn semantically rich representations solely from graph structure.

IJCAI Conference 2025 Conference Paper

ARPDL: Adaptive Relational Prior Distribution Loss as an Adapter for Document-Level Relation Extraction

  • Huangming Xu
  • Fu Zhang
  • Jingwei Cheng
  • Xin Li

The goal of document-level relation extraction (DocRE) is to identify relations between entities from multiple sentences. As a multi-label classification task, a common approach is to determine whether there are relations for an entity pair by selecting a multi-label classification threshold, with scores of relations above the threshold predicted as positive and the rest as negative. However, we find that predicting multiple relations for entity pairs causes the decrease of predicted scores in positive classes. This could lead to many positive classes being incorrectly predicted as negative. Additionally, our analysis suggests that fitting the distribution of predicted relations to the prior distribution of relations can help improve prediction performance. However, previous studies have not explored or leveraged the prior distribution of relations. To address these issues and findings, we for the first time propose the idea of incorporating the relational prior distribution into the loss calculation in DocRE tasks. We innovatively propose an Adaptive Relational Prior Distribution Loss (ARPDL), which can adaptively adjust relation prediction scores based on the relational prior distribution. Our designed relational prior distribution component can also be integrated as an adapter into other threshold-based losses to improve prediction performance. Experimental results demonstrate that ARPDL consistently improves the performance of existing DocRE models, achieving new state-of-the-art results. Furthermore, integrating our relational prior distribution adapter into other losses significantly enhances their performance in DocRE tasks, validating the effectiveness and generality of our approach. Code is available at https: //github. com/xhm-code/ARPDL.

EAAI Journal 2025 Journal Article

Industrial device-aided data collection for real-time rail defect detection via a lightweight network

  • Qing Dong
  • Tianxin Han
  • Gang Wu
  • Lina Sun
  • Min Huang
  • Fu Zhang

Rail defect detection is challenging due to the diverse and irregular nature of defects, along with the limited availability of high-quality datasets. Existing methods struggle with effectively capturing multi-scale features for proper feature allocation and preserving crucial details in deep networks, leading to incomplete defect representation and reduced accuracy. To address these limitations, we propose Rail Defect Detection Network (REDNet), a lightweight deep learning model specifically designed for real-time rail defect detection in manufacturing and maintenance applications. We design the Multi-Scale Deep Feature Aggregation (MSDFA) module to enhance semantic consistency modeling and achieve more precise feature fusion. We develop the Adaptive Task Decomposition Head (ATDH) to address dynamic feature allocation, and we introduce the Reversible Column Network (RevCol) as the backbone to enhance feature extraction and ensure information reconstruction. Additionally, we developed a high-quality dataset using specialized equipment to address data scarcity and utilized it for training. REDNet achieved a high mean Average Precision at an Intersection over Union (IoU) threshold of 0. 50 (mAP50) of 94. 1% with exceptional real-time performance at 204. 1 frames per second (FPS), while keeping an efficient design of 5. 70 million parameters and surpassing state-of-the-art (SOTA) methods in accuracy and speed. These features make it suitable for defect detection, facilitating engineering deployment, and improve quality control in rail manufacturing and maintenance. Generalization tests on the public Microsoft Common Objects in Context (MS COCO) dataset yielded a mean Average Precision across IoU thresholds from 0. 50 to 0. 95 (mAP50–95) of 46. 8%, further confirming the effectiveness of REDNet.

EAAI Journal 2025 Journal Article

Mention Distance-aware Interactive Attention with Multi-step Reasoning for document-level relation extraction

  • Fu Zhang
  • Jiapeng Wang
  • Huangming Xu
  • Honglin Wu
  • Jingwei Cheng
  • Weijun Li

Document-level relation extraction (DocRE) is widely used in various natural language processing and artificial intelligence applications, aiming to identify relations between entities in a document that may appear multiple times or span multiple sentences. Previous methods have relied on global document features to generate a unified representation for each entity, which may result in the loss of entity-specific information and fail to capture the nuanced relations between different entity pairs. In this paper, we propose the Mention Distance-aware Interactive Attention with Multi-step Reasoning (MDIAMR) model, which leverages attention mechanisms and graph neural networks to address these challenges. Specifically, we introduce an entity interaction attention module to explicitly model the distance information between mentions and dynamically aggregate all mentions of each entity. This approach highlights the importance of different mentions to the entity, thereby enhancing the entity’s representation. Additionally, we design a multi-step reasoning module based on graph attention networks (GAT), which iteratively updates entity pair representations by considering information from neighboring pairs. We also incorporate a cosine similarity loss function to help the model differentiate between entity pairs that are related or unrelated to the target entity pair. Experimental results demonstrate that our model outperforms competitive baseline models on two publicly available datasets.

KER Journal 2021 Journal Article

A comprehensive overview of RDF for spatial and spatiotemporal data management

  • Fu Zhang
  • Qingzhe Lu
  • Zhenjun Du
  • Xu Chen
  • Chunhong Cao

Abstract Currently, a large amount of spatial and spatiotemporal RDF data has been shared and exchanged on the Internet and various applications. Resource Description Framework (RDF) is widely accepted for representing and processing data in different (including spatiotemporal) application domains. The effective management of spatial and spatiotemporal RDF data are becoming more and more important. A lot of work has been done to study how to represent, query, store, and manage spatial and spatiotemporal RDF data. In order to grasp and learn the main ideas and research results of spatial and spatiotemporal RDF data, in this paper, we provide a comprehensive overview of RDF for spatial and spatiotemporal data management. We summarize spatial and spatiotemporal RDF data management from several essential aspects such as representation, querying, storage, performance assessment, datasets, and management tools. In addition, the direction of future research and some comparisons and analysis are also discussed in depth.

KER Journal 2016 Journal Article

A survey on fuzzy ontologies for the Semantic Web

  • Fu Zhang
  • Jingwei Cheng
  • Zongmin Ma

Abstract Ontology, as a standard (World Wide Web Consortium recommendation) for representing knowledge in the Semantic Web, has become a fundamental and critical component for developing applications in different real-world scenarios. However, it is widely pointed out that classical ontology model is not sufficient to deal with imprecise and vague knowledge strongly characterizing some real-world applications. Thus, a requirement of extending ontologies naturally arises in many practical applications of knowledge-based systems, in particular the Semantic Web. In order to provide the necessary means to handle such vague and imprecise information there are today many proposals for fuzzy extensions to ontologies, and until now the literature on fuzzy ontologies has been flourishing. To investigate fuzzy ontologies and more importantly serve as helping readers grasp the main ideas and results of fuzzy ontologies, and to highlight an ongoing research on fuzzy approaches for knowledge semantic representation based on ontologies, as well as their applications on various domains, in this paper, we provide a comprehensive overview of fuzzy ontologies. In detail, we first introduce fuzzy ontologies from the most common aspects such as representation (including categories, formal definitions, representation languages, and tools of fuzzy ontologies), reasoning (including reasoning techniques and reasoners), and applications (the most relevant applications about fuzzy ontologies). Then, the other important issues on fuzzy ontologies, such as construction, mapping, integration, query, storage, evaluation, extension, and directions for future research, are also discussed in detail. Also, we make some comparisons and analyses in our whole review.

KER Journal 2012 Journal Article

An overview of fuzzy Description Logics for the Semantic Web

  • Z. M. Ma
  • Fu Zhang
  • Hailong Wang
  • Li Yan

Abstract Information imprecision and uncertainty exist in many real world applications, and such information would be retrieved, processed, shared, reused, and aligned in the maximum automatic way possible. As a popular family of formally well-founded and decidable knowledge representation languages, fuzzy Description Logics (fuzzy DLs ), which extend DLs with fuzzy logic, are very well suited to cover for representing and reasoning with imprecision and uncertainty. Thus, a requirement naturally arises in many practical applications of knowledge-based systems, in particular the Semantic Web, because DLs are the logical foundation of the Semantic Web. Currently, there have been lots of fuzzy extensions of DLs with Zadeh's fuzzy logic theory papers published, to investigate fuzzy DLs and more importantly serve as identifying the direction of fuzzy DLs study. In this paper, we aim at providing a comprehensive literature overview of fuzzy DLs, and we focus our attention on fuzzy extensions of DLs based on fuzzy set theory. Other relevant formalisms that are based on approaches like probabilistic theory or non-monotonic logics are covered elsewhere. In detail, we first introduce the existing fuzzy DLs (including the syntax, semantics, knowledge base, and reasoning algorithm) from the origin, development (from weaker to stronger in expressive power), some special techniques, and so on. Then, the other important issues on fuzzy DLs, such as reasoning, querying, applications, and directions for future research, are also discussed in detail. Also, we make a comparison and analysis.

v2026.09.13