Stereo matching is the most important and difficult part in the stereo vision. People have been working on how to establish matching cells between two homologous images more accurately and decrease the computational cost during matching. In the paper

firstly the images are rectified which makes the search range from two dimension to one dimension

and then adopt a latent constraint and one algorithm named SMP algorithm which is based on uniqueness constraint to achieve the matching of stereo pairs. This paper proposse one new method which make SMP algorithm more accurate than before.Using false constraint is to detect some fake match points gotten by SMP algorithm

and get disparity map after interpolation.In addition

implementing Box filtering accelerating method is to decrease the computational cost and reduce program running time which is satisfied with application of real-time system.