{"id":"https://openalex.org/W3037442952","doi":"https://doi.org/10.1109/tsp.2020.3004700","title":"Greedy Algorithms for Sparse and Positive Signal Recovery Based on Bit-Wise MAP Detection","display_name":"Greedy Algorithms for Sparse and Positive Signal Recovery Based on Bit-Wise MAP Detection","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3037442952","doi":"https://doi.org/10.1109/tsp.2020.3004700","mag":"3037442952"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2020.3004700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2020.3004700","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Signal Processing","raw_type":"journal-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/A5001728130","display_name":"Jeongmin Chae","orcid":"https://orcid.org/0000-0001-6007-1300"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jeongmin Chae","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ajou University, Suwon, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-6007-1300","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ajou University, Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"last","author":{"id":null,"display_name":"Songnam Hong","orcid":"https://orcid.org/0000-0003-3527-4717"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Songnam Hong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ajou University, Suwon, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-3527-4717","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ajou University, Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57664883"],"apc_list":null,"apc_paid":null,"fwci":0.8749,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.68690545,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"68","issue":null,"first_page":"4017","last_page":"4029"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9993000030517578,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.6175234317779541},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5778995156288147},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5682005882263184},{"id":"https://openalex.org/keywords/signal-recovery","display_name":"Signal recovery","score":0.5447949767112732},{"id":"https://openalex.org/keywords/detection-theory","display_name":"Detection theory","score":0.4719274044036865},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.45705246925354004},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.4455465078353882},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.3861519992351532},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1414225995540619},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.12241128087043762},{"id":"https://openalex.org/keywords/radar","display_name":"Radar","score":0.10393616557121277}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6175234317779541},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5778995156288147},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5682005882263184},{"id":"https://openalex.org/C2989281035","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Signal recovery","level":3,"score":0.5447949767112732},{"id":"https://openalex.org/C137270730","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Detection theory","level":3,"score":0.4719274044036865},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.45705246925354004},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.4455465078353882},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.3861519992351532},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1414225995540619},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.12241128087043762},{"id":"https://openalex.org/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.10393616557121277},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2020.3004700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2020.3004700","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Signal Processing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.800000011920929,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G1477165083","display_name":null,"funder_award_id":"UD190033ED","funder_id":"https://openalex.org/F4320323103","funder_display_name":"Agency for Defense Development"}],"funders":[{"id":"https://openalex.org/F4320323103","display_name":"Agency for Defense Development","ror":"https://ror.org/05fhe0r85"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1576838924","https://openalex.org/W1966946151","https://openalex.org/W1974198688","https://openalex.org/W2002336572","https://openalex.org/W2011039300","https://openalex.org/W2015418199","https://openalex.org/W2017761965","https://openalex.org/W2031839259","https://openalex.org/W2046658845","https://openalex.org/W2065321782","https://openalex.org/W2071284784","https://openalex.org/W2078204800","https://openalex.org/W2091893102","https://openalex.org/W2109357213","https://openalex.org/W2127271355","https://openalex.org/W2134474909","https://openalex.org/W2135046866","https://openalex.org/W2140856955","https://openalex.org/W2160979406","https://openalex.org/W2166046159","https://openalex.org/W2166347904","https://openalex.org/W2264830470","https://openalex.org/W2294690908","https://openalex.org/W2296616510","https://openalex.org/W2344487751","https://openalex.org/W2919469879","https://openalex.org/W2922358819","https://openalex.org/W2952964368","https://openalex.org/W2963322354","https://openalex.org/W4238744307","https://openalex.org/W4250955649","https://openalex.org/W6634494761","https://openalex.org/W6697419950"],"related_works":["https://openalex.org/W1502442302","https://openalex.org/W2107703637","https://openalex.org/W2567231135","https://openalex.org/W2381127329","https://openalex.org/W2078389543","https://openalex.org/W1590318662","https://openalex.org/W3015194228","https://openalex.org/W2087326866","https://openalex.org/W1980874175","https://openalex.org/W2379256376"],"abstract_inverted_index":{"We":[0,99,145,219],"propose":[1],"a":[2,8,12,22,35,85,105,128,152,156,166,238],"novel":[3],"greedy":[4,185,217],"algorithm":[5],"to":[6,73,122],"recover":[7],"sparse":[9,97,153,240],"signal":[10,154,241],"from":[11,244],"small":[13],"number":[14],"of":[15,46,49,80,88,95,111,151,196,214,225,234,237],"noisy":[16],"measurements.":[17],"In":[18],"the":[19,44,50,57,61,78,81,93,112,162,171,180,194,212,215,222,226,232],"proposed":[20,116,163,227],"method,":[21],"new":[23],"support":[24,52],"index":[25,130],"is":[26,40,70,119],"identified":[27],"for":[28],"each":[29,89],"iteration":[30],"based":[31,187],"on":[32,188],"bit-wise":[33],"maximum":[34,129],"posteriori":[36,86],"(B-MAP)":[37],"detection.":[38],"This":[39],"an":[41,74],"optimal":[42],"in":[43,141],"sense":[45],"recovering":[47],"one":[48],"remaining":[51,90],"indices,":[53],"provided":[54],"that":[55,204,221],"all":[56],"detected":[58],"indices":[59],"during":[60,131],"previous":[62],"iterations":[63],"are":[64,191,229],"correct.":[65],"Despite":[66],"its":[67],"optimality,":[68],"it":[69],"unpractical":[71],"due":[72],"expensive":[75],"complexity":[76],"as":[77,140,174,231],"computation":[79],"maximization":[82,113],"metric":[83],"(i.e.,":[84,126],"probability":[87,157],"support)":[91],"requires":[92],"marginalization":[94],"high-dimensional":[96],"vector.":[98],"address":[100],"this":[101],"problem":[102],"by":[103],"presenting":[104],"good":[106],"proxy":[107,118],"(named":[108],"B-MAP":[109,117,164,189,205],"proxy)":[110],"metric.":[114],"The":[115],"accurate":[120],"enough":[121],"accomplish":[123],"our":[124],"purpose":[125],"finding":[127],"iterations)":[132],"and":[133,176,199,209],"simply":[134],"evaluated":[135],"via":[136],"simple":[137],"vector":[138],"correlations":[139],"conventional":[142],"orthogonal-matching-pursuit":[143],"(OMP).":[144],"verify":[146],"that,":[147],"when":[148],"non-zero":[149,160,235],"values":[150,236],"follow":[155],"distribution":[158],"with":[159],"mean,":[161],"attains":[165],"higher":[167],"recovery":[168],"accuracy":[169],"than":[170],"existing":[172],"methods":[173],"OMP":[175,208],"MAP-OMP,":[177],"while":[178],"having":[179],"same":[181],"complexity.":[182],"Subsequently,":[183],"advanced":[184,216],"algorithms,":[186],"proxy,":[190],"constructed":[192],"using":[193],"idea":[195],"compressive-sampling-matching-pursuit":[197],"(CoSaMP)":[198],"subspace-pursuit":[200],"(SP).":[201],"Simulations":[202],"demonstrate":[203],"can":[206],"outperform":[207],"MAP-OMP":[210],"under":[211],"frameworks":[213],"algorithms.":[218],"remark":[220],"performance":[223],"gains":[224],"algorithms":[228],"larger":[230],"means":[233],"random":[239],"become":[242],"far":[243],"zero.":[245]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}