{"id":"https://openalex.org/W2403514405","doi":"https://doi.org/10.1109/tsp.2016.2572048","title":"A Batch Algorithm for Estimating Trajectories of Point Targets Using Expectation Maximization","display_name":"A Batch Algorithm for Estimating Trajectories of Point Targets Using Expectation Maximization","publication_year":2016,"publication_date":"2016-05-24","ids":{"openalex":"https://openalex.org/W2403514405","doi":"https://doi.org/10.1109/tsp.2016.2572048","mag":"2403514405"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2016.2572048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2016.2572048","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Signal Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://publications.lib.chalmers.se/records/fulltext/242433/local_242433.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027597120","display_name":"Abu Sajana Rahmathullah","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Abu Sajana Rahmathullah","raw_affiliation_strings":["Signals and Systems Department, Chalmers University of Technology, Gothenburg, Sweden","Signals & Syst. Dept., Chalmers Univ. of Technol., Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-0225-0743","affiliations":[{"raw_affiliation_string":"Signals and Systems Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Signals & Syst. Dept., Chalmers Univ. of Technol., Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063821969","display_name":"Raghavendra Selvan","orcid":"https://orcid.org/0000-0003-4302-0207"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Raghavendra Selvan","raw_affiliation_strings":["Computer Science Department, University of Copenhagen, Copenhagen, Denmark","Computer Science Department University of Copenhagen Copenhagen Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Computer Science Department University of Copenhagen Copenhagen Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029413988","display_name":"Lennart Svensson","orcid":"https://orcid.org/0000-0003-0206-9186"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Lennart Svensson","raw_affiliation_strings":["Signals and Systems Department, Chalmers University of Technology, Gothenburg, Sweden","Signals & Syst. Dept., Chalmers Univ. of Technol., Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signals and Systems Department, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Signals & Syst. Dept., Chalmers Univ. of Technol., Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2993,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86648368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"64","issue":"18","first_page":"4792","last_page":"4804"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10711","display_name":"Target Tracking and Data Fusion in Sensor Networks","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.9833999872207642,"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/algorithm","display_name":"Algorithm","score":0.6829533576965332},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6601055860519409},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.5219866037368774},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49194666743278503},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.4805479645729065},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4327922761440277},{"id":"https://openalex.org/keywords/data-association","display_name":"Data association","score":0.4309956431388855},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4177699089050293},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3454554080963135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3018907904624939},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.18198710680007935},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09353813529014587}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6829533576965332},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6601055860519409},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.5219866037368774},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49194666743278503},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.4805479645729065},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4327922761440277},{"id":"https://openalex.org/C2983325608","wikidata":"https://www.wikidata.org/wiki/Q17084606","display_name":"Data association","level":3,"score":0.4309956431388855},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4177699089050293},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3454554080963135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3018907904624939},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.18198710680007935},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09353813529014587}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tsp.2016.2572048","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2016.2572048","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"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 Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:242433","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/242433","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/242433/local_242433.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:publications.lib.chalmers.se:242433","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/242433-a-batch-algorithm-for-estimating-trajectories-of-point-targets-using-expectation-maximization","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/51df9091-b715-4d51-bf0b-731b27d3f136","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/51df9091-b715-4d51-bf0b-731b27d3f136","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rahmathullah , A S , Selvan , R & Svensson , L 2016 , ' A Batch Algorithm for Estimating Trajectories of Point Targets Using Expectation Maximization ' , IEEE Transactions on Signal Processing , vol. 64 , no. 18 , pp. 4792-4804 . https://doi.org/10.1109/TSP.2016.2572048","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/aaa13ab0-ae87-4d9b-bdd6-e4d71eb4bb53","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/aaa13ab0-ae87-4d9b-bdd6-e4d71eb4bb53","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rahmathullah , A S , Selvan , R & Svensson , L 2016 , ' A Batch Algorithm for Estimating Trajectories of Point Targets Using Expectation Maximization ' , IEEE Transactions on Signal Processing , vol. 64 , no. 18 , pp. 4792-4804 . https://doi.org/10.1109/TSP.2016.2572048","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:research.chalmers.se:242433","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/242433","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/242433/local_242433.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321523","display_name":"Chalmers Tekniska H\u00f6gskola","ror":"https://ror.org/040wg7k59"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2403514405.pdf"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W34992941","https://openalex.org/W1496856925","https://openalex.org/W1521365818","https://openalex.org/W1557595030","https://openalex.org/W1568122762","https://openalex.org/W1642300317","https://openalex.org/W1665207485","https://openalex.org/W1841989491","https://openalex.org/W2001817222","https://openalex.org/W2002341681","https://openalex.org/W2007463795","https://openalex.org/W2007808202","https://openalex.org/W2007890476","https://openalex.org/W2011087880","https://openalex.org/W2048605796","https://openalex.org/W2049633694","https://openalex.org/W2055111541","https://openalex.org/W2076526444","https://openalex.org/W2078147285","https://openalex.org/W2080755927","https://openalex.org/W2083643725","https://openalex.org/W2094227853","https://openalex.org/W2103204412","https://openalex.org/W2104174032","https://openalex.org/W2107142957","https://openalex.org/W2115979064","https://openalex.org/W2118429180","https://openalex.org/W2122467413","https://openalex.org/W2126885789","https://openalex.org/W2127923214","https://openalex.org/W2129078811","https://openalex.org/W2129897708","https://openalex.org/W2137813581","https://openalex.org/W2141200443","https://openalex.org/W2143928057","https://openalex.org/W2147855783","https://openalex.org/W2150440166","https://openalex.org/W2155680787","https://openalex.org/W2157316965","https://openalex.org/W2294153305","https://openalex.org/W2406671474","https://openalex.org/W3029645440","https://openalex.org/W3104150103","https://openalex.org/W4301014524","https://openalex.org/W6618308950","https://openalex.org/W6629759753","https://openalex.org/W6633511732","https://openalex.org/W6675781167","https://openalex.org/W6677308353","https://openalex.org/W6681578613","https://openalex.org/W6681697924","https://openalex.org/W6713720400","https://openalex.org/W7048738093"],"related_works":["https://openalex.org/W1978572805","https://openalex.org/W2383807498","https://openalex.org/W1997992934","https://openalex.org/W1987225439","https://openalex.org/W4238188170","https://openalex.org/W2125114371","https://openalex.org/W2019977573","https://openalex.org/W2149980199","https://openalex.org/W2083331556","https://openalex.org/W1602763373"],"abstract_inverted_index":{"In":[0],"this":[1,61],"paper,":[2],"we":[3,64,99],"propose":[4],"a":[5,42,51,186],"strategy":[6],"that":[7,66,114,157],"is":[8,20,53],"based":[9,176],"on":[10],"expectation":[11],"maximization":[12],"for":[13,79,88,147],"tracking":[14,25,180],"multiple":[15,178],"point":[16,32,39],"targets.":[17],"The":[18,182],"algorithm":[19,69,103,129,146,160,184],"similar":[21],"to":[22,37,171],"probabilistic":[23,108],"multi-hypothesis":[24],"(PMHT)":[26],"but":[27],"does":[28,130],"not":[29],"relax":[30],"the":[31,38,67,83,101,127,137,145,158,193],"target":[33,40,43],"model":[34,62],"assumptions.":[35],"According":[36],"models,":[41],"can":[44,70],"generate":[45],"at":[46,56],"most":[47,57],"one":[48,58],"measurement,":[49],"and":[50,82,106,112,116,165,192],"measurement":[52],"generated":[54],"by":[55],"target.":[59],"With":[60],"assumption,":[63],"show":[65,113,156],"proposed":[68,102,128,159,183],"be":[71],"implemented":[72],"as":[73],"iterations":[74,155],"of":[75,144],"Rauch-Tung-Striebel":[76],"(RTS)":[77],"smoothing":[78],"state":[80],"estimation,":[81],"loopy":[84],"belief":[85],"propagation":[86],"method":[87],"marginal":[89],"data":[90,109],"association":[91,110],"probabilities":[92],"calculation.":[93],"Using":[94],"example":[95],"illustrations":[96],"with":[97,104],"tracks,":[98],"compare":[100,169],"PMHT":[105,115],"joint":[107],"(JPDA)":[111],"JPDA":[117,164],"exhibit":[118],"coalescence":[119],"when":[120],"there":[121],"are":[122],"closely":[123],"moving":[124],"targets":[125],"whereas":[126],"not.":[131],"Furthermore,":[132],"extensive":[133],"simulations":[134],"c":[135],"comparing":[136],"mean":[138],"optimal":[139],"subpattern":[140],"assignment":[141],"(MOSPA)":[142],"performance":[143],"different":[148],"scenarios":[149],"averaged":[150],"over":[151],"several":[152],"Monte":[153],"Carlo":[154],"performs":[161],"better":[162],"than":[163],"PMHT.":[166],"We":[167],"also":[168],"it":[170],"benchmarking":[172],"algorithm:":[173],"N-scan":[174],"pruning":[175],"track-oriented":[177],"hypothesis":[179],"(TOMHT).":[181],"shows":[185],"good":[187],"tradeoff":[188],"between":[189],"computational":[190],"complexity":[191],"MOSPA":[194],"performance.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}