CVMar 24, 2025

Distilling Stereo Networks for Performant and Efficient Leaner Networks

arXiv:2503.18544v1h-index: 58IJCNN
Originality Incremental advance
AI Analysis

This work addresses the need for efficient and high-performing stereo matching networks in applications like robotics and autonomous driving, though it is incremental as it builds on existing distillation techniques.

The authors tackled the problem of distilling knowledge from complex stereo matching networks to create leaner, faster student networks, achieving better performance than several state-of-the-art methods on the SceneFlow dataset while being up to 8x faster and showing improved generalization on unseen datasets like ETH3D and Middlebury.

Knowledge distillation has been quite popular in vision for tasks like classification and segmentation however not much work has been done for distilling state-of-the-art stereo matching methods despite their range of applications. One of the reasons for its lack of use in stereo matching networks is due to the inherent complexity of these networks, where a typical network is composed of multiple two- and three-dimensional modules. In this work, we systematically combine the insights from state-of-the-art stereo methods with general knowledge-distillation techniques to develop a joint framework for stereo networks distillation with competitive results and faster inference. Moreover, we show, via a detailed empirical analysis, that distilling knowledge from the stereo network requires careful design of the complete distillation pipeline starting from backbone to the right selection of distillation points and corresponding loss functions. This results in the student networks that are not only leaner and faster but give excellent performance . For instance, our student network while performing better than the performance oriented methods like PSMNet [1], CFNet [2], and LEAStereo [3]) on benchmark SceneFlow dataset, is 8x, 5x, and 8x faster respectively. Furthermore, compared to speed oriented methods having inference time less than 100ms, our student networks perform better than all the tested methods. In addition, our student network also shows better generalization capabilities when tested on unseen datasets like ETH3D and Middlebury.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes