摘要
该文提出利用一种最大似然自适应门限的快速算法,该算法首先利用自适应的对观测进行门限处理,然后仅利用处于门限内的有效观测进行GM-CPHD算法的更新步计算,大大降低了算法的计算复杂度。
Due to the fact that classic GM-CPHD filer has a great computational complexity, a adaptive gating algorithm is proposed in this paper, which reduces the measurements set by using a max likelihood adaptive gate, and only the measurement falling into the gate can be used to update the PHD estimation.
出处
《电脑知识与技术（过刊）》
2014年第7X期4804-4805,共2页
Computer Knowledge and Technology
