Stereo Matching Based on Visual Sensitive Information
원문 초록
The area of computer vision is one of the most discussed topics amongst many scholars, and stereo matching is its most important sub fields. After the parallax map is transformed into a depth map, it can be applied to many intelligent fields. In this paper, a stereo matching algorithm based on visual sensitive information is proposed by using standard images from Middlebury dataset. Aiming at the limitation of traditional stereo matching algorithms regarding the cost window, a cost aggregation algorithm based on the dynamic window is proposed, and the disparity image is optimized by using left and right consistency detection to further reduce the error matching rate. The experimental results show that the proposed algorithm can effectively enhance the stereo matching effect of the image providing significant improvement in accuracy as compared with the classical census algorithm. The proposed model code, dataset, and experimental results are available at https://github.com/WangHewei16/Stereo-Matching.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
ESMStereo: Enhanced ShuffleMixer Disparity Upsampling for Real-Time and Accurate Stereo Matching
Multi-Label Stereo Matching for Transparent Scene Depth Estimation
Diving into the Fusion of Monocular Priors for Generalized Stereo Matching
Boosting Omnidirectional Stereo Matching with a Pre-trained Depth Foundation Model
Distilling Stereo Networks for Performant and Efficient Leaner Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.