Yuzhang Gu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yuzhang Gu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Xiaolin Zhang
Bio-Vision System Laboratory, State Key Laboratory of Transducer Technology, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai 200050, P. R. China
3 shared publications- Keli Hu
Department of Computer Science and Engineering, Shaoxing University, Shaoxing, China
2 shared publications Shoumeng Qiu
Chinese Academy of Sciences
2 shared publications- Xiaolin Zhang
Bionic Vision System Laboratory, State Key Laboratory of Transducer Technology, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China
2 shared publications - Changxing Fan
Department of Computer Science, Shaoxing University, Shaoxing, China
1 shared publication - Chongyi Ye
Bionic Vision System Laboratory, State Key Laboratory of Transducer Technology, Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences
1 shared publication
Latest Publications
- 27 October 2022
- Published by Springer Nature
- p. 707-720
WTB-LLL: A Watercraft Tracking Benchmark Derived by Low-Light-Level Camera
- 27 October 2022
- Published by Springer Nature
- p. 707-720
WTB-LLL: A Watercraft Tracking Benchmark Derived by Low-Light-Level Camera
- 14 January 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 36 (03)
Feature Projection and SVR-Based Model Update for Object Tracking
Siamese network-based object tracking algorithms have recently gained popularity due to continuous improvement in tracking accuracy and robustness. However, these trackers are often limited by inefficient initialization and unstable online update. The model drift accumulates as more frames are processed. To address the above issues, this paper introduced a method that combines both deep learning and conventional regression algorithms (SVR, Support Vector Regression). Specifically, we propose a feature projection algorithm, which can effectively reduce the dimension of the features extracted from deep neural networks and improve the distinguishability of them at the same time. To make the features more robust for SVR training, we further propose two feature aggregation methods at both the channel level and the spatial level. We update the SVR model online instead of the deep neural network to make the tracking process more robust. Extensive experiments on four challenging benchmarks indicate that our proposed tracker is superior to baseline methods both qualitatively and quantitatively.
- 14 January 2022
- Published by World Scientific Pub Co Pte Ltd in International Journal of Pattern Recognition and Artificial Intelligence
- Vol. 36 (03)
Feature Projection and SVR-Based Model Update for Object Tracking
Siamese network-based object tracking algorithms have recently gained popularity due to continuous improvement in tracking accuracy and robustness. However, these trackers are often limited by inefficient initialization and unstable online update. The model drift accumulates as more frames are processed. To address the above issues, this paper introduced a method that combines both deep learning and conventional regression algorithms (SVR, Support Vector Regression). Specifically, we propose a feature projection algorithm, which can effectively reduce the dimension of the features extracted from deep neural networks and improve the distinguishability of them at the same time. To make the features more robust for SVR training, we further propose two feature aggregation methods at both the channel level and the spatial level. We update the SVR model online instead of the deep neural network to make the tracking process more robust. Extensive experiments on four challenging benchmarks indicate that our proposed tracker is superior to baseline methods both qualitatively and quantitatively.
- 7 September 2021
- Published by Springer Nature
- p. C1
Correction to: BFRIFP: Brain Functional Reorganization Inspired Filter Pruning
- 7 September 2021
- Published by Springer Nature
- p. C1
Correction to: BFRIFP: Brain Functional Reorganization Inspired Filter Pruning
- 7 September 2021
- Published by Springer Nature
- p. 16-28
BFRIFP: Brain Functional Reorganization Inspired Filter Pruning
- 7 September 2021
- Published by Springer Nature
- p. 16-28
BFRIFP: Brain Functional Reorganization Inspired Filter Pruning
- Open Access
- 6 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 10040-10047
PGCN-TCA: Pseudo Graph Convolutional Network With Temporal and Channel-Wise Attention for Skeleton-Based Action Recognition
Skeleton-based human action recognition has become an active research area in recent years. The key to this task is to fully explore both spatial and temporal features. Recently, GCN-based methods modeling the human body skeletons as spatial-temporal graphs, have achieved remarkable performances. However, most GCN-based methods use a fixed adjacency matrix defined by the dataset, which can only capture the structural information provided by joints directly connected through bones and ignore the dependencies between distant joints that are not connected. In addition, such a fixed adjacency matrix used in all layers leads to the network failing to extract multi-level semantic features. In this paper we propose a pseudo graph convolutional network with temporal and channel-wise attention (PGCN-TCA) to solve this problem. The fixed normalized adjacent matrix is substituted with a learnable matrix. In this way, the matrix can learn the dependencies between connected joints and joints that are not physically connected. At the same time, learnable matrices in different layers can help the network capture multi-level features in spatial domain. Moreover, Since frames and input channels that contain outstanding characteristics play significant roles in distinguishing the action from others, we propose a mixed temporal and channel-wise attention. Our method achieves comparable performances to state-of-the-art methods on NTU-RGB+D and HDM05 datasets.
- 6 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 10040-10047
Open AccessPGCN-TCA: Pseudo Graph Convolutional Network With Temporal and Channel-Wise Attention for Skeleton-Based Action Recognition
Skeleton-based human action recognition has become an active research area in recent years. The key to this task is to fully explore both spatial and temporal features. Recently, GCN-based methods modeling the human body skeletons as spatial-temporal graphs, have achieved remarkable performances. However, most GCN-based methods use a fixed adjacency matrix defined by the dataset, which can only capture the structural information provided by joints directly connected through bones and ignore the dependencies between distant joints that are not connected. In addition, such a fixed adjacency matrix used in all layers leads to the network failing to extract multi-level semantic features. In this paper we propose a pseudo graph convolutional network with temporal and channel-wise attention (PGCN-TCA) to solve this problem. The fixed normalized adjacent matrix is substituted with a learnable matrix. In this way, the matrix can learn the dependencies between connected joints and joints that are not physically connected. At the same time, learnable matrices in different layers can help the network capture multi-level features in spatial domain. Moreover, Since frames and input channels that contain outstanding characteristics play significant roles in distinguishing the action from others, we propose a mixed temporal and channel-wise attention. Our method achieves comparable performances to state-of-the-art methods on NTU-RGB+D and HDM05 datasets.
- Open Access
Robust Stereo Visual Odometry Using Improved RANSAC-Based Methods for Mobile Robot Localization
In this paper, we present a novel approach for stereo visual odometry with robust motion estimation that is faster and more accurate than standard RANSAC (Random Sample Consensus). Our method makes improvements in RANSAC in three aspects: first, the hypotheses are preferentially generated by sampling the input feature points on the order of ages and similarities of the features; second, the evaluation of hypotheses is performed based on the SPRT (Sequential Probability Ratio Test) that makes bad hypotheses discarded very fast without verifying all the data points; third, we aggregate the three best hypotheses to get the final estimation instead of only selecting the best hypothesis. The first two aspects improve the speed of RANSAC by generating good hypotheses and discarding bad hypotheses in advance, respectively. The last aspect improves the accuracy of motion estimation. Our method was evaluated in the KITTI (Karlsruhe Institute of Technology and Toyota Technological Institute) and the New Tsukuba dataset. Experimental results show that the proposed method achieves better results for both speed and accuracy than RANSAC.
Open AccessRobust Stereo Visual Odometry Using Improved RANSAC-Based Methods for Mobile Robot Localization
In this paper, we present a novel approach for stereo visual odometry with robust motion estimation that is faster and more accurate than standard RANSAC (Random Sample Consensus). Our method makes improvements in RANSAC in three aspects: first, the hypotheses are preferentially generated by sampling the input feature points on the order of ages and similarities of the features; second, the evaluation of hypotheses is performed based on the SPRT (Sequential Probability Ratio Test) that makes bad hypotheses discarded very fast without verifying all the data points; third, we aggregate the three best hypotheses to get the final estimation instead of only selecting the best hypothesis. The first two aspects improve the speed of RANSAC by generating good hypotheses and discarding bad hypotheses in advance, respectively. The last aspect improves the accuracy of motion estimation. Our method was evaluated in the KITTI (Karlsruhe Institute of Technology and Toyota Technological Institute) and the New Tsukuba dataset. Experimental results show that the proposed method achieves better results for both speed and accuracy than RANSAC.
- Open Access
- 2 October 2017
- Published by MDPI AG in Information
- Vol. 8 (4) , 122
Neutrosophic Similarity Score Based Weighted Histogram for Robust Mean-Shift Tracking
Visual object tracking is a critical task in computer vision. Challenging things always exist when an object needs to be tracked. For instance, background clutter is one of the most challenging problems. The mean-shift tracker is quite popular because of its efficiency and performance in a range of conditions. However, the challenge of background clutter also disturbs its performance. In this article, we propose a novel weighted histogram based on neutrosophic similarity score to help the mean-shift tracker discriminate the target from the background. Neutrosophic set (NS) is a new branch of philosophy for dealing with incomplete, indeterminate, and inconsistent information. In this paper, we utilize the single valued neutrosophic set (SVNS), which is a subclass of NS to improve the mean-shift tracker. First, two kinds of criteria are considered as the object feature similarity and the background feature similarity, and each bin of the weight histogram is represented in the SVNS domain via three membership functions T(Truth), I(indeterminacy), and F(Falsity). Second, the neutrosophic similarity score function is introduced to fuse those two criteria and to build the final weight histogram. Finally, a novel neutrosophic weighted mean-shift tracker is proposed. The proposed tracker is compared with several mean-shift based trackers on a dataset of 61 public sequences. The results revealed that our method outperforms other trackers, especially when confronting background clutter.
- 2 October 2017
- Published by MDPI AG in Information
- Vol. 8 (4) , 122
Open AccessNeutrosophic Similarity Score Based Weighted Histogram for Robust Mean-Shift Tracking
Visual object tracking is a critical task in computer vision. Challenging things always exist when an object needs to be tracked. For instance, background clutter is one of the most challenging problems. The mean-shift tracker is quite popular because of its efficiency and performance in a range of conditions. However, the challenge of background clutter also disturbs its performance. In this article, we propose a novel weighted histogram based on neutrosophic similarity score to help the mean-shift tracker discriminate the target from the background. Neutrosophic set (NS) is a new branch of philosophy for dealing with incomplete, indeterminate, and inconsistent information. In this paper, we utilize the single valued neutrosophic set (SVNS), which is a subclass of NS to improve the mean-shift tracker. First, two kinds of criteria are considered as the object feature similarity and the background feature similarity, and each bin of the weight histogram is represented in the SVNS domain via three membership functions T(Truth), I(indeterminacy), and F(Falsity). Second, the neutrosophic similarity score function is introduced to fuse those two criteria and to build the final weight histogram. Finally, a novel neutrosophic weighted mean-shift tracker is proposed. The proposed tracker is compared with several mean-shift based trackers on a dataset of 61 public sequences. The results revealed that our method outperforms other trackers, especially when confronting background clutter.
- Open Access
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (3) , 781-784
Stereo Matching Based on Efficient Image-Guided Cost Aggregation
Cost aggregation is one of the most important steps in local stereo matching, while it is difficult to fulfill both accuracy and speed. In this letter, a novel cost aggregation, consisting of guidance image, fast aggregation function and simplified scan-line optimization, is developed. Experiments demonstrate that the proposed algorithm has competitive performance compared with the state-of-art aggregation methods on 32 Middlebury stereo datasets in both accuracy and speed.
- 1 January 2016
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E99.D (3) , 781-784
Open AccessStereo Matching Based on Efficient Image-Guided Cost Aggregation
Cost aggregation is one of the most important steps in local stereo matching, while it is difficult to fulfill both accuracy and speed. In this letter, a novel cost aggregation, consisting of guidance image, fast aggregation function and simplified scan-line optimization, is developed. Experiments demonstrate that the proposed algorithm has competitive performance compared with the state-of-art aggregation methods on 32 Middlebury stereo datasets in both accuracy and speed.