| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6905116 | Applied Soft Computing | 2015 | 6 Pages |
Abstract
- FV can be considered as a generalization of the BoW. In other words, BoW is a particular case of the FV. The additional gradients improve the FV's performance greatly.
- Smaller codebooks can be used to construct the FV, which yields lower computational cost.
- FV performs well even with simple linear classifiers.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Muzaffer Aslan, Abdulkadir Sengur, Yang Xiao, Haibo Wang, M. Cevdet Ince, Xin Ma,