Skip to content
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

关于论文中Learning reliable keypoint这一节的疑问 #26

Open
LChen-99 opened this issue Oct 19, 2024 · 1 comment
Open

关于论文中Learning reliable keypoint这一节的疑问 #26

LChen-99 opened this issue Oct 19, 2024 · 1 comment

Comments

@LChen-99
Copy link

LChen-99 commented Oct 19, 2024 •
edited
Loading

图片

按照论文中的公式和说法，我不太理解为什么低纹理区域rpa会很低。以我的理解如果在低纹理区但是matching probability都很高，那么论文中公式20的结果应该也会很高。请问作者可以解答我的疑惑吗。
图片
@Maybe-so
Copy link

我觉得是因为低纹理区域每个点都很相似，因此匹配概率会被分摊开来，使得每个点的概率平均下来都变小了

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@LChen-99 @Maybe-so