In this work, we present a novel, fast clustering scheme for codebook generation from local features for object class recognition. It relies on a sequential data analysis and creates compact clusters with low variance. We compare our algorithm to other commonly used algorithms with respect to cluster statistics and classification performance. It turns out that our algorithm is the fastest for codebook generation, without loss in classification performance, when using the right matching scheme. In this context, we propose a well suited matching scheme for assigning data entries to cluster centers based on the sigmoid function. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Teynor, A., & Burkhardt, H. (2007). Fast codebook generation by sequential data analysis for object classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4841 LNCS, pp. 610–620). Springer Verlag. https://doi.org/10.1007/978-3-540-76858-6_59
Mendeley helps you to discover research relevant for your work.