Abstract:
We present a novel approach to the design of codebooks in patch-based, bag-of-feature visual scene recognition problems. The Sequential Input Space Carving (SISC) approach we present achieves compact codebooks in a fraction of the computation time needed by the K-means clustering method usually employed in this setting. We demonstrate the performance of the SISC using several recognition tasks including the PASCAL VOC challenge, human action classification tasks using the KTH and WEIZMANN datasets and texture classification tasks using the UIUC, and CUReT datasets. In all these, the SISC approach achieves classification performances comparable to those reported by other authors, and sometimes outperforms them, in a fraction of the computing time and at significantly smaller codebook sizes.
