{"id":"https://openalex.org/W2936060928","doi":"https://doi.org/10.1109/icassp.2019.8682920","title":"Gridless DOA Estimation via. Alternating Projections","display_name":"Gridless DOA Estimation via. Alternating Projections","publication_year":2019,"publication_date":"2019-04-17","ids":{"openalex":"https://openalex.org/W2936060928","doi":"https://doi.org/10.1109/icassp.2019.8682920","mag":"2936060928"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2019.8682920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5020298722","display_name":"Mark Wagner","orcid":"https://orcid.org/0000-0002-2153-7080"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mark Wagner","raw_affiliation_strings":["San Diego Electrical and Computer Engineering, University of California, La Jolla, CA"],"affiliations":[{"raw_affiliation_string":"San Diego Electrical and Computer Engineering, University of California, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004718675","display_name":"Peter Gerstoft","orcid":"https://orcid.org/0000-0002-0471-062X"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Gerstoft","raw_affiliation_strings":["San Diego Electrical and Computer Engineering, University of California, La Jolla, CA"],"affiliations":[{"raw_affiliation_string":"San Diego Electrical and Computer Engineering, University of California, La Jolla, CA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013155255","display_name":"Yongsung Park","orcid":"https://orcid.org/0000-0001-6692-0262"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yongsung Park","raw_affiliation_strings":["Naval Architecture and Ocean Engineering, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Naval Architecture and Ocean Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020298722"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":1.836,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.85741237,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"4215","last_page":"4219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9998000264167786,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"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.9994999766349792,"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/computer-science","display_name":"Computer science","score":0.6275317668914795},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6238218545913696},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5966426730155945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5943126082420349},{"id":"https://openalex.org/keywords/direction-of-arrival","display_name":"Direction of arrival","score":0.5848696231842041},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5403493046760559},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.531356155872345},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43919411301612854},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42587172985076904},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4245613217353821},{"id":"https://openalex.org/keywords/estimation","display_name":"Estimation","score":0.41315293312072754},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36661654710769653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21512585878372192}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6275317668914795},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6238218545913696},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5966426730155945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5943126082420349},{"id":"https://openalex.org/C172051844","wikidata":"https://www.wikidata.org/wiki/Q5280438","display_name":"Direction of arrival","level":3,"score":0.5848696231842041},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5403493046760559},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.531356155872345},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43919411301612854},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42587172985076904},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4245613217353821},{"id":"https://openalex.org/C96250715","wikidata":"https://www.wikidata.org/wiki/Q965330","display_name":"Estimation","level":2,"score":0.41315293312072754},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36661654710769653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21512585878372192},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C21822782","wikidata":"https://www.wikidata.org/wiki/Q131214","display_name":"Antenna (radio)","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icassp.2019.8682920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2019.8682920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:s-space.snu.ac.kr:10371/187189","is_oa":false,"landing_page_url":"https://hdl.handle.net/10371/187189","pdf_url":null,"source":{"id":"https://openalex.org/S4306401345","display_name":"Seoul National University Open Repository (Seoul National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139264467","host_organization_name":"Seoul National University","host_organization_lineage":["https://openalex.org/I139264467"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485732691","https://openalex.org/W1541064563","https://openalex.org/W1571780702","https://openalex.org/W1982485815","https://openalex.org/W2019833178","https://openalex.org/W2028191993","https://openalex.org/W2052059821","https://openalex.org/W2063215935","https://openalex.org/W2065656021","https://openalex.org/W2090989552","https://openalex.org/W2091369174","https://openalex.org/W2106686997","https://openalex.org/W2113638573","https://openalex.org/W2115125420","https://openalex.org/W2119667497","https://openalex.org/W2123457453","https://openalex.org/W2164278908","https://openalex.org/W2528695050","https://openalex.org/W2565293665","https://openalex.org/W2635499064","https://openalex.org/W2964325628","https://openalex.org/W3098494111","https://openalex.org/W4230248090","https://openalex.org/W4241068368","https://openalex.org/W4250589301","https://openalex.org/W4292363360","https://openalex.org/W6676102582","https://openalex.org/W6728275842"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W1553604823","https://openalex.org/W8322802","https://openalex.org/W2195994862","https://openalex.org/W314331466","https://openalex.org/W2149122936"],"abstract_inverted_index":{"An":[0],"alternative":[1],"method":[2,45],"for":[3],"solving":[4,17],"the":[5,18,29,34,44,65,93,97],"gridless":[6,35,57,88],"direction-of-arrival":[7],"(DOA)":[8],"estimation":[9,15,37,90],"problem":[10,38],"is":[11],"presented.":[12],"Gridless":[13],"DOA":[14,36,58,89],"involves":[16],"semi-definite":[19],"characterization":[20],"of":[21,33,46,67,75,96],"a":[22,71],"rank":[23],"minimization":[24],"problem.":[25],"We":[26,50],"show":[27],"that":[28],"original":[30],"non-convex":[31],"formulation":[32],"can":[39],"be":[40],"solved":[41,91],"efficiently":[42],"using":[43,92],"alternating":[47],"projections":[48,55],"(AP).":[49],"deem":[51],"our":[52],"solution":[53],"`alternating":[54],"based":[56],"estimation,'":[59],"or":[60],"APG.":[61],"Using":[62],"insight":[63],"from":[64],"derivation":[66],"APG":[68],"we":[69],"present":[70],"reduced":[72],"dimension":[73],"variation":[74],"APG,":[76],"(RD-APG).":[77],"The":[78],"presented":[79],"algorithms":[80],"are":[81],"compared":[82],"in":[83],"speed":[84],"and":[85],"accuracy":[86],"to":[87],"current":[94],"state":[95],"art":[98],"SDP":[99],"solver.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}