Revision history [back]

I'm working on my thesis and I measured times it takes for each algorithm SIFT and SURF to find a match. I know that SURF was designed to be faster than SIFT, but my measures revealed the opposite. The measure test is running with 20 images from very small to very big, from black and white to very colorful. The tests show, that SIFT is twice as fast than SURF I'm using OpenCV-2.4.8 with Java interface and FLANNBASED descriptor matcher. I'm not the only one who notice this, for example here is another one, but without answer: link

How can I explain this in my thesis ?

I'm working on my thesis and I measured times it takes for each algorithm SIFT and SURF to find a match. I know that SURF was designed to be faster than SIFT, but my measures revealed the opposite. The measure test is running with 20 images from very small to very big, from black and white to very colorful. The tests show, that SIFT is twice as fast than as SURF I'm using OpenCV-2.4.8 with Java interface and FLANNBASED descriptor matcher. I'm not the only one who notice this, for example here is another one, but without answer: link

How can I explain this in my thesis ?

I'm working on my thesis and I measured times it takes for each algorithm SIFT and SURF to find a match. I know that SURF was designed to be faster than SIFT, but my measures revealed the opposite. The measure test is running with 20 images from very small to very big, from black and white to very colorful. The tests show, that SIFT is twice as fast as SURF I'm using OpenCV-2.4.8 with Java interface and FLANNBASED descriptor matcher. I'm not the only one who notice this, for example here is another one, but without answer: link

How can I explain this in my thesis ?