New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

关于计算复杂度的问题 #28

Open

woaicv opened this issue Apr 3, 2022 · 1 comment

woaicv commented Apr 3, 2022

您好，有个问题我没太想清楚，就是GSA的计算复杂度为什么是 O(mnHW d) = O( H2W2d k1k2 )。非常感谢！

forever10086 commented May 2, 2022

我推测是每个patch有一个representative，这是query，size就是patch的个数，mn，是与整个image做全局自注意力，key的size就是HW，所以计算复杂度是O(mnHWd)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment