MLMinhua Li
Minhua Li
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Minhua Li has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Qingling Chang
School of Electronics and Information Engineering, Wuyi University, Jiangmen, China
1 shared publication Shiting Xu
Zhuhai 4Dage Network Technology, Zhuhai, China
1 shared publication- Xinglin Liu
Faculty of Intelligent Manufacturing, Wuyi University, Jiangmen, China
1 shared publication - Yan Cui
School of Electronics and Information Engineering, Wuyi University, Jiangmen, China
1 shared publication Yuhan Wang
Jiangsu University of Science and Technology, Zhenjiang, China
1 shared publication
Latest Publications
- Open Access
- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 100128-100136
Stereo Matching With Multiscale Hybrid Cost Volume
Stereo matching estimates the disparity between a pair of rectified left and right images. It plays an important role in robot navigation, autonomous driving, and other related tasks. Nowadays, convolutional neural networks based on deep learning have greatly improved the performance of stereo matching. However, there are still many challenges. One of them is that current stereo models mostly generate a single scale cost volume based on costly 3D convolutions method or quick 2D convolutions method, but neither of these two methods can achieve a fair trade-off between quality and time. In this paper, we propose to construct the multi-scale hybrid cost volume which aims at achieving fast speed while maintaining comparable accuracy. Concretely, we generate a correlation cost volume and a concatenation cost volume respectively, and then integrate together to form a hybrid cost volume which can significantly improve the accuracy and reduce the computational complexity. At the multi-scale level, we generate three hybrid cost volumes at different scales and then aggregate them by 2D convolutions which are faster than 3D convolutions. In addition, we adopt 2D CNN stacked hourglass with fused cost volume for cost aggregation. Specifically, the proposed method provides competitive performance with state-of-the-art methods, while being faster than most top-performing methods (e.g.,$3.7\times $ than PSMNet,$8.1\times $ than GCNet,$16.3\times $ than GANet). Extensive experiments of our model on the SceneFlow, KITTI 2012, and KITTI 2015 datasets demonstrate the competitiveness of our results.- 16 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 100128-100136
Open AccessStereo Matching With Multiscale Hybrid Cost Volume
Stereo matching estimates the disparity between a pair of rectified left and right images. It plays an important role in robot navigation, autonomous driving, and other related tasks. Nowadays, convolutional neural networks based on deep learning have greatly improved the performance of stereo matching. However, there are still many challenges. One of them is that current stereo models mostly generate a single scale cost volume based on costly 3D convolutions method or quick 2D convolutions method, but neither of these two methods can achieve a fair trade-off between quality and time. In this paper, we propose to construct the multi-scale hybrid cost volume which aims at achieving fast speed while maintaining comparable accuracy. Concretely, we generate a correlation cost volume and a concatenation cost volume respectively, and then integrate together to form a hybrid cost volume which can significantly improve the accuracy and reduce the computational complexity. At the multi-scale level, we generate three hybrid cost volumes at different scales and then aggregate them by 2D convolutions which are faster than 3D convolutions. In addition, we adopt 2D CNN stacked hourglass with fused cost volume for cost aggregation. Specifically, the proposed method provides competitive performance with state-of-the-art methods, while being faster than most top-performing methods (e.g.,$3.7\times $ than PSMNet,$8.1\times $ than GCNet,$16.3\times $ than GANet). Extensive experiments of our model on the SceneFlow, KITTI 2012, and KITTI 2015 datasets demonstrate the competitiveness of our results.