{"id":"https://openalex.org/W2137620427","doi":"https://doi.org/10.1109/icassp.2009.4960346","title":"An approximate L0 norm minimization algorithm for compressed sensing","display_name":"An approximate L0 norm minimization algorithm for compressed sensing","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2137620427","doi":"https://doi.org/10.1109/icassp.2009.4960346","mag":"2137620427"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2009.4960346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2009.4960346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109272022","display_name":"Mashud Hyder","orcid":null},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mashud Hyder","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033583535","display_name":"Kaushik Mahata","orcid":"https://orcid.org/0000-0001-8501-3596"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kaushik Mahata","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109272022"],"corresponding_institution_ids":["https://openalex.org/I78757542"],"apc_list":null,"apc_paid":null,"fwci":1.7727,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.85807643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3365","last_page":"3368"},"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.9987999796867371,"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/compressed-sensing","display_name":"Compressed sensing","score":0.7527848482131958},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.719807505607605},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5678938031196594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.522107720375061},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4995241165161133},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.41670626401901245},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05555877089500427}],"concepts":[{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.7527848482131958},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.719807505607605},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5678938031196594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.522107720375061},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4995241165161133},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.41670626401901245},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05555877089500427},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icassp.2009.4960346","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2009.4960346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Acoustics, Speech and Signal Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/29034215","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},{"id":"pmh:uon:8769","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.13/919056","pdf_url":null,"source":{"id":"https://openalex.org/S4306401391","display_name":"NOVA (University of Newcastle, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I78757542","host_organization_name":"University of Newcastle Australia","host_organization_lineage":["https://openalex.org/I78757542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference paper"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/29034215","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1986931325","https://openalex.org/W1995636681","https://openalex.org/W2067706439","https://openalex.org/W2078204800","https://openalex.org/W2112665454","https://openalex.org/W2143163931","https://openalex.org/W2145096794","https://openalex.org/W2166087152","https://openalex.org/W2168745297","https://openalex.org/W2296616510","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2158224665","https://openalex.org/W2051487156","https://openalex.org/W2379589510","https://openalex.org/W2810730439","https://openalex.org/W4300044672","https://openalex.org/W1881631164","https://openalex.org/W2073681303","https://openalex.org/W2358292267","https://openalex.org/W2208932071","https://openalex.org/W2016015572"],"abstract_inverted_index":{"lscr":[0,28,42,58],"<sup":[1,29,43,59],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[2,30,44,60],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sup>":[3,31,45,61],"Norm":[4],"based":[5],"signal":[6,21,92],"recovery":[7,18],"is":[8,35,87],"attractive":[9,66],"in":[10,74],"compressed":[11],"sensing":[12],"as":[13],"it":[14],"can":[15],"facilitate":[16],"exact":[17],"of":[19,54,57,89],"sparse":[20,49,83],"with":[22],"very":[23,90],"high":[24,100],"probability.":[25],"Unfortunately,":[26],"direct":[27],"norm":[32,46],"minimization":[33],"problem":[34],"NP-hard.":[36],"This":[37],"paper":[38],"describes":[39],"an":[40],"approximate":[41],"algorithm":[47,64,85],"for":[48],"representation":[50,84],"which":[51],"preserves":[52],"most":[53],"the":[55],"advantages":[56],"norm.":[62],"The":[63,82],"shows":[65],"convergence":[67],"properties,":[68],"and":[69],"provides":[70],"remarkable":[71],"performance":[72],"improvement":[73],"noisy":[75],"environment":[76],"compared":[77],"to":[78],"other":[79],"popular":[80],"algorithms.":[81],"presented":[86],"capable":[88],"fast":[91],"recovery,":[93],"thereby":[94],"reducing":[95],"retrieval":[96],"latency":[97],"when":[98],"handling":[99],"dimensional":[101],"signal.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}