z-logo
open-access-imgOpen Access
High discriminative SIFT feature and feature pair selection to improve the bag of visual words model
Author(s) -
Liu Lifeng,
Ma Yan,
Zhang Xiangfen,
Zhang Yuping,
Li Shunbao
Publication year - 2017
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2017.0062
Subject(s) - discriminative model , scale invariant feature transform , artificial intelligence , pattern recognition (psychology) , histogram , computer science , bag of words model in computer vision , feature (linguistics) , bag of words model , feature selection , feature extraction , visual word , mathematics , image (mathematics) , image retrieval , linguistics , philosophy
The bag of visual words (BOW) model has been widely applied in the field of image recognition and image classification. However, all scale‐invariant feature transform (SIFT) features are clustered to construct the visual words which result in a substantial loss of discriminative power for the visual words. The corresponding visual phrases will further render the generated BOW histogram sparse. In this study, the authors aim to improve the classification accuracy by extracting high discriminative SIFT features and feature pairs. First, high discriminative SIFT features are extracted with the within‐ and between‐class correlation coefficients. Second, the high discriminative SIFT feature pairs are selected by using minimum spanning tree and its total cost. Next, high discriminative SIFT features and feature pairs are exploited to construct the visual word dictionary and visual phrase dictionary, respectively, which are concatenated to a joint histogram with different weights. Compared with the state‐of‐the‐art BOW‐based methods, the experimental results on Caltech 101 dataset show that the proposed method has higher classification accuracy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here