• DocumentCode
    3432993
  • Title

    Key point reduction in SIFT descriptor used by subtractive clustering

  • Author

    Alitappeh, Reza Javanmard ; Saravi, Kossar Jeddi ; Mahmoudi, Fariborz

  • Author_Institution
    Islamic Azad Univ. of Qazvin, Qazvin, Iran
  • fYear
    2012
  • fDate
    2-5 July 2012
  • Firstpage
    906
  • Lastpage
    911
  • Abstract
    The SIFT descriptor is one of the most widely used descriptors and is very stable in regard to changes in rotation, scale, affine, illumination, etc. This method is based on key points extracted from the image. If there are many such points, a lot of time will be needed in the matching and recognition phases. For this reason, we have tried in this article to use the clustering technique in order to reduce the number of key points by omitting similar points. In other words, subtractive clustering is used to select key points which are more distinct from and less similar to other points. In the section on conclusions, a successful implementation of this method is presented. The efficiencies of the proposed algorithm and of the base SIFT algorithm on the data set ALOI were investigated and it was observed that by adding this method to the base SIFT descriptor the rate of recognition increases by two percent and the time complexity decreases by 1.035728 seconds.
  • Keywords
    computational complexity; feature extraction; image matching; pattern clustering; affine; base SIFT descriptor; data set ALOI; illumination; image extraction; key point reduction; matching phases; recognition phases; rotation; scale; subtractive clustering; time complexity; Accuracy; Clustering algorithms; Data mining; Feature extraction; Object recognition; Training; Vectors; Object Recognition; SIFT Descriptor; Subtractive Clustering;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science, Signal Processing and their Applications (ISSPA), 2012 11th International Conference on
  • Conference_Location
    Montreal, QC
  • Print_ISBN
    978-1-4673-0381-1
  • Electronic_ISBN
    978-1-4673-0380-4
  • Type

    conf

  • DOI
    10.1109/ISSPA.2012.6310683
  • Filename
    6310683