Demo Data from VLDB 2026 / reviewers in the wild / expert
Renliang Weng
dblp:134/1786
· DBLP profile ↗
7ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 6 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.
| Artificial intelligence
5 papers |
Face, body and person analysis · 41% 3D vision · 20% Video understanding and tracking · 12% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › multi-view geometry
camera geometry |
0.6 | 1 | 2022 | Ray3D: ray-based 3D human pose estimation for monocular absolute 3D localization · CVPR 2022 |
Computer vision › Face, body and person analysis
human pose estimation |
0.6 | 1 | 2022 | Ray3D: ray-based 3D human pose estimation for monocular absolute 3D localization · CVPR 2022 |
Machine learning › Graph learning › graph neural network
graph convolutional network |
0.5 | 1 | 2021 | Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021 |
Computer vision › Video understanding and tracking
multi-object tracking |
0.5 | 1 | 2021 | Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021 |
Computer vision › Image recognition and object detection › object detection › proposal-based detection
proposal classification |
0.5 | 1 | 2021 | Learning a Proposal Classifier for Multiple Object Tracking · CVPR 2021 |
Computer vision › Face, body and person analysis
face recognition |
0.4 | 2 | 2016 | Robust Point Set Matching for Partial Face Recognition · IEEE Trans. Image Process. 2016 Robust Feature Set Matching for Partial Face Recognition · ICCV 2013 |
Computer vision › Face, body and person analysis › face recognition › occluded face recognition
partial face recognition |
0.4 | 2 | 2016 | Robust Point Set Matching for Partial Face Recognition · IEEE Trans. Image Process. 2016 Robust Feature Set Matching for Partial Face Recognition · ICCV 2013 |
Computer vision › Face, body and person analysis
face alignment |
0.2 | 1 | 2016 | Learning Cascaded Deep Auto-Encoder Networks for Face Alignment · IEEE Trans. Multim. 2016 |
Computer vision › 3D vision › shape matching
point set matching |
0.2 | 1 | 2016 | Robust Point Set Matching for Partial Face Recognition · IEEE Trans. Image Process. 2016 |
Machine learning › Trustworthy machine learning › robustness › corruption robustness
occlusion robustness |
0.0 | 1 | 2013 | Robust Feature Set Matching for Partial Face Recognition · ICCV 2013 |
Methods — techniques the papers use, named apart from their topics
ray-based representation · 0.6graph convolutional network · 0.5graph clustering · 0.5local texture feature extraction · 0.2keypoint detection · 0.2deep autoencoder · 0.2cascade regression · 0.2robust point matching · 0.2metric learning · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | 3SD: Self-Supervised Saliency Detection With No LabelsabstractWe present a conceptually simple self-supervised method for saliency detection. Our method generates and uses pseudo-ground truth labels for training. The generated pseudo-GT labels don’t require any kind of human annotations (e.g., pixel-wise labels or weak labels like scribbles). Recent works show that features extracted from classification tasks provide important saliency cues like structure and semantic information of salient objects in the image. Our method, called 3SD, exploits this idea by adding a branch for a self-supervised classification task in parallel with salient object detection, to obtain class activation maps (CAM maps). These CAM maps along with the edges of the input image are used to generate the pseudo-GT saliency maps to train our 3SD network. Specifically, we propose a contrastive learning-based training on multiple image patches for the classification task. We show the multi-patch classification with contrastive loss improves the quality of the CAM maps compared to naive classification on the entire image. Experiments on six benchmark datasets demonstrate that without any labels, our 3SD method outperforms all existing weakly supervised and unsupervised methods, and its performance is on par with the fully-supervised methods. Rajeev Yasarla, Renliang Weng, Wongun Choi, Vishal M. Patel, Amir Sadeghian |
WACV | 2 |
| 2023 | IIP-Transformer: Intra-Inter-Part Transformer for Skeleton-Based Action RecognitionabstractRecently, body part as an intuitive movement unit has received increasing attention in skeleton-based action. However, the part-level embedding is hard to be fully exploited, especially for fine-grained actions, as the body joints are aggregated into parts. To address this problem, we propose a novel transformer-based network (IIP-Transformer). Different from previous models that rely on specially designed partition method, our proposed IIPA mechanism which incorporates joint-level (intra-part) and part-level (inter-part) interactions simultaneously is the keypoint for IIP-Transformer to fully exploit part-level data, making considerable improvements in both coarse-grained and fine-grained action recognition. Ablation studies on three typical partition methods show that IIP-Transformer is a relatively general solution for part-level data and thus we could choose the simplest hand-craft partition embedding to significantly reduce computational complexity and model size. Besides, The proposed IIP-Transformer exceeds the state-of-the-art methods with much less computational complexity on NTU RGB+D, NTU RGB+D120 and NW-UCLA datasets. Qingtian Wang, Shuze Shi, Jiabin He, Jianlin Peng, Tingxi Liu, Renliang Weng |
IEEE Big Data | 6 |
| 2022 | Ray3D: ray-based 3D human pose estimation for monocular absolute 3D localizationabstractIn this paper, we propose a novel monocular ray-based 3D (Ray3D) absolute human pose estimation with calibrated camera. Accurate and generalizable absolute 3D human pose estimation from monocular 2D pose input is an ill-posed problem. To address this challenge, we convert the input from pixel space to 3D normalized rays. This conversion makes our approach robust to camera intrinsic parameter changes. To deal with the in-the-wild camera extrinsic parameter variations, Ray3D explicitly takes the camera extrinsic parameters as an input and jointly models the distribution between the 3D pose rays and camera extrinsic parameters. This novel network design is the key to the outstanding generalizability of Ray3D approach. To have a comprehensive understanding of how the camera intrinsic and extrinsic parameter variations affect the accuracy of absolute 3D key-point localization, we conduct in-depth systematic experiments on three single person 3D benchmarks as well as one synthetic benchmark. These experiments demonstrate that our method significantly outperforms existing state-of-the-art models. Our code and the synthetic dataset are available at https://github.com/YxZhxn/Ray3D. Fenghai Li, Renliang Weng, Wongun Choi |
CVPR | 3 |
| 2021 | Learning a Proposal Classifier for Multiple Object TrackingabstractThe recent trend in multiple object tracking (MOT) is heading towards leveraging deep learning to boost the tracking performance. However, it is not trivial to solve the data-association problem in an end-to-end fashion. In this paper, we propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph. This framework is similar to the two-stage object detector Faster RCNN, and can solve the MOT problem in a data-driven way. For proposal generation, we propose an iterative graph clustering method to reduce the computational cost while maintaining the quality of the generated proposals. For proposal scoring, we deploy a trainable graph-convolutional-network (GCN) to learn the structural patterns of the generated proposals and rank them according to the estimated quality scores. For trajectory inference, a simple deoverlapping strategy is adopted to generate tracking output while complying with the constraints that no detection can be assigned to more than one track. We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks. Our code is available at https://github.com/daip13/LPC_MOT.git. Renliang Weng, Wongun Choi, Changshui Zhang, Zhangping He |
CVPR | 2 |
| 2016 | Robust Point Set Matching for Partial Face RecognitionabstractOver the past three decades, a number of face recognition methods have been proposed in computer vision, and most of them use holistic face images for person identification. In many real-world scenarios especially some unconstrained environments, human faces might be occluded by other objects, and it is difficult to obtain fully holistic face images for recognition. To address this, we propose a new partial face recognition approach to recognize persons of interest from their partial faces. Given a pair of gallery image and probe face patch, we first detect keypoints and extract their local textural features. Then, we propose a robust point set matching method to discriminatively match these two extracted local feature sets, where both the textural information and geometrical information of local features are explicitly used for matching simultaneously. Finally, the similarity of two faces is converted as the distance between these two aligned feature sets. Experimental results on four public face data sets show the effectiveness of the proposed approach. Renliang Weng, Jiwen Lu, Yap-Peng Tan |
IEEE Trans. Image Process. | 1 |
| 2016 | Learning Cascaded Deep Auto-Encoder Networks for Face AlignmentabstractIn this paper, we propose a new cascaded deep auto-encoder networks (CDAN) approach for face alignment. Our framework consists of a global exemplar-based deep auto-encoder network (GEDAN) and a series of localized deep auto-encoder networks (LDAN) in a cascaded fashion. The global network takes a low-resolution holistic facial image as input and generates a preliminary facial landmark configuration. The following localized networks sample pose-indexed local features around current landmark positions, and refine the landmark positions with increasingly higher image resolutions. Our network architectures are designed to achieve greater robustness against pose variations as well as higher landmark estimation accuracy. Experimental results on three datasets show that the proposed approach achieves superior alignment accuracy with real-time speed. Renliang Weng, Jiwen Lu, Yap-Peng Tan, Jie Zhou 0001 |
IEEE Trans. Multim. | 1 |
| 2013 | Robust Feature Set Matching for Partial Face RecognitionabstractOver the past two decades, a number of face recognition methods have been proposed in the literature. Most of them use holistic face images to recognize people. However, human faces are easily occluded by other objects in many real-world scenarios and we have to recognize the person of interest from his/her partial faces. In this paper, we propose a new partial face recognition approach by using feature set matching, which is able to align partial face patches to holistic gallery faces automatically and is robust to occlusions and illumination changes. Given each gallery image and probe face patch, we first detect key points and extract their local features. Then, we propose a Metric Learned Extended Robust Point Matching (MLERPM) method to discriminatively match local feature sets of a pair of gallery and probe samples. Lastly, the similarity of two faces is converted as the distance between two feature sets. Experimental results on three public face databases are presented to show the effectiveness of the proposed approach. Renliang Weng, Jiwen Lu, Junlin Hu 0001, Gao Yang 0001, Yap-Peng Tan |
ICCV | 1 |