18 December 2003 Image database clustering with SVM-based class personalization
Author Affiliations +
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.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bertrand H Le Saux, Bertrand H Le Saux, Nozha Boujemaa, Nozha Boujemaa, "Image database clustering with SVM-based class personalization", Proc. SPIE 5307, Storage and Retrieval Methods and Applications for Multimedia 2004, (18 December 2003); doi: 10.1117/12.526610; https://doi.org/10.1117/12.526610
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Warped metrics for image similarity retrieval
Proceedings of SPIE (December 19 2001)
Querying semantic image databases
Proceedings of SPIE (March 31 1992)
Decision-theoretic image retrieval
Proceedings of SPIE (June 30 2002)

Back to Top