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

DTQ - B-bit binary array #47

Closed
Esmeriz opened this issue Sep 18, 2019 · 2 comments
Closed

DTQ - B-bit binary array #47

Esmeriz opened this issue Sep 18, 2019 · 2 comments

Comments

@Esmeriz
Copy link

Esmeriz commented Sep 18, 2019

From what I understood, both from the paper and the code, the concept here is to train a neural network through triplets to produce a B-bit array binary output that will allow an effective yet fast search image retrieval search. More so, I assume that when you state "compact binary codes" you are mentioning to b and, implicitly, to the "codes" of each image has in the code of this project.

However, when you try 8 bits, 16 bits, 32 bits on your benchmark, which of the args are you changing on the training script? the subspace? or the product of the subspace and the subcenter? I say this because in your code a default value is

parser.add_argument('--subspace', default=4, type=int)
parser.add_argument('--subcenter', default=256, type=int)

In this case, is it 1024 bits?

@hbellafkir
Copy link
Contributor

256 centers can be indexed with 8bit, so for 4 spaces we need 8x4=32bit, where each 8bit indicates a center from the appropriate space.

@bl0
Copy link
Contributor

bl0 commented Oct 11, 2019

Thanks @hbellafkir

I am closing this issue due to a long time of inactivity, feel free to reopen it if there is any question. Thanks!

@bl0 bl0 closed this as completed Oct 11, 2019
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

3 participants