{"id":"https://openalex.org/W2953426880","doi":"https://doi.org/10.3390/a12070131","title":"Aiding Dictionary Learning Through Multi-Parametric Sparse Representation","display_name":"Aiding Dictionary Learning Through Multi-Parametric Sparse Representation","publication_year":2019,"publication_date":"2019-06-28","ids":{"openalex":"https://openalex.org/W2953426880","doi":"https://doi.org/10.3390/a12070131","mag":"2953426880"},"language":"en","primary_location":{"id":"doi:10.3390/a12070131","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12070131","pdf_url":"https://www.mdpi.com/1999-4893/12/7/131/pdf?version=1561949826","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/7/131/pdf?version=1561949826","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009952869","display_name":"Florin Stoican","orcid":"https://orcid.org/0000-0002-4550-9113"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Florin Stoican","raw_affiliation_strings":["Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u021bei, 060042 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Automatic Control and Computers, University Politehnica of Bucharest, 313 Spl. Independen\u021bei, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055191887","display_name":"Paul Irofti","orcid":"https://orcid.org/0000-0002-7541-4334"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Paul Irofti","raw_affiliation_strings":["The Research Institute of the University of Bucharest (ICUB) and Department of Computer Science, University of Bucharest, Bulevardul M. Kog\u0103lniceanu 36-46, 050107 Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"The Research Institute of the University of Bucharest (ICUB) and Department of Computer Science, University of Bucharest, Bulevardul M. Kog\u0103lniceanu 36-46, 050107 Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009952869"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7567,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68620197,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"7","first_page":"131","last_page":"131"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/affine-transformation","display_name":"Affine transformation","score":0.7449782490730286},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.6102613806724548},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5894818902015686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5755099654197693},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5684219002723694},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.499891996383667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46712714433670044},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45808306336402893},{"id":"https://openalex.org/keywords/k-svd","display_name":"K-SVD","score":0.4296174943447113},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34992876648902893},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34285488724708557},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3260643482208252},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14368721842765808},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08452033996582031}],"concepts":[{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.7449782490730286},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.6102613806724548},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5894818902015686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5755099654197693},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5684219002723694},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.499891996383667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46712714433670044},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45808306336402893},{"id":"https://openalex.org/C154771677","wikidata":"https://www.wikidata.org/wiki/Q17098361","display_name":"K-SVD","level":3,"score":0.4296174943447113},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34992876648902893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34285488724708557},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3260643482208252},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14368721842765808},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08452033996582031},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a12070131","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12070131","pdf_url":"https://www.mdpi.com/1999-4893/12/7/131/pdf?version=1561949826","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8f64c89f8b474c5eaa398d6b1997624a","is_oa":true,"landing_page_url":"https://doaj.org/article/8f64c89f8b474c5eaa398d6b1997624a","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 7, p 131 (2019)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/7/131/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12070131","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12070131","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12070131","pdf_url":"https://www.mdpi.com/1999-4893/12/7/131/pdf?version=1561949826","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4860783512","display_name":null,"funder_award_id":"project number 17PCCDI/2018 within PNCDI III","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2953426880.pdf","grobid_xml":"https://content.openalex.org/works/W2953426880.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W124292005","https://openalex.org/W1524886571","https://openalex.org/W1972821878","https://openalex.org/W2014279255","https://openalex.org/W2031280071","https://openalex.org/W2035114543","https://openalex.org/W2051171836","https://openalex.org/W2054308357","https://openalex.org/W2115922137","https://openalex.org/W2135046866","https://openalex.org/W2152171106","https://openalex.org/W2152724152","https://openalex.org/W2153909400","https://openalex.org/W2167188281","https://openalex.org/W2182510773","https://openalex.org/W2536620281","https://openalex.org/W2568845341","https://openalex.org/W2766233962","https://openalex.org/W2800431972","https://openalex.org/W3099751318","https://openalex.org/W4235713725","https://openalex.org/W4241687679","https://openalex.org/W4243994785","https://openalex.org/W7017100176"],"related_works":["https://openalex.org/W2099321050","https://openalex.org/W2890952311","https://openalex.org/W2047275718","https://openalex.org/W2509955295","https://openalex.org/W2034957211","https://openalex.org/W110819671","https://openalex.org/W2388952560","https://openalex.org/W2149282631","https://openalex.org/W2011611369","https://openalex.org/W2204991413"],"abstract_inverted_index":{"The":[0,35],"\u2113":[1],"1":[2],"relaxations":[3],"of":[4,86,108,115,127],"the":[5,14,24,50,53,57,61,87,92,105,109,113,130,134],"sparse":[6],"and":[7,112],"cosparse":[8],"representation":[9,85],"problems":[10,39],"which":[11,64],"appear":[12],"in":[13],"dictionary":[15],"learning":[16],"procedure":[17],"are":[18],"usually":[19],"solved":[20],"repeatedly":[21],"(varying":[22],"only":[23,41,60],"parameter":[25,128],"vector),":[26],"thus":[27],"making":[28],"them":[29],"well-suited":[30],"to":[31,49,66],"a":[32,82,101,123],"multi-parametric":[33],"interpretation.":[34],"associated":[36],"constrained":[37],"optimization":[38],"differ":[40],"through":[42,100],"an":[43,77,116],"affine":[44,80,117],"term":[45],"from":[46],"one":[47],"iteration":[48],"next":[51],"(i.e.,":[52],"problem\u2019s":[54],"structure":[55],"remains":[56],"same":[58],"while":[59],"current":[62],"vector,":[63],"is":[65,98],"be":[67],"(co)sparsely":[68],"represented,":[69],"changes).":[70],"We":[71,119],"exploit":[72],"this":[73],"fact":[74],"by":[75],"providing":[76],"explicit,":[78],"piecewise":[79],"with":[81],"polyhedral":[83,110],"support,":[84],"solution.":[88],"Consequently,":[89],"at":[90],"runtime,":[91],"optimal":[93],"solution":[94],"(the":[95],"(co)sparse":[96],"representation)":[97],"obtained":[99],"simple":[102],"enumeration":[103],"throughout":[104],"non-overlapping":[106],"regions":[107],"partition":[111],"application":[114],"law.":[118],"show":[120],"that,":[121],"for":[122],"suitably":[124],"large":[125],"number":[126],"instances,":[129],"explicit":[131],"approach":[132],"outperforms":[133],"classical":[135],"implementation.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}