When using feature descriptors [like SIFT, SURF] – is Approximate Nearest Neighbour the fastest method to do matching between images?
When using feature descriptors [like SIFT, SURF] – is Approximate Nearest Neighbour the fastest
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
When using feature descriptors [like SIFT, SURF] – is Approximate Nearest Neighbour the fastest method to do matching between images?
I’d say that Euclidean distnace based nearest neighbor would be the easiest to implement, but not necessarily the fastest.
I’d agree that approximate nearest neighbor or ‘best bin first’ would be the quickest at identifying which image in your background set most closely resembles the probe image.
If your trying to identify a single object in the image, things will be a little more difficult.