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

Jinliang Zang

dblp:217/2513 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 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
3 papers
3D vision · 84% Efficient and distributed learning · 16%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › stereo vision
stereo matching
2.632025
BANet: Bilateral Aggregation Network for Mobile Stereo Matching · ICCV 2025
ZeroStereo: Zero-Shot Stereo Matching from Single Images · ICCV 2025
MonSter: Marry Monodepth to Stereo Unleashes Power · CVPR 2025
Computer vision › 3D vision › stereo vision › stereo matching
cost aggregation
0.912025
BANet: Bilateral Aggregation Network for Mobile Stereo Matching · ICCV 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
BANet: Bilateral Aggregation Network for Mobile Stereo Matching · ICCV 2025
Computer vision › 3D vision › depth estimation
monocular depth estimation
0.912025
MonSter: Marry Monodepth to Stereo Unleashes Power · CVPR 2025
Computer vision › 3D vision
depth estimation
0.312025
ZeroStereo: Zero-Shot Stereo Matching from Single Images · ICCV 2025

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

zero-shot learning · 0.9spatial attention · 0.9dual-branch architecture · 0.9confidence-based guidance · 0.92d convolution · 0.9
YearPublicationVenuePosition
2025 MonSter: Marry Monodepth to Stereo Unleashes Power
abstract
Stereo matching recovers depth from image correspondences. Existing methods struggle to handle ill-posed regions with limited matching cues, such as occlusions and textureless areas. To address this, we propose MonSter, a novel method that leverages the complementary strengths of monocular depth estimation and stereo matching. MonSter integrates monocular depth and stereo matching into a dual-branch architecture to iteratively improve each other. Confidence-based guidance adaptively selects reliable stereo cues for monodepth scale-shift recovery. The refined monodepth is in turn guides stereo effectively at ill-posed regions. Such iterative mutual enhancement enables MonSter to evolve monodepth priors from coarse object-level structures to pixel-level geometry, fully unlocking the potential of stereo matching. As shown in Fig. 2, MonSter ranks 1stacross five most commonly used leaderboards — SceneFlow, KITTI 2012, KITTI 2015, Middlebury, and ETH3D. Achieving up to 49.5% improvements (Bad 1.0 on ETH3D) over the previous best method. Comprehensive analysis verifies the effectiveness of MonSter in ill-posed regions. In terms of zero-shot generalization, MonSter significantly and consistently outperforms state-of-the-art across the board. The code is publicly available at: https://github.com/Junda24/MonSter.
Junda Cheng, Longliang Liu, Gangwei Xu, Xianqi Wang 0001, Zhaoxing Zhang, Jinliang Zang, Yurui Chen, Zhipeng Cai 0003, Xin Yang 0008
CVPR7
2025 ZeroStereo: Zero-Shot Stereo Matching from Single Images
Xianqi Wang 0001, Gangwei Xu, Junda Cheng, Min Lin 0006, Jinliang Zang, Yurui Chen, Xin Yang 0008
ICCV7
2025 BANet: Bilateral Aggregation Network for Mobile Stereo Matching
abstract
State-of-the-art stereo matching methods typically use costly 3D convolutions to aggregate a full cost volume, but their computational demands make mobile deployment challenging. Directly applying 2D convolutions for cost aggregation often results in edge blurring, detail loss, and mismatches in textureless regions. Some complex operations, like deformable convolutions and iterative warping, can partially alleviate this issue; however, they are not mobile-friendly, limiting their deployment on mobile devices. In this paper, we present a novel bilateral aggregation network (BANet) for mobile stereo matching that produces high-quality results with sharp edges and fine details using only 2D convolutions. Specifically, we first separate the full cost volume into detailed and smooth volumes using a spatial attention map, then perform detailed and smooth aggregations accordingly, ultimately fusing both to obtain the final disparity map. Experimental results demonstrate that our BANet-2D significantly outperforms other mobile-friendly methods, achieving 35.3\% higher accuracy on the KITTI 2015 leaderboard than MobileStereoNet-2D, with faster runtime on mobile devices. Code: \textcolor{magenta}{https://github.com/gangweix/BANet}.
Gangwei Xu, Xianqi Wang 0001, Junda Cheng, Jinliang Zang, Yurui Chen, Xin Yang 0008
ICCV6