The matching algorithm chosen for calculating the degree of match is a normalized correlation algorithm accelerated by pyramid algorithm.
匹配程度的算法选择的是归一化自相关匹配算法,并采用金字塔搜索算法进行加速。
To solve this problem we have implemented the texture progressive transmission with the classic Laplacian pyramid algorithm and the Haar transform algorithm.
为解决这个问题用拉普拉斯金字塔算法和哈尔变换算法实现了纹理递进传输。
To the problems of dynamic programming stereo matching algorithm modified by ground control points (GCPs), a pyramid two-level dynamic programming stereo matching algorithm is proposed.
针对控制点修正的动态规划立体匹配算法存在控制点求取时间长、实时性差的问题,提出一种金字塔双层动态规划立体匹配算法。
应用推荐