{"id":"https://openalex.org/W2128026227","doi":"https://doi.org/10.1109/tsp.2009.2040018","title":"An Improved Smoothed $\\ell^0$ Approximation Algorithm for Sparse Representation","display_name":"An Improved Smoothed $\\ell^0$ Approximation Algorithm for Sparse Representation","publication_year":2010,"publication_date":"2010-01-20","ids":{"openalex":"https://openalex.org/W2128026227","doi":"https://doi.org/10.1109/tsp.2009.2040018","mag":"2128026227"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2009.2040018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2009.2040018","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/A5004318874","display_name":"Md Mashud Hyder","orcid":"https://orcid.org/0000-0002-5288-7358"},"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":"Md. Mashud Hyder","raw_affiliation_strings":["Department of Electrical Engineering, University of Newcastle, Callaghan, NSW, Australia","Dept. of Electr. Eng., Univ. of Newcastle, Callaghan, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Newcastle, Callaghan, NSW, 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":["Department of Electrical Engineering, University of Newcastle, Callaghan, NSW, Australia","Dept. of Electr. Eng., Univ. of Newcastle, Callaghan, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Univ. of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78757542"],"apc_list":null,"apc_paid":null,"fwci":6.6592,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.9747192,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"58","issue":"4","first_page":"2194","last_page":"2205"},"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5956878066062927},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5595403909683228},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5527799725532532},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5327503681182861},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.49202224612236023},{"id":"https://openalex.org/keywords/classification-of-discontinuities","display_name":"Classification of discontinuities","score":0.4454866647720337},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43908584117889404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43667060136795044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38647395372390747},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34148749709129333},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08585816621780396}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5956878066062927},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5595403909683228},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5527799725532532},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5327503681182861},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.49202224612236023},{"id":"https://openalex.org/C15627037","wikidata":"https://www.wikidata.org/wiki/Q541961","display_name":"Classification of discontinuities","level":2,"score":0.4454866647720337},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43908584117889404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43667060136795044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38647395372390747},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34148749709129333},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08585816621780396},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp.2009.2040018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2009.2040018","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1667165204","https://openalex.org/W1986931325","https://openalex.org/W1995636681","https://openalex.org/W2034260606","https://openalex.org/W2036488048","https://openalex.org/W2053691921","https://openalex.org/W2060179699","https://openalex.org/W2067706439","https://openalex.org/W2097323375","https://openalex.org/W2099641086","https://openalex.org/W2100068253","https://openalex.org/W2104266187","https://openalex.org/W2109449402","https://openalex.org/W2112665454","https://openalex.org/W2115706991","https://openalex.org/W2122315118","https://openalex.org/W2122548617","https://openalex.org/W2126607811","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2145096794","https://openalex.org/W2164452299","https://openalex.org/W2166087152","https://openalex.org/W2166765763","https://openalex.org/W2168745297","https://openalex.org/W2296319761","https://openalex.org/W2296616510","https://openalex.org/W2803670972","https://openalex.org/W3022380717","https://openalex.org/W3105340263","https://openalex.org/W4250589301","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W1972096828","https://openalex.org/W2529137940","https://openalex.org/W4302048708","https://openalex.org/W2359913921","https://openalex.org/W4239740410","https://openalex.org/W1996195943","https://openalex.org/W4205298958","https://openalex.org/W1981385315","https://openalex.org/W2486440955","https://openalex.org/W2323190011"],"abstract_inverted_index":{"l0norm":[0,21],"based":[1],"algorithms":[2],"have":[3],"numerous":[4],"potential":[5],"applications":[6],"where":[7],"a":[8,14,64,95],"sparse":[9,39],"signal":[10],"is":[11,24,54,70],"recovered":[12],"from":[13],"small":[15],"number":[16],"of":[17,81],"measurements.":[18],"The":[19],"direct":[20],"optimization":[22,90],"problem":[23],"NP-hard.":[25],"In":[26],"this":[27],"paper":[28],"we":[29,62,86],"work":[30],"with":[31],"the":[32,33,47,57,74,78,82],"smoothed":[34],"l0(SL0)":[35],"approximation":[36],"algorithm":[37],"for":[38],"representation.":[40],"We":[41],"give":[42],"an":[43,88],"upper":[44,52],"bound":[45,53],"on":[46],"run-time":[48],"estimation":[49],"error.":[50],"This":[51,68],"tighter":[55],"than":[56],"previously":[58],"known":[59],"bound.":[60],"Subsequently,":[61],"develop":[63],"reliable":[65],"stopping":[66],"criterion.":[67],"criterion":[69],"helpful":[71],"in":[72,94],"avoiding":[73],"problems":[75],"due":[76],"to":[77],"underlying":[79],"discontinuities":[80],"l0cost":[83],"function.":[84],"Furthermore,":[85],"propose":[87],"alternative":[89],"strategy,":[91],"which":[92],"results":[93],"Newton":[96],"like":[97],"algorithm.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}