DocumentCode
2427605
Title
Automated Flower Classification over a Large Number of Classes
Author
Nilsback, Maria-Elena ; Zisserman, Andrew
Author_Institution
Dept. of Eng. Sci., Univ. of Oxford, Oxford
fYear
2008
fDate
16-19 Dec. 2008
Firstpage
722
Lastpage
729
Abstract
We investigate to what extent combinations of features can improve classification performance on a large dataset of similar classes. To this end we introduce a 103 class flower dataset. We compute four different features for the flowers, each describing different aspects, namely the local shape/texture, the shape of the boundary, the overall spatial distribution of petals, and the colour. We combine the features using a multiple kernel framework with a SVM classifier. The weights for each class are learnt using the method of Varma and Ray, which has achieved state of the art performance on other large dataset, such as Caltech 101/256. Our dataset has a similar challenge in the number of classes, but with the added difficulty of large between class similarity and small within class similarity. Results show that learning the optimum kernel combination of multiple features vastly improves the performance, from 55.1% for the best single feature to 72.8% for the combination of all features.
Keywords
feature extraction; image classification; image colour analysis; support vector machines; SVM classifier; automated flower classification; multiple kernel framework; support vector machine; Distributed computing; Kernel; Shape; Support vector machine classification; Support vector machines; object classification; segmentation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision, Graphics & Image Processing, 2008. ICVGIP '08. Sixth Indian Conference on
Conference_Location
Bhubaneswar
Print_ISBN
978-0-7695-3476-3
Electronic_ISBN
978-0-7695-3476-3
Type
conf
DOI
10.1109/ICVGIP.2008.47
Filename
4756141
Link To Document