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

Ganzhangqin Yuan

dblp:361/1307 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-8058-5322ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 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
2 papers
Geometric modeling and processing · 100%
Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d shape reconstruction
0.712023
SSRNet: Scalable 3D Surface Reconstruction Network · IEEE Trans. Vis. Comput. Graph. 2023
Geometric modeling and processing › mesh generation
delaunay triangulation
0.712023
DMNet: Delaunay Meshing Network for 3D Shape Representation · ICCV 2023
Geometric modeling and processing › surface reconstruction
mesh reconstruction
0.712023
DMNet: Delaunay Meshing Network for 3D Shape Representation · ICCV 2023
Geometric modeling and processing
point cloud processing
0.712023
SSRNet: Scalable 3D Surface Reconstruction Network · IEEE Trans. Vis. Comput. Graph. 2023
Geometric modeling and processing
shape representation
0.712023
DMNet: Delaunay Meshing Network for 3D Shape Representation · ICCV 2023

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

octree · 1.3neural network · 1.3graph neural network · 0.7delaunay triangulation · 0.7
YearPublicationVenuePosition
2023 DMNet: Delaunay Meshing Network for 3D Shape Representation
abstract
Recently, there has been a growing interest in learningbased explicit methods due to their ability to respect the original input and preserve details. However, the connectivity on complex structures is still difficult to infer due to the limited local shape perception, resulting in artifacts and non-watertight triangles. In this paper, we present a novel learning-based method with Delaunay triangulation to achieve high-precision reconstruction. We model the Delaunay triangulation as a dual graph, extract local geometric information from the points, and embed it into the structural representation of Delaunay triangulation in an organic way, benefiting fine-grained details reconstruction. To encourage neighborhood information interaction of edges and nodes in the graph, we introduce a local graph iteration algorithm, which is a variant of graph neural network. Moreover, a geometric constraint loss further improves the classification of tetrahedrons. Benefiting from our fully local network, a scaling strategy is designed to enable large-scale reconstruction. Experiments show that our method yields watertight and high-quality meshes. Especially for some thin structures and sharp edges, our method shows better performance than the current state-of-the-art methods. Furthermore, it has a strong adaptability to point clouds of different densities.
Chen Zhang 0043, Ganzhangqin Yuan, Wenbing Tao
ICCV2
2023 SSRNet: Scalable 3D Surface Reconstruction Network
abstract
Learning-based surface reconstruction methods have received considerable attention in recent years due to their excellent expressiveness. However, existing learning-based methods lack scalability in processing large-scale point clouds. This paper proposes a novel scalable learning-based 3D surface reconstruction method based on octree, called SSRNet. SSRNet works in a scalable reconstruction pipeline, which divides oriented point clouds into different local parts and then processes them in parallel. Accommodating this scalable design pattern, SSRNet constructs local geometric features for octree vertices. Such features comprise the relation between the vertices and the implicit surface, ensuring geometric perception. Focusing on local geometric information also enables the network to avoid the overfitting problem and generalize well on different datasets. Finally, as a learning-based method, SSRNet can process large-scale point clouds in a short time. And to further solve the efficiency problem, we provide a lightweight and efficient version that is about five times faster while maintaining reconstruction performance. Experiments show that our methods achieve state-of-the-art performance with outstanding efficiency.
Ganzhangqin Yuan, Qiancheng Fu, Zhenxing Mi, Wenbing Tao
IEEE Trans. Vis. Comput. Graph.1