Skip to content

Computationally efficient stereo matching for edge multimedia platforms via context-guided aggregation and adaptive accumulation

Unknown authors
Sep 2026 · Multimedia Systems · Vol 32 · 0 citations · 46 references

TL;DR

A computationally efficient stereo matching architecture, termed MCFNet, designed to minimize processing bottlenecks without compromising accuracy is introduced, highlighting its potential for practical multimedia systems such as autonomous driving and intelligent robotics.

View source

Similar papers

2026

EPP-Stereo: Preserving Geometric Evidence for Cross-Domain Stereo Matching

Stereonetworks trained on synthetic data often degrade in real-world scenes. Within an IGEV-style pipeline, domain-sensitive features may disturb correspondence cues, average matching-dimension pooling may attenuate reliable responses, and local motion encoding does not explicitly exploit rectified stereo geometry. We...

Wei-Chuan Yao, Yuan-Wei Bi, De-Xiang Chen · 0 citations
Preprint Aug 2026

PhasorNet: Learning Structure from Frequency for Real-Time Stereo Matching

PhasorNet is proposed, a lightweight yet powerful framework that boosts geometric discrimination via frequency-domain cues that achieves state-of-the-art performance on the challenging ETH3D benchmark while exhibiting excellent cross-domain generalization on KITTI, delivering an efficient and practical solution for acc...

Md Raqib Khan, S. Vipparthi, Subrahmanyam Murala · 0 citations
Open access Sep 2026

Multi-dimensional image feature attention-based stereo vision measurement for close-range scenes

In recent years, binocular stereo matching has been widely adopted for three-dimensional object measurement. However, conventional methods often suffer from performance degradation in close-range scenarios, where the reduced distance to the target results in substantially larger disparities, requiring a wider search ra...

Xin-Le Jin, Dong-Yun Lin, Wei-Yao Lan et al. · 0 citations
Open access Sep 2026

Efficient binocular ranging framework with improved BT-census cost and multi-resolution fusion

To address central pixel dependency and degraded matching reliability in low-texture or occluded regions, this paper proposes a robust binocular ranging framework integrating an improved Census-BT cost with a multi-resolution region of interest (ROI) pyramid strategy. The approach employs an annular Gaussian-weighted C...

He-Yang Sun, Wen-Chuan Zhao, Feng-Shu Yu et al. · 0 citations
Sep 2026

Dynamic multi-feature fusion and dual-branch adaptive aggregation for stereo matching

An improved algorithm based on dynamic multi-feature fusion and dual-branch adaptive aggregation that adapts to local scene characteristics and the ultimate disparity map is generated through a region-based disparity optimization module and multiple optimization processes.

Sen Lin, Lu-Heng Ren · 0 citations
Conference Aug 2026

MCA-MVSNet: Multi-Scale Context and Attention-Aware Multi-View Stereo Network for Weakly Textured Scene Reconstruction

Multi-view stereo (MVS) aims to recover dense 3D structures by exploiting geometric constraints and complementary visual information across multiple views. Although learning-based MVS methods generally achieve better reconstruction performance than traditional approaches, they remain vulnerable to ambiguous local match...

Wei-Ye Xing, Jin Huang · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.