I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward
{"title":"基于稀疏奇异值分解的缺失交通重构改进OMP","authors":"I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward","doi":"10.1109/ICT.2019.8798801","DOIUrl":null,"url":null,"abstract":"Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Enhanced OMP for Missing Traffic Reconstruction based on Sparse SVD\",\"authors\":\"I. D. Irawati, A. B. Suksmono, Ian Joseph Matheus Edward\",\"doi\":\"10.1109/ICT.2019.8798801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.\",\"PeriodicalId\":127412,\"journal\":{\"name\":\"2019 26th International Conference on Telecommunications (ICT)\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 26th International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2019.8798801\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 26th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2019.8798801","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhanced OMP for Missing Traffic Reconstruction based on Sparse SVD
Missing large amount of internet data is a crucial issue to be addressed in network monitoring. The missing information should be restored using only a minimum knowledge of the data. Compressive Sampling (CS) algorithm provides a solution to complete data by utilizing the properties of randomness in the input data. Recently the reconstruction algorithm has developed in the base dictionary using orthogonal based operators. In this paper, we consider a CS approch to solve the missing problem using Singular Value Decomposition (SVD) sparsity, routing matrix for measurement matrix, and Orthogonal Matching Pursuit (OMP) as a recovery algorithm. To improve the accuracy, we also incorporating linear interpolation after OMP and Bilinear interpolation after SVD reconstruction. The missing scheme is randomized to simulate the actual behaviour of the network. Our experiments show that our proposed method is capable to fix large missing values with a high degree of accuracy for all missing type. This method is superior compared to the method in previous studies.