Denis C. Ilie-Ablachim, Andra Baltoiu, Bogdan Dumitrescu
{"title":"锥原子稀疏表示","authors":"Denis C. Ilie-Ablachim, Andra Baltoiu, Bogdan Dumitrescu","doi":"10.1109/icassp49357.2023.10095127","DOIUrl":null,"url":null,"abstract":"We extend the notion of sparse representation to the case where the atoms are not vectors, but cones, hence infinite sets. The sparse representation is linear, as usual, but the most convenient vector is chosen from each selected cone. We give a cone version of Orthogonal Matching Pursuit (OMP) and show that its complexity is only a few times larger than that of OMP. The new cone OMP can be used for anomaly detection; we apply it with very good results to the detection of abnormal heartbeats.","PeriodicalId":113072,"journal":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sparse Representations with Cone Atoms\",\"authors\":\"Denis C. Ilie-Ablachim, Andra Baltoiu, Bogdan Dumitrescu\",\"doi\":\"10.1109/icassp49357.2023.10095127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We extend the notion of sparse representation to the case where the atoms are not vectors, but cones, hence infinite sets. The sparse representation is linear, as usual, but the most convenient vector is chosen from each selected cone. We give a cone version of Orthogonal Matching Pursuit (OMP) and show that its complexity is only a few times larger than that of OMP. The new cone OMP can be used for anomaly detection; we apply it with very good results to the detection of abnormal heartbeats.\",\"PeriodicalId\":113072,\"journal\":{\"name\":\"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icassp49357.2023.10095127\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icassp49357.2023.10095127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We extend the notion of sparse representation to the case where the atoms are not vectors, but cones, hence infinite sets. The sparse representation is linear, as usual, but the most convenient vector is chosen from each selected cone. We give a cone version of Orthogonal Matching Pursuit (OMP) and show that its complexity is only a few times larger than that of OMP. The new cone OMP can be used for anomaly detection; we apply it with very good results to the detection of abnormal heartbeats.