Sunday, August 29, 2010

PCA-SIFT Details

PCA-SIFT was introduced as an improvement for SIFT. The implementation only differs in the 4th step (keypoint descriptor). PCA-SIFT uses Principal Component Analysis (PCA) instead of a histogram to normalize the gradient patch. Hence, the feature vector is significantly smaller than the standard SIFT feature vector.

It differs from the original SIFT implementation in its forth stage. By reducing the 128 element of the original SIFT using PCA, results in a significant space benefit.

Another difference is the input vector is created by concatenating the horizontal and vertical gradient maps for 41x41 patch centered at the keypoint. Producing 2x39x39 = 3042 vector elements. The fewer components of PCA-SIFT requires less storage therefore, resulting in faster matching. The dimensionality of this feature space is arbitrary chosen as n=20, which results in a significant space benefit.

TO DO: add more detail

4 comments:

  1. suppose I want to find PCA-SIFT for dense interest points. So is it equivalent to taking all 41x41 patches from image gradient and applying PCA?

    ReplyDelete
  2. Replies
    1. Can you please email the code of PCA SIFT

      Delete
    2. Hye I have research work on pcasift
      Could you plz share this code as i have not been able to find any help on internet for it

      Delete