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

Wenrui Hu

dblp:140/7531 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
1since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 2 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.

Computer graphics and multimedia
2 papers
Image and video processing · 82% Multimedia analysis and retrieval · 18%

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

TopicWeightPapersLastEvidence papers
Image and video processing
background subtraction
0.312017
Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition · IEEE Trans. Image Process. 2017
Image and video processing › motion analysis
moving object detection
0.312017
Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition · IEEE Trans. Image Process. 2017
Multimedia analysis and retrieval
video analysis
0.312017
Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition · IEEE Trans. Image Process. 2017
Image and video processing › image restoration › adverse weather image restoration
atmospheric turbulence mitigation
0.212016
Removing Turbulence Effect via Hybrid Total Variation and Deformation-Guided Kernel Regression · IEEE Trans. Image Process. 2016
Image and video processing › image restoration › image deblurring
blind deconvolution
0.212016
Removing Turbulence Effect via Hybrid Total Variation and Deformation-Guided Kernel Regression · IEEE Trans. Image Process. 2016
Image and video processing
image restoration
0.212016
Removing Turbulence Effect via Hybrid Total Variation and Deformation-Guided Kernel Regression · IEEE Trans. Image Process. 2016

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

total variation · 0.3tensor decomposition · 0.3low-rank and sparse representation · 0.3low-rank decomposition · 0.2hybrid total variation · 0.2deformation-guided kernel regression · 0.2
YearPublicationVenuePosition
2024 TDAD: Trident Distillations for Anomaly Detection
abstract
The problem of overgeneralization is widespread in unsupervised anomaly detection methods, especially those that rely on knowledge distillation techniques. This problem arises because the student network has a strong tendency to mimic its teacher, even for unseen anomaly patterns, resulting in erroneous predictions. To tackle this issue, we have developed Trident Distillation Anomaly Detection (TDAD), which uses a trident distillation process in a self-supervised masked training paradigm. TDAD incorporates synthetic anomalies and seamlessly blends general knowledge distillation (GKD) with novel self-consistency distillation (SCD) and discrepancy maximization distillation (DMD) techniques. The synergistic optimization of these components widens the gap between abnormal feature distributions in the teacher and student domains, while maintaining coherence within the normal distributions, thereby enhancing prediction reliability. Extensive experiments conducted on the MVTec dataset demonstrate that TDAD effectively mitigates overgeneralization, achieving superior anomaly detection performance compared to its competitors.
Wenrui Hu
ICIP1
2018 Nonlocal image denoising via adaptive tensor nuclear norm minimization
Wenrui Hu, Tianyu Jin, Zhonglei Mei
Neural Comput. Appl.2
2017 Discriminative Reverse Sparse Tracking via Weighted Multitask Learning
abstract
Multitask learning has shown great potentiality for visual tracking under a particle filter framework. However, the recent multitask trackers, which exploit the similarity between all candidates by imposing group sparsity on the candidate representations, have a limitation in robustness due to the diverse sampling of candidates. To deal with this issue, we propose a discriminative reverse sparse tracker via weighted multitask learning. Our positive and negative templates are retained from the target observations and the background, respectively. Here, the templates are reversely represented via the candidates, and the representation of each positive template is viewed as a single task. Compared with existing multitask trackers, the proposed algorithm has the following advantages. First, we regularize the target representations with the ℓ2,1-norm to exploit the similarity shared by the positive templates, which is reasonable because of the target appearance consistency in the tracking process. Second, the valuable prior relationship between the candidates and the templates is introduced into the representation model by a weighted multitask learning scheme. Third, both target information and background information are integrated to generate discriminative scores for enhancing the proposed tracker. The experimental results on challenging sequences show that the proposed algorithm is effective and performs favorably against 12 state-of-the-art trackers.
Yehui Yang, Wenrui Hu, Wensheng Zhang 0002, Tianzhu Zhang 0001, Yuan Xie 0006
IEEE Trans. Circuits Syst. Video Technol.2
2017 Temporal Restricted Visual Tracking Via Reverse-Low-Rank Sparse Learning
abstract
An effective representation model, which aims to mine the most meaningful information in the data, plays an important role in visual tracking. Some recent particle-filter-based trackers achieve promising results by introducing the low-rank assumption into the representation model. However, their assumed low-rank structure of candidates limits the robustness when facing severe challenges such as abrupt motion. To avoid the above limitation, we propose a temporal restricted reverse-low-rank learning algorithm for visual tracking with the following advantages: 1) the reverse-low-rank model jointly represents target and background templates via candidates, which exploits the low-rank structure among consecutive target observations and enforces the temporal consistency of target in a global level; 2) the appearance consistency may be broken when target suffers from sudden changes. To overcome this issue, we propose a local constraint via 11,2 mixed-norm, which can not only ensures the local consistency of target appearance, but also tolerates the sudden changes between two adjacent frames; and 3) to alleviate the inference of unreasonable representation values due to outlier candidates, an adaptive weighted scheme is designed to improve the robustness of the tracker. By evaluating on 26 challenge video sequences, the experiments show the effectiveness and favorable performance of the proposed algorithm against 12 state-of-the-art visual trackers.
Yehui Yang, Wenrui Hu, Yuan Xie 0006, Wensheng Zhang 0002, Tianzhu Zhang 0001
IEEE Trans. Cybern.2
2017 Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition
abstract
In this paper, we propose a new low-rank and sparse representation model for moving object detection. The model preserves the natural space-time structure of video sequences by representing them as three-way tensors. Then, it operates the low-rank background and sparse foreground decomposition in the tensor framework. On the one hand, we use the tensor nuclear norm to exploit the spatio-temporal redundancy of background based on the circulant algebra. On the other, we use the new designed saliently fused-sparse regularizer (SFS) to adaptively constrain the foreground with spatio-temporal smoothness. To refine the existing foreground smooth regularizers, the SFS incorporates the local spatio-temporal geometric structure information into the tensor total variation by using the 3D locally adaptive regression kernel (3D-LARK). What is more, the SFS further uses the 3D-LARK to compute the space-time motion saliency of foreground, which is combined with the l1norm and improves the robustness of foreground extraction. Finally, we solve the proposed model with globally optimal guarantee. Extensive experiments on challenging well-known data sets demonstrate that our method significantly outperforms the state-of-the-art approaches and works effectively on a wide range of complex scenarios.
Wenrui Hu, Yehui Yang, Wensheng Zhang 0002, Yuan Xie 0006
IEEE Trans. Image Process.1
2017 The Twist Tensor Nuclear Norm for Video Completion
abstract
In this paper, we propose a new low-rank tensor model based on the circulant algebra, namely, twist tensor nuclear norm (t-TNN). The twist tensor denotes a three-way tensor representation to laterally store 2-D data slices in order. On one hand, t-TNN convexly relaxes the tensor multirank of the twist tensor in the Fourier domain, which allows an efficient computation using fast Fourier transform. On the other, t-TNN is equal to the nuclear norm of block circulant matricization of the twist tensor in the original domain, which extends the traditional matrix nuclear norm in a block circulant way. We test the t-TNN model on a video completion application that aims to fill missing values and the experiment results validate its effectiveness, especially when dealing with video recorded by a nonstationary panning camera. The block circulant matricization of the twist tensor can be transformed into a circulant block representation with nuclear norm invariance. This representation, after transformation, exploits the horizontal translation relationship between the frames in a video, and endows the t-TNN model with a more powerful ability to reconstruct panning videos than the existing state-of-the-art low-rank models.
Wenrui Hu, Dacheng Tao, Wensheng Zhang 0002, Yuan Xie 0006, Yehui Yang
IEEE Trans. Neural Networks Learn. Syst.1
2016 Removing Turbulence Effect via Hybrid Total Variation and Deformation-Guided Kernel Regression
abstract
It remains a challenge to simultaneously remove geometric distortion and space-time-varying blur in frames captured through a turbulent atmospheric medium. To solve, or at least reduce these effects, we propose a new scheme to recover a latent image from observed frames by integrating a new hybrid total variation model and deformation-guided spatial-temporal kernel regression. The proposed scheme first constructs a high-quality reference image from the observed frames using low-rank decomposition. Then, to generate an improved registered sequence, the reference image is iteratively optimized using a variational model containing the combined regularization of local and non-local total variations. The proposed optimization algorithm efficiently solves this model with convergence guarantee. Next, to reduce blur variation, deformation-guided spatial-temporal kernel regression is carried out to fuse the registered sequence into one image by introducing the concept of the near-stationary patch. Applying a blind deconvolution algorithm to the fused image produces the final output. Extensive experimental testing shows, both qualitatively and quantitatively, that the proposed method can effectively alleviate distortion, and blur and recover details of the original scene compared to the state-of-the-art methods.
Yuan Xie 0006, Wensheng Zhang 0002, Dacheng Tao, Wenrui Hu, Yanyun Qu, Hanzi Wang
IEEE Trans. Image Process.4
2015 Global Coupled Learning and Local Consistencies Ensuring for sparse-based tracking
Yehui Yang, Yuan Xie 0006, Wensheng Zhang 0002, Wenrui Hu, Yuanhua Tan
Neurocomputing4
2014 A total variation based nonrigid image registration by combining parametric and non-parametric transformation models
Wenrui Hu, Yuan Xie 0006, Lin Li 0014, Wensheng Zhang 0002
Neurocomputing1
2014 Single image super-resolution using combined total variation regularization by split Bregman Iteration
Lin Li 0014, Yuan Xie 0006, Wenrui Hu, Wensheng Zhang 0002
Neurocomputing3