Multiple object cues for high performance vector quantization

Citation data:

Pattern Recognition, ISSN: 0031-3203, Vol: 67, Page: 380-395

Publication Year:
2017
Usage 57
Abstract Views 56
Link-outs 1
Captures 11
Readers 9
Exports-Saves 2
Social Media 25
Shares, Likes & Comments 25
DOI:
10.1016/j.patcog.2017.02.024
Author(s):
B. Ramesh; C. Xiang; T. H. Lee
Publisher(s):
Elsevier BV
Tags:
Computer Science
article description
In this paper, we propose a multi-cue object representation for image classification using the standard bag-of-words model. Ever since the success of the bag-of-words model for image classification, several modifications of it have been proposed in the literature. These variants target to improve key aspects, such as efficient and compact dictionary learning, advanced image encoding techniques, pooling methods, and efficient kernels for the final classification step. In particular, “soft-encoding” methods such as sparse coding, locality constrained linear coding, Fisher vector encoding, have received great attention in the literature, to improve upon the “hard-assignment” obtained by vector quantization. Nevertheless, these methods come at a higher computational cost while little attention has been paid to the extracted local features. In contrast, we propose a novel multi-cue object representation for image classification using the simple vector quantization, and show highly competitive classification performance compared to state-of-the-art methods on popular datasets like Caltech-101 and MICC Flickr-101. Apart from the object representation, we also propose a novel keypoint detection scheme that helps to achieve a classification rate comparable to the popular dense keypoint sampling strategy, at a much lower computational cost.