简体繁体中英

Reduce time needed for SIFT Brute-force Matcher Algorithm in OpenCV

原文 2014-09-03 05:45:52 8 1 performance/ algorithm/ opencv/ sift

I've been wondering how can SIFT Brute-force Matcher (for object identfication) time be reduced. My program iterates over some trainsets of images and returns the maximum number of matches found in each case. Is there a way (except for resizing the images to a smaller scale) to shorten this time interval because I think that the greater becomes my database it will be rendered useless if I have a huge identification time?

Thanks in advance

PS I use Python Bindings for OpenCV 2.4.9

1 answers

why dont you try flann matcher...... thats much faster than bruteforce......

http://docs.opencv.org/trunk/doc/py_tutorials/py_feature2d/py_feature_homography/py_feature_homography.html#py-feature-homography

Regex vs brute-force for small strings

Closest pair of points brute-force; Why O(n^2)?

Any alternatives to speeding up brute force 'tally' algorithm?

Reduce the time needed for a database to be read

Reduce time complexity of brute forcing - largest prime factor

Project Euler #14: Why is my TreeMap algorithm slower than brute force?

How can I speed up this brute force addition algorithm in Objective-C?

Two radically different queries against 4 mil records execute in the same time - one uses brute force

What is a better solution than brute force for this?

Saving a brute force result for future use?

暂无

The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.

Related Question Regex vs brute-force for small strings Closest pair of points brute-force; Why O(n^2)? Any alternatives to speeding up brute force 'tally' algorithm? Reduce the time needed for a database to be read Reduce time complexity of brute forcing - largest prime factor Project Euler #14: Why is my TreeMap algorithm slower than brute force? How can I speed up this brute force addition algorithm in Objective-C? Two radically different queries against 4 mil records execute in the same time - one uses brute force What is a better solution than brute force for this? Saving a brute force result for future use?

Related Tags

Reduce time needed for SIFT Brute-force Matcher Algorithm in OpenCV

Question

1 answers

solution1 2 ACCPTED 2014-09-04 06:28:59

solution1
2 ACCPTED 2014-09-04 06:28:59