SIFT描述子的计算复杂性? [英] Computational Complexity of SIFT descriptor?
本文介绍了SIFT描述子的计算复杂性?的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!
问题描述
其中x是图块的近邻,pi,po是芯片的输入,输出引脚数,α,β,γ是特征分数,而Γ0,Γ1,Γ2是输入,计算,输出时钟。
The SIFT descriptor is a local descriptor that introduced by David Lowe. This descriptor can be splitted up into multiple parts:
5- Assigning an orientation to the keypoints
So, my question is:
What is the computational complexity of SIFT descriptor? something like O(2n+logn)
解决方案
Here's a paper that talks exactly about this.
The actual time complexity for a n by n image is apparently
where x is the neigborhood of the tile,pi,po are the number of input, output pins of the chip, α,β,γ are the feature fractions, and Γ0,Γ1,Γ2 are the input, compute, output clocks.
这篇关于SIFT描述子的计算复杂性?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!
查看全文