{"title":"多静态跟踪与场稳定的似然函数分解","authors":"R. Streit","doi":"10.1109/ICIF.2007.4408040","DOIUrl":null,"url":null,"abstract":"An alternating directions method is presented for joint maximum a posteriori estimation of target track and sensor field using bistatic range data. The algorithm cycles over two sub-algorithms: one improves the target state estimate conditioned on sensor field state, and the other improves the sensor field state estimate conditioned on target state. Nonlinearities in the sub-algorithms are mitigated by decomposing their likelihood functions using integral representations. The kernels of these integrals are linear-Gaussian densities in the states to be estimated, a fact that facilitates the use of missing data methods. The resulting sub-algorithms are equivalent to linear-Gaussian Kalman smoothers. The alternating directions algorithm is guaranteed to converge to (at least) a local maximum of the joint target-field likelihood function.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Likelihood function decomposition for multistatic tracking and field stabilization\",\"authors\":\"R. Streit\",\"doi\":\"10.1109/ICIF.2007.4408040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An alternating directions method is presented for joint maximum a posteriori estimation of target track and sensor field using bistatic range data. The algorithm cycles over two sub-algorithms: one improves the target state estimate conditioned on sensor field state, and the other improves the sensor field state estimate conditioned on target state. Nonlinearities in the sub-algorithms are mitigated by decomposing their likelihood functions using integral representations. The kernels of these integrals are linear-Gaussian densities in the states to be estimated, a fact that facilitates the use of missing data methods. The resulting sub-algorithms are equivalent to linear-Gaussian Kalman smoothers. The alternating directions algorithm is guaranteed to converge to (at least) a local maximum of the joint target-field likelihood function.\",\"PeriodicalId\":298941,\"journal\":{\"name\":\"2007 10th International Conference on Information Fusion\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 10th International Conference on Information Fusion\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIF.2007.4408040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 10th International Conference on Information Fusion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2007.4408040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Likelihood function decomposition for multistatic tracking and field stabilization
An alternating directions method is presented for joint maximum a posteriori estimation of target track and sensor field using bistatic range data. The algorithm cycles over two sub-algorithms: one improves the target state estimate conditioned on sensor field state, and the other improves the sensor field state estimate conditioned on target state. Nonlinearities in the sub-algorithms are mitigated by decomposing their likelihood functions using integral representations. The kernels of these integrals are linear-Gaussian densities in the states to be estimated, a fact that facilitates the use of missing data methods. The resulting sub-algorithms are equivalent to linear-Gaussian Kalman smoothers. The alternating directions algorithm is guaranteed to converge to (at least) a local maximum of the joint target-field likelihood function.