Selection of an optimum patch for an area-based stereo matching algorithm

Describes an approach to reduce the execution time of an area-based stereo matching technique by defining a patch (or window) carefully. It is shown that the conventional way of defining a patch contains redundancy and that a patch defined otherwise improves the performance in terms of coverage and speed while accuracy degradation is nominal. This paper also describes an attempt of defining optimal patch for stereo matching.