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

Which paper are you mainly refered? #3

Open
MRJTM opened this issue Oct 18, 2018 · 6 comments
Open

Which paper are you mainly refered? #3

MRJTM opened this issue Oct 18, 2018 · 6 comments

Comments

@MRJTM
Copy link

MRJTM commented Oct 18, 2018

I am new in the field of ReID and I want to run a project that implement ReID with triple loss, it would be better for me if the project is based on a specific paper. So I would appreciate that if you could tell me if you had mainly refered a paper and which paper it is.

@layumi
Copy link
Owner

layumi commented Oct 18, 2018

You may refer to this paper.
https://arxiv.org/abs/1703.07737
But I change the learning policy and sampler method a little.

@MRJTM
Copy link
Author

MRJTM commented Oct 19, 2018

Thank you for replying me,I‘ll read this paper then run your code to understand how you train a model with TriHard loss.

@upgirlnana
Copy link

i can’t understand the positive and negative samples' choosing process,can you describ it more detail

@MRJTM
Copy link
Author

MRJTM commented Dec 22, 2018

For triplet loss, In his code, you can see that he first random select K samples as anchors, K is the batch size, and then for each id in these K sample, he select N samples to generate positive and negative sample,
so you'll get K ids, for each id ,you have 1+N samples, the 1 is the anchor, and you can get the hardest positive sample from these N samples, for hardest negative sample , it is chosen from the left (K-1)N negative samples. So finally you will get K triplets:(anchor, hardest positive, hardest negative)

@minygd
Copy link

minygd commented Apr 17, 2019

For triplet loss, In his code, you can see that he first random select K samples as anchors, K is the batch size, and then for each id in these K sample, he select N samples to generate positive and negative sample,
so you'll get K ids, for each id ,you have 1+N samples, the 1 is the anchor, and you can get the hardest positive sample from these N samples, for hardest negative sample , it is chosen from the left (K-1)N negative samples. So finally you will get K triplets:(anchor, hardest positive, hardest negative)

Thx!

@wudibaichi2
Copy link

Can you tell us more about your sampling strategy? I don't understand it well?

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

5 participants