Dynamic Programming in Segments for Occlusion Detection/Stereo Matching

GUO Da-bo; LU Zhao-yang; JIAO Wei-dong; CUI Ling-ling

您当前的位置：

首页 >

文章列表页 >

Dynamic Programming in Segments for Occlusion Detection/Stereo Matching

更新时间：2025-07-16

- Dynamic Programming in Segments for Occlusion Detection/Stereo Matching
- Acta Electronica Sinica Vol. 37, Issue 7, Pages: 1516-1521(2009)
- 作者机构：
  
  1. 西安电子科技大学ISN国家重点实验室,陕西,西安,710071
  2. 山西大学物理电子工程学院,山西,太原,030006
  3. 西安电子科技大学ISN国家重点实验室陕西西安,710071
  4. 山西大学物理电子工程学院山西太原,030006
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Published：2009
- 稿件说明：
移动端阅览
GUO Da-bo, LU Zhao-yang, JIAO Wei-dong, et al. Dynamic Programming in Segments for Occlusion Detection/Stereo Matching[J]. Acta Electronica Sinica, 2009, 37(7): 1516-1521.
DOI：

GUO Da-bo, LU Zhao-yang, JIAO Wei-dong, et al. Dynamic Programming in Segments for Occlusion Detection/Stereo Matching[J]. Acta Electronica Sinica, 2009, 37(7): 1516-1521. DOI：

摘要

为了显式地在视差图上标记出遮挡区域

本文在计算视差空间的基础上

利用动态规划算法搜索出最佳视差曲线.计算所得的视差曲线上有三种状态标记:匹配状态和二种遮挡状态.为了保证视差曲线通过路径控制点

提出了一种分段式动态规划算法.算法将视差空间影像划分为路径控制区和非路径控制区.在路径控制区强制路径通过路径控制点

在非路径控制区采用动态规划进行路径最佳搜索.为保证路径控制点高度可靠

提出了选择路径控制点的4个准则.实验结果表明

新算法比传统的动态规划算法在遮挡检测和匹配精度上都有一定的提高

算法可靠性强

运算量小.

Abstract

In order to mark occluded regions explicitly on the disparity map

the dynamic programming is employed to search optimal disparity curve on base of the calculating disparity space at first.Each point on the optimal disparity curve must be in one of three states:matching state or other two occlusion states.To guarantee the disparity curve passing through ground control points (GCP)

an algorithm of dynamic programming in segments is proposed

that is

the disparity space image is divided into ground control regions and non-ground control regions.In the ground control region

the searching path is forced to pass GCPs.In the non-ground control region

the optimal path searching is under dynamic programming.For the reliability of the GCP

four criterions are presented to choose a point as a GCP.Experimental results show that the new algorithm has certain enhancement in the precision of occlusion detection and matching

and is more reliable and faster than conventional dynamic algorithms.

关键词

Keywords

references

Views

1181

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Phase Matching and Occlusion Detection Based on Dynamic Programming

Power Spectrum Manifold-Based Information Geometry DP-TBD Algorithm

Pyramid Patch-Matching Optical Flow Estimation Method Based on Occlusion Optimization

Improved Feature Stereo Matching Method Based on Binocular Vision

Methods for Optimal Eliminating Cycles in Information Flow of Authorization Policies

Related Author

XU Yi

ZHOU Jun

ZHOU Yuan-hua

WU Hao

CHENG Yong-qiang

YANG Zheng

LI Xiang

WANG Hong-qiang

Related Institution

上海交通大学图像通信与信息处理研究所

College of Electronic Science and Technology， National University of Defense Technology

School of Information Engineering， Nanchang Hangkong University

Key Laboratory of Nondestructive Testing， Ministry of Education， Nanchang Hangkong University

School of Mechanical and Precision Instrument Engineering, Xi’an University of Technology

⁰