arrow
返回

Fast block matching algorithm based on the winner-update strategy

delete2001-01-01
delete129
PRE
AI
Y
Yong‐Sheng Chen *
Y
Yi-Ping Hung
C
Chiou‐Shann Fuh
DOI:10.1109/83.935037delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Block matching is a widely used method for stereo vision, visual tracking, and video compression. Many fast algorithms for block matching have been proposed in the past, but most of them do not guarantee that the match found is the globally optimal match in a search range. This paper presents a new fast algorithm based on the winner-update strategy which utilizes an ascending lower bound list of the matching error to determine the temporary winner. Two lower bound lists derived by using partial distance and by using Minkowski's inequality are described in this paper. The basic idea of the winner-update strategy is to avoid, at each search position, the costly computation of matching error when there exists a lower bound larger than the global minimum matching error. The proposed algorithm can significantly speed up the computation of the block matching because 1) computational cost of the lower bound we use is less than that of the matching error itself; 2) an element in the ascending lower bound list will be calculated only when its preceding element has already been smaller than the minimum matching error computed so far; 3) for many search positions, only the first several lower bounds in the list need to be calculated. Our experiments have shown that, when applying to motion vector estimation for several widely-used test videos. 92% to 98% of operations can be saved while still guaranteeing the global optimality, Moreover, the proposed algorithm can be easily modified either to meet the limited time requirement or to provide an ordered list of best candidate matches. Our source codes of the proposed algorithm are available at http://smart.iis.sinica.edu.tw/html/winu.html.
Keyword:
block matching
fast algorithm
Minkowski's inequality
motion estimation
winner-update strategy
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Image Processing 封面图
IEEE Transactions on Image Processing
IF:
13.7
论文数:
1.0W
被引数:
8.4W

机构

暂无机构信息
引用论文

引用论文

Heterogeneous Integration Challenges Within Wafer Level Fan-Out SiP for Wearables and IoT
err2018-05-01
err0
PREAI
errAlberto Martins; Marcio Pinheiro; Ana Filipa Ferreira; Rodrigo Almeida; Filipe Matos; Joana Oliveira; Rui Pedro Silva; Hugo Santos; Manual Monteiro; Hugo Gamboa
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容