|Topic:||Efficient finding of nearest neighbors for binary vectors|
|Supervisor:||Prof. Dr. Ing. Jan Kybic|
|Description:||Binary keypoint descriptors, such as BRIEF or Boosting Binary Keypoint descriptors, are very compact and thus memory efficient. In the image matching task, keypoints are matched using their descriptors. The task is to find an efficient method for finding nearest neighbors for a given query binary vector and to compare it with alternative approaches, e.g. exhaustive comparison or a binary search.
|Realization form:||sw projekt|