← Search

Zhengfa Liang

8 accepted papers

2025

Gated Cross-Attention Network for Depth Completion

ICASSP 2025accepted

Depth completion is a popular research direction in the field of depth estimation. The fusion of color and depth features is the critical challenge in this task, mainly due to the asymmetry between the rich scene details in color images and the sparse pixels in depth maps. To tackle this issue, we d…

Cited by 0SourceScholar
2021

Multi-Scale Cascade Disparity Refinement Stereo Network

ICASSP 2021accepted

Stereo matching has attracted much attention in recent years. Traditional methods can quickly generate a disparity result, but the accuracy is low. On the contrary, methods based on neural networks can achieve a high accuracy level, but they are difficult to reach the real-time level. Therefore, thi…

Cited by 0SourceScholar
2021

Multi-Scale Cost Volumes Cascade Network for Stereo Matching

ICRA 2021poster

Stereo matching is essential for robot navigation. However, the accuracy of current widely used traditional methods is low, while methods based on CNN need expensive computational cost and running time. This is because different cost volumes play a crucial role in balancing speed and accuracy. Thus…

Cited by 8SourceScholar
2019

Learning Parallax Attention for Stereo Image Super-Resolution

CVPR 2019poster

Stereo image pairs can be used to improve the performance of super-resolution (SR) since additional information is provided from a second viewpoint. However, it is challenging to incorporate this information for SR since disparities between stereo images vary significantly. In this paper, we propose…

Cited by 327PDFcodeScholar
2019

Multi-Level Context Ultra-Aggregation for Stereo Matching

CVPR 2019poster

Exploiting multi-level context information to cost volume can improve the performance of learning-based stereo matching methods. In recent years, 3-D Convolution Neural Networks (3-D CNNs) show the advantages in regularizing cost volume but are limited by unary features learning in matching cost com…

Cited by 137PDFScholar
2018

Learning for Disparity Estimation Through Feature Constancy

CVPR 2018poster

Stereo matching algorithms usually consist of four steps, including matching cost calculation, matching cost aggregation, disparity calculation, and disparity refinement. Existing CNN-based methods only adopt CNN to solve parts of the four steps, or use different networks to deal with different step…