Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minh Dang

dblp:51/2354 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-7913-0224ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-authorArtificial intelligence and machine learning · 2 · 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
3 papers
Geometric modeling and processing · 60% Computer animation and physical simulation · 29% Computational fabrication · 11%
Artificial intelligence
2 papers
3D vision · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
cloth simulation
0.612022
GarNet++: Improving Fast and Accurate Static 3D Cloth Draping by Curvature Loss · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Computer vision › 3D vision
point cloud processing
0.412019
GarNet: A Two-Stream Network for Fast and Accurate 3D Cloth Draping · ICCV 2019
Geometric modeling and processing › shape modeling › garment modeling
garment draping
0.412019
GarNet: A Two-Stream Network for Fast and Accurate 3D Cloth Draping · ICCV 2019
Geometric modeling and processing
shape modeling
0.412019
GarNet: A Two-Stream Network for Fast and Accurate 3D Cloth Draping · ICCV 2019
Computational fabrication › computational design
inverse design
0.212015
Interactive design of probability density functions for shape grammars · ACM Trans. Graph. 2015
Geometric modeling and processing
procedural modeling
0.212015
Interactive design of probability density functions for shape grammars · ACM Trans. Graph. 2015
Geometric modeling and processing › procedural modeling
shape grammar
0.212015
Interactive design of probability density functions for shape grammars · ACM Trans. Graph. 2015
Computer vision › 3D vision
3d reconstruction
0.212022
GarNet++: Improving Fast and Accurate Static 3D Cloth Draping by Curvature Loss · IEEE Trans. Pattern Anal. Mach. Intell. 2022
Computer vision › 3D vision
human body modeling
0.212022
GarNet++: Improving Fast and Accurate Static 3D Cloth Draping by Curvature Loss · IEEE Trans. Pattern Anal. Mach. Intell. 2022

Methods — techniques the papers use, named apart from their topics

two-stream deep network · 1.1physics-based simulation · 1.1curvature loss · 1.1two-stream network · 0.8physics-inspired loss · 0.8deep point cloud features · 0.8l1 regularization · 0.2kernel similarity · 0.2gaussian process regression · 0.2function factorization · 0.2
YearPublicationVenuePosition
2022 GarNet++: Improving Fast and Accurate Static 3D Cloth Draping by Curvature Loss
abstract
In this paper, we tackle the problem of static 3D cloth draping on virtual human bodies. We introduce a two-stream deep network model that produces a visually plausible draping of a template cloth on virtual 3D bodies by extracting features from both the body and garment shapes. Our network learns to mimic a physics-based simulation (PBS) method while requiring two orders of magnitude less computation time. To train the network, we introduce loss terms inspired by PBS to produce plausible results and make the model collision-aware. To increase the details of the draped garment, we introduce two loss functions that penalize the difference between the curvature of the predicted cloth and PBS. Particularly, we study the impact of mean curvature normal and a novel detail-preserving loss both qualitatively and quantitatively. Our new curvature loss computes the local covariance matrices of the 3D points, and compares the Rayleigh quotients of the prediction and PBS. This leads to more details while performing favorably or comparably against the loss that considers mean curvature normal vectors in the 3D triangulated meshes. We validate our framework on four garment types for various body shapes and poses. Finally, we achieve superior performance against a recently proposed data-driven method.
Erhan Gundogdu, Victor Constantin, Shaifali Parashar, Amrollah Seifoddini, Minh Dang, Mathieu Salzmann, Pascal Fua
IEEE Trans. Pattern Anal. Mach. Intell.5
2019 GarNet: A Two-Stream Network for Fast and Accurate 3D Cloth Draping
abstract
While Physics-Based Simulation (PBS) can accurately drape a 3D garment on a 3D body, it remains too costly for real-time applications, such as virtual try-on. By contrast, inference in a deep network, requiring a single forward pass, is much faster. Taking advantage of this, we propose a novel architecture to fit a 3D garment template to a 3D body. Specifically, we build upon the recent progress in 3D point cloud processing with deep networks to extract garment features at varying levels of detail, including point-wise, patch-wise and global features. We fuse these features with those extracted in parallel from the 3D body, so as to model the cloth-body interactions. The resulting two-stream architecture, which we call as GarNet, is trained using a loss function inspired by physics-based modeling, and delivers visually plausible garment shapes whose 3D points are, on average, less than 1 cm away from those of a PBS method, while running 100 times faster. Moreover, the proposed method can model various garment types with different cutting patterns when parameters of those patterns are given as input to the network.
Erhan Gundogdu, Victor Constantin, Amrollah Seifoddini, Minh Dang, Mathieu Salzmann, Pascal Fua
ICCV4
2017 Discovering Structured Variations Via Template Matching
abstract
Abstract Understanding patterns of variation from raw measurement data remains a central goal of shape analysis. Such an understanding reveals which elements are repeated, or how elements can be derived as structured variations from a common base element. We investigate this problem in the context of 3D acquisitions of buildings. Utilizing a set of template models, we discover geometric similarities across a set of building elements. Each template is equipped with a deformation model that defines variations of a base geometry. Central to our algorithm is a simultaneous template matching and deformation analysis that detects patterns across building elements by extracting similarities in the deformation modes of their matching templates. We demonstrate that such an analysis can successfully detect structured variations even for noisy and incomplete data.
Duygu Ceylan, Minh Dang, Niloy J. Mitra, Boris Neubert, Mark Pauly
Comput. Graph. Forum2
2015 Interactive design of probability density functions for shape grammars
abstract
A shape grammar defines a procedural shape space containing a variety of models of the same class, e.g. buildings, trees, furniture, airplanes, bikes, etc. We present a framework that enables a user to interactively design a probability density function (pdf) over such a shape space and to sample models according to the designed pdf. First, we propose a user interface that enables a user to quickly provide preference scores for selected shapes and suggest sampling strategies to decide which models to present to the user to evaluate. Second, we propose a novel kernel function to encode the similarity between two procedural models. Third, we propose a framework to interpolate user preference scores by combining multiple techniques: function factorization, Gaussian process regression, autorelevance detection, and l 1 regularization. Fourth, we modify the original grammars to generate models with a pdf proportional to the user preference scores. Finally, we provide evaluations of our user interface and framework parameters and a comparison to other exploratory modeling techniques using modeling tasks in five example shape spaces: furniture, low-rise buildings, skyscrapers, airplanes, and vegetation.
Minh Dang, Stefan Lienhard, Duygu Ceylan, Boris Neubert, Peter Wonka, Mark Pauly
ACM Trans. Graph.1
2014 SAFE: Structure-aware facade editing
abstract
Abstract Many man‐made objects, in particular building facades, exhibit dominant structural relations such as symmetry and regularity. When editing these shapes, a common objective is to preserve these relations. However, often there are numerous plausible editing results that all preserve the desired structural relations of the input, creating ambiguity. We propose an interactive facade editing framework that explores this structural ambiguity. We first analyze the input in a semi‐automatic manner to detect different groupings of the facade elements and the relations among them. We then provide an incremental editing process where a set of variations that preserve the detected relations in a particular grouping are generated at each step. Starting from one input example, our system can quickly generate various facade configurations.
Minh Dang, Duygu Ceylan, Boris Neubert, Mark Pauly
Comput. Graph. Forum1