{"id":"https://openalex.org/W2400233299","doi":"https://doi.org/10.1109/icassp.2016.7472467","title":"Blind deconvolution of sparse but filtered pulses with linear state space models","display_name":"Blind deconvolution of sparse but filtered pulses with linear state space models","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2400233299","doi":"https://doi.org/10.1109/icassp.2016.7472467","mag":"2400233299"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2016.7472467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012481985","display_name":"Nour Zalmai","orcid":"https://orcid.org/0000-0002-7089-3268"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Nour Zalmai","raw_affiliation_strings":["ETH Zurich Dept. of Information Technology & Electrical Engineering"],"affiliations":[{"raw_affiliation_string":"ETH Zurich Dept. of Information Technology & Electrical Engineering","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022018277","display_name":"Hampus Malmberg","orcid":"https://orcid.org/0000-0001-7100-1711"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Hampus Malmberg","raw_affiliation_strings":["ETH Zurich Dept. of Information Technology & Electrical Engineering"],"affiliations":[{"raw_affiliation_string":"ETH Zurich Dept. of Information Technology & Electrical Engineering","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051479034","display_name":"Hans\u2010Andrea Loeliger","orcid":"https://orcid.org/0000-0001-7153-7145"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Hans-Andrea Loeliger","raw_affiliation_strings":["ETH Zurich Dept. of Information Technology & Electrical Engineering"],"affiliations":[{"raw_affiliation_string":"ETH Zurich Dept. of Information Technology & Electrical Engineering","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012481985"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.0087,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75890199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4194","last_page":"4198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/blind-deconvolution","display_name":"Blind deconvolution","score":0.7489598989486694},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6510000228881836},{"id":"https://openalex.org/keywords/deconvolution","display_name":"Deconvolution","score":0.6147556900978088},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.5841493010520935},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.5662446022033691},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5609618425369263},{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.5298143625259399},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.46215444803237915},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.421818345785141},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3317940831184387},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33052289485931396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2898011803627014},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.2220851480960846},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11055862903594971}],"concepts":[{"id":"https://openalex.org/C30044814","wikidata":"https://www.wikidata.org/wiki/Q11334452","display_name":"Blind deconvolution","level":3,"score":0.7489598989486694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6510000228881836},{"id":"https://openalex.org/C174576160","wikidata":"https://www.wikidata.org/wiki/Q1183700","display_name":"Deconvolution","level":2,"score":0.6147556900978088},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.5841493010520935},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.5662446022033691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5609618425369263},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.5298143625259399},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.46215444803237915},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.421818345785141},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3317940831184387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33052289485931396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2898011803627014},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.2220851480960846},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11055862903594971},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2016.7472467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2016.7472467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1667084042","https://openalex.org/W1795014501","https://openalex.org/W1988520084","https://openalex.org/W2052963087","https://openalex.org/W2119667497","https://openalex.org/W2127870457","https://openalex.org/W2138204001","https://openalex.org/W2142940228","https://openalex.org/W2148154358","https://openalex.org/W2150859678","https://openalex.org/W2160547390","https://openalex.org/W2161219071","https://openalex.org/W2171980229","https://openalex.org/W2265897154","https://openalex.org/W4285719527","https://openalex.org/W6684942582"],"related_works":["https://openalex.org/W2034520358","https://openalex.org/W2028099218","https://openalex.org/W2059639161","https://openalex.org/W2586325539","https://openalex.org/W2058895457","https://openalex.org/W1538056422","https://openalex.org/W2029084792","https://openalex.org/W2023738877","https://openalex.org/W2147401053","https://openalex.org/W2589098082"],"abstract_inverted_index":{"The":[0,25],"paper":[1],"considers":[2],"the":[3,22,40,73,81,86],"problem":[4],"of":[5,13,21],"joint":[6],"system":[7,17,41,87],"identification":[8],"and":[9,33,84],"input":[10,26,36,82],"signal":[11,27,83],"estimation":[12],"an":[14,57],"unknown":[15,67,91],"linear":[16],"from":[18,51],"noisy":[19],"observations":[20],"output":[23],"signal.":[24],"is":[28],"assumed":[29],"to":[30],"be":[31,110],"sparse,":[32],"each":[34,97],"individual":[35],"pulse":[37],"may":[38],"affect":[39],"in":[42,96],"its":[43],"own":[44],"(and":[45],"unknown)":[46],"way.":[47],"Based":[48],"on":[49],"ideas":[50],"sparse":[52],"Bayesian":[53],"learning,":[54],"we":[55],"derive":[56],"efficient":[58],"expectation":[59],"maximization":[60],"(EM)":[61],"algorithm":[62,75],"for":[63,104],"jointly":[64,94],"estimating":[65,80,85],"all":[66,90],"quantities.":[68],"Unlike":[69],"related":[70],"prior":[71],"work,":[72],"proposed":[74],"does":[76],"not":[77],"alternate":[78],"between":[79],"parameters;":[88],"instead,":[89],"quantities":[92],"are":[93],"updated":[95],"EM":[98,106],"step.":[99],"We":[100],"give":[101],"closed-form":[102],"expressions":[103],"these":[105],"updates,":[107],"which":[108],"can":[109],"efficiently":[111],"computed":[112],"by":[113],"Gaussian":[114],"message":[115],"passing.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}