{"id":"https://openalex.org/W3015684859","doi":"https://doi.org/10.3390/a13040088","title":"Feasibility Pump Algorithm for Sparse Representation under Gaussian Noise","display_name":"Feasibility Pump Algorithm for Sparse Representation under Gaussian Noise","publication_year":2020,"publication_date":"2020-04-09","ids":{"openalex":"https://openalex.org/W3015684859","doi":"https://doi.org/10.3390/a13040088","mag":"3015684859"},"language":"en","primary_location":{"id":"doi:10.3390/a13040088","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13040088","pdf_url":"https://www.mdpi.com/1999-4893/13/4/88/pdf?version=1586427802","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/4/88/pdf?version=1586427802","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014156243","display_name":"Florin Ilarion Miertoiu","orcid":"https://orcid.org/0000-0002-6136-5543"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Florin Ilarion Miertoiu","raw_affiliation_strings":["Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u0163ei, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u0163ei, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023994037","display_name":"Bogdan Dumitrescu","orcid":"https://orcid.org/0000-0003-4555-1714"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Bogdan Dumitrescu","raw_affiliation_strings":["Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u0163ei, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u0163ei, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023994037"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.3521,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52514043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":95},"biblio":{"volume":"13","issue":"4","first_page":"88","last_page":"88"},"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.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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9988999962806702,"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/algorithm","display_name":"Algorithm","score":0.7005169987678528},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.6542795300483704},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.621787428855896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5518942475318909},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5487962961196899},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5401929616928101},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4662526845932007},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4656534790992737},{"id":"https://openalex.org/keywords/thresholding","display_name":"Thresholding","score":0.46234220266342163},{"id":"https://openalex.org/keywords/basis-pursuit","display_name":"Basis pursuit","score":0.4266493320465088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3739166855812073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22618767619132996},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.18453776836395264}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7005169987678528},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.6542795300483704},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.621787428855896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5518942475318909},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5487962961196899},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5401929616928101},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4662526845932007},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4656534790992737},{"id":"https://openalex.org/C191178318","wikidata":"https://www.wikidata.org/wiki/Q2256906","display_name":"Thresholding","level":3,"score":0.46234220266342163},{"id":"https://openalex.org/C99217422","wikidata":"https://www.wikidata.org/wiki/Q4867576","display_name":"Basis pursuit","level":4,"score":0.4266493320465088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3739166855812073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22618767619132996},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.18453776836395264},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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":3,"locations":[{"id":"doi:10.3390/a13040088","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13040088","pdf_url":"https://www.mdpi.com/1999-4893/13/4/88/pdf?version=1586427802","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:730f0a1878fa46478a26bbdedaf7903e","is_oa":true,"landing_page_url":"https://doaj.org/article/730f0a1878fa46478a26bbdedaf7903e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 4, p 88 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/4/88/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13040088","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13040088","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13040088","pdf_url":"https://www.mdpi.com/1999-4893/13/4/88/pdf?version=1586427802","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3015684859.pdf","grobid_xml":"https://content.openalex.org/works/W3015684859.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1963494418","https://openalex.org/W1995969950","https://openalex.org/W2041695750","https://openalex.org/W2050613227","https://openalex.org/W2100556411","https://openalex.org/W2116148865","https://openalex.org/W2119069542","https://openalex.org/W2127022339","https://openalex.org/W2130187411","https://openalex.org/W2172226214","https://openalex.org/W2235020008","https://openalex.org/W2530503938","https://openalex.org/W2740548164","https://openalex.org/W2902383031","https://openalex.org/W2917567606","https://openalex.org/W2964040514","https://openalex.org/W6728009443"],"related_works":["https://openalex.org/W2108275041","https://openalex.org/W2949587108","https://openalex.org/W2249469762","https://openalex.org/W2011611369","https://openalex.org/W2294690908","https://openalex.org/W1992008660","https://openalex.org/W2116148865","https://openalex.org/W2160547390","https://openalex.org/W2042974711","https://openalex.org/W59030693"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,9,33,43,49,55,59,83,96],"Feasibility":[4],"Pump":[5],"is":[6,22,77],"adapted":[7],"for":[8,82,95],"problem":[10],"of":[11,14],"sparse":[12],"representations":[13],"signals":[15],"affected":[16],"by":[17],"Gaussian":[18],"noise.":[19],"This":[20],"adaptation":[21],"tested":[23],"and":[24,32,58,68,91],"then":[25],"compared":[26,72],"to":[27,85],"Orthogonal":[28],"Matching":[29],"Pursuit":[30],"(OMP)":[31],"Fast":[34],"Iterative":[35],"Shrinkage-Thresholding":[36],"Algorithm":[37],"(FISTA).":[38],"The":[39],"feasibility":[40],"pump":[41],"recovers":[42],"true":[44],"support":[45,60],"much":[46],"better":[47],"than":[48],"other":[50],"two":[51],"algorithms":[52],"and,":[53],"as":[54],"SNR":[56],"decreases":[57],"size":[61],"increases,":[62],"it":[63],"has":[64],"a":[65,88,92],"smaller":[66],"recovery":[67],"representation":[69],"error":[70,97],"when":[71],"with":[73],"its":[74],"competitors.":[75],"It":[76],"observed":[78],"that,":[79],"in":[80],"order":[81],"algorithm":[84],"be":[86],"efficient,":[87],"regularization":[89],"parameter":[90],"weight":[93],"term":[94],"are":[98],"needed.":[99]},"counts_by_year":[{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}