How to use SIFT algorithm to compute how similar two images are?

by

First, aren’t you supposed to be using vl_sift instead of sift?

Second, you can use SIFT feature matching to find correspondences in the two images. Here’s some sample code: 

    I = imread('p1.jpg');
    J = imread('p2.jpg');

    I = single(rgb2gray(I)); % Conversion to single is recommended
    J = single(rgb2gray(J)); % in the documentation

    [F1 D1] = vl_sift(I);
    [F2 D2] = vl_sift(J);

    % Where 1.5 = ratio between euclidean distance of NN2/NN1
    [matches score] = vl_ubcmatch(D1,D2,1.5); 

    subplot(1,2,1);
    imshow(uint8(I));
    hold on;
    plot(F1(1,matches(1,:)),F1(2,matches(1,:)),'b*');

    subplot(1,2,2);
    imshow(uint8(J));
    hold on;
    plot(F2(1,matches(2,:)),F2(2,matches(2,:)),'r*');

vl_ubcmatch() essentially does the following:

Suppose you have a point P in F1 and you want to find the “best” match in F2. One way to do that is to compare the descriptor of P in F1 to all the descriptors in D2. By compare, I mean find the Euclidean distance (or the L2-norm of the difference of the two descriptors).

Then, I find two points in F2, say U & V which have the lowest and second-lowest distance (say, Du and Dv) from P respectively.

Here’s what Lowe recommended: if Dv/Du >= threshold (I used 1.5 in the sample code), then this match is acceptable; otherwise, it’s ambiguously matched and is rejected as a correspondence and we don’t match any point in F2 to P. Essentially, if there’s a big difference between the best and second-best matches, you can expect this to be a quality match.

This is important since there’s a lot of scope for ambiguous matches in an image: imagine matching points in a lake or a building with several windows, the descriptors can look very similar but the correspondence is obviously wrong.

You can do the matching in any number of ways .. you can do it yourself very easily with MATLAB or you can speed it up by using a KD-tree or an approximate nearest number search like FLANN which has been implemented in OpenCV.

EDIT: Also, there are several kd-tree implementations in MATLAB.

More Related Contents:

  1. how to get a single feature vector from SIFT descriptor [closed]
  2. How to make the blackboard text appear clearer using MATLAB?
  3. Content-Based Image Retrieval and Precision-Recall graphs using Color Histograms in MATLAB
  4. f(x) = 1 for -0.5
  5. find unknown value in matrix using MATLAB [closed]
  6. Finding islands of zeros in a sequence
  7. How can I plot a function with two variables in Octave or Matlab?
  8. How should I update the data of a plot in Matlab?
  9. Automatically plot different colored lines
  10. Suppress Output
  11. How do I set default values for functions parameters in MATLAB?
  12. How to select a submatrix (not in any particular pattern) in Matlab
  13. Matlab ode solvers: changing state and specified time
  14. How to divide an image into blocks in MATLAB?
  15. Access m-files in a subfolder without permanently adding it to the path
  16. What does operator “dot” (.) mean?
  17. Example of 10-fold SVM classification in MATLAB
  18. How can I find the maximum value and its index in array in MATLAB?
  19. Vectorizing the Notion of Colon (:) – values between two vectors in MATLAB
  20. Reading CSV files with MATLAB?
  21. What’s the difference between & and && in MATLAB?
  22. How can I count the number of elements of a given value in a matrix?
  23. Determining the number of occurrences of each unique element in a vector
  24. Unicode characters in MATLAB source files
  25. How to draw horizontal and vertical lines in MATLAB?
  26. Turn a MATLAB plot into image
  27. MATLAB debugging: smarter way to stop the code with an specific condition?
  28. Generating all combinations with repetition using MATLAB
  29. Rounding to n significant digits
  30. How do I double the size of a vector in MATLAB with interpolation?

Leave a Comment