Home >

news ヘルプ

論文・著書情報


タイトル
和文: 
英文:Neighbor-To-Neighbor Search for Fast Coding of Feature Vectors 
著者
和文: 井上 中順, 篠田 浩一.  
英文: Nakamasa Inoue, Koichi Shinoda.  
言語 English 
掲載誌/書名
和文: 
英文:2013 IEEE International Conference on Computer Vision 
巻, 号, ページ         pp. 1233-1240
出版年月 2013年12月3日 
出版者
和文: 
英文: 
会議名称
和文: 
英文:2013 IEEE International Conference on Computer Vision 
開催地
和文: 
英文:Sydney 
ファイル
DOI http://dx.doi.org/10.1109/ICCV.2013.156
アブストラクト Assigning a visual code to a low-level image descriptor, which we call code assignment, is the most computationally expensive part of image classification algorithms based on the bag of visual word (BoW) framework. This paper proposes a fast computation method, Neighbor-to- Neighbor (NTN) search, for this code assignment. Based on the fact that image features from an adjacent region are usually similar to each other, this algorithm effectively reduces the cost of calculating the distance between a codeword and a feature vector. This method can be applied not only to a hard codebook constructed by vector quantization (NTN-VQ), but also to a soft codebook, a Gaussian mixture model (NTN-GMM). We evaluated this method on the PASCAL VOC 2007 classification challenge task. NTN-VQ reduced the assignment cost by 77.4% in super-vector coding, and NTN-GMM reduced it by 89.3% in Fisher-vector coding, without any significant degradation in classification performance.

©2007 Tokyo Institute of Technology All rights reserved.