检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海交通大学计算机科学与工程系,上海200030
出 处:《电子与信息学报》2004年第7期1076-1081,共6页Journal of Electronics & Information Technology
基 金:国家自然科学基金资助项目(No.60072029)
摘 要:该文提出了一种新的快速块匹配运动估计方法,分级筛选法.该方法将搜索最佳匹配块的过程分为若干个筛选级别,在初始的级别中用很少的运算代价通过简单的特征匹配先淘汰一部分候选块;然后在上一级剩余的候选块中,逐级用更加细致的特征继续筛选;直至找到最佳匹配块.实验结果表明,在估计精度非常相近的前提下,该文方法的速度是全搜索方法的12~14倍,而且该方法有很好的稳定性.A multi-level elimination algorithm for fast motion estimation is proposed in this paper. The most matched block of the current block is detected in the next frame with a multi-level elimination strategy in this algorithm. In the first level, some candidate blocks are eliminated by simple characters based block-matching, needing only very few computation costs. Then in further levels, more detailed characters are used for block-matching to eliminate more candidate blocks until the most matched block is selected in the last level. Experimental results show that the proposed algorithm can work steadily and get very close performance to the full-search algorithm while a computation reduction of about 12~14 times, with respect to the full-search algorithm.
分 类 号:TN941[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222