EDBT 2026 Demo / reviewers in the wild / expert
Jing Meng 0004
dblp:56/4928-4
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0002-0721-6181ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Artificial intelligence and machine learning · 1 · 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
1 paper |
Geometric modeling and processing · 100% | |
| Artificial intelligence
1 paper |
Learning paradigms · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › shape matching › non-rigid shape matching
functional maps |
1.0 | 1 | 2026 | MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence · AAAI 2026 |
Geometric modeling and processing
shape correspondence |
1.0 | 1 | 2026 | MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence · AAAI 2026 |
Machine learning › Learning paradigms
unsupervised learning |
0.3 | 1 | 2026 | MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
multiscale iterative solver · 2.0functional maps · 2.0consistency loss · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape CorrespondenceabstractDeep functional map frameworks (DFM) for shape correspondence are powerful, yet fundamentally limited by their reliance on end-to-end differentiability. This constraint prevents the integration of highly accurate, non-differentiable refinement techniques, capping their overall performance, especially on challenging non-isometric shapes. To overcome this, we introduce MDND, a novel DFM paradigm built on the principle of merging differentiable and non-differentiable components. Our framework facilitates unsupervised learning guided by an internal, non-differentiable refinement. Specifically, MDND employs a dual-branch architecture: a non-differentiable refinement branch leverages a novel, multiscale iterative solver to produce highly robust correspondences, acting as a refined target. Concurrently, a fully differentiable branch learns to predict correspondences from features. The entire system is trained end-to-end without supervision by enforcing a consistency loss that compels the differentiable branch to learn from the superior, refined results of the non-differentiable branch. Extensive experiments show that MDND sets a new state-of-the-art, demonstrating remarkable robustness on shapes with non-isometric deformations and topological noise. Qinsong Li, Jing Meng 0004, Haibo Wang 0009, Shengjun Liu 0002 |
AAAI | 2 |
| 2025 | TriAlign: revisiting deep functional map from map representation alignment perspectives
Haibo Wang 0009, Qinsong Li, Ling Hu 0004, Jing Meng 0004, Yukun Lai, Shengjun Liu 0002 |
Vis. Comput. | 5 |
| 2024 | Multiscale Spectral Manifold Wavelet Regularizer for Unsupervised Deep Functional MapsabstractAbstract In deep functional maps, the regularizer computing the functional map is especially crucial for ensuring the global consistency of the computed pointwise map. As the regularizers integrated into deep learning should be differentiable, it is not trivial to incorporate informative axiomatic structural constraints into the deep functional map, such as the orientation‐preserving term. Although commonly used regularizers include the Laplacian‐commutativity term and the resolvent Laplacian commutativity term, these are limited to single‐scale analysis for capturing geometric information. To this end, we propose a novel and theoretically well‐justified regularizer commuting the functional map with the multiscale spectral manifold wavelet operator. This regularizer enhances the isometric constraints of the functional map and is conducive to providing it with better structural properties with multiscale analysis. Furthermore, we design an unsupervised deep functional map with the regularizer in a fully differentiable way. The quantitative and qualitative comparisons with several existing techniques on the (near‐)isometric and non‐isometric datasets show our method's superior accuracy and generalization capabilities. Additionally, we illustrate that our regularizer can be easily inserted into other functional map methods and improve their accuracy. Shengjun Liu 0002, Jing Meng 0004, Ling Hu 0004, Yueyu Guo, Haibo Wang 0009, Qinsong Li |
Comput. Graph. Forum | 2 |