Optimal Disparity Map

Views Updated: Dec 15, 2025

Key Facts

Abbreviation
ODM
Pronunciation
/ˈɑptɪməl dɪˈspɛrəti mæp/
Category
Computing
Related Field
General

Examples in Context

  1. To shorten the convergence time, the optimal search problem of disparity map is converted to an iterative convergence process of bi-valued neural networks.
  2. Finally, the disparity of both matched and occluded points are obtained through finding the optimal path using dynamic programming, and the dense disparity map is obtained.
  3. The information of both matched and occluded points are obtained through finding the optimal path using dynamic programming, and occlusion is detected and handled by disparity consistency testing and the occluded pixels filling, and then the dense disparity map is obtained.
  4. The method processes a global optimal motion estimation in overlapped window region, and use the hierarchical structure to overcome the disadvantages of fixed size block matching, so have a correct disparity vector, and produce a smoother disparity map.

Other meanings of ODM