Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 8, 2008 | Published
Book Section - Chapter Open

Incremental Learning of Nonparametric Bayesian Mixture Models

Abstract

Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group before learning can begin. Here we explore incremental clustering, in which data can arrive continuously. We present a novel incremental model-based clustering algorithm based on nonparametric Bayesian methods, which we call Memory Bounded Variational Dirichlet Process (MB-VDP). The number of clusters are determined flexibly by the data and the approach can be used to automatically discover object categories. The computational requirements required to produce model updates are bounded and do not grow with the amount of data processed. The technique is well suited to very large datasets, and we show that our approach outperforms existing online alternatives for learning nonparametric Bayesian mixture models.

Additional Information

© 2008 IEEE. This material is based on work supported by the National Science Foundation under grant numbers 0447903 and 0535278, the Office of Naval Research under grant numbers 00014-06-1-0734 and 00014-06-1-0795, and The National Institutes of Health Predoctoral Training in Integrative Neuroscience grant number T32 GM007737.

Attached Files

Published - Gomes2008p87642008_Ieee_Conference_On_Computer_Vision_And_Pattern_Recognition_Vols_1-12.pdf

Files

Gomes2008p87642008_Ieee_Conference_On_Computer_Vision_And_Pattern_Recognition_Vols_1-12.pdf

Additional details

Created:
August 19, 2023
Modified:
January 12, 2024