A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook
Abstract
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it also risks the loss of discriminative power. Moreover, creating a compact visual codebook can be very time-consuming, especially when the number of initial visual words is large. In this paper, to minimize its loss of discriminative power, we propose an approach to build a compact visual codebook by maximally preserving the separability of the object classes. Furthermore, a fast algorithm is designed to accomplish this task effortlessly, which can hierarchically merge 10,000 visual words down to 2 in ninety seconds. Experimental study shows that the compact visual codebook created in this way can achieve excellent classification performance even after a considerable reduction in size.
Cite
Text
Wang et al. "A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook." European Conference on Computer Vision, 2008. doi:10.1007/978-3-540-88693-8_53Markdown
[Wang et al. "A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook." European Conference on Computer Vision, 2008.](https://mlanthology.org/eccv/2008/wang2008eccv-fast/) doi:10.1007/978-3-540-88693-8_53BibTeX
@inproceedings{wang2008eccv-fast,
title = {{A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook}},
author = {Wang, Lei and Zhou, Luping and Shen, Chunhua},
booktitle = {European Conference on Computer Vision},
year = {2008},
pages = {719-732},
doi = {10.1007/978-3-540-88693-8_53},
url = {https://mlanthology.org/eccv/2008/wang2008eccv-fast/}
}