Publication Information

{'id': 'https://openalex.org/W1520740474', 'doi': 'https://doi.org/10.1109/cscs.2015.50', 'title': 'Overcomplete Dictionary Design: The Impact of the Sparse Representation Algorithm', 'display_name': 'Overcomplete Dictionary Design: The Impact of the Sparse Representation Algorithm', 'publication_year': 2015, 'publication_date': '2015-05-01', 'ids': {'openalex': 'https://openalex.org/W1520740474', 'doi': 'https://doi.org/10.1109/cscs.2015.50', 'mag': '1520740474'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/cscs.2015.50', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5055191887', 'display_name': 'Paul Irofti', 'orcid': 'https://orcid.org/0000-0002-7541-4334'}, 'institutions': [{'id': 'https://openalex.org/I61641377', 'display_name': 'Universitatea Națională de Știință și Tehnologie Politehnica București', 'ror': 'https://ror.org/0558j5q12', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I61641377']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Paul Irofti', 'raw_affiliation_strings': ['Dept. of Autom. Control & Comput., Univ. Politeh. of Bucharest, Bucharest, Romania'], 'affiliations': [{'raw_affiliation_string': 'Dept. of Autom. Control & Comput., Univ. Politeh. of Bucharest, Bucharest, Romania', 'institution_ids': ['https://openalex.org/I61641377']}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5023994037', 'display_name': 'Bogdan Dumitrescu', 'orcid': 'https://orcid.org/0000-0003-4555-1714'}, 'institutions': [{'id': 'https://openalex.org/I61641377', 'display_name': 'Universitatea Națională de Știință și Tehnologie Politehnica București', 'ror': 'https://ror.org/0558j5q12', 'country_code': 'RO', 'type': 'education', 'lineage': ['https://openalex.org/I61641377']}], 'countries': ['RO'], 'is_corresponding': False, 'raw_author_name': 'Bogdan Dumitrescu', 'raw_affiliation_strings': ['Dept. of Autom. Control & Comput., Univ. Politeh. of Bucharest, Bucharest, Romania'], 'affiliations': [{'raw_affiliation_string': 'Dept. of Autom. Control & Comput., Univ. Politeh. of Bucharest, Bucharest, Romania', 'institution_ids': ['https://openalex.org/I61641377']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.363, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 7, 'citation_normalized_percentile': {'value': 0.875928, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 83, 'max': 84}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': 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/T10688', 'display_name': 'Image and Signal Denoising Methods', 'score': 0.9985, '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'}}, {'id': 'https://openalex.org/T11034', 'display_name': 'Digital Filter Design and Implementation', 'score': 0.9981, '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/representation', 'display_name': 'Representation', 'score': 0.6409502}, {'id': 'https://openalex.org/keywords/k-svd', 'display_name': 'K-SVD', 'score': 0.5707288}], 'concepts': [{'id': 'https://openalex.org/C156872377', 'wikidata': 'https://www.wikidata.org/wiki/Q6786281', 'display_name': 'Matching pursuit', 'level': 3, 'score': 0.8946664}, {'id': 'https://openalex.org/C124066611', 'wikidata': 'https://www.wikidata.org/wiki/Q28684319', 'display_name': 'Sparse approximation', 'level': 2, 'score': 0.86745954}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.6930493}, {'id': 'https://openalex.org/C2776359362', 'wikidata': 'https://www.wikidata.org/wiki/Q2145286', 'display_name': 'Representation (politics)', 'level': 3, 'score': 0.6409502}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.59355474}, {'id': 'https://openalex.org/C154771677', 'wikidata': 'https://www.wikidata.org/wiki/Q17098361', 'display_name': 'K-SVD', 'level': 3, 'score': 0.5707288}, {'id': 'https://openalex.org/C51823790', 'wikidata': 'https://www.wikidata.org/wiki/Q504353', 'display_name': 'Greedy algorithm', 'level': 2, 'score': 0.44998264}, {'id': 'https://openalex.org/C165064840', 'wikidata': 'https://www.wikidata.org/wiki/Q1321061', 'display_name': 'Matching (statistics)', 'level': 2, 'score': 0.4329866}, {'id': 'https://openalex.org/C179799912', 'wikidata': 'https://www.wikidata.org/wiki/Q205084', 'display_name': 'Computational complexity theory', 'level': 2, 'score': 0.41723138}, {'id': 'https://openalex.org/C154945302', 'wikidata': 'https://www.wikidata.org/wiki/Q11660', 'display_name': 'Artificial intelligence', 'level': 1, 'score': 0.3775019}, {'id': 'https://openalex.org/C153180895', 'wikidata': 'https://www.wikidata.org/wiki/Q7148389', 'display_name': 'Pattern recognition (psychology)', 'level': 2, 'score': 0.37715888}, {'id': 'https://openalex.org/C33923547', 'wikidata': 'https://www.wikidata.org/wiki/Q395', 'display_name': 'Mathematics', 'level': 0, 'score': 0.2435126}, {'id': 'https://openalex.org/C124851039', 'wikidata': 'https://www.wikidata.org/wiki/Q2665459', 'display_name': 'Compressed sensing', 'level': 2, 'score': 0.14411119}, {'id': 'https://openalex.org/C105795698', 'wikidata': 'https://www.wikidata.org/wiki/Q12483', 'display_name': 'Statistics', '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}, {'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}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/cscs.2015.50', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 18, 'referenced_works': ['https://openalex.org/W1591116419', 'https://openalex.org/W1890834058', 'https://openalex.org/W1976709621', 'https://openalex.org/W2061615939', 'https://openalex.org/W2082114499', 'https://openalex.org/W2083493778', 'https://openalex.org/W2102380305', 'https://openalex.org/W2115429828', 'https://openalex.org/W2115549875', 'https://openalex.org/W2128659236', 'https://openalex.org/W2136020472', 'https://openalex.org/W2156593994', 'https://openalex.org/W2160547390', 'https://openalex.org/W2160979406', 'https://openalex.org/W2163398148', 'https://openalex.org/W2273229859', 'https://openalex.org/W2296399167', 'https://openalex.org/W4235713725'], 'related_works': ['https://openalex.org/W4254934694', 'https://openalex.org/W4245251483', 'https://openalex.org/W2994662386', 'https://openalex.org/W2965458591', 'https://openalex.org/W2944524174', 'https://openalex.org/W2160547390', 'https://openalex.org/W2113038107', 'https://openalex.org/W2042974711', 'https://openalex.org/W2011611369', 'https://openalex.org/W1992008660'], 'abstract_inverted_index': {'The': [0, 120], 'design': [1], 'of': [2, 30, 64, 97, 116, 132, 138], 'dictionaries': [3, 142], 'for': [4, 17, 38, 143], 'sparse': [5, 15, 67, 144], 'representations': [6, 16], 'is': [7], 'typically': [8], 'done': [9, 48], 'by': [10], 'iterating': [11], 'two': [12], 'stages:': [13], 'compute': [14], 'the': [18, 23, 26, 31, 39, 43, 62, 86, 95, 108, 114, 129], 'fixed': [19, 27], 'dictionary': [20, 24], 'and': [21, 134, 140], 'update': [22, 40, 109, 118], 'using': [25, 98, 141], 'representations.': [28, 145], 'Most': [29], 'innovation': [32], 'in': [33], 'recent': [34], 'work': [35], 'was': [36, 46], 'proposed': [37], 'stage,': [41, 110], 'while': [42], 'representation': [44, 68, 100], 'stage': [45], 'routinely': [47], 'with': [49, 77], 'Orthogonal': [50, 88], 'Matching': [51], 'Pursuit': [52], '(OMP),': [53], 'due': [54], 'to': [55], 'its': [56], 'low': [57], 'complexity.': [58, 79], 'We': [59], 'investigate': [60], 'here': [61, 125], 'use': [63], 'other': [65], 'greedy': [66], 'algorithms,': [69], 'more': [70, 104], 'computationally': [71], 'demanding': [72], 'than': [73, 106], 'OMP': [74], 'but': [75], 'still': [76], 'convenient': [78], 'These': [80], 'algorithms': [81, 101], 'include': [82], 'a': [83], 'new': [84, 136], 'proposal,': [85], 'projection-based': [87], 'Least': [89], 'Squares.': [90], 'It': [91], 'turns': [92], 'out': [93], 'that': [94], 'effect': [96], 'better': [99], 'may': [102], 'be': [103], 'significant': [105], 'improving': [107], 'sometimes': [111], 'even': [112], 'leveling': [113], 'performance': [115], 'different': [117], 'algorithms.': [119], 'numerous': [121], 'experimental': [122], 'results': [123], 'presented': [124], 'suggest': [126], 'which': [127], 'are': [128], 'best': [130], 'combinations': [131], 'methods': [133], 'open': [135], 'ways': [137], 'designing': [139]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W1520740474', 'counts_by_year': [{'year': 2024, 'cited_by_count': 2}, {'year': 2023, 'cited_by_count': 1}, {'year': 2021, 'cited_by_count': 1}, {'year': 2020, 'cited_by_count': 1}, {'year': 2019, 'cited_by_count': 1}, {'year': 2015, 'cited_by_count': 1}], 'updated_date': '2025-01-06T07:34:55.478839', 'created_date': '2016-06-24'}