Collinear trinocular stereo using two-level dynamic programming

An almost occlusion-free trinocular stereo algorithm is described. It can cope with the occlusion problem when trying to obtain depth data of good accuracy by using a long stereo baseline. A third camera located midway between a pair of stereo cameras is used for the purpose. A correspondence search algorithmbased on two-level dynamic programming was developed to obtain an optimal correspondence among the three images. Experiments showed the validity of the algorithm.<
>