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

Naiyu Zhang

dblp:137/4922 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2017
0000-0001-6000-786XORCID · 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-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1

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
1 paper
Geometric modeling and processing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh generation
0.212015
Parallel Structured Mesh Generation with Disparity Maps by GPU Implementation · IEEE Trans. Vis. Comput. Graph. 2015
Geometric modeling and processing › mesh generation
structured meshing
0.212015
Parallel Structured Mesh Generation with Disparity Maps by GPU Implementation · IEEE Trans. Vis. Comput. Graph. 2015
GPUs and heterogeneous computing
GPU computing
0.112015
Parallel Structured Mesh Generation with Disparity Maps by GPU Implementation · IEEE Trans. Vis. Comput. Graph. 2015

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

self-organizing map · 0.4data decomposition · 0.4
YearPublicationVenuePosition
2017 A massively parallel neural network approach to large-scale Euclidean traveling salesman problems
Hongjian Wang 0001, Naiyu Zhang, Jean-Charles Créput
Neurocomputing2
2016 Massively parallel GPU computing for fast stereo correspondence algorithms
Hongjian Wang 0001, Naiyu Zhang, Jean-Charles Créput, Yassine Ruichek, Julien Moreau 0001
J. Syst. Archit.2
2015 Parallel Structured Mesh Generation with Disparity Maps by GPU Implementation
abstract
The goal of structured mesh is to generate a compressed representation of the 3D surface, where near objects are provided with more details than objects far from the camera, according to the disparity map. The solution is based on the Kohonens Self-Organizing Map algorithm for the benefits of its ability to generate a topological map according to a probability distribution and its potential to be a natural massive parallel algorithm. The disparity map, which stands for a density distribution that reflects the proximity of objects to the camera, is partitioned into an appropriate number of cell units, in such a way that each cell is associated to a processing unit and responsible of a certain area of the plane. The advantage of the proposed model is that it is decentralized and based on data decomposition. The required processing units and memory are with linearly increasing relationship to the problem size. Experimental results show that our GPU implementation is able to provide near real-time performance with small size disparity maps and the running time increases in a linear way with a very weak increasing coefficient. The proposed method is suitable to deal with large scale problems in a massively parallel way.
Hongjian Wang 0001, Naiyu Zhang, Jean-Charles Créput, Julien Moreau 0001, Yassine Ruichek
IEEE Trans. Vis. Comput. Graph.2
2013 Cellular GPU Model for Structured Mesh Generation and Its Application to the Stereo-Matching Disparity Map
abstract
This paper presents a cellular GPU model for structured mesh generation according to an input stereo-matching disparity map. Here, the disparity map stands for a density distribution that reflects the proximity of objects to the camera in 3D space. The meshing process consists in covering such data density distribution with a topological structured hexagonal grid that adapts itself and deforms according to the density values. The goal is to generate a compressed mesh where the nearest objects are provided with more details than objects which are far from the camera. The solution we propose is based on the Kohonen's Self-Organizing Map learning algorithm for the benefit of its ability to generate a topological map according to a probability distribution and its ability to be a natural massive parallel algorithm. We propose a GPU parallel model and its implantation of the SOM standard algorithm, and present experiments on a set of standard stereo-matching disparity map benchmarks.
Naiyu Zhang, Hongjian Wang 0001, Jean-Charles Créput, Julien Moreau 0001, Yassine Ruichek
ISM1