XTXian Tang

Xian Tang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Xian Tang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Deep Learning-Based Automatic Defect Detection Method for Sewer Pipelines

    by Dongming Shen, Xiang Liu, Yanfeng Shang, Xian Tang

    To address the issues of low automation, reliance on manual screening by professionals, and long detection cycles in current urban drainage pipeline defect detection, this study proposes an improved object detection algorithm called EFE-SSD (enhanced feature extraction SSD), based on the SSD (Single Shot MultiBox Detector) network. Firstly, the RFB_s module is added to the SSD backbone network to enhance its feature extraction capabilities. Additionally, multiple scale features are fused to improve the detection performance of small target defects to some extent. Then, the improved ECA attention mechanism is used to adjust the channel weights of the output layer, suppressing irrelevant features. Finally, the Focal Loss is employed to replace the cross-entropy loss in the SSD network, effectively addressing the issue of imbalanced positive and negative samples during training. This increases the weight of difficult-to-classify samples during network training, further improving the detection accuracy of the network. Experimental results show that EFE-SSD achieves a detection mAP of 92.2% for four types of pipeline defects: Settled deposits, Displaced joints, Deformations, and Roots. Compared to the SSD algorithm, the model’s mAP was increased by 2.26 percentage points—ensuring the accuracy of pipeline defect detection.


  • Open Access

    One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs

    by Xian Tang, Junfeng Zhou, Yaxian Qiu, Xiang Liu, Yunyu Shi, Jingwen Zhao

    Given a directed acyclic graph (DAG) G, G’s transitive reduction (TR) Gtr is the unique DAG satisfying thatGtr has theminimumnumber of edges and has the same transitive closure (TC) asG.TRcomputation has been extensively studied during the past decades andwas used inmany applications, where the main problem is howto computeTRefficiently for large graphs.However, existing approaches have either large space complexity or higher time complexity, whichmakes them cannot computeTRefficiently on large dense graphs. We propose a novel approach forTRcomputation, which takes every single edge as the basic processing unit, and utilizes existing reachability algorithms to test whether it is redundant or not. In thisway,weavoid the costly graph traversal operation of existing approaches.We identify the performance bottleneck and propose a set of heuristics to sort edges, such that to reduce the average processing cost of each edge.We showby experimental results that our approachworksmuchbetter than all the existing approaches, and can be faster than the state-of-the-art approach by morethan two orders of magnitude on large dense graphs.


  • Open Access

    $HT$ : A Novel Labeling Scheme for k-Hop Reachability Queries on DAGs

    by Ming Du, Anping Yang, Junfeng Zhou, Xian Tang, Ziyang Chen, Yanfei Zuo

    Given a directed acyclic graph ( DAG), a k-hop reachability query u?kv is used to answer whether there exists a path from u to v with length ≤k. Answering k-hop reachability queries is a fundamental graph operation and has been extensively studied during the past years. Considering that existing approaches still suffer from inefficiency in practice when processing large graphs, we propose a novel labeling scheme, namely HT, to accelerate k-hop reachability queries answering. HT uses a constrained 2hop distance label to maintain the length of shortest paths between a set of hop nodes and other nodes, and for the remaining reachability information, HT uses a novel topological level to accelerate graph traversal. Further, we propose to enhance HT by two optimization techniques. The experimental results show that compared with the state-of-the-art approaches, HT works best for most graphs when answering k-hop reachability queries with small index size and reasonable index construction time.