A novel stereo matching pipeline with robustness and unfixed disparity search range

Jiazhi Liu; Feng Liu

Home/Archive/arXiv

arXiv · 2204.04865

A novel stereo matching pipeline with robustness and unfixed disparity search range

Jiazhi Liu·Feng Liu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Stereo matching is an essential basis for various applications, but most stereo matching methods have poor generalization performance and require a fixed disparity search range. Moreover, current stereo matching methods focus on the scenes that only have positive disparities, but ignore the scenes that contain both positive and negative disparities, such as 3D movies. In this paper, we present a new stereo matching pipeline that first computes semi-dense disparity maps based on binocular disparity, and then completes the rest depending on monocular cues. The new stereo matching pipeline have the following advantages: It 1) has better generalization performance than most of the current stereo matching methods; 2) relaxes the limitation of a fixed disparity search range; 3) can handle the scenes that involve both positive and negative disparities, which has more potential applications, such as view synthesis in 3D multimedia and VR/AR. Experimental results demonstrate the effectiveness of our new stereo matching pipeline.

Explore related subjects

cs.CV

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jiazhi Liu, Feng Liu. 2022-05-10. A novel stereo matching pipeline with robustness and unfixed disparity search range. https://arxiv.org/abs/2204.04865

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

CMFDFormer: Transformer-based Copy-Move Forgery Detection with Continual Learning

Copy-move forgery detection aims at detecting duplicated regions in a suspected forged image, and deep learning based copy-move forgery detection methods are in the ascendant. These deep learning based methods heavily rely on synthetic training data, and the performance will degrade when facing new tasks. In this paper, we propose a Transformer-style copy-move forgery detection network named as CMFDFormer, and provide a novel PCSD (Pooled Cube and Strip Distillation) continual learning framework to help CMFDFormer handle new tasks. CMFDFormer consists of a MiT (Mix Transformer) backbone network and a PHD (Pluggable Hybrid Decoder) mask prediction network. The MiT backbone network is a Transformer-style network which is adopted on the basis of comprehensive analyses with CNN-style and MLP-style backbones. The PHD network is constructed based on self-correlation computation, hierarchical feature integration, a multi-scale cycle fully-connected block and a mask reconstruction block. The PHD network is applicable to feature extractors of different styles for hierarchical multi-scale information extraction, achieving comparable performance. Last but not least, we propose a PCSD continual learning framework to improve the forgery detectability and avoid catastrophic forgetting when handling new tasks. Our continual learning framework restricts intermediate features from the PHD network, and takes advantage of both cube pooling and strip pooling. Extensive experiments on publicly available datasets demonstrate the good performance of CMFDFormer and the effectiveness of the PCSD continual learning framework.

cs.CV↗

arXiv2026

PDB: Not All Drivers Are the Same -- A Personalized Dataset for Understanding Driving Behavior

Driving behavior varies across individuals, yet most existing driving datasets do not preserve driver identity or control for factors that may affect driving style. We introduce the Personalized Driving Behavior (PDB) dataset, a multimodal dataset collected from 9 drivers using the same vehicle and route under comparable conditions. PDB includes data from a 128-line LiDAR, external and driver-facing cameras, GNSS, IMU, CAN-bus signals, and heart-rate measurements, with 111,060 frames of LiDAR point cloud data and more than 1.33 million images. Based on these recordings, we construct PDB-Traj, a personalized trajectory prediction benchmark with 1,309 10-second trajectory segments sampled at 10 Hz. Each segment includes the ego trajectory, surrounding-agent trajectories, and driver identity. We further introduce Gated Selective Personalization (Gate-SP), a driver-aware baseline that selectively incorporates driver identity into trajectory prediction. Experiments on PDB-Traj provide reference results for personalized motion forecasting and show that driver information can improve prediction when applied selectively. PDB and PDB-Traj provide a benchmark for studying driver-specific behavior and personalized trajectory prediction.

cs.CV↗

arXiv2026

TestDG: Test-time Domain Generalization for Continual Test-time Adaptation

This paper studies continual test-time adaptation (CTTA), the task of adapting a model to constantly changing unseen domains in testing while preserving previously learned knowledge. Existing CTTA methods mostly focus on adaptation to the current test domain only, overlooking generalization to arbitrary test domains a model may face in the future. To tackle this limitation, we present a novel online test-time domain generalization framework for CTTA, dubbed TestDG. TestDG aims to learn features invariant to both current and previous test domains on the fly during testing, improving the potential for effective generalization to future domains. To this end, we propose a new model architecture and a test-time adaptation strategy dedicated to learning domain-invariant features, along with prototype selection and update mechanisms for effectively managing information from previous test domains. TestDG achieved state of the art on three of four public CTTA benchmarks and performed on par with the best prior method on ImageNet-C. Moreover, it showed superior generalization to unseen test domains.

cs.CV↗