{"id":"https://openalex.org/W1591867251","doi":"https://doi.org/10.1007/11679363_26","title":"Recovery of Sparse Representations by Polytope Faces Pursuit","display_name":"Recovery of Sparse Representations by Polytope Faces Pursuit","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1591867251","doi":"https://doi.org/10.1007/11679363_26","mag":"1591867251"},"language":"en","primary_location":{"id":"doi:10.1007/11679363_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11679363_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5066967599","display_name":"Mark D. Plumbley","orcid":"https://orcid.org/0000-0002-9708-1075"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Mark D. Plumbley","raw_affiliation_strings":["Department of Electronic Engineering, Queen Mary University of London, Mile End Road, London, E1 4NS, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Queen Mary University of London, Mile End Road, London, E1 4NS, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066967599"],"corresponding_institution_ids":["https://openalex.org/I166337079"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":21.9768,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.99328108,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"206","last_page":"213"},"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.9994999766349792,"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.9994999766349792,"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.9976000189781189,"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.9966999888420105,"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/polytope","display_name":"Polytope","score":0.7972713708877563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7373834848403931},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.7085613012313843},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.6112872362136841},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47638362646102905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4693722724914551},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4378575384616852},{"id":"https://openalex.org/keywords/orthogonal-basis","display_name":"Orthogonal basis","score":0.43654578924179077},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4319365620613098},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4313051104545593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3689277768135071},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1808018684387207},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.16587036848068237},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10351148247718811}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7972713708877563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7373834848403931},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.7085613012313843},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.6112872362136841},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47638362646102905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4693722724914551},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4378575384616852},{"id":"https://openalex.org/C187064257","wikidata":"https://www.wikidata.org/wiki/Q3306808","display_name":"Orthogonal basis","level":2,"score":0.43654578924179077},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4319365620613098},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4313051104545593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3689277768135071},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1808018684387207},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.16587036848068237},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10351148247718811},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11679363_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11679363_26","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.1212","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.1212","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.elec.qmul.ac.uk/people/markp/2005/Plumbley05-recovery.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"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":16,"referenced_works":["https://openalex.org/W1511213320","https://openalex.org/W1963547452","https://openalex.org/W1986931325","https://openalex.org/W2013718771","https://openalex.org/W2028781966","https://openalex.org/W2116148865","https://openalex.org/W2128659236","https://openalex.org/W2142940228","https://openalex.org/W2151693816","https://openalex.org/W2154332973","https://openalex.org/W2157969180","https://openalex.org/W2244944662","https://openalex.org/W3151335051","https://openalex.org/W4210631977","https://openalex.org/W4213255380","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1974198688","https://openalex.org/W1973211400","https://openalex.org/W2134343866","https://openalex.org/W1974665041","https://openalex.org/W2390966538","https://openalex.org/W1815093352","https://openalex.org/W3215967011","https://openalex.org/W2119375127","https://openalex.org/W2949400653","https://openalex.org/W2114913122"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}