{"title":"一种快速的压缩感知算法","authors":"Hao Liu, Yuehao Yan, Junhai Wang","doi":"10.1109/ICCWAMTIP.2014.7073450","DOIUrl":null,"url":null,"abstract":"After studying the compressed sensing theory and its main reconstruction algorithm-Matching Pursuit (MP) algorithm, this paper proposes a new approach to improve the speed of MP algorithm, and it describes how to build a Beowulf parallel computing system with 8 PCs. Its parallel computations is implemented by Message-Passing-Interface(MPI), and a 100Mb/s high speed Ethernet network interconnects all PCs. Test is made using parallel computing program to measure the parallel efficiency of the system, results show that this approach can reduce the MP algorithm computing time-cost form 78 minutes with a PC to 11 minutes with 8 PCs.","PeriodicalId":211273,"journal":{"name":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A fast algorithm of compressed sensing\",\"authors\":\"Hao Liu, Yuehao Yan, Junhai Wang\",\"doi\":\"10.1109/ICCWAMTIP.2014.7073450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"After studying the compressed sensing theory and its main reconstruction algorithm-Matching Pursuit (MP) algorithm, this paper proposes a new approach to improve the speed of MP algorithm, and it describes how to build a Beowulf parallel computing system with 8 PCs. Its parallel computations is implemented by Message-Passing-Interface(MPI), and a 100Mb/s high speed Ethernet network interconnects all PCs. Test is made using parallel computing program to measure the parallel efficiency of the system, results show that this approach can reduce the MP algorithm computing time-cost form 78 minutes with a PC to 11 minutes with 8 PCs.\",\"PeriodicalId\":211273,\"journal\":{\"name\":\"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCWAMTIP.2014.7073450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Computer Conference on Wavelet Actiev Media Technology and Information Processing(ICCWAMTIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCWAMTIP.2014.7073450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
After studying the compressed sensing theory and its main reconstruction algorithm-Matching Pursuit (MP) algorithm, this paper proposes a new approach to improve the speed of MP algorithm, and it describes how to build a Beowulf parallel computing system with 8 PCs. Its parallel computations is implemented by Message-Passing-Interface(MPI), and a 100Mb/s high speed Ethernet network interconnects all PCs. Test is made using parallel computing program to measure the parallel efficiency of the system, results show that this approach can reduce the MP algorithm computing time-cost form 78 minutes with a PC to 11 minutes with 8 PCs.