{"id":"https://openalex.org/W2544904580","doi":"https://doi.org/10.1109/icecs.2004.1399685","title":"Sparse approximations with a high resolution greedy algorithm","display_name":"Sparse approximations with a high resolution greedy algorithm","publication_year":2005,"publication_date":"2005-03-31","ids":{"openalex":"https://openalex.org/W2544904580","doi":"https://doi.org/10.1109/icecs.2004.1399685","mag":"2544904580"},"language":"en","primary_location":{"id":"doi:10.1109/icecs.2004.1399685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2004.1399685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004.","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/A5033144048","display_name":"Benjamin G. Salomon","orcid":"https://orcid.org/0000-0002-7080-2362"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"B.G. Salomon","raw_affiliation_strings":["Faculty of Engineering, Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054664411","display_name":"Hanoch Ur","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"H. Ur","raw_affiliation_strings":["Faculty of Engineering, Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033144048"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.36910866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":null,"first_page":"330","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9998000264167786,"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/T10860","display_name":"Speech and Audio Processing","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7632994651794434},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.7332584857940674},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7260414361953735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6588397026062012},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5936297178268433},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.5363145470619202},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5035642981529236},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4968428909778595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47801530361175537},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.473394513130188},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.46346157789230347},{"id":"https://openalex.org/keywords/cascade","display_name":"Cascade","score":0.4476171135902405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4226633310317993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38443517684936523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16821283102035522},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.13988855481147766}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7632994651794434},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.7332584857940674},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7260414361953735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6588397026062012},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5936297178268433},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.5363145470619202},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5035642981529236},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4968428909778595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47801530361175537},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.473394513130188},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.46346157789230347},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.4476171135902405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4226633310317993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38443517684936523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16821283102035522},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.13988855481147766},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icecs.2004.1399685","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs.2004.1399685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004.","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":18,"referenced_works":["https://openalex.org/W1910610070","https://openalex.org/W1986583171","https://openalex.org/W1986931325","https://openalex.org/W2000577625","https://openalex.org/W2021302824","https://openalex.org/W2028781966","https://openalex.org/W2054396396","https://openalex.org/W2098675633","https://openalex.org/W2109021821","https://openalex.org/W2111730426","https://openalex.org/W2115755118","https://openalex.org/W2123487365","https://openalex.org/W2128659236","https://openalex.org/W2132968352","https://openalex.org/W2144124493","https://openalex.org/W2151693816","https://openalex.org/W2156447271","https://openalex.org/W2170170066"],"related_works":["https://openalex.org/W1974198688","https://openalex.org/W2011611369","https://openalex.org/W4297791310","https://openalex.org/W4245251483","https://openalex.org/W2116148865","https://openalex.org/W2134343866","https://openalex.org/W1973211400","https://openalex.org/W4372266926","https://openalex.org/W2045237525","https://openalex.org/W2544904580"],"abstract_inverted_index":{"Signal":[0],"decomposition":[1],"with":[2,45],"an":[3],"overcomplete":[4],"dictionary":[5],"is":[6,13,24],"nonunique.":[7],"Computation":[8],"of":[9,62],"the":[10,40,46,80,85,94],"best":[11,43],"approximation":[12,50],"known":[14],"to":[15,89],"be":[16],"NP-hard":[17],"problem.":[18],"The":[19],"matching":[20],"pursuit":[21],"(MP)":[22],"algorithm":[23,29],"a":[25,32,54,60,69,74],"popular":[26],"iterative":[27],"greedy":[28,87],"that":[30,42],"finds":[31],"sub-optimal":[33],"approximation,":[34,83],"by":[35,52],"picking":[36],"at":[37],"each":[38],"iteration":[39],"vector":[41],"correlates":[44],"present":[47],"residual.":[48],"Choosing":[49],"vectors":[51],"optimizing":[53],"correlation":[55],"inner":[56],"product":[57],"can":[58],"produce":[59],"loss":[61],"time":[63],"and":[64],"frequency":[65],"resolution.":[66],"We":[67],"propose":[68],"modified":[70],"MP,":[71],"based":[72],"on":[73,79],"post":[75],"processing":[76],"step":[77],"applied":[78],"resulting":[81],"MP":[82],"using":[84],"backward":[86],"algorithm,":[88],"achieve":[90],"higher":[91],"resolution":[92],"than":[93],"original":[95],"MP.":[96]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}