{"title":"具有lp范数最大化的鲁棒稀疏张量分析","authors":"Ganyi Tang, Gui-Fu Lu, Zhongqun Wang","doi":"10.1109/ICSESS.2017.8343022","DOIUrl":null,"url":null,"abstract":"Tensor PCA, which can make full use of the spatial relationship of images/videos, plays an important role in computer vision and image analysis. The proposed method is robust to outliers because of using the adjustable Lp-norm. The elastic net, which generalizes the sparsity-inducing lasso penalty by combining the ridge penalty, is integrated into the objective function to develop a sparse model, which is beneficial for features extraction. We propose a greedy algorithm to extract basic features one by one and optimize projection matrices alternatively. The monotonicity of the iterative procedure are theoretically guaranteed. Experimental results upon several face databases demonstrate the advantages of the proposed approach.","PeriodicalId":179815,"journal":{"name":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"53 Pt 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust and sparse tensor analysis with Lp-norm maximization\",\"authors\":\"Ganyi Tang, Gui-Fu Lu, Zhongqun Wang\",\"doi\":\"10.1109/ICSESS.2017.8343022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tensor PCA, which can make full use of the spatial relationship of images/videos, plays an important role in computer vision and image analysis. The proposed method is robust to outliers because of using the adjustable Lp-norm. The elastic net, which generalizes the sparsity-inducing lasso penalty by combining the ridge penalty, is integrated into the objective function to develop a sparse model, which is beneficial for features extraction. We propose a greedy algorithm to extract basic features one by one and optimize projection matrices alternatively. The monotonicity of the iterative procedure are theoretically guaranteed. Experimental results upon several face databases demonstrate the advantages of the proposed approach.\",\"PeriodicalId\":179815,\"journal\":{\"name\":\"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"53 Pt 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2017.8343022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 8th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2017.8343022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust and sparse tensor analysis with Lp-norm maximization
Tensor PCA, which can make full use of the spatial relationship of images/videos, plays an important role in computer vision and image analysis. The proposed method is robust to outliers because of using the adjustable Lp-norm. The elastic net, which generalizes the sparsity-inducing lasso penalty by combining the ridge penalty, is integrated into the objective function to develop a sparse model, which is beneficial for features extraction. We propose a greedy algorithm to extract basic features one by one and optimize projection matrices alternatively. The monotonicity of the iterative procedure are theoretically guaranteed. Experimental results upon several face databases demonstrate the advantages of the proposed approach.