Demo Data from EDBT 2026 / reviewers in the wild / expert
Leyi Zhu
dblp:231/1747
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
2 papers |
Geometric modeling and processing · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › surface parameterization
seamless parametrization |
0.6 | 1 | 2022 | Which cross fields can be quadrangulated?: global parameterization from prescribed holonomy signatures · ACM Trans. Graph. 2022 |
Geometric modeling and processing
surface parameterization |
0.6 | 1 | 2022 | Which cross fields can be quadrangulated?: global parameterization from prescribed holonomy signatures · ACM Trans. Graph. 2022 |
Geometric modeling and processing › discrete geometry › discrete differential geometry
discrete conformal equivalence |
0.5 | 1 | 2021 | Efficient and robust discrete conformal equivalence with boundary · ACM Trans. Graph. 2021 |
Geometric modeling and processing › vector field design
cross fields |
0.2 | 1 | 2022 | Which cross fields can be quadrangulated?: global parameterization from prescribed holonomy signatures · ACM Trans. Graph. 2022 |
Geometric modeling and processing › mesh generation
quad meshing |
0.2 | 1 | 2022 | Which cross fields can be quadrangulated?: global parameterization from prescribed holonomy signatures · ACM Trans. Graph. 2022 |
Geometric modeling and processing › mesh processing
intrinsic triangulation |
0.1 | 1 | 2021 | Efficient and robust discrete conformal equivalence with boundary · ACM Trans. Graph. 2021 |
Geometric modeling and processing
mesh processing |
0.1 | 1 | 2021 | Efficient and robust discrete conformal equivalence with boundary · ACM Trans. Graph. 2021 |
Methods — techniques the papers use, named apart from their topics
turning number · 0.6cut graph modification · 0.6hyperbolic ideal delaunay triangulation · 0.5double cover · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Test-Time Intensity Consistency Adaptation for Shadow Detection
Leyi Zhu, Weihuang Liu, Zimeng Li 0001, Xuhang Chen 0002, Chi-Man Pun |
ICONIP (7) | 1 |
| 2022 | Which cross fields can be quadrangulated?: global parameterization from prescribed holonomy signaturesabstractWe describe a method for the generation of seamless surface parametrizations with guaranteed local injectivity and full control over holonomy. Previous methods guarantee only one of the two. Local injectivity is required to enable these parametrizations' use in applications such as surface quadrangulation and spline construction. Holonomy control is crucial to enable guidance or prescription of the parametrization's isocurves based on directional information, in particular from cross-fields or feature curves, and more generally to constrain the parametrization topologically. To this end we investigate the relation between cross-field topology and seamless parametrization topology. Leveraging previous results on locally injective parametrization and combining them with insights on this relation in terms of holonomy, we propose an algorithm that meets these requirements. A key component relies on the insight that arbitrary surface cut graphs, as required for global parametrization, can be homeomorphically modified to assume almost any set of turning numbers with respect to a given target cross-field. Hanxiao Shen, Leyi Zhu, Ryan Capouellez, Daniele Panozzo, Marcel Campen, Denis Zorin |
ACM Trans. Graph. | 2 |
| 2021 | Efficient and robust discrete conformal equivalence with boundaryabstractWe describe an efficient algorithm to compute a discrete metric with prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the boundary of a mesh. The metric is (discretely) conformally equivalent to the input metric. Its construction is based on theory developed in [Gu et al. 2018b] and [Springborn 2020], relying on results on hyperbolic ideal Delaunay triangulations. Generality is achieved by considering the surface's intrinsic triangulation as a degree of freedom, and particular attention is paid to the proper treatment of surface boundaries. While via a double cover approach the case with boundary can be reduced to the case without boundary quite naturally, the implied symmetry of the setting causes additional challenges related to stable Delaunay-critical configurations that we address explicitly. We furthermore explore the numerical limits of the approach and derive continuous maps from the discrete metrics. Marcel Campen, Ryan Capouellez, Hanxiao Shen, Leyi Zhu, Daniele Panozzo, Denis Zorin |
ACM Trans. Graph. | 4 |
| 2018 | Vehicle Re-Identification by Deep Feature Fusion Based on Joint Bayesian CriterionabstractVehicle re-identification is a challenging task as the differences between vehicles of the same model are extremely small. In this paper, we propose to fuse deep features extracted by two different CNNs for vehicle re-identification. CNNs can extract discriminative features for classification tasks. Features extracted by different CNNs describe different aspects of the input image, and are complementary to each other. We propose a new loss function called the Joint Bayesian loss to fuse the different deep features. The proposed Joint Bayesian loss can minimize the intra-class variations and simultaneously maximize the inter-class variations of the fused features, and it is very fit for the vehicle re-identification. Experiments on a large-scale vehicle dataset demonstrate the effectiveness of the proposed method. Mingtao Pei, Leyi Zhu |
ICPR | 3 |