Sparse representations based attribute learning for flower classification

被引:19
作者
Cheng, Keyang [1 ,2 ]
Tan, Xiaoyang [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Sch Informat Sci & Technol, Nanjing 210016, Jiangsu, Peoples R China
[2] Jiangsu Univ, Sch Comp Sci & Telecommun Engn, Zhenjiang 212013, Jiangsu, Peoples R China
基金
美国国家科学基金会;
关键词
Flower classification; Attribute learning; Sparse representation; Attribute reduce;
D O I
10.1016/j.neucom.2014.05.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Classification for flowers is a very difficult task. Traditional methods need to built a classifier for each flower category, and obtain large number of flower samples to train these classifiers. In practice, many different types of flowers make the job become very difficult and boring. In this work, we present an attribute based approach for flowers recognition. Particularly, instead of training for a specific category of flowers directly based on manually designed features such as SIFT and HoG, we extract a series of visual attributes from a given set of flower images and generalize these to new images with possibly unknown flowers. A recently proposed sparse representations classification scheme is employed to predict the attributes of a given flower image from any category. In addition, we use a genetic algorithm to find the most discriminative attributes among others for better performance during the stage of flower classification. The effectiveness of the proposed method is validated on a publicly available flower classification database with promising results. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:416 / 426
页数:11
相关论文
共 41 条
[1]  
[Anonymous], P INT C COMP VIS PAT
[2]  
[Anonymous], P INT C COMP VIS PAT
[3]  
[Anonymous], P INT S MIX AUGM REA
[4]  
[Anonymous], 2006, IEEE T INF THEORY
[5]  
[Anonymous], 2007, Computer Vision
[6]  
[Anonymous], P INT C COMP VIS PAT
[7]  
[Anonymous], 2009, P 17 ACM INT C MULTI
[8]  
[Anonymous], P INT C COMP VIS
[9]  
[Anonymous], INT J ADV COMPUT TEC
[10]  
[Anonymous], IEEE T PATTERN ANAL