Demo Data from VLDB 2026 / reviewers in the wild / expert
Muxingzi Li
dblp:263/3214
· DBLP profile ↗
4ranked-venue papers
3as first author
2since 2021 · last 2021
0000-0003-2126-8578ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 2 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.
| Artificial intelligence
2 papers |
Generative modeling · 78% Segmentation and scene understanding · 22% | |
| Computer graphics and multimedia
2 papers |
Image and video processing · 70% Geometric modeling and processing · 30% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › generative adversarial network
conditional GAN |
0.5 | 1 | 2021 | Enhance Image as You Like with Unpaired Learning · IJCAI 2021 |
Machine learning › Generative modeling
generative adversarial network |
0.5 | 1 | 2021 | Enhance Image as You Like with Unpaired Learning · IJCAI 2021 |
Machine learning › Generative modeling › generative adversarial network
image-to-image translation |
0.5 | 1 | 2021 | Enhance Image as You Like with Unpaired Learning · IJCAI 2021 |
Image and video processing
image enhancement |
0.5 | 1 | 2021 | Enhance Image as You Like with Unpaired Learning · IJCAI 2021 |
Image and video processing › image enhancement
low-light image enhancement |
0.5 | 1 | 2021 | Enhance Image as You Like with Unpaired Learning · IJCAI 2021 |
Computer vision › Segmentation and scene understanding
image segmentation |
0.4 | 1 | 2020 | Approximating shapes in images with low-complexity polygons · CVPR 2020 |
Geometric modeling and processing › shape representation
shape approximation |
0.4 | 1 | 2020 | Approximating shapes in images with low-complexity polygons · CVPR 2020 |
Methods — techniques the papers use, named apart from their topics
modulation code learning · 1.0conditional GAN · 1.0splitting and merging · 0.9priority queue exploration · 0.9energy minimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Planar Shape Based Registration for Multi-modal Geometry
Muxingzi Li, Florent Lafarge |
BMVC | 1 |
| 2021 | Enhance Image as You Like with Unpaired LearningabstractLow-light image enhancement exhibits an ill-posed nature, as a given image may have many enhanced versions, yet recent studies focus on building a deterministic mapping from input to an enhanced version. In contrast, we propose a lightweight one-path conditional generative adversarial network (cGAN) to learn a one-to-many relation from low-light to normal-light image space, given only sets of low- and normal-light training images without any correspondence. By formulating this ill-posed problem as a modulation code learning task, our network learns to generate a collection of enhanced images from a given input conditioned on various reference images. Therefore our inference model easily adapts to various user preferences, provided with a few favorable photos from each user. Our model achieves competitive visual and quantitative results on par with fully supervised methods on both noisy and clean datasets, while being 6 to 10 times lighter than state-of-the-art generative adversarial networks (GANs) approaches. Xiaopeng Sun 0001, Muxingzi Li, Tianyu He, Lubin Fan |
IJCAI | 2 |
| 2020 | Approximating shapes in images with low-complexity polygonsabstractWe present an algorithm for extracting and vectorizing objects in images with polygons. Departing from a polygonal partition that oversegments an image into convex cells, the algorithm refines the geometry of the partition while labeling its cells by a semantic class. The result is a set of polygons, each capturing an object in the image. The quality of a configuration is measured by an energy that accounts for both the fidelity to input data and the complexity of the output polygons. To efficiently explore the configuration space, we perform splitting and merging operations in tandem on the cells of the polygonal partition. The exploration mechanism is controlled by a priority queue that sorts the operations most likely to decrease the energy. We show the potential of our algorithm on different types of scenes, from organic shapes to man-made objects through floor maps, and demonstrate its efficiency compared to existing vectorization methods. Muxingzi Li, Florent Lafarge, Renaud Marlet |
CVPR | 1 |
| 2019 | Robust Joint Image Reconstruction from Color and Monochrome Cameras
Muxingzi Li, Peihan Tu, Wolfgang Heidrich |
BMVC | 1 |