共查询到19条相似文献,搜索用时 156 毫秒
1.
2.
在立体匹配中,同时保证算法的精度和速度是一个技术难题。提出了一种基于贝叶斯理论的快速稠密立体匹配算法。将贝叶斯概率分布理论应用到立体匹配问题上,利用MSERDoG算子提取支撑点,像素灰度值作为匹配代价、固定窗口作为代价聚合对其进行匹配,对匹配好的支撑点进行三角剖分,将支撑点的视差、梯度、三角剖分的线性系数及分割作为计算视差的先验概率条件,从而保证了有效的视差搜索空间,提高了匹配效率。最终通过最小化能量函数获得稠密的视差图。在国际标准Middlebury平台进行实验,结果表明提出的算法匹配精度高,速度快,误匹配率低,匹配效率高。 相似文献
3.
提出一种基于视差和帧差的图割优化运动目标分割算法,在运动目标分割过程中,利用能量函数优化方法得到较为准确的区域视差,同时在此基础上将视差和帧差特征采用图割算法的能量函数进行融合,以此提高前景目标分割的准确性.实验结果表明该方法当区域视差的优化受到灰度因素的影响时,利用图割结合视差和帧差特征能够有效地减少视差优化不够准确的区域被检测为前景目标的可能性,同时也能填补大多数帧差分割的空洞,增强了分割结果的稳定性. 相似文献
4.
5.
6.
选择特征点作为匹配特征,采用视差估计方法,在满足一定匹配准则情况下,可以得到一约束最小化能量函数。模拟实验结果表明,使用模拟退火算法,可使能量函数达到全局最小,从而实现立体匹配。 相似文献
7.
8.
9.
基于斜平面平滑的半全局匹配算法虽然能很好地处理深度不连续区域,减少视差断裂现象,具有很好的视差平滑效果.但此方法计算量大,并且若输入的左右图像对不是理想校正的,最终得到的视差图中可能会出现黑色小方块.针对上述问题,本文提出了一种基于斜平面平滑优化的双目立体视觉算法,优化了视差斜平面拟合过程,提高了斜平面平滑的运算速度;另,通过对初始视差图中无效的视差值进行临近插值填充,很好地解决了视差图中的方块现象;同时考虑到同一分割块内的像素梯度值应比较接近,对图像分割时用到的能量函数增加梯度项,使分割区域更加合理.实验结果表明,本文算法能取得更好的视差图,主观效果得到改善,运算速度提高约40%. 相似文献
10.
针对现有双目场景流计算方法在大位移、运动遮挡及光照变化等复杂场景下场景流估计的准确性与鲁棒性问题,提出一种基于金字塔块匹配的双目场景流计算方法 .首先对双目图像序列进行超像素分割和视差估计,得到图像初始分割结果和视差信息,然后建立基于金字塔块匹配的运动模型并采用Ransac随机一致性算法拟合刚性运动模型和最小化重投影算法估计对象运动参数.最后,本文将金字塔块匹配结果作为约束项,联合对象运动参数和超像素平面参数构建基于金字塔块匹配的双目场景流估计能量函数模型,通过最小化能量函数得到最终场景流.实验分别采用KITTI2015(Karlsruhe Institute of Technology and Toyota technological Institute 2015)和MPI-Sintel(Max-Planck Institute and Sintel)数据集测试图像对本文方法和具有代表性场景流算法进行综合对比分析,结果表明本文方法相对于其他对比方法有效提高大位移、运动遮挡以及光照变化情况下场景流估计精度和鲁棒性. 相似文献
11.
12.
Kah Bin Lim 《Journal of Visual Communication and Image Representation》2011,22(4):325-331
In the paper, the algorithm of segment-based stereo matching using graph cuts is developed for extracting depth information from the stereo image pairs. The first step of the algorithm employs the mean-shift algorithm to segment the reference image, which ensures our method to correctly estimate in large untextured regions and precisely localize depth boundaries, followed by the use of Adaptive Support Weighted Self-Adaptation dissimilarity algorithm (ASW-SelfAd) for the estimation of initial disparity. This is followed by application of Singular Value Decomposition (SVD) in solving the robust disparity plane fitting. In order to ensure reliable pixel sets for the segment, we filter out outliers which contain occlusion region through three main rules, namely; cross-checking, judging reliable area and disparity distance measurement. Lastly, we apply improved clustering algorithm to merge the neighboring segments. The geometrical relationship of adjacent planes such as parallelism and intersection is employed for determination of whether two planes shall be merged. A new energy function is subsequently formulated with the use of graph cuts for the refinement of the disparity map. Finally, the depth information is extracted from the final disparity map. Experimental results on the Middlebury dataset demonstrate that our approach is effective in improving the state of the art. 相似文献
13.
对立体匹配问题建立马尔可夫随机场模型,使用并行的多尺度信任传播算法求解马尔可夫随机场的能量最小化问题.在传统串行算法基础上利用CUDA技术实现了并行计算,并结合图像的梯度和亮度信息计算能量函数的数据项,平滑项采用两个相邻像素视差的绝对差度量.以标准的Middlebury立体数据集做为输入,实验结果表明:算法具有很好的实时性能,运行时间远小于传统的串行算法,深度图结果较优. 相似文献
14.
本文提出一种新的采用全局相似性测量的彩色图像分割算法。该算法将图像分割问题表述为求解能量泛函最小化的问题。利用Bhattacharyya距离测量前景和背景之间的概率分布函数的全局相似性,并将Bhattacharyya系数作为最终的能量泛函。由于高阶能量项的引入,该能量的最小化通常是一个NP难题,为了能够有效的优化该能量泛函,本文提出一个辅助上界函数并且利用graph cuts对该函数进行优化求解。该辅助函数在优化的过程中能够保证能量递减。该算法能够应用于多种分割问题,包括交互式分割、显著性分割等。实验结果表明,算法具有全局分割的特点,能够对彩色图像进行较准确的分割。 相似文献
15.
Sanoj Kumar Sanjeev Kumar Nagarajan Sukavanam Balasubramanian Raman 《AEUE-International Journal of Electronics and Communications》2013,67(5):372-381
In this paper, an efficient segment-based disparity estimation algorithm is proposed, based on wavelet transform and human visual system. The core idea is to estimate disparity not only from the left and right images but also from their decomposed sub-bands up to a certain level. The stereo image pair is divided into the segments of homogeneous color. Instead of assigning a disparity value to each pixel inside a segment, a disparity plane is assigned to each segment and the stereo matching problem is formulated as an energy minimization problem in the segmented domain. The optimal disparity plane labeling is approximated by applying belief propagation, which assigns the corresponding disparity plane to each segment. The obtained disparity maps are merged into a single disparity map using the human visual system model. Experiments with stereo image pairs show the validity of the proposed method. 相似文献
16.
网络虚拟化使得智能能量感知网络部署成为可能,已有研究忽略了节点映射能耗最优化。本文把节点映射能耗优化问题转化为生产地与销售地之间物资运输代价最优化问题,建立高效节能节点映射运输模型。根据最大元素法,提出了混合一阶段与两阶段映射算法,在链路映射的约束下找到节点分配最小能耗代价最优解;利用主动休眠策略,提出了基于运输模型的主动休眠虚拟网络映射节能算法;利用节点可重复映射技术,提出了基于运输模型的节点可重复映射算法,进一步提高了底层网络资源休眠数量。仿真结果验证了本文所提算法能够显著降低系统能耗,适合大规模高效节能虚拟网络映射。 相似文献
17.
One can select feature points as matching character by using disparity estimation method, under satisfying the condition of certain matching theorem. Then we can obtain a constraint minimum energy function. By using simulated annealing (SA) algorithm and a lot of simulation experiments, the energy function can escape local minimum, then stereo correspondence can be realized. 相似文献
18.
《Signal Processing: Image Communication》2007,22(2):127-143
This paper describes a dense stereo matching algorithm for epipolar rectified images. The method applies colour segmentation on the reference image. Our basic assumptions are that disparity varies smoothly inside a segment, while disparity boundaries coincide with the segment borders. The use of these assumptions makes the algorithm capable of handling large untextured regions, estimating precise depth boundaries and propagating disparity information to occluded regions, which are challenging tasks for conventional stereo methods. We model disparity inside a segment by a planar equation. Initial disparity segments are clustered to form a set of disparity layers, which are planar surfaces that are likely to occur in the scene. Assignments of segments to disparity layers are then derived by minimization of a global cost function. This cost function is based on the observation that occlusions cannot be dealt with in the domain of segments. Therefore, we propose a novel cost function that is defined on two levels, one representing the segments and the other corresponding to pixels. The basic idea is that a pixel has to be assigned to the same disparity layer as its segment, but can as well be occluded. The cost function is then effectively minimized via graph-cuts. In the experimental results, we show that our method produces good-quality results, especially in regions of low texture and close to disparity boundaries. Results obtained for the Middlebury test set indicate that the proposed method is able to compete with the best-performing state-of-the-art algorithms. 相似文献
19.