{"title":"一种新的自适应子字典匹配追踪算法","authors":"Guo Jinku, Li Guangbin, Yang Xiaojun","doi":"10.1109/ICOSP.2008.4697105","DOIUrl":null,"url":null,"abstract":"Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.","PeriodicalId":445699,"journal":{"name":"2008 9th International Conference on Signal Processing","volume":"13 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A novel Matching Pursuit algorithm with adaptive subdictionary\",\"authors\":\"Guo Jinku, Li Guangbin, Yang Xiaojun\",\"doi\":\"10.1109/ICOSP.2008.4697105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.\",\"PeriodicalId\":445699,\"journal\":{\"name\":\"2008 9th International Conference on Signal Processing\",\"volume\":\"13 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 9th International Conference on Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOSP.2008.4697105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 9th International Conference on Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSP.2008.4697105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel Matching Pursuit algorithm with adaptive subdictionary
Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
