Computing the Cost of Occlusion

✍ Scribed by Gabriel Fielding; Moshe Kam

• Book ID: 102567663
• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 158 KB
• Volume: 79
• Category: Article
• ISSN: 1077-3142
• DOI: 10.1006/cviu.2000.0853

✦ Synopsis

presented a new dynamic programming-based stereo matching algorithm. The algorithm uses a parameter which represents the cost of occlusion. This cost is levied if the algorithm decides that two measurements, each from a different camera along corresponding epipolar lines, are not projections of the same point in space. The occlusion cost is dependent on the standard deviation of the (Gaussian) sensor noise, σ , and the probability of match detection, P D . Under certain conditions such as low signalto-noise ratio, the algorithm of Cox et al. will declare occlusions where they do not exist. We offer an alternative definition for the cost of occlusion, based on a decision-theoretic formulation for the matching process. This alternative improves the performance of the matching algorithm.