{"id":"https://openalex.org/W3196217814","doi":"https://doi.org/10.1109/tvt.2021.3106794","title":"Alternating Maximization and the EM Algorithm in Maximum-Likelihood Direction Finding","display_name":"Alternating Maximization and the EM Algorithm in Maximum-Likelihood Direction Finding","publication_year":2021,"publication_date":"2021-08-24","ids":{"openalex":"https://openalex.org/W3196217814","doi":"https://doi.org/10.1109/tvt.2021.3106794","mag":"3196217814"},"language":"en","primary_location":{"id":"doi:10.1109/tvt.2021.3106794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2021.3106794","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-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/A5008186216","display_name":"Ming-yan Gong","orcid":"https://orcid.org/0000-0002-4052-1498"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming-yan Gong","raw_affiliation_strings":["School of Information and Electronics, Beijing Institute of Technology, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0002-4052-1498","affiliations":[{"raw_affiliation_string":"School of Information and Electronics, Beijing Institute of Technology, Beijing, China","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044630013","display_name":"Bin Lyu","orcid":"https://orcid.org/0000-0001-5077-2576"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Lyu","raw_affiliation_strings":["Key Laboratory of Ministry of Education in Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0001-5077-2576","affiliations":[{"raw_affiliation_string":"Key Laboratory of Ministry of Education in Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Nanjing, China","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2353,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.79467095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"70","issue":"10","first_page":"9634","last_page":"9645"},"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.9998999834060669,"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.9998999834060669,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9991000294685364,"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/T10860","display_name":"Speech and Audio Processing","score":0.9990000128746033,"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/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.7815192341804504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6797159910202026},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.6669369339942932},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5991092920303345},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5778536796569824},{"id":"https://openalex.org/keywords/likelihood-function","display_name":"Likelihood function","score":0.5712098479270935},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5515503883361816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5270174741744995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4942519962787628},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.43792325258255005},{"id":"https://openalex.org/keywords/maximum-likelihood-sequence-estimation","display_name":"Maximum likelihood sequence estimation","score":0.4233320653438568},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41232192516326904},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.41167712211608887},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.39142072200775146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3427380323410034},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.209634929895401}],"concepts":[{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.7815192341804504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6797159910202026},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.6669369339942932},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5991092920303345},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5778536796569824},{"id":"https://openalex.org/C89106044","wikidata":"https://www.wikidata.org/wiki/Q45284","display_name":"Likelihood function","level":3,"score":0.5712098479270935},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5515503883361816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5270174741744995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4942519962787628},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.43792325258255005},{"id":"https://openalex.org/C191462741","wikidata":"https://www.wikidata.org/wiki/Q6795902","display_name":"Maximum likelihood sequence estimation","level":3,"score":0.4233320653438568},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41232192516326904},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.41167712211608887},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.39142072200775146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3427380323410034},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.209634929895401},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tvt.2021.3106794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvt.2021.3106794","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1985690171","https://openalex.org/W2049633694","https://openalex.org/W2075721610","https://openalex.org/W2101658087","https://openalex.org/W2116414176","https://openalex.org/W2128083638","https://openalex.org/W2130788135","https://openalex.org/W2140728947","https://openalex.org/W2148982591","https://openalex.org/W2154191559","https://openalex.org/W2158536589","https://openalex.org/W2161623414","https://openalex.org/W2162654459","https://openalex.org/W2167086615","https://openalex.org/W2945889962","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W1978153144","https://openalex.org/W102848802","https://openalex.org/W2019724159","https://openalex.org/W2371672232","https://openalex.org/W2120595071","https://openalex.org/W1512911331","https://openalex.org/W1575258345","https://openalex.org/W2160216316","https://openalex.org/W2110390278","https://openalex.org/W1967639437"],"abstract_inverted_index":{"The":[0],"classic":[1],"expectation-maximization":[2],"(EM)":[3],"algorithm":[4,65,71,81,94,116],"in":[5],"maximum-likelihood":[6],"direction":[7],"finding":[8,15],"updates":[9],"the":[10,21,36,44,62,69,73,79,83,104,107,114,121,131,134],"complete-data":[11,37],"sufficient":[12,28],"statistics":[13,29],"by":[14,34],"their":[16],"conditional":[17],"expectations.":[18],"Besides,":[19],"from":[20],"perspective":[22],"of":[23,106,133],"alternating":[24],"maximization":[25],"(AM)":[26],"these":[27],"can":[30,126],"also":[31],"be":[32,127],"updated":[33],"maximizing":[35],"log-likelihood":[38],"function":[39],"with":[40],"respect":[41],"to":[42,68,102,129,139],"only":[43],"complete":[45],"data,":[46],"based":[47],"on":[48],"which":[49],"both":[50],"deterministic":[51,74],"and":[52,95,120,136],"stochastic":[53,84],"signal":[54,75,85],"models":[55],"are":[56,100],"considered.":[57],"Theoretical":[58],"analysis":[59],"indicates":[60],"that":[61,113],"proposed":[63,101],"AM":[64,92,108,137],"is":[66],"equivalent":[67],"EM":[70,80,135],"for":[72,82],"model":[76],"while":[77],"outperforming":[78],"model.":[86],"On":[87],"this":[88],"foundation,":[89],"a":[90],"sequential":[91],"(SAM)":[93],"two":[96,122],"iterative":[97,123],"weighting":[98,124],"schemes":[99,125],"improve":[103],"convergence":[105,119,132],"algorithm.":[109],"Numerical":[110],"results":[111],"show":[112],"SAM":[115],"yields":[117],"faster":[118],"used":[128],"avoid":[130],"algorithms":[138],"an":[140],"unwanted":[141],"limit":[142],"point":[143],"efficiently.":[144]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}