Demo Data from EDBT 2026 / reviewers in the wild / expert
Jianxu Shangguan
dblp:425/1906
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0008-5280-9182ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
1 paper |
Reinforcement learning · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 50% Algorithms and data structures · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › multi-agent reinforcement learning
cooperative multi-agent reinforcement learning |
0.9 | 1 | 2025 | CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing Pieces · ACM Multimedia 2025 |
Image and video processing › image restoration
image inpainting |
0.9 | 1 | 2025 | CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing Pieces · ACM Multimedia 2025 |
Algorithms and data structures › search algorithms
combinatorial search |
0.3 | 1 | 2025 | CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing Pieces · ACM Multimedia 2025 |
Mathematical optimization › multi-objective optimization
evolutionary algorithm |
0.3 | 1 | 2025 | CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing Pieces · ACM Multimedia 2025 |
Methods — techniques the papers use, named apart from their topics
outpainting network · 2.6inpainting network · 2.6evolutionary algorithm · 2.6co-evolutionary training · 2.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | CEARI: Co-Evolutionary Agents for Reassembling and Inpainting Puzzles with Gaps and Missing PiecesabstractPuzzle solving has recently become a popular research topic. Existing solvers often overlook puzzles with missing pieces. The missing pieces, together with gaps between pieces, pose significant challenges, amplified by a large solution space. To tackle the challenges, we propose Co-Evolutionary Agents for Reassembling and Inpainting (CEARI), one agent to inpaint missing contents and the other to reassemble the puzzle, with a shared perception network to perceive the puzzle status. The reassembly agent utilizes an evolutionary algorithm to explore the large solution space, to discover a sequence of fragment-swapping actions to efficiently reassemble the puzzle, while the inpainting agent evolves from using a local outpainting network at the early stage to using a global inpainting network at the latter stage. Furthermore, a co-evolutionary training paradigm is designed to iteratively evolve the two agents in a coherent and collaborative manner, improving reassembly accuracy and inpainting quality simultaneously. Experimental results on three datasets show that CEARI largely outperforms state-of-the-art methods in terms of both reassembly accuracy and inpainting quality. Xingke Song, Jianxu Shangguan, Yiran Li 0003, Jialu Zhang 0003, Jianfeng Ren, Ruibin Bai, Xin Chen 0003, Xudong Jiang 0001 |
ACM Multimedia | 2 |