{"id":"https://openalex.org/W2166003790","doi":"https://doi.org/10.1109/isspit.2011.6151554","title":"A fixed-point iterative schema for error minimization in k-sparse decomposition","display_name":"A fixed-point iterative schema for error minimization in k-sparse decomposition","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2166003790","doi":"https://doi.org/10.1109/isspit.2011.6151554","mag":"2166003790"},"language":"en","primary_location":{"id":"doi:10.1109/isspit.2011.6151554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspit.2011.6151554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2434/171079","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023356812","display_name":"Alessandro Adamo","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Adamo","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Milano, Milan, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037883962","display_name":"Giuliano Grossi","orcid":"https://orcid.org/0000-0001-9274-4047"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giuliano Grossi","raw_affiliation_strings":["Dipartimento di Scienze dell'lnformazione, Universit\u00e0 degli Studi di Milano, Milan, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Scienze dell'lnformazione, Universit\u00e0 degli Studi di Milano, Milan, Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7617,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85193861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"5","issue":null,"first_page":"167","last_page":"172"},"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.9997000098228455,"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/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.994700014591217,"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/matching-pursuit","display_name":"Matching pursuit","score":0.8340194225311279},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.7688206434249878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5897943377494812},{"id":"https://openalex.org/keywords/signal-reconstruction","display_name":"Signal reconstruction","score":0.4827560782432556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4647146463394165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4513000547885895},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.42931440472602844},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4164401590824127},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4121329188346863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38510861992836},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.34512513875961304},{"id":"https://openalex.org/keywords/signal-processing","display_name":"Signal processing","score":0.3137182295322418}],"concepts":[{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.8340194225311279},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.7688206434249878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5897943377494812},{"id":"https://openalex.org/C70958404","wikidata":"https://www.wikidata.org/wiki/Q7512728","display_name":"Signal reconstruction","level":4,"score":0.4827560782432556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4647146463394165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4513000547885895},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.42931440472602844},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4164401590824127},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4121329188346863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38510861992836},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.34512513875961304},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.3137182295322418},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C554190296","wikidata":"https://www.wikidata.org/wiki/Q47528","display_name":"Radar","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isspit.2011.6151554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspit.2011.6151554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:air.unimi.it:2434/171079","is_oa":true,"landing_page_url":"http://hdl.handle.net/2434/171079","pdf_url":null,"source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:air.unimi.it:2434/171079","is_oa":true,"landing_page_url":"http://hdl.handle.net/2434/171079","pdf_url":null,"source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1969117912","https://openalex.org/W2020919843","https://openalex.org/W2050834445","https://openalex.org/W2078204800","https://openalex.org/W2097323375","https://openalex.org/W2115429828","https://openalex.org/W2116148865","https://openalex.org/W2127271355","https://openalex.org/W2128659236","https://openalex.org/W2151693816","https://openalex.org/W2160547390","https://openalex.org/W2162800060","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2378166785","https://openalex.org/W2382972663","https://openalex.org/W2388133936","https://openalex.org/W3015194228","https://openalex.org/W2465351041","https://openalex.org/W1555738523","https://openalex.org/W2103001330","https://openalex.org/W2946877649","https://openalex.org/W2340242818","https://openalex.org/W2381127329"],"abstract_inverted_index":{"Analogously":[0],"to":[1,17,32,61,68,79,141,172],"the":[2,19,27,75,81,103,118,122,127,162,173,180],"well":[3],"known":[4],"greedy":[5],"strategy":[6,48],"called":[7],"Orthogonal":[8],"Matching":[9],"Pursuit":[10],"(OMP),":[11],"we":[12],"present":[13],"a":[14,34,43,54,65,109,113],"new":[15],"algorithm":[16],"solve":[18],"sparse":[20,97,114,130,188],"approximation":[21,115,189],"problem":[22],"over":[23],"redundant":[24],"dictionaries":[25],"where":[26],"input":[28],"signal":[29,88,94],"is":[30,77,164],"restricted":[31],"be":[33,62],"linear":[35],"combination":[36],"of":[37,49,56,107,126],"k":[38],"atoms":[39],"or":[40],"fewer":[41],"from":[42],"fixed":[44,104],"dictionary.":[45],"The":[46,132,146],"basic":[47],"our":[50],"method":[51,76,134,182,185],"rests":[52],"on":[53],"family":[55],"nonlinear":[57],"mappings":[58],"which":[59,89],"results":[60],"contractive":[63],"in":[64],"interval":[66],"close":[67],"zero.":[69],"By":[70],"iterating":[71],"contractions":[72],"and":[73,143,159,191],"projections":[74],"able":[78],"extract":[80],"most":[82],"significant":[83],"components":[84],"also":[85],"for":[86],"noisy":[87],"subsumes":[90],"an":[91],"ideal":[92,128],"underlying":[93],"having":[95],"sufficiently":[96],"representation.":[98],"For":[99],"reasonable":[100],"error":[101,190],"level,":[102],"point":[105],"solution":[106],"such":[108],"iterative":[110],"schema":[111],"provides":[112],"containing":[116],"only":[117],"nonzero":[119],"terms":[120],"characterizing":[121],"unique":[123],"sparsest":[124],"representation":[125],"noiseless":[129],"signal.":[131],"heuristic":[133],"so":[135],"derived":[136],"has":[137],"been":[138],"applied":[139],"both":[140,178,186],"synthetic":[142],"real":[144],"data.":[145],"former":[147],"was":[148],"generated":[149],"by":[150,155,166],"combining":[151],"exact":[152],"signals":[153,169],"drawn":[154],"usual":[156],"Bernoulli-Gaussian":[157],"model":[158],"Gaussian":[160],"noise;":[161],"later":[163],"taken":[165],"electrocardiogram":[167],"(ECG)":[168],"with":[170],"application":[171],"dictionary":[174],"learning":[175],"problem.":[176],"In":[177],"cases":[179],"proposed":[181],"outperforms":[183],"OMP":[184],"regarding":[187],"computation":[192],"time.":[193]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}