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.

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

Could you explan more about Cascade corner pooling module? #52

Closed
wtiandong opened this issue Jun 6, 2019 · 2 comments
Closed

Could you explan more about Cascade corner pooling module? #52

wtiandong opened this issue Jun 6, 2019 · 2 comments

Comments

@wtiandong
Copy link

wtiandong commented Jun 6, 2019

Hi @Duankaiwen ,
I'm reading your paper now, and little confused about the cascade corner pooling layer. You say "It first looks along a boundary to find a boundary maximum value, then looks inside along the location of the boundary maximum value to find a internal maximum value, and finally, add the two maximum values together. By doing this, the corners obtain both the the boundary information and the visual patterns of objects."
I read your code and match it to your figure 5(b) architecture exactly. But I don't really understand this arch. I can understand It first looks along a boundary to find a boundary maximum value, e.g. left pooling, this is same as CornerNet. But how it looks inside along the location of the boundary maximum value to find a internal maximum value, and finally, add the two maximum values together via 3x3-Conv and top pooling?

Thanks.

@Duankaiwen
Copy link
Owner

Duankaiwen commented Jun 10, 2019

Hi@wtiandong, it actually fist looks inside to find a internal maximum value for each pixel and add the internal maximum value into the feature map, and via a 3x3-Conv. We think this step equips each pixel with internal feature. Then it looks along a boundary to find a boundary maximum value. We think the this boundary maximum value also has the internal feature.

@wtiandong
Copy link
Author

Hi@wtiandong, it actually fist looks inside to find a internal maximum value for each pixel and add the internal maximum value into the feature map, and via a 3x3-Conv. We think this step equips each pixel with internal feature. Then it looks along a boundary to find a boundary maximum value. We think the this boundary maximum value also has the internal feature.

OK. It's clear now. Thank you very much.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants