{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:14:54Z","timestamp":1730225694796,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T00:00:00Z","timestamp":1621209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,17]]},"DOI":"10.1109\/i2mtc50364.2021.9459978","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T18:17:46Z","timestamp":1624904266000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Recovery of Noisy Compressively Sensed Speech via Regularized Maximum Feasible Subsystem Algorithm"],"prefix":"10.1109","author":[{"given":"Fereshteh Fakhar","family":"Firouzeh","sequence":"first","affiliation":[]},{"given":"Sreeraman","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"J. W.","family":"Chinneck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"The mosek optimization software 2018","year":"0","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2019.1607715"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/I2MTC43012.2020.9129262"},{"key":"ref12","article-title":"Timit acoustic phonetic continuous speech corpus","author":"garofolo","year":"1993","journal-title":"Linguistic Data Consortium"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref14","first-page":"1433","article-title":"Compressive sampling","volume":"3","author":"cand\u00e8s","year":"2006","journal-title":"Proceedings of the International Congress of Mathematicians"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48777-8_4"},{"journal-title":"From finding maximum feasible subsystems of linear systems to feedforward neural network design","year":"1994","author":"amaldi","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90152-X"},{"key":"ref18","first-page":"181","article-title":"The complexity and approximability of finding maximum feasible subsystems of linear relations","volume":"147","author":"amaldi","year":"1994","journal-title":"Oper Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90079-V"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2019.107117"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.06.066"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MeMeA49120.2020.9137337"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2793851"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/97.736233"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/070686676"},{"journal-title":"Algorithms for robust and fast sparse recovery","year":"2016","author":"peter","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC.2017.7868430"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990155"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.13.3.210.12632"},{"journal-title":"Report Voice assistants in use to triple to 8 billion by 2023","year":"0","author":"perez","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.3.311"},{"key":"ref22","article-title":"Sparse solutions of linear systems via maximum feasible subsets","author":"chinneck","year":"2018","journal-title":"Les Cahiers du GERAD G-201B-104"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096681"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1984.1164317"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326050"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6393(93)90095-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IAdCC.2013.6514391"}],"event":{"name":"2021 IEEE International Instrumentation and Measurement Technology Conference (I2MTC)","start":{"date-parts":[[2021,5,17]]},"location":"Glasgow, United Kingdom","end":{"date-parts":[[2021,5,20]]}},"container-title":["2021 IEEE International Instrumentation and Measurement Technology Conference (I2MTC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9459717\/9459787\/09459978.pdf?arnumber=9459978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:42:57Z","timestamp":1652182977000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9459978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,17]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/i2mtc50364.2021.9459978","relation":{},"subject":[],"published":{"date-parts":[[2021,5,17]]}}}