XZXudong Zhang

Xudong Zhang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xudong Zhang has a total of 45 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Progressive Piecewise Implicit Reconstruction from Point Cloud via Surface Accuracy Optimization

    by Jingfang Miao, Yueyao Zhang, Xudong Zhang, Yongwei Miao

    Neural implicit surface representations have been proven to be an effective manner to express 3d shapes, but it still has some artificial defects of lacking geometric or topological accuracy for complex shape regions. To solve this issue, a coarse-to-fine training strategy and a piecewise implicit surface reconstruction network are presented to effectively capture the subtle geometric structures from input point cloud shapes. The encoder of our network is designed with piecewise patch feature channel and multi-scale feature aggregation to effectively capture fine shape structures as well as to avoid being affected by non-uniform point cloud distribution. For the decoder of our network, a novel strategy of surface accuracy optimization (SAO) is introduced to progressively learn the underlying implicit surfaces, which can control its accuracy of surface learning under a predefined tolerance parameter whilst further recovering local geometry details in a coarse-to-fine learning manner. Extensive experiments demonstrate that our network design and training method can effectively reconstruct the global shape of the underlying point cloud data while maintaining its fine surface details and also suppressing the artefacts. Compared to the traditional methods, our proposed network has always shown its competitive performance on both IoU and CD errors. Such as, our reconstruction results on the ShapeNet dataset are improved by an average of 7.11%, 20.15%, and 1.99% in terms of IoU index, comparing with DeepSDF, ONet, and CONet methods, respectively; and also reduced by an average of 76.28%, 83.33%, and 36.97% in terms of CD error, respectively.

  • Open Access

    A Multiple-Objective Memetic Algorithm for the Energy- Efficient Scheduling of Distributed Assembly Flow Shops

    by Ruiheng Sun, Hongbo Song, Yourong Chen, Xudong Zhang, Liyuan Liu, Jian Lin, Yulong Cui

    In this paper, a Multiple-Objective Memetic Algorithm (MOMA) is proposed to address the Energy-Efficient Distributed Assembly Permutation Flow-Shop Scheduling Problem (EEDAPFSP) by explicitly exploiting the structural and objective symmetries inherent in the scheduling process, with the dual objectives of minimizing the maximum completion time (makespan) and total energy consumption (TEC). The EEDAPFSP is a complex NP-hard optimization problem in modern sustainable manufacturing that balances production efficiency and environmental sustainability. During the global search phase, a symmetry-preserving dual-search framework is constructed, in which diverse and potential regions in the solution space are explored by symmetrically generating time-dominant product sub-sequences (TDPSs) and energy-dominant product sub-sequences (EDPSs) in the individuals of each iteration, enabling complementary exploration from time- and energy-oriented perspectives. This is accomplished through the incorporation of a variable-weight metric technique and a first product fixed strategy into an estimation distributed algorithm-based hyper-heuristic (EDAHH), so as to maintain a balanced and symmetric probabilistic modeling of decision patterns with respect to the makespan and energy consumption. In the local search phase, two problem-specific designed neighborhood structures are proposed to refine the job sequences corresponding to the TDPS and EDPS in the superior sub-population, effectively reducing both the makespan and TEC. A box-level ε dominance technique based on the crowding distance is proposed for Pareto archive updating. Additionally, an energy-saving strategy is embedded throughout the algorithm, incorporating three mechanisms—job processing delay, machine shutdown and restart control, and speed regulation—to further optimize TEC during both the global and local search phases. Finally, extensive computational experiments are carried out, and the results demonstrate that the MOMA achieves significantly better performance in terms of the inverted generational distance (IGD) and the quality metric ρ compared with state-of-the-art algorithms. The resulting Pareto front of non-dominated solutions provides a comprehensive set of trade-offs between energy consumption and the makespan, offering decision makers flexible and efficient scheduling options.


  • Weld penetration state identification based on time series multi-source data fusion

    by Fei Wang, Yourong Chen, Qiyue Wang, Liyuan Liu, Muhammad Alam, Xudong Zhang, Wenhua Jiao


  • Open Access

    Patch-Based Implicit Surface Learning Network by Combining Neighborhood Point Grouping and Fully Connected Residual Feature

    by Yongwei Miao, Yueyao Zhang, Haipeng Wang, Fuchang Liu, Ran Fan, Xudong Zhang

    Due to its lack of surface details of the underlying point cloud shape for implicit field learning, a novel patch-based surface learning network based on neighborhood point grouping and fully connected residual feature is proposed which adopts a patch-based representation for training the local sign distance field of 3D shapes. With the discrete point cloud data as input, the initial center position and radius of spherical patch representing 3D shape are obtained by applying the farthest point sampling strategy; then, the relative positions of sampling points located in each surface patch relative to its patch center can be calculated, whilst the sampling points located in the overlapping regions always exist several relative positions; for the network encoder, each relative position will be encoded into 256 dimensional latent vector using the neighboring point grouping layer, and the latent vectors of sampling points located in each surface patch are maximized to represent their latent features; for the network decoder, a multi-layer fully connected residual feature decoding module is adopted to decode the sign distance value of its relative position for each sampling point, whilst that of the sampling point located in the overlapping regions for different patches can be calculated as a weighted sum of their distance values; finally, the Marching Cube algorithm is applied to extract the zero iso-surface of sign distance values for sampling points to obtain final 3D mesh model. By using ShapeNet, ABC and Famous dataset, experimental results demonstrate that our patch-based point cloud learning network can effectively reconstruct the overall shape structure whilst maintaining its surface details. If testing on ShapeNet datasets, the IoU index is 83.9, and the CD index is 0.032. The reconstruction results by our proposed network is superior to that of DeepSDF, occupancy network, or convolutional occupancy network.

  • Open Access

    A Secure and Efficient Authentication Scheme for Large-Scale IoT Devices Based on Zero-Knowledge Proof

    by Ziyi Su, Shiwei Wang, Hongliu Cai, Jiaxuan Huang, Yourong Chen, Xudong Zhang, Muhammad Alam

    Current authentication schemes based on zero-knowledge proof (ZKP) still face issues such as high computation costs, low efficiency, and security assurance difficulty. Therefore, we propose a secure and efficient authentication scheme (SEAS) for large-scale IoT devices based on ZKP. In the initialization phase, the trusted authority creates prerequisites for device traceability and system security. Then, we propose a new registration method to ensure device anonymity. In the identity tracing and revocation phase, we revoke the real identity of abnormal devices by decrypting and updating group public keys, avoiding their access and reducing revocation costs. In the authentication phase, we check the arithmetic relationship between blind certificates, proofs, and other random data. We propose a new anonymous batch authentication method to effectively reduce computation costs, enhance authentication efficiency, and guarantee device authentication security. Security analysis and experimental results show that an SEAS can ensure security and effectively reduce verification time and energy costs. Its security and performance exceed existing schemes.


  • Open Access

    A Double-Branch Point Cloud Completion Network by Combining Shape Structure Recovery and Local Detail Compensation

    by Yongwei Miao, Chengyu Jing, Fuchang Liu, Xudong Zhang

    To address the issue that it is difficult to effectively maintain the detail information of original shapes for traditional point cloud restoration methods, a two-branch point cloud completion network is proposed which combines shape structure recovery branch and local detail compensation branch. For the shape structure recovery branch, its encoder performs feature transformation on the missing point cloud data to overcome the rotational invariance of the 3D shapes, and solves the disorder problem of the point cloud by using the maximum pooling operation, which can generate the feature codeword of the input shape by adopting the multi-layer perceptron. In order to compensate shape details of the coarse completion results, the local detail compensation branch can learn the geometric features of the underlying shapes through hierarchical feature learning and multi-level feature fusion for different dimensional features extracted from the encoder, so as to effectively recover the missing point cloud data and retain the original shape details. Finally, the point cloud data obtained by these two branches will be stitched and fused, and then the farthest point resampling is iteratively performed to obtain the final point cloud completion results. Compared with the completion results on ShapeNet dataset, the average CD error and EMD error of our proposed network are 16%-29% and 19%-65% lower than that of the existing networks respectively, whilst the average CD error and EMD error are 6%-41% and 31%-59% lower than that of the existing network respectively if testing on the ModelNet dataset. The proposed two-branch completion network can repair the overall structure of the underlying shape and effectively recover its shape details to generate a complete point cloud model with uniform distribution of sampling points. The network is also robust to model noise and different degrees of missing data.

  • A Large-Scale Node Lightweight Consensus Algorithm of Blockchain for Internet of Things

    by Yubo Zhuang, Yourong Chen, Xudong Zhang, Tiaojuan Ren, Meng Han, Muhammad Alam, Zhen Hong

    In order to solve the problems in the blockchain consensus algorithm such as slow consensus speed, high resource consumption, and low consensus security due to excessive large-scale node data volume and Byzantine attacks in the Internet of Things system, we propose a large-scale node lightweight consensus algorithm of blockchain for Internet of Things (LNLCA). Firstly, a transaction set construction mechanism is proposed to improve consensus efficiency and security. The mechanism packages multiple data monitored by Internet of Things (IoT) nodes into data transactions, and builds the transaction set. Then it constructs non-conflict subsets and conflict subsets. Secondly, an adjacent parent node sampling and response mechanism is proposed to reduce the consumption of communication resources. The new transaction set selects nearby parent nodes based on the time distance summation method and collaborates to batch verify each transaction in the transaction set. Finally, an efficient consistent consensus based on transaction set Direct Acyclic Graph (DAG) is proposed to quickly vote for each transaction in the transaction set, thereby constructing the transaction set DAG for batch uploading to the chain, and achieving a secure and lightweight consensus on IoT data. The experimental results show that no matter how the number of Byzantine nodes changes, LNLCA can improve transaction throughput, and reduce transaction delay and communication overhead, which outperforms the CDBFT, Avalanche, and Hashgraph.


  • Open Access

    An efficient point cloud semantic segmentation network with multiscale super-patch transformer

    by Yongwei Miao, Yuliang Sun, Yimin Zhang, Jinrong Wang, Xudong Zhang

    Efficient semantic segmentation of large-scale point cloud scenes is a fundamental and essential task for perception or understanding the surrounding 3d environments. However, due to the vast amount of point cloud data, it is always a challenging to train deep neural networks efficiently and also difficult to establish a unified model to represent different shapes effectively due to their variety and occlusions of scene objects. Taking scene super-patch as data representation and guided by its contextual information, we propose a novel multiscale super-patch transformer network (MSSPTNet) for point cloud segmentation, which consists of a multiscale super-patch local aggregation (MSSPLA) module and a super-patch transformer (SPT) module. Given large-scale point cloud data as input, a dynamic region-growing algorithm is first adopted to extract scene super-patches from the sampling points with consistent geometric features. Then, the MSSPLA module aggregates local features and their contextual information of adjacent super-patches at different scales. Owing to the self-attention mechanism, the SPT module exploits the similarity among scene super-patches in high-level feature space. By combining these two modules, our MSSPTNet can effectively learn both local and global features from the input point clouds. Finally, the interpolating upsampling and multi-layer perceptrons are exploited to generate semantic labels for the original point cloud data. Experimental results on the public S3DIS dataset demonstrate its efficiency of the proposed network for segmenting large-scale point cloud scenes, especially for those indoor scenes with a large number of repetitive structures, i.e., the network training of our MSSPTNet is much faster than other segmentation networks by a factor of tens to hundreds.


  • Open Access

    A review of point cloud segmentation for understanding 3D indoor scenes

    by Yuliang Sun, Xudong Zhang, Yongwei Miao

    Point cloud segmentation is an essential task in three-dimensional (3D) vision and intelligence. It is a critical step in understanding 3D scenes with a variety of applications. With the rapid development of 3D scanning devices, point cloud data have become increasingly available to researchers. Recent advances in deep learning are driving advances in point cloud segmentation research and applications. This paper presents a comprehensive review of recent progress in point cloud segmentation for understanding 3D indoor scenes. First, we present public point cloud datasets, which are the foundation for research in this area. Second, we briefly review previous segmentation methods based on geometry. Then, learning-based segmentation methods with multi-views and voxels are presented. Next, we provide an overview of learning-based point cloud segmentation, ranging from semantic segmentation to instance segmentation. Based on the annotation level, these methods are categorized into fully supervised and weakly supervised methods. Finally, we discuss open challenges and research directions in the future.