Wei Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wei Zeng has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Xuebin Chang
School of Mathematics and Statistics Xi'an Jiaotong University Xi'an 710049 Shaanxi China
3 shared publications- Qi Zhao
Xi’an Jiaotong University
2 shared publications Yi-Jun Yang
Xi’an Jiaotong University
2 shared publicationsYijun Yang
2 shared publicationsDebo Dong
The Institute of Neuroscience and Medicine, Brain and Behaviour (INM-7), Research Centre Jülich, Jülich, Germany; Key Laboratory of Cognition and Personality, Ministry of Education, Faculty of Psychology, Southwest University, Chongqing, China
1 shared publicationDingyun Hu
1 shared publication
Latest Publications
- 20 January 2026
- Published by Springer Nature
- p. 337-349
ColonMeshNet: Fusing Local and Global Context for Accurate 3D Colon Segmentation
- 20 January 2026
- Published by Springer Nature
- p. 337-349
ColonMeshNet: Fusing Local and Global Context for Accurate 3D Colon Segmentation
- Open Access
- 18 August 2025
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 37 (10) , 1717-1725
A Filling Algorithm for N-Sided Holes Based on Constrained Least Square Method
N-sided hole filling plays an important role in surface modeling. To address twist compatibility issues, an algorithm based on constrained least square method to fill N-sided holes with NURBS patches is proposed. Firstly, initial cross-boundary derivatives of the surface are generated through linear interpolation of boundary derivatives. Then, a central point is calculated, and this central point along with the midpoints of the boundary lines are used as the first and last control points to construct internal lines, incorporating tangent vectors at the endpoints. Subsequently, normal constraints and twist compatibility conditions are introduced, and the linear interpolation energy of the initial surface boundary derivative are selected as the optimization objective function to generate the cross-boundary derivatives that satisfy boundary compatibility, twist compatibility and ε-G1 continuity, where ε is the angular deviation given by the user. Finally, bicubic blended Coons surfaces are employed to achieve G1 continuous filling for each rectangular region of the N-sided hole. The proposed method solves the numerical instability and surface smoothing problems caused by the small knot vector interval introduced by the Piegl’s algorithm to meet the twist compatibility. The angular deviation between normal vectors of adjacent surfaces is controlled within the user-specified ε angle tolerance. To validate the algorithm’s effectiveness, five representative experimental datasets, each emphasizing distinct aspects of size and curvature, were selected.
- 18 August 2025
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 37 (10) , 1717-1725
Open AccessA Filling Algorithm for N-Sided Holes Based on Constrained Least Square Method
N-sided hole filling plays an important role in surface modeling. To address twist compatibility issues, an algorithm based on constrained least square method to fill N-sided holes with NURBS patches is proposed. Firstly, initial cross-boundary derivatives of the surface are generated through linear interpolation of boundary derivatives. Then, a central point is calculated, and this central point along with the midpoints of the boundary lines are used as the first and last control points to construct internal lines, incorporating tangent vectors at the endpoints. Subsequently, normal constraints and twist compatibility conditions are introduced, and the linear interpolation energy of the initial surface boundary derivative are selected as the optimization objective function to generate the cross-boundary derivatives that satisfy boundary compatibility, twist compatibility and ε-G1 continuity, where ε is the angular deviation given by the user. Finally, bicubic blended Coons surfaces are employed to achieve G1 continuous filling for each rectangular region of the N-sided hole. The proposed method solves the numerical instability and surface smoothing problems caused by the small knot vector interval introduced by the Piegl’s algorithm to meet the twist compatibility. The angular deviation between normal vectors of adjacent surfaces is controlled within the user-specified ε angle tolerance. To validate the algorithm’s effectiveness, five representative experimental datasets, each emphasizing distinct aspects of size and curvature, were selected.
- Open Access
QC-OT: Optimal Transport with Quasiconformal Mapping
The optimal transport (OT) map offers the most economical way to transfer one probability measure distribution to another. Classical OT theory does not involve a discussion of preserving topological connections and orientations in transmission results and processes. Existing numerical and geometric methods for computing OT seldom pays specific attention on this aspect. Especially, when dealing with the triangular mesh data, the known semi-discrete geometric OT (sd-OT) method employs critical operation of Delaunay triangulation (DT) to adapt topology to ensure the convexity of the energy function and the existence of the solution. This change in topology hampers the applicability of OT in modeling non-flip physical deformations in real-world tasks such as shape registration and editing problems in computer vision and medical imaging fields. This work introduces the topology structure-preserving optimal transport (QC-OT) map for the triangular mesh input. The computational strategy focuses on the two components: relaxing DT and convexity check in sd-OT and integrating quasiconformal (QC) correction. Here, quasiconformal mapping is employed to correct the regions unexpected distortions, and guarantee the topological preserving property of the transport. Furthermore, the spatial-temporal topology-preserving OT map is presented based t-OT to study the dynamics of the transportation. Multiple experiments have validated the efficiency and effectiveness of the proposed method and demonstrated its potential in the applications of mesh parameterization and image editing.
Open AccessQC-OT: Optimal Transport with Quasiconformal Mapping
The optimal transport (OT) map offers the most economical way to transfer one probability measure distribution to another. Classical OT theory does not involve a discussion of preserving topological connections and orientations in transmission results and processes. Existing numerical and geometric methods for computing OT seldom pays specific attention on this aspect. Especially, when dealing with the triangular mesh data, the known semi-discrete geometric OT (sd-OT) method employs critical operation of Delaunay triangulation (DT) to adapt topology to ensure the convexity of the energy function and the existence of the solution. This change in topology hampers the applicability of OT in modeling non-flip physical deformations in real-world tasks such as shape registration and editing problems in computer vision and medical imaging fields. This work introduces the topology structure-preserving optimal transport (QC-OT) map for the triangular mesh input. The computational strategy focuses on the two components: relaxing DT and convexity check in sd-OT and integrating quasiconformal (QC) correction. Here, quasiconformal mapping is employed to correct the regions unexpected distortions, and guarantee the topological preserving property of the transport. Furthermore, the spatial-temporal topology-preserving OT map is presented based t-OT to study the dynamics of the transportation. Multiple experiments have validated the efficiency and effectiveness of the proposed method and demonstrated its potential in the applications of mesh parameterization and image editing.
- Open Access
GMapLatent: Geometric Mapping in Latent Space
Cross-domain generative models based on encoder-decoder AI architectures have attracted much attention in generating realistic images, where domain alignment is crucial for generation accuracy. Domain alignment methods usually deal directly with the initial distribution; however, mismatched or mixed clusters can lead to mode collapse and mixture problems in the decoder, compromising model generalization capabilities. In this work, we innovate a cross-domain alignment and generation model that introduces a canonical latent space representation based on geometric mapping to align the cross-domain latent spaces in a rigorous and precise manner, thus avoiding mode collapse and mixture in the encoder-decoder generation architectures. We name this model GMapLatent. The core of the method is to seamlessly align latent spaces with strict cluster correspondence constraints using the canonical parameterizations of cluster-decorated latent spaces. We first (1) transform the latent space to a canonical parameter domain by composing barycenter translation, optimal transport merging and constrained harmonic mapping, and then (2) compute geometric registration with cluster constraints over the canonical parameter domains. This process realizes a bijective (one-to-one and onto) mapping between newly transformed latent spaces and generates a precise alignment of cluster pairs. Cross-domain generation is then achieved through the aligned latent spaces embedded in the encoder-decoder pipeline. Experiments on gray-scale and color images validate the efficiency, efficacy and applicability of GMapLatent, and demonstrate that the proposed model has superior performance over existing models.
Open AccessGMapLatent: Geometric Mapping in Latent Space
Cross-domain generative models based on encoder-decoder AI architectures have attracted much attention in generating realistic images, where domain alignment is crucial for generation accuracy. Domain alignment methods usually deal directly with the initial distribution; however, mismatched or mixed clusters can lead to mode collapse and mixture problems in the decoder, compromising model generalization capabilities. In this work, we innovate a cross-domain alignment and generation model that introduces a canonical latent space representation based on geometric mapping to align the cross-domain latent spaces in a rigorous and precise manner, thus avoiding mode collapse and mixture in the encoder-decoder generation architectures. We name this model GMapLatent. The core of the method is to seamlessly align latent spaces with strict cluster correspondence constraints using the canonical parameterizations of cluster-decorated latent spaces. We first (1) transform the latent space to a canonical parameter domain by composing barycenter translation, optimal transport merging and constrained harmonic mapping, and then (2) compute geometric registration with cluster constraints over the canonical parameter domains. This process realizes a bijective (one-to-one and onto) mapping between newly transformed latent spaces and generates a precise alignment of cluster pairs. Cross-domain generation is then achieved through the aligned latent spaces embedded in the encoder-decoder pipeline. Experiments on gray-scale and color images validate the efficiency, efficacy and applicability of GMapLatent, and demonstrate that the proposed model has superior performance over existing models.
- 9 January 2025
- Published by Elsevier in Medical Image Analysis
- Vol. 101, 103455
Multi-center brain age prediction via dual-modality fusion convolutional network
- 9 January 2025
- Published by Elsevier in Medical Image Analysis
- Vol. 101, 103455
Multi-center brain age prediction via dual-modality fusion convolutional network
- 28 April 2024
- Published by Springer Nature
- p. 145-158
Coordinate Descent for k-Means with Differential Privacy
- 28 April 2024
- Published by Springer Nature
- p. 145-158
Coordinate Descent for k-Means with Differential Privacy
- Open Access
- 1 December 2023
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 35 (12) , 1910-1919
Application of Region Division in Self Intersecting Polygon Decomposition Algorithm
Polygon decomposition has been widely employed in the fields of computer graphics, CAD software, and path planning. The presence of self-intersections in polygons introduces errors and inaccuracies in subsequent computations and drawing operations. Decomposing self-intersecting polygons poses a common challenge in CAD applications. Traditional algorithms rely on triangulation techniques. However, this approach yields a substantial number of triangles, significantly elevating both computational and storage complexities. In response to the issue of self-intersecting polygon decomposition, a decomposition algorithm based on region partitioning is proposed. The approach begins by identifying all intersection points within the polygon. Then, a pathfinding technique is employed to traverse the self-intersecting polygon, partitioning it into non-overlapping and self-intersection-free regions. Finally, by discerning the inclusion of each region, internal areas are preserved, while external ones are discarded. This process results in a decomposition of the self-intersecting polygon into non-overlapping simple polygons. Comparative experiments with the GluTess method on large integrated circuit boards reveal that our algorithm improves time efficiency by around 60% and reduces spatial occupancy by about 20%.
- 1 December 2023
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 35 (12) , 1910-1919
Open AccessApplication of Region Division in Self Intersecting Polygon Decomposition Algorithm
Polygon decomposition has been widely employed in the fields of computer graphics, CAD software, and path planning. The presence of self-intersections in polygons introduces errors and inaccuracies in subsequent computations and drawing operations. Decomposing self-intersecting polygons poses a common challenge in CAD applications. Traditional algorithms rely on triangulation techniques. However, this approach yields a substantial number of triangles, significantly elevating both computational and storage complexities. In response to the issue of self-intersecting polygon decomposition, a decomposition algorithm based on region partitioning is proposed. The approach begins by identifying all intersection points within the polygon. Then, a pathfinding technique is employed to traverse the self-intersecting polygon, partitioning it into non-overlapping and self-intersection-free regions. Finally, by discerning the inclusion of each region, internal areas are preserved, while external ones are discarded. This process results in a decomposition of the self-intersecting polygon into non-overlapping simple polygons. Comparative experiments with the GluTess method on large integrated circuit boards reveal that our algorithm improves time efficiency by around 60% and reduces spatial occupancy by about 20%.
- 1 December 2023
- Published by Springer Nature
- p. 357-369
Brain Cortical Surface Registration with Anatomical Atlas Constraints
- 1 December 2023
- Published by Springer Nature
- p. 357-369
Brain Cortical Surface Registration with Anatomical Atlas Constraints
- Open Access
Keypoint-Guided Optimal Transport
Existing Optimal Transport (OT) methods mainly derive the optimal transport plan/matching under the criterion of transport cost/distance minimization, which may cause incorrect matching in some cases. In many applications, annotating a few matched keypoints across domains is reasonable or even effortless in annotation burden. It is valuable to investigate how to leverage the annotated keypoints to guide the correct matching in OT. In this paper, we propose a novel KeyPoint-Guided model by ReLation preservation (KPG-RL) that searches for the optimal matching (i.e., transport plan) guided by the keypoints in OT. To impose the keypoints in OT, first, we propose a mask-based constraint of the transport plan that preserves the matching of keypoint pairs. Second, we propose to preserve the relation of each data point to the keypoints to guide the matching. The proposed KPG-RL model can be solved by Sinkhorn's algorithm and is applicable even when distributions are supported in different spaces. We further utilize the relation preservation constraint in the Kantorovich Problem and Gromov-Wasserstein model to impose the guidance of keypoints in them. Meanwhile, the proposed KPG-RL model is extended to the partial OT setting. Moreover, we deduce the dual formulation of the KPG-RL model, which is solved using deep learning techniques. Based on the learned transport plan from dual KPG-RL, we propose a novel manifold barycentric projection to transport source data to the target domain. As applications, we apply the proposed KPG-RL model to the heterogeneous domain adaptation and image-to-image translation. Experiments verified the effectiveness of the proposed approach.
Open AccessKeypoint-Guided Optimal Transport
Existing Optimal Transport (OT) methods mainly derive the optimal transport plan/matching under the criterion of transport cost/distance minimization, which may cause incorrect matching in some cases. In many applications, annotating a few matched keypoints across domains is reasonable or even effortless in annotation burden. It is valuable to investigate how to leverage the annotated keypoints to guide the correct matching in OT. In this paper, we propose a novel KeyPoint-Guided model by ReLation preservation (KPG-RL) that searches for the optimal matching (i.e., transport plan) guided by the keypoints in OT. To impose the keypoints in OT, first, we propose a mask-based constraint of the transport plan that preserves the matching of keypoint pairs. Second, we propose to preserve the relation of each data point to the keypoints to guide the matching. The proposed KPG-RL model can be solved by Sinkhorn's algorithm and is applicable even when distributions are supported in different spaces. We further utilize the relation preservation constraint in the Kantorovich Problem and Gromov-Wasserstein model to impose the guidance of keypoints in them. Meanwhile, the proposed KPG-RL model is extended to the partial OT setting. Moreover, we deduce the dual formulation of the KPG-RL model, which is solved using deep learning techniques. Based on the learned transport plan from dual KPG-RL, we propose a novel manifold barycentric projection to transport source data to the target domain. As applications, we apply the proposed KPG-RL model to the heterogeneous domain adaptation and image-to-image translation. Experiments verified the effectiveness of the proposed approach.
- 14 February 2023
- Published by Springer Nature in Communications in Mathematics and Statistics
- Vol. 12 (3) , 505-522
Diffeomorphic Registration of 3D Surfaces with Point and Curve Landmarks
- 14 February 2023
- Published by Springer Nature in Communications in Mathematics and Statistics
- Vol. 12 (3) , 505-522
Diffeomorphic Registration of 3D Surfaces with Point and Curve Landmarks