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

Zhengyang Dong

dblp:220/5468 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · conflict

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
3D vision · 67% Segmentation and scene understanding · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d shape reconstruction
0.612022
Unsupervised Learning of Shape Programs with Repeatable Implicit Parts · NeurIPS 2022
Computer vision › 3D vision
3d shape representation
0.612022
Unsupervised Learning of Shape Programs with Repeatable Implicit Parts · NeurIPS 2022
Computer vision › Segmentation and scene understanding › 3d segmentation
shape segmentation
0.612022
Unsupervised Learning of Shape Programs with Repeatable Implicit Parts · NeurIPS 2022
Bioinformatics and computational biology › single-cell analysis
single-cell RNA sequencing
0.512021
netAE: semi-supervised dimensionality reduction of single-cell RNA sequencing to facilitate cell labeling · Bioinform. 2021

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

unsupervised training · 0.6matching-based objective · 0.6implicit function · 0.6network embedding · 0.5autoencoder · 0.5
YearPublicationVenuePosition
2025 HiFeFace: Dual-Branch Facial Expression Recognition with Learnable Contour Fusion
Zhengyang Dong, Guanghui Li 0001
PRCV (12)1
2024 A Multiphase Dual Attention-Based LSTM Neural Network for Industrial Product Quality Prediction
abstract
Quality prediction plays an essential role in industrial process monitoring and optimization. However, the existed methods lack of the ability to extract features in multiphase and nonlinear time series data. To improve the quality prediction accuracy and simultaneously provide some suggestion of the process mechanism, this article proposes a phased dual-attention long short-term memory (PDA-LSTM) neural network, which consists of a phase segmentation module and a prediction module. The whole series data are first divided into phases in the phase segmentation module, and individual models are subsequently constructed for each phase in the prediction module to capture distinct patterns. The LSTM network with input and temporal attention mechanism is utilized to select the most relevant variables and time steps throughout the time sequence. The proposed method is verified with a numerical example and a real injection molding process. Compared with the existed methods, the PDA-LSTM method has the advantages of higher prediction accuracy and the ability to interpret the key input variable and time points of the process data.
Zhengyang Dong, Yifeng Pan, Jianzhong Fu, Peng Zhao 0011
IEEE Trans. Ind. Informatics1
2022 Unsupervised Learning of Shape Programs with Repeatable Implicit Parts
abstract
Shape programs encode shape structures by representing object parts as subroutines and constructing the overall shape by composing these subroutines. This usually involves the reuse of subroutines for repeatable parts, enabling the modeling of correlations among shape elements such as geometric similarity. However, existing learning-based shape programs suffer from limited representation capacity, because they use coarse geometry representations such as geometric primitives and low-resolution voxel grids. Further, their training requires manually annotated ground-truth programs, which are expensive to attain. We address these limitations by proposing Shape Programs with Repeatable Implicit Parts (ProGRIP). Using implicit functions to represent parts, ProGRIP greatly boosts the representation capacity of shape programs while preserving the higher-level structure of repetitions and symmetry. Meanwhile, we free ProGRIP from any inaccessible supervised training via devising a matching-based unsupervised training objective. Our empirical studies show that ProGRIP outperforms existing structured representations in both shape reconstruction fidelity and segmentation accuracy of semantic parts.
Boyang Deng, Sumith Kulal, Zhengyang Dong, Congyue Deng, Yonglong Tian, Jiajun Wu 0001
NeurIPS3
2021 netAE: semi-supervised dimensionality reduction of single-cell RNA sequencing to facilitate cell labeling
abstract
MOTIVATION: Single-cell RNA sequencing allows us to study cell heterogeneity at an unprecedented cell-level resolution and identify known and new cell populations. Current cell labeling pipeline uses unsupervised clustering and assigns labels to clusters by manual inspection. However, this pipeline does not utilize available gold-standard labels because there are usually too few of them to be useful to most computational methods. This article aims to facilitate cell labeling with a semi-supervised method in an alternative pipeline, in which a few gold-standard labels are first identified and then extended to the rest of the cells computationally. RESULTS: We built a semi-supervised dimensionality reduction method, a network-enhanced autoencoder (netAE). Tested on three public datasets, netAE outperforms various dimensionality reduction baselines and achieves satisfactory classification accuracy even when the labeled set is very small, without disrupting the similarity structure of the original space. AVAILABILITY AND IMPLEMENTATION: The code of netAE is available on GitHub: https://github.com/LeoZDong/netAE. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Zhengyang Dong, Gil Alterovitz
Bioinform.1