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

Houjie Li

dblp:09/7817 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
8since 2021 · last 2026
0000-0002-7530-3343ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
1 paper
Rendering · 91% Image and video processing · 9%

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

TopicWeightPapersLastEvidence papers
Rendering
neural rendering
0.912025
Taming High-Resolution Auxiliary G-Buffers for Deep Supersampling of Rendered Content · IEEE Trans. Vis. Comput. Graph. 2025
Rendering
real-time rendering
0.912025
Taming High-Resolution Auxiliary G-Buffers for Deep Supersampling of Rendered Content · IEEE Trans. Vis. Comput. Graph. 2025
Rendering › antialiasing
supersampling
0.912025
Taming High-Resolution Auxiliary G-Buffers for Deep Supersampling of Rendered Content · IEEE Trans. Vis. Comput. Graph. 2025
Image and video processing › image resampling › image rescaling
image upsampling
0.312025
Taming High-Resolution Auxiliary G-Buffers for Deep Supersampling of Rendered Content · IEEE Trans. Vis. Comput. Graph. 2025

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

occlusion-aware blending · 0.9neural network · 0.9gated encoder · 0.9attention · 0.9
YearPublicationVenuePosition
2026 CFF-KDNet: Cross-scale feature fusion network with knowledge distillation for camouflaged object detection
Houjie Li
Expert Syst. Appl.2
2026 DGD-CCAFNet: Dual-level graph distillation and continuous cross-modal attention fusion network for multimodal sentiment analysis
Houjie Li, Fenglin Li 0002, Mengyin Wang
Expert Syst. Appl.1
2026 MSINet: Mantis shrimp vision-inspired network for camouflaged object detection
Houjie Li, Jing Sun 0012, Fuming Sun
Expert Syst. Appl.2
2026 HGLFFNet: Hierarchical global-local feature fusion network for facial expression recognition
Houjie Li, Fuming Sun, Mengyin Wang
Neurocomputing1
2026 SPMNet: Self-prompt mask-guided network for Camouflaged Object Detection
Mengyin Wang, Fenglin Li 0002, Houjie Li
Knowl. Based Syst.6
2025 Taming High-Resolution Auxiliary G-Buffers for Deep Supersampling of Rendered Content
abstract
High-resolution images come with rich color information and texture details. Due to the rapid upgrading of display devices and rendering technologies, high-resolution real-time rendering faces the computational overhead challenge. To address this, the current mainstream solution is to render at a lower resolution and then upsample to the target resolution by supersampling techniques. However, while many prior supersampling approaches have attempted to exploit rich rendered data such as color, depth, motion vectors at low resolution, there is little discussion on how to harness high-frequency information that is readily available in the high-resolution (HR) G-buffers of modern renders. In this article, we seek to investigate how to fully leverage information from HR G-buffers to maximize the visual quality of supersampling results. We propose a neural network for real-time supersampling of rendered content, which is based on several core designs, including gated G-buffers encoder, G-buffers attended encoder and reflection-aware loss. These designs are especially made for the sake of effectively using HR G-buffers, enabling faithful recovery of a variety of high-frequency scene details from low-resolution, highly aliased inputs. Furthermore, a simple occlusion-aware blender is proposed to efficiently rectify dis-occluded features in the warped previous frame, allowing us to better exploit history information to improve temporal stability. The experiments show that our method, equipped with strong ability to harness HR G-buffer information, significantly improves the visual fidelity of high-resolution reconstructions upon previous state-of-the-art methods, even for challenging $4 \times 4$4×4 upsampling, while still being compute-efficient.
Pengjie Wang 0001, Chengzhi Yuan, Jie Guo 0001, Xiaosong Yang, Houjie Li, Ian Stephenson, Jian Chang 0001, Ying Cao 0001
IEEE Trans. Vis. Comput. Graph.5
2024 OR2Net: Online Re-weighting Relation Network for kinship verification
abstract
Kinship verification aims to infer whether there is a kin relation between different individuals from facial images . However, popular kinship datasets are often small and suffer from data imbalance. Most existing methods build complex networks to extract features but ignore some implicit information, like family information. They use balanced datasets with fixed negative samples for training, which overlooks valuable information from multiple negative samples, leading to poor performance and robustness. To address these issues, we propose a novel end-to-end framework for kinship verification called Online Re-weighting Relation Network (OR 2 Net) based on an online re-weighting strategy of meta-learning and relation network. Our novel relation network aims to extract fine-grained features and reduce differences between generations by using multi-scale features and mining family information from kinship datasets. Additionally, we design a lightweight meta re-weighting network that uses a small, clean meta-set to guide the adaptive weighing of training examples. This is done using one-step stochastic gradient descent (SGD) based on an online re-weighting strategy from meta-learning. This helps find effective hard negative samples and reduces the imbalance problem. Extensive experiments on three public kinship verification datasets show that our proposed method is more effective compared to state-of-the-art methods. The code is publicly available on https://github.com/XinZhao-dlnu/OR2N .
Houjie Li, Mengyin Wang, Haiyu Song 0002, Fuming Sun
Expert Syst. Appl.1
2024 Few-shot anime pose transfer
abstract
Abstract In this paper, we propose a few-shot method for pose transfer of anime characters—given a source image of an anime character and a target pose, we transfer the pose of the target to the source character. Despite recent advances in pose transfer on real people images, these methods typically require large numbers of training images of different person under different poses to achieve reasonable results. However, anime character images are expensive to obtain they are created with a lot of artistic authoring. To address this, we propose a meta-learning framework for few-shot pose transfer, which can well generalize to an unseen character given just a few examples of the character. Further, we propose fusion residual blocks to align the features of the source and target so that the appearance of the source character can be well transferred to the target pose. Experiments show that our method outperforms leading pose transfer methods, especially when the source characters are not in the training set.
Pengjie Wang 0001, Chengzhi Yuan, Houjie Li, Wen Tang 0004, Xiaosong Yang
Vis. Comput.4