SIFT descriptor for binary shape discrimination, classification and matching

Abstract

In this work, we study efficiency of SIFT descriptor in discrimination of binary shapes.We also analyze how the use of 2−tuples of SIFT keypoints can affect discrimination of shapes. The study is divided into two parts, the first part serves as a primary analysis where we propose to compute overlap of classes using SIFT and a majority vote of keypoints. In the second part, we analyze both classification and matching of binary shapes using SIFT and Bag of Features. Our empirical study shows that SIFT although being considered as a texture feature, can be used to distinguish shapes in binary images and can be applied to the classification of foreground’s silhouettes.