Stereo matching with implicit detection of occlusions

Progressive Linear Search for Stereo Matching and Its Application to Interframe Interpolation

“…Each line in this example was processed in 0.15 s. Figure 10 shows the disparity obtained for the Pentagon image. This image has been widely used in stereo matching algorithms [14,16,17,30,[41][42][43]. This image has a resolution of 512 × 512 pixels and the results were obtained by considering a maximum disparity of 25 pixels.…”

A stereo confidence metric using single view imagery with comparison to five alternative approaches

“…Research that has considered LRC include Refs. [7,15,18,20,33,34]. Previous research into the MSM include Refs.…”

Stereo matching with occlusion detection using cost relaxation

“…The approach was motivated by the work of Reimann, Haken [11] and Trapp [7] who formulated the correspondence problem as a biologically abutted self-organization process, based on Haken's synergetic pattern recognition equation [11,12]. To model the correspondence problem, all free system parameters are described via so called order variables, containing the probability of the concerned disparities.…”

“…The original approach was expanded by Trapp, who added implicit occlusion detection to inhibit correspondences of pixels originated in occluded areas by introducing an inhibitory term to the competition process [7].…”