Most contemporary stereo correspondence algorithms impose globalconsistency among candidate match-points by solely using a spatialhierarchy mechanism. This paper analyzes the stereo matching failurescaused by the spatial hierarchy mechanism in the presence of narrowoccluding objects. The lessons learned from this occlusion analysis areused to formulate a new global matching framework-dynamic disparitysearch. The authors present experimental results showing a significantdecrease in the false positive match-rate with a dynamic disparitysearch-based stereo algorithm as compared to a spatial hierarchymechanism-based algorithm
展开▼