Share Email Print
cover

Proceedings Paper

Image database clustering with SVM-based class personalization
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

To allow efficient browsing of large image collections, we have to provide a summary of its visual content. We present in this paper a robust approach to organize image databases: the Adaptive Robust Competition (ARC). This algorithm relies on a non-supervised database categorization, coupled with a selection of prototypes in each resulting category. This categorization is performed using image descriptors, which describe the visual appearance of the images. A principal component analysis is performed for every feature to reduce dimensionality. Then, clustering is performed in challenging conditions by minimizing a Competitive Agglomeration objective function with an extra noise cluster to collect outliers. The competition is improved to be adaptive to clusters of various densities. In a second step, we provide the user with tools to correct possible misclassifications and personalize the image categories. The constraints to deal with for such a system are the simplicity of the user feedback and the rapidity to propose a new category based on the user's criteria.

Paper Details

Date Published: 18 December 2003
PDF: 11 pages
Proc. SPIE 5307, Storage and Retrieval Methods and Applications for Multimedia 2004, (18 December 2003); doi: 10.1117/12.526610
Show Author Affiliations
Bertrand H Le Saux, INRIA Rocquencourt (France)
Nozha Boujemaa, INRIA Rocquencourt (France)


Published in SPIE Proceedings Vol. 5307:
Storage and Retrieval Methods and Applications for Multimedia 2004
Minerva M. Yeung; Rainer W. Lienhart; Chung-Sheng Li, Editor(s)

© SPIE. Terms of Use
Back to Top