Analysis of the Effect of Dataset Differences on Object Recognition: The Case of Recognition Methods Based on Exact Matching of Feature Vectors

SUMMARY Specific object recognition methods based on the exact matching of feature vectors are known as methods that can achieve high recognition performance for large-scale three-dimensional specific object recognition. Since there are few common three-dimensional object datasets whose size is sufficient to explore the effect of differences in object dataset composition and the effect of increasing number of objects for recognition, these effects for specific object recognition methods based on exact matching of feature vectors have been discussed insufficiently. The number of objects in well-known datasets (e.g., COIL-100) is around 100. Therefore, in this research, we prepared a dataset of 1002 three-dimensional objects by themselves. In this paper, we discuss the effect of dataset differences, which are based on object structure, texture, and the number of objects, for methods such as that based on the Bloomier filter and that based on a hash table with this dataset in addition to COIL-100. © 2013 Wiley Periodicals, Inc. Electron Comm Jpn, 96(9): 33–45, 2013; Published online in Wiley Online Library (wileyonlinelibrary.com). DOI 10.1002/ecj.11414

[1]  Eli Shechtman,et al.  In defense of Nearest-Neighbor based image classification , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[2]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[3]  K. Kise,et al.  A Memory Reduction Method for 3 D Object Recognition Based on Selection of Local Features , 2008 .

[4]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[5]  Bernard Chazelle,et al.  The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.

[6]  David Nistér,et al.  Scalable Recognition with a Vocabulary Tree , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[7]  Yan Ke,et al.  PCA-SIFT: a more distinctive representation for local image descriptors , 2004, CVPR 2004.

[8]  Koichi Kise,et al.  Compressed representation of feature vectors using a Bloomier filter and its application to specific object recognition , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

[9]  Efficient Recognition of Objects by Cascading Approximate Nearest Neighbor Searchers , 2007 .

[10]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[11]  K. Kise,et al.  Robust and Efficient Recognition of Low Quality Images by Increasing Reference Feature Vectors , 2010 .

[12]  Cordelia Schmid,et al.  Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search , 2008, ECCV.