{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:36:28Z","timestamp":1761708988265},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Intell. Transport. Syst. Mag."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1109\/mits.2014.2304754","type":"journal-article","created":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T18:03:28Z","timestamp":1398189808000},"page":"21-33","source":"Crossref","is-referenced-by-count":28,"title":["Intersection-Based Road User Tracking Using a Classifying Multiple-Model PHD Filter"],"prefix":"10.1109","volume":"6","author":[{"given":"Daniel","family":"Meissner","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Reuter","sequence":"additional","affiliation":[]},{"given":"Elias","family":"Strigel","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Dietmayer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.03.006"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1244"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2255334"},{"key":"ref32","article-title":"Tensor decompositions for signal processing application","author":"cichocki","year":"0","journal-title":"IEEE Signal Processing Mag"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref30","first-page":"126","article-title":"Orthogonal nonnegative matrix tri-factorizations for clustering","author":"ding","year":"0","journal-title":"Proc 12th ACM SIGKDD Int Conf Knowledge Discovery and Data Mining"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.11-06-407"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<229::AID-CEM587>3.0.CO;2-N"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00011-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2285514"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2437-5_16"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2164621"},{"key":"ref12","first-page":"1","article-title":"Algorithms for nonnegative matrix and tensor factorizations: A unified view based on block coordinate descent framework","volume":"58","author":"kim","year":"2013","journal-title":"J Global Optim"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190410"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","article-title":"On the convergence of multiplicative update algorithms for nonnegative matrix factorization","volume":"18","author":"lin","year":"2007","journal-title":"IEEE Trans Neural Networks"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref17","author":"luenberger","year":"2003","journal-title":"Linear and Nonlinear Programming"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08013"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638234"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185576"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2008.10.057"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.55"},{"key":"ref29","article-title":"Common and individual features analysis: Beyond canonical correlation analysis","author":"zhou","year":"2013"},{"key":"ref5","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","volume":"28","author":"kumar","year":"2013","journal-title":"JMLR W&CP"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2008\/764206"},{"key":"ref7","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","volume":"16","author":"donoho","year":"0","journal-title":"Advances in Neural Information Processing 16 (Proc NIPS*2003)"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref9","first-page":"3349","article-title":"Sparse and unique nonnegative matrix factorization through data preprocessing","volume":"13","author":"gillis","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278"},{"key":"ref46","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"van der maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/36.297973"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"cai","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"ref22","first-page":"1223","article-title":"Factoring nonnegative matrices with linear programs","volume":"25","author":"bittorf","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15883-4_29"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2005.844293"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2271507"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2269903"},{"key":"ref23","article-title":"Fast and robust recursive algorithms for separable nonnegative matrix factorization","author":"gillis","year":"0","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020577"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOAS597"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2205237"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2021636"}],"container-title":["IEEE Intelligent Transportation Systems Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5117645\/6803919\/06803992.pdf?arnumber=6803992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:19:31Z","timestamp":1642004371000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6803992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":48,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/mits.2014.2304754","relation":{},"ISSN":["1939-1390"],"issn-type":[{"value":"1939-1390","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}