0
$\begingroup$

I'm reading through BRIEF and one point isn't clear to me. If we are randomly sampling the pixel-vs-pixel tests, how is it that we obtain a reproducible descriptor?

EDIT

This is a duplicate. Find question with answer here

$\endgroup$
1
  • $\begingroup$ I'm used to writing longer, more detailed questions on here, but if you're someone who knows the answer to this one, you probably understand the question despite the brevity. $\endgroup$ Mar 30 at 19:16
0
$\begingroup$

It looks to me as if they came up with a random pixel patch vs pixel patch set of points and they used this to train their system. The system then recognizes different transformations by looking at the database of transformations and seeing how the transformations would affect the match. It then picks the transformation with the best score (lowest Hamming distance). The random pixel locations are only random once during the system design.

$\endgroup$
2
  • $\begingroup$ Yeah I got a response on Reddit saying that the same set of random points is used. It just seems weird to me, as then I'd expect they would make more of a point about where to find these points so that all implementations of it look the same. $\endgroup$ Mar 31 at 8:09
  • $\begingroup$ Here is the response! dsp.stackexchange.com/questions/69951/… $\endgroup$ Mar 31 at 8:30

Not the answer you're looking for? Browse other questions tagged or ask your own question.