检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yan Yangyang Fu Xiang
机构地区:[1]Institute of Computer Vision,Nanchang Hang Kong University,Nanchang,China
出 处:《通讯和计算机(中英文版)》2019年第1期14-24,共11页Journal of Communication and Computer
摘 要:Flower Image Classification is a Fine-Grained Classification problem.The main difficulty of Fine-Grained Classification is the large inter-class similarity and the inner-class difference.In this paper,we propose a new algorithm based on Saliency Map and PCANet to overcome the difficulty.This algorithm mainly consists of two parts:flower region selection,flower feature learning.In first part,we combine saliency map with gray-scale map to select flower region.In second part,we use the flower region as input to train the PCANet which is a simple deep learning network for learning flower feature automatically,then a 102-way softmax layer that follow the PCANet achieve classification.Our approach achieves 84.12%accuracy on Oxford 17 Flowers dataset.The results show that a combination of Saliency Map and simple deep learning network PCANet can applies to flower image classification problem.
关 键 词:SALIENCY MAP PCANet DEEP LEARNING FLOWER IMAGE classification
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.68.176