{"title":"增量l1 -范数主成分分析的新算法","authors":"M. Dhanaraj, Panos P. Markopoulos","doi":"10.23919/EUSIPCO.2018.8553239","DOIUrl":null,"url":null,"abstract":"L1-norm Principal-Component Analysis (L1-PCA) has been shown to exhibit sturdy resistance against outliers among the processed data. In this work, we propose L1-IPCA: an algorithm for incremental L1-PCA, appropriate for big-data and streaming-data applications. The proposed algorithm updates the calculated L1-norm principal components as new data points arrive, conducting a sequence of computationally efficient bit-flipping iterations. Our experimental studies on subspace estimation, image conditioning, and video foreground extraction illustrate that the proposed algorithm attains remarkable outlier resistance at low computational cost.","PeriodicalId":303069,"journal":{"name":"2018 26th European Signal Processing Conference (EUSIPCO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Novel Algorithm for Incremental L1-Norm Principal-Component Analysis\",\"authors\":\"M. Dhanaraj, Panos P. Markopoulos\",\"doi\":\"10.23919/EUSIPCO.2018.8553239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"L1-norm Principal-Component Analysis (L1-PCA) has been shown to exhibit sturdy resistance against outliers among the processed data. In this work, we propose L1-IPCA: an algorithm for incremental L1-PCA, appropriate for big-data and streaming-data applications. The proposed algorithm updates the calculated L1-norm principal components as new data points arrive, conducting a sequence of computationally efficient bit-flipping iterations. Our experimental studies on subspace estimation, image conditioning, and video foreground extraction illustrate that the proposed algorithm attains remarkable outlier resistance at low computational cost.\",\"PeriodicalId\":303069,\"journal\":{\"name\":\"2018 26th European Signal Processing Conference (EUSIPCO)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 26th European Signal Processing Conference (EUSIPCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/EUSIPCO.2018.8553239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/EUSIPCO.2018.8553239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Novel Algorithm for Incremental L1-Norm Principal-Component Analysis
L1-norm Principal-Component Analysis (L1-PCA) has been shown to exhibit sturdy resistance against outliers among the processed data. In this work, we propose L1-IPCA: an algorithm for incremental L1-PCA, appropriate for big-data and streaming-data applications. The proposed algorithm updates the calculated L1-norm principal components as new data points arrive, conducting a sequence of computationally efficient bit-flipping iterations. Our experimental studies on subspace estimation, image conditioning, and video foreground extraction illustrate that the proposed algorithm attains remarkable outlier resistance at low computational cost.