{"id":"https://openalex.org/W1922432994","doi":"https://doi.org/10.1109/eusipco.2015.7362429","title":"Fast non-negative orthogonal least squares","display_name":"Fast non-negative orthogonal least squares","publication_year":2015,"publication_date":"2015-08-01","ids":{"openalex":"https://openalex.org/W1922432994","doi":"https://doi.org/10.1109/eusipco.2015.7362429","mag":"1922432994"},"language":"en","primary_location":{"id":"doi:10.1109/eusipco.2015.7362429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eusipco.2015.7362429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd European Signal Processing Conference (EUSIPCO)","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/A5038313743","display_name":"Mehrdad Yaghoobi","orcid":"https://orcid.org/0000-0002-9847-8234"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mehrdad Yaghoobi","raw_affiliation_strings":["Institute for Digital Communications, University of Edinburgh, UK","Institute for Digital Communications, The University of Edinburgh, EH9 3JL, UK"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, EH9 3JL, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057962470","display_name":"Mike E. Davies","orcid":"https://orcid.org/0000-0003-2327-236X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mike E. Davies","raw_affiliation_strings":["Institute for Digital Communications, University of Edinburgh, UK","Institute for Digital Communications, The University of Edinburgh, EH9 3JL, UK"],"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, University of Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, EH9 3JL, UK","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038313743"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.0414283,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"479","last_page":"483"},"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.9995999932289124,"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.9991000294685364,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.6705490946769714},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6058422923088074},{"id":"https://openalex.org/keywords/qr-decomposition","display_name":"QR decomposition","score":0.5903784036636353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5828998684883118},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5320877432823181},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4885340929031372},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4771572947502136},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.46384552121162415},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.46058979630470276},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4398956298828125},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4333982467651367},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.43287116289138794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3628104627132416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3007485866546631},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.08891037106513977},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07825347781181335}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6705490946769714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6058422923088074},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.5903784036636353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828998684883118},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5320877432823181},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4885340929031372},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4771572947502136},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.46384552121162415},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.46058979630470276},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4398956298828125},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4333982467651367},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.43287116289138794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3628104627132416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3007485866546631},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.08891037106513977},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07825347781181335},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/eusipco.2015.7362429","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eusipco.2015.7362429","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd European Signal Processing Conference (EUSIPCO)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/182ef166-94ba-4895-ad55-85a195f7cd94","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/182ef166-94ba-4895-ad55-85a195f7cd94","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8799999952316284}],"awards":[{"id":"https://openalex.org/G8726282573","display_name":null,"funder_award_id":"EP/K014277/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W43282915","https://openalex.org/W2028781966","https://openalex.org/W2032944446","https://openalex.org/W2102380305","https://openalex.org/W2103399651","https://openalex.org/W2116216716","https://openalex.org/W2141433180","https://openalex.org/W2798909945","https://openalex.org/W6601779987"],"related_works":["https://openalex.org/W2078349096","https://openalex.org/W2002598339","https://openalex.org/W2150953077","https://openalex.org/W1599936522","https://openalex.org/W2091883426","https://openalex.org/W1558774265","https://openalex.org/W3173235360","https://openalex.org/W2174948646","https://openalex.org/W2024017047","https://openalex.org/W2006707200"],"abstract_inverted_index":{"An":[0],"important":[1],"class":[2,31],"of":[3,32,62,81,86,103,111,129,139,168],"sparse":[4,9,20],"signals":[5],"is":[6,39,47,65,93,114,124,141,152,161],"the":[7,41,50,59,63,77,82,90,104,112,117,121,136,149,158,169],"non-negative":[8,25,91,105,170],"signals.":[10],"While":[11],"numerous":[12],"greedy":[13,33],"techniques":[14],"have":[15],"been":[16],"introduced":[17],"for":[18,145],"low-complexity":[19],"approximations,":[21],"there":[22],"are":[23],"few":[24],"versions.":[26],"Among":[27],"such":[28,87],"a":[29,72,100],"large":[30],"techniques,":[34],"one":[35],"successful":[36],"method,":[37],"which":[38],"called":[40],"Orthogonal":[42],"Least":[43],"Squares":[44],"(OLS)":[45],"algorithm,":[46],"based":[48,75],"on":[49,76],"maximum":[51],"residual":[52],"energy":[53],"reduction":[54],"at":[55],"each":[56],"iteration.":[57],"However,":[58],"basic":[60,118,137],"implementation":[61,74,102,138,167],"OLS":[64,69,106,171],"computationally":[66,143],"slow.":[67],"The":[68,84,108],"algorithm":[70,113,160],"has":[71],"fast":[73,101],"QR":[78],"matrix":[79],"factorisation":[80],"dictionary.":[83],"extension":[85],"technique":[88],"to":[89],"domain":[92],"possible.":[94],"In":[95],"this":[96],"paper,":[97],"we":[98],"present":[99],"(NNOLS).":[107],"computational":[109],"complexity":[110],"compared":[115],"with":[116,126],"implementation,":[119],"where":[120],"new":[122],"method":[123,151],"faster":[125,163],"two":[127],"orders":[128],"magnitude.":[130],"We":[131,154],"also":[132,155],"show":[133,156],"that,":[134],"if":[135],"NNOLS":[140],"not":[142],"feasible":[144],"moderate":[146],"size":[147],"problems,":[148],"proposed":[150,159],"tractable.":[153],"that":[157],"even":[162],"than":[164],"an":[165],"approximate":[166],"algorithm.":[172]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
