Automated flower classification over a large number of classes

被引:1836
作者
Nilsback, Maria-Elena [1 ]
Zisserman, Andrew [1 ]
机构
[1] Univ Oxford, Visual Geometry Grp, Dept Engn Sci, Oxford OX1 2JD, England
来源
SIXTH INDIAN CONFERENCE ON COMPUTER VISION, GRAPHICS & IMAGE PROCESSING ICVGIP 2008 | 2008年
关键词
D O I
10.1109/ICVGIP.2008.47
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 [16], 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.
引用
收藏
页码:722 / 729
页数:8
相关论文
共 18 条
  • [1] [Anonymous], 2006, IEEE COMP SOC C COMP
  • [2] [Anonymous], 2007, P ICCV
  • [3] [Anonymous], 2004, IEEE COMP SOC C COMP
  • [4] [Anonymous], P ICCV, DOI DOI 10.1109/ICCV.2001.937505
  • [5] [Anonymous], 1998, Encyclopedia of Biostatistics
  • [6] Bach F. R., 2004, P ICML
  • [7] Bosch A., 2007, P CIVR
  • [8] Indexing flower patent images using domain knowledge
    Das, M
    Manmatha, R
    Riseman, EM
    [J]. IEEE INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 1999, 14 (05): : 24 - 32
  • [9] GFIFFIN G, 2007, 7694 CALTECH
  • [10] Distinctive image features from scale-invariant keypoints
    Lowe, DG
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2004, 60 (02) : 91 - 110