Keypoint matching in stereo vision

There is always a need for fast keypoint matching in applications. This paper focuses on the area of stereo vision and presents an algorithm for fast keypoint matching. We first estimate the potential match´s position according the optical flow. Then the following matching process is restricted in a smaller region. Experiments show that our algorithm is effective and robust.