检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈松柏[1]
机构地区:[1]四川农业大学工程技术学院,四川雅安625000
出 处:《信息与电子工程》2006年第6期461-463,共3页information and electronic engineering
摘 要:通过分析归一化相关匹配算法的原理,提出了建立累加和表与平方求和表来减少匹配过程中加减法的冗余计算量,并采用快速傅里叶变换算法减少乘法的计算时间,使算法在无损匹配性能的条件下大大降低了计算时间。同时,该快速算法对于匹配模板和搜索区域的增加不敏感,十分有利于工程实现。Normalized Cross Correlation (NCC) algorithm is robust, but it has poor real-time performance due to its large amount of computation. By analyzing the principle of the algorithm, we present a fast NCC algorithm, which reduces the redundancy computation of addition and subtraction by designing accumulation sum table and square sum table. At the same time, FFT algorithm is adopted to decrease the computational cost of multiplication. In addition, this fast NCC algorithm is lossless to the capability of correlation, and insensitive to the increment of template size or search region, so that it is quite fit to practice in reality.
分 类 号:TN911.73[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15