{"id":"https://openalex.org/W7160312349","doi":"https://doi.org/10.48550/arxiv.2605.02309","title":"The AECM Algorithm for Deterministic Maximum Likelihood Direction Finding in the Presence of Gaussian Mixture Noise","display_name":"The AECM Algorithm for Deterministic Maximum Likelihood Direction Finding in the Presence of Gaussian Mixture Noise","publication_year":2026,"publication_date":"2026-05-04","ids":{"openalex":"https://openalex.org/W7160312349","doi":"https://doi.org/10.48550/arxiv.2605.02309"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.02309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02309","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.02309","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134511884","display_name":"Mingyan Gong","orcid":"https://orcid.org/0000-0002-4052-1498"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gong, Mingyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135386173","display_name":"Bin Lyu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lyu, Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9136999845504761,"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.9136999845504761,"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.03460000082850456,"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.011800000444054604,"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/outlier","display_name":"Outlier","score":0.6425999999046326},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5792999863624573},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5742999911308289},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5738999843597412},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5551999807357788},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.5551999807357788},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5476999878883362},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.48539999127388},{"id":"https://openalex.org/keywords/gaussian-noise","display_name":"Gaussian noise","score":0.4765999913215637}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7106000185012817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7044000029563904},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.6425999999046326},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5792999863624573},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5742999911308289},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5738999843597412},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.5551999807357788},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5551999807357788},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5476999878883362},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.48539999127388},{"id":"https://openalex.org/C4199805","wikidata":"https://www.wikidata.org/wiki/Q2725903","display_name":"Gaussian noise","level":2,"score":0.4765999913215637},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4375},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C2780382809","wikidata":"https://www.wikidata.org/wiki/Q1367488","display_name":"Direction finding","level":3,"score":0.3885999917984009},{"id":"https://openalex.org/C61224824","wikidata":"https://www.wikidata.org/wiki/Q2260434","display_name":"Mixture model","level":2,"score":0.38429999351501465},{"id":"https://openalex.org/C172051844","wikidata":"https://www.wikidata.org/wiki/Q5280438","display_name":"Direction of arrival","level":3,"score":0.3765000104904175},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C2781170535","wikidata":"https://www.wikidata.org/wiki/Q30587856","display_name":"Noisy data","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C29265498","wikidata":"https://www.wikidata.org/wiki/Q7047719","display_name":"Noise measurement","level":3,"score":0.27059999108314514},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.26669999957084656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26440000534057617},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.02309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02309","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.02309","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.02309","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Gaussian":[0,22],"mixture":[1,23],"noise":[2,6],"can":[3],"model":[4],"non-Gaussian":[5],"and":[7,39,43,60,85,97,146],"also":[8],"be":[9],"used":[10],"when":[11],"outliers":[12],"are":[13],"present.":[14],"For":[15],"deterministic":[16],"maximum":[17],"likelihood":[18],"direction":[19,52],"finding":[20],"in":[21],"noise,":[24],"the":[25,34,71,80,94,98,118,123,131,139],"Space-Alternating":[26],"Generalized":[27],"Expectation-maximization":[28],"(SAGE)":[29],"algorithm,":[30,36,76,82],"an":[31,77],"extension":[32,78],"of":[33,53,79,93,127],"expectation-maximization":[35],"was":[37],"applied":[38,84],"designed":[40],"by":[41,112],"Kozick":[42],"Sadler":[44],"twenty":[45],"odd":[46],"years":[47],"ago,":[48],"which":[49,87],"simultaneously":[50],"updates":[51],"arrival":[54],"(DOA)":[55],"estimates":[56,106],"at":[57,107],"each":[58,108,128],"iteration":[59,109,129],"cannot":[61],"properly":[62],"converge":[63],"under":[64],"unequal":[65],"signal":[66],"powers.":[67],"In":[68],"this":[69],"article,":[70],"Alternating":[72],"Expectation-Conditional":[73],"Maximization":[74],"(AECM)":[75],"SAGE":[81,132],"is":[83,147],"designed,":[86],"utilizes":[88],"multiple":[89],"less":[90],"informative":[91],"versions":[92],"complete":[95],"data":[96],"golden":[99],"section":[100],"search":[101],"method":[102],"to":[103],"update":[104],"DOA":[105],"sequentially":[110],"(one":[111],"one).":[113],"Theoretical":[114],"analysis":[115],"shows":[116],"that":[117,138],"AECM":[119,140],"algorithm":[120,141],"has":[121],"almost":[122],"same":[124],"computational":[125],"complexity":[126],"as":[130],"algorithm.":[133],"However,":[134],"numerical":[135],"results":[136],"show":[137],"yields":[142],"faster":[143],"stable":[144],"convergence":[145],"computationally":[148],"more":[149],"efficient.":[150]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-06T00:00:00"}