{"title":"Single-layer Unsupervised Feature Learning with l2 regularized sparse filtering","authors":"Zhao Yang, Lianwen Jin, Dapeng Tao, Shuye Zhang, Xin Zhang","doi":"10.1109/ChinaSIP.2014.6889288","DOIUrl":null,"url":null,"abstract":"Patch-based Single-layer Unsupervised Feature Learning (SUFL) has been successfully applied in several tasks of computer vision. In the feature learning process, the key ingredient is how to learn a good feature mapping that connects patches to feature vectors. Among various feature mapping methods, the sparse filtering is easy to be implemented and hyper-parameter free. However, the standard sparse filtering method only considers the sparsity distribution of the learned features, ignoring the feature mapping matrix itself. This will lead to a random magnitude for mapping matrix and further weaken the generation performance. In this paper we proposed L2 regularized sparse filtering for the feature mapping in SULF. Classification experiments on three different datasets, i.e., CIFAR-10, small Norb, and subsets of CISIA-HWDB1.0 handwritten characters, show that our method has better performance comparing with the standard sparse filtering.","PeriodicalId":248977,"journal":{"name":"2014 IEEE China Summit & International Conference on Signal and Information Processing (ChinaSIP)","volume":"30 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE China Summit & International Conference on Signal and Information Processing (ChinaSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaSIP.2014.6889288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Patch-based Single-layer Unsupervised Feature Learning (SUFL) has been successfully applied in several tasks of computer vision. In the feature learning process, the key ingredient is how to learn a good feature mapping that connects patches to feature vectors. Among various feature mapping methods, the sparse filtering is easy to be implemented and hyper-parameter free. However, the standard sparse filtering method only considers the sparsity distribution of the learned features, ignoring the feature mapping matrix itself. This will lead to a random magnitude for mapping matrix and further weaken the generation performance. In this paper we proposed L2 regularized sparse filtering for the feature mapping in SULF. Classification experiments on three different datasets, i.e., CIFAR-10, small Norb, and subsets of CISIA-HWDB1.0 handwritten characters, show that our method has better performance comparing with the standard sparse filtering.