共查询到20条相似文献,搜索用时 343 毫秒
1.
一种基于时空相关性的运动估计算法 总被引:2,自引:0,他引:2
研究了一种基于时空相关性的运动估计方法。提出在块匹配法中,对于运动相关性好的块根据相邻块或前一帧图像的运动预测出它的初始运动矢量,然后在小范围内搜索,做运动矢量的变化。对传统的块匹配运动估计,给出了提高运动矢量一致性的修正准则。实验结果表明,本文算法所得的运动矢量一致性远高于传统块匹配法,同时能保持和全局搜索法相媲美的预测质量,而运算时间则有较大幅度缩短。 相似文献
2.
运动估计中菱形算法是一种高效的搜索方法,但它没有利用视频序列中运动矢量的中心偏置分布特性和相邻宏块在时间和空间上的相关性,因此还有很大的空间可以进一步提高该算法的性能.在充分利用运动矢量的中心偏置分布特性和相邻宏块运动矢量的相关性的基础上,提出了一种基于自适应预测的菱形搜索算法(APDS),与传统的起点预测方法不同的是,该算法对所有宏块搜索起点的预测并不是按照一种固定的方法求取,而是通过分析其相邻宏块运动矢量的特性来自适应求得搜索起点和决定搜索策略.实验证明,同传统的菱形法相比,这种方法提高了搜索准确度,同时大幅降低了搜索时间,是一种高效率的搜索算法. 相似文献
3.
针对传统运动估计算法的缺点,本文提出了一种采用弧形、小十字、大菱形模板进行快速块匹配运动估计的新算法.该算法(NOADS)充分利用序列图像中运动矢量场中心偏置分布特性,使用小十字模板,进一步搜索根据情况自适应调整扩展为水平菱形或是垂直菱形模板,处理中心区域小运动矢量和静止运动矢量的搜索.使用大菱形-弧形模板处理大运动矢量的搜索.实验结果表明NOADS有效减少了搜索点数,提高了搜索速度,能同时适应于小运动块和大运动块的搜索,速度上比DS提高约20%,比3SS提高30% ~60%. 相似文献
4.
5.
6.
运动估计块匹配两级搜索算法 总被引:2,自引:0,他引:2
根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度. 相似文献
7.
提出一种基于对象的快速自适应的混合运动估计方法,利用同一对象的运动矢量之间的相关性,根据搜索过程中块匹配的程度,减小或增大搜索范围,实验表明,该算法既降低计算量,又保持了较好的图像质量。 相似文献
8.
运动估计算法是实时视频编解码技术的研究重点,高精度的匹配和补偿可以减少预测误差,提高视频图像的压缩效果.为降低在视频编码标准H.264中运动估计的高计算复杂度问题,提出了采用一种基于节点模型的可变形块匹配运动估计算法来搜索最佳运动矢量.该算法充分利用了H.264运动矢量的的统计特性和相关性,并采用基于像素差值分类的运动估计匹配准则.实验表明,在编码性能损失很小的条件下,该算法有效降低了视频压缩编码中运动估计的运算复杂度. 相似文献
9.
10.
对于帧率上变换算法中运动矢量估计不准确的问题,文中提出了一种新的运动矢量处理算法,较好地纠正了错误的运动矢量。该算法根据前后向运动矢量的一致性程度,以及对应块的绝对差值和,对运动矢量进行了可靠性分类。针对分布在纹理相似区的错误运动矢量,利用时间和空间相关性联合纠正;对于物体边缘区域则分解为小块重搜索运动矢量,以避免边缘模糊现象。实验结果显示,算法可以较好地纠正运动矢量。 相似文献
11.
12.
本文提出了一种新的基于遗传算法的快速运动估计方法.该方法对遗传算法进行了改进,采用"阈值法"确定选择算子,并将基因变异所导致的随机搜索与特定目标搜索相结合,解决了以往快速搜索算法易陷于局部最优的问题,大大提高了运动估计速度.该方法还将运动矢量空间一致性原则用于初始种群的选取,进一步提高了算法性能.由于其具备遗传算法固有的规则性和高度并行性,该方法适合于采用VLSI实现实时视频编码器. 相似文献
13.
14.
15.
该文提出一种新的基于量子克隆选择的自适应多模式快速运动估计算法。算法利用序列图像的时空预测运动矢量作为序列活动剧烈程度的依据,自适应选择搜索模式。静止块直接中止搜索;平缓运动类型块以(0,0)点为起始点,直接使用CDS搜索模式;剧烈运动类型块使用QCS/CDS联合搜索模式,首先使用量子克隆选择QCS寻找近似最优解,然后以近似最优解为起始点,使用CDS搜索。实验结果证明,算法在能够获得接近全搜索方法所得到的平均峰值信噪比前提下,平均搜索点数大大减少,搜索速度显著加快。 相似文献
16.
Error concealment technique based on optical flow 总被引:1,自引:0,他引:1
Jae-Won Suh Yo-Sung Ho 《Electronics letters》2002,38(18):1020-1021
A new motion vector recovery algorithm based on optical flow is proposed. Optical flow fields are very similar to the true motion and can be used to recover three-dimensional motion information. Experimental results on test video sequences produced a higher peak signal-to-noise ratio value than that of conventional methods based on the block matching algorithm 相似文献
17.
Block-by-block motion compensation algorithms are studied for video-conference/video-telephone television signals. A fast feature-based block matching algorithm using integral projections for the motion vector estimation is proposed. The proposed algorithm reduces the motion estimation computations by a factor of two by calculating the one-dimensional cost functions rather than the two-dimensional ones. Also, the low sensitivity of the proposed algorithm to the presence of additive noise is shown experimentally. Simulation results based on the original and noisy image sequences are presented 相似文献
18.
Temporal error concealment using motion field interpolation 总被引:3,自引:0,他引:3
An error concealment algorithm based on motion field interpolation is presented. For each pixel in a damaged block, the algorithm recovers a motion vector using bilinear interpolation of neighbouring motion vectors. This vector is then used to conceal the damaged pixel. Overlapped motion compensation is used to combine this algorithm with a boundary matching error concealment algorithm. Simulation results demonstrate the superior performance of the proposed algorithms 相似文献
19.
Shen-Chuan Tai Ying-Ru Chen Zheng-Bin Huang Chuen-Ching Wang 《Display Technology, Journal of》2008,4(2):188-197
This paper presents a robust true motion estimation algorithm, designated as MPMVP (Multi-pass and Motion Vector Propagation), to enhance the accuracy of the motion vector fields in frame rate up-conversion applications. The MPMVP uses a multi-pass scheme to progressively refine approximate motion vectors to true motion vectors based upon the motion information acquired in previous passes. The multi-pass motion estimation process uses a large block size to detect the motion vectors within the objects themselves and small block sizes to detect the motion vectors along the object boundaries. Actually, the block size is progressively reduced during the search process. When the motion vector of a block is considered to be sufficiently accurate for motion estimation purposes, the block is said to be converged and the local motion vector search process terminates. A novel technique, referred to as motion vector propagation, is then applied to propagate the motion vector of the converged block to its neighboring blocks. This technique not only ensures that neighboring motion vectors within the same object have a high degree of spatial correlation, but also accelerates the convergence of the motion vectors in the neighboring blocks and therefore reduces the overall computational time and expense of the multi-pass motion vector search procedure. A novel distortion criterion is proposed to enhance the tolerance of the traditional sum-of-absolute-difference measurement technique applied in the motion estimation scheme to noise and shadow effects. The experimental results demonstrate that the proposed true motion estimation algorithm outperforms the traditional full search, 3DRS and TCSBP algorithms in terms of both the smoothness of the generated motion vector fields and the visual quality of the up-converted frames. 相似文献
20.
In this paper, a new error concealment algorithm is proposed for the H.264 standard. The algorithm consists of two processes. The first process uses a fuzzy logic method to select the size type of lost blocks. The motion vector of a lost block is calculated from the current frame, if the motion vectors of the neighboring blocks surrounding the lost block are discontinuous. Otherwise, the size type of the lost block can be determined from the preceding frame. The second process is an error concealment algorithm via a proposed adapted multiple‐reference‐frames selection for finding the lost motion vector. The adapted multiple‐reference‐frames selection is based on the motion estimation analysis of H.264 coding so that the number of searched frames can be reduced. Therefore the most accurate mode of the lost block can be determined with much less computation time in the selection of the lost motion vector. Experimental results show that the proposed algorithm achieves from 0.5 to 4.52 dB improvement when compared to the method in VM 9.0. 相似文献