摘要
通过研究块匹配算法当中菱形算法中的冗余性,提出了一种基于差分的块匹配快速搜索算法(DBS),利用搜索点的匹配误差之间的大小关系,预测最优点的搜索方向,减少了搜索点数,通过实验表明了该算法在保证了匹配精度的同时获得了更高的搜索速度。
By researching into the redundancy in the Diamond Search algorithm（DS）, a new improved Difference Based Search （DBS） algorithm is proposed. By making use of the relationship between distortions of search points, the direction that leads to global minimum distortion point is predicted. In this way, the number of points which needs to be calculated is reduced. Experi- ment results show that the new algorithm achieves higher coding speed while maintaining the matching precision.
出处
《计算机工程与应用》
CSCD
2013年第6期127-130,138,共5页
Computer Engineering and Applications
基金
国家科技重大专项(No.2009ZX01031-001-007)
