PatchMatch Stereo - Cross Dynamic Windows Based on Textured Bithreshold Rule

Disparity maps are calculated based on stereo matching algorithms, with the key to the design of cost aggregation windows. PatchMatch stereo adopts the idea of slanted planes and iterative propagation, therefore it often achieves good results in weak and untextured regions, however requires a large aggregation window and time. This paper presents an adaptive window, through high and low textured double threshold and cross-arm search, to obtain a suitable dynamic window for each pixel. The problem of no texture in the small window and high texture matching error in large window is solved by effective segmentation of different regions of the image, and it obviously improves the calculation speed when the disparity map accuracy is largely consistent.