I am trying to write a SIFT implementation as an exercise. However, I encounter problems that I have not yet been able to figure out. As far as I can tell, what I get is the opposite of SIFT: it finds uninteresting, flat areas of the image. I am using VXL.
In any case, my understanding of the early stages of SIFT is as follows:
Build a Guassian pyramid
Using this pyramid, get the gaussians difference pyramid
Find all local extremes to get potential key points
It doesn’t matter since I don’t know.
I have a pastebin of my code, if someone wants to help, I will be infinitely grateful. So far, this is what my algorithm pulls out, with a magenta pixel at the location of each detected “key point”.
Finally, a standard disclaimer, my apologies if I did something wrong or violated some rules of conduct.
source
share