检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京邮电大学计算机学院,武汉430072 [2]南京邮电大学自动化学院,南京210023 [3]武汉大学软件工程国家重点实验室,武汉430072
出 处:《计算机工程》2017年第10期167-171,185,共6页Computer Engineering
基 金:国家自然科学基金(61073113);江苏省普通高校研究生科研创新计划项目(CXZZ12_0478)
摘 要:针对面向分类的传统字典学习方法在大数据集上批量学习时计算代价较高的问题,提出一种类特定的增量式字典学习算法。该算法在初始训练集上进行类特定的字典学习得到初始字典,通过增量数据集选取增量字典原子初始值。根据不能在初始字典上稀疏表示且互信息最大的原则,从增量样本集中选取若干样本作为增量字典原子的初始值。在保持原有字典原子不变的情况下,迭代更新编码系数和增量字典原子,直至收敛得到新的字典。利用稀疏表示分类器,在Eclipse数据集和ORL人脸图像数据库上的实验结果验证了该算法的分类有效性和计算代价上的优越性。Aiming at the problem that the computation cost of the traditional classification-oriented dictionary learning algorithms is too expensive on big datasets, this paper proposes a novel classification-oriented incremental dictionary learning algorithm. In the algorithm, the class-specific dictionary learning is conducted on the initial training set to obtain the initial dictionary. And the initial values of the incremental dictionary atoms are selected on the incremental data set. Based on the principle that the samples cannot be sparsely represented by old atoms and have the maximum mutual information, some samples are selected as the initial value of the incremental dictionary atoms. Keeping the original dictionary unchanged, the coding coefficient and the incremental dictionary atoms are updated iteratively until the convergence is realized and the new dictionary is obtained. Sparse representation classifier is used as classifier in experiments. Experimental results on the Eclipse software defect dataset and ORL face image database show that the proposed algorithm is effective in classification and has superiority in computational cost.
关 键 词:增量学习 字典学习 类特定字典 稀疏编码 稀疏表示分类
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.219