{"title":"一种基于冗余字典的自适应正交匹配追踪算法","authors":"Yu-min Tian, Zhihui Wang","doi":"10.1109/FSKD.2013.6816263","DOIUrl":null,"url":null,"abstract":"The reconstruction performance of an orthogonal matching pursuit algorithm is poor due to less observation values. An observation matrix design method which can adaptively ensure the sample size based on the image information is proposed. To make the algorithm more sparsely representative, an adaptive orthogonal matching pursuit algorithm based on the redundant dictionary is discussed by using a K-SVD dictionary training method to get a sparse dictionary. Experimental results show that the algorithm not only solves the problem that the sample size is small, but also improves the image reconstruction quality.","PeriodicalId":368964,"journal":{"name":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An adaptive orthogonal matching pursuit algorithm based on redundancy dictionary\",\"authors\":\"Yu-min Tian, Zhihui Wang\",\"doi\":\"10.1109/FSKD.2013.6816263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The reconstruction performance of an orthogonal matching pursuit algorithm is poor due to less observation values. An observation matrix design method which can adaptively ensure the sample size based on the image information is proposed. To make the algorithm more sparsely representative, an adaptive orthogonal matching pursuit algorithm based on the redundant dictionary is discussed by using a K-SVD dictionary training method to get a sparse dictionary. Experimental results show that the algorithm not only solves the problem that the sample size is small, but also improves the image reconstruction quality.\",\"PeriodicalId\":368964,\"journal\":{\"name\":\"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)\",\"volume\":\"164 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2013.6816263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 10th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2013.6816263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An adaptive orthogonal matching pursuit algorithm based on redundancy dictionary
The reconstruction performance of an orthogonal matching pursuit algorithm is poor due to less observation values. An observation matrix design method which can adaptively ensure the sample size based on the image information is proposed. To make the algorithm more sparsely representative, an adaptive orthogonal matching pursuit algorithm based on the redundant dictionary is discussed by using a K-SVD dictionary training method to get a sparse dictionary. Experimental results show that the algorithm not only solves the problem that the sample size is small, but also improves the image reconstruction quality.