Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhaoliang Lun
dblp:139/0448
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-author
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
3 papers |
Geometric modeling and processing · 58% Visual content generation and editing · 22% Computational fabrication · 19% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visual content generation and editing
graphic design |
0.3 | 1 | 2017 | Learning to group discrete graphical patterns · ACM Trans. Graph. 2017 |
Geometric modeling and processing
shape analysis |
0.2 | 1 | 2015 | Elements of style: learning perceptual shape style similarity · ACM Trans. Graph. 2015 |
Methods — techniques the papers use, named apart from their topics
perceptual grouping · 0.3convolutional neural network · 0.3tabu search · 0.2element compatibility metric · 0.2geometric element matching · 0.2crowdsourcing · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | 3D Shape Reconstruction from Sketches via Multi-view Convolutional NetworksabstractWe propose a method for reconstructing 3D shapes from 2D sketches in the form of line drawings. Our method takes as input a single sketch, or multiple sketches, and outputs a dense point cloud representing a 3D reconstruction of the input sketch(es). The point cloud is then converted into a polygon mesh. At the heart of our method lies a deep, encoder-decoder network. The encoder converts the sketch into a compact representation encoding shape information. The decoder converts this representation into depth and normal maps capturing the underlying surface from several output viewpoints. The multi-view maps are then consolidated into a 3D point cloud by solving an optimization problem that fuses depth and normals across all viewpoints. Based on our experiments, compared to other methods, such as volumetric networks, our architecture offers several advantages, including more faithful reconstruction, higher output surface resolution, better preservation of topology and shape structure. Zhaoliang Lun, Matheus Gadelha, Evangelos Kalogerakis, Subhransu Maji, Rui Wang 0003 |
3DV | 1 |
| 2017 | Learning to group discrete graphical patternsabstractWe introduce a deep learning approach for grouping discrete patterns common in graphical designs. Our approach is based on a convolutional neural network architecture that learns a grouping measure defined over a pair of pattern elements. Motivated by perceptual grouping principles, the key feature of our network is the encoding of element shape, context, symmetries, and structural arrangements. These element properties are all jointly considered and appropriately weighted in our grouping measure. To better align our measure with human perceptions for grouping, we train our network on a large, human-annotated dataset of pattern groupings consisting of patterns at varying granularity levels, with rich element relations and varieties, and tempered with noise and other data imperfections. Experimental results demonstrate that our deep-learned measure leads to robust grouping results. Zhaoliang Lun, Changqing Zou, Evangelos Kalogerakis, Ping Tan 0002, Marie-Paule Cani, Hao (Richard) Zhang |
ACM Trans. Graph. | 1 |
| 2016 | Functionality preserving shape style transferabstractWhen geometric models with a desired combination of style and functionality are not available, they currently need to be created manually. We facilitate algorithmic synthesis of 3D models of man-made shapes which combines user-specified style, described via anexemplarshape, and functionality, encoded by a functionally differenttargetshape. Our method automatically transfers the style of the exemplar to the target, creating the desired combination. The main challenge in performing cross-functional style transfer is to implicitly separate an object's style from its function: while stylistically the output shapes should be as close as possible to the exemplar, their original functionality and structure, as encoded by the target, should be strictly preserved. Recent literature point to the presence of similarly shaped, salientgeometric elementsas a main indicator of stylistic similarity between 3D shapes. We therefore transfer the exemplar style to the target via a sequence of element-level operations. We allow onlycompatibleoperations, ones that do not affect the target functionality. To this end, we introduce a cross-structural element compatibility metric that estimates the impact of each operation on the edited shape. Our metric is based on the global context and coarse geometry of evaluated elements, and is trained on databases of 3D objects. We use this metric to cast style transfer as a tabu search, which incrementally updates the target shape using compatible operations, progressively increasing its style similarity to the exemplar while strictly maintaining its functionality at each step. We evaluate our framework across a range of man-made objects including furniture, light fixtures, and tableware, and perform a number of user studies confirming that it produces convincing outputs combining the desired style and function. Zhaoliang Lun, Evangelos Kalogerakis, Rui Wang 0003, Alla Sheffer |
ACM Trans. Graph. | 1 |
| 2015 | Elements of style: learning perceptual shape style similarityabstractThe human perception of stylistic similarity transcends structure and function: for instance, a bed and a dresser may share a common style. An algorithmically computed style similarity measure that mimics human perception can benefit a range of computer graphics applications. Previous work in style analysis focused on shapes within the same class, and leveraged structural similarity between these shapes to facilitate analysis. In contrast, we introduce the firststructure-transcendingstyle similarity measure and validate it to be well aligned with human perception of stylistic similarity. Our measure is inspired by observations about style similarity in art history literature, which point to the presence of similarly shaped, salient,geometric elementsas one of the key indicators of stylistic similarity. We translate these observations into an algorithmic measure by first quantifying the geometric properties that make humans perceive geometric elements as similarly shaped and salient in the context of style, then employing this quantification to detect pairs of matching style related elements on the analyzed models, and finally collating the element-level geometric similarity measurements into an object-level style measure consistent with human perception. To achieve this consistency we employ crowdsourcing to quantify the different components of our measure; we learn the relative perceptual importance of a range of elementary shape distances and other parameters used in our measurement from 50K responses to cross-structure style similarity queries provided by over 2500 participants.We train and validate our method on this dataset, showing it to successfully predict relative style similarity with near 90% accuracy based on 10-fold cross-validation. Zhaoliang Lun, Evangelos Kalogerakis, Alla Sheffer |
ACM Trans. Graph. | 1 |
| 2013 | Implicit Integration for Particle-based Simulation of Elasto-Plastic SolidsabstractAbstract We present a novel particle‐based method for stable simulation of elasto‐plastic materials. The main contribution of our method is an implicit numerical integrator, using a physically‐based model, for computing particles that undergo both elastic and plastic deformations. The main advantage of our implicit integrator is that it allows the use of large time steps while still preserving stable and physically plausible simulation results. As a key component of our algorithm, at each time step we compute the particle positions and velocities based on a sparse linear system, which we solve efficiently on the graphics hardware. Compared to existing techniques, our method allows for a much wider range of stiffness and plasticity settings. In addition, our method can significantly reduce the computation cost for certain range of material types. We demonstrate fast and stable simulations for a variety of elasto‐plastic materials, ranging from highly stiffelastic materials to highly plastic ones. Yahan Zhou, Zhaoliang Lun, Evangelos Kalogerakis, Rui Wang 0003 |
Comput. Graph. Forum | 2 |