A Generalized Probabilistic Framework for Compact Codebook Creation
Compact and discriminative visual codebooks are preferred in many visual recognition tasks. In the literature, a few researchers have taken the approach of hierarchically merging visual words of a initial large-size code-book, but implemented this idea with different merging criteria. In this work, we show that by defining different class-conditional distribution function and parameter estimation method, these merging criteria can be unified under a single probabilistic framework. More...[Show more]
|Collections||ANU Research Publications|
|Source:||Graph connectivity in sparse subspace clustering|
|01_Liu_A_Generalized_Probabilistic_2011.pdf||186.9 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.