文件名称:Multiple-hypothesis-algorithm
-
所属分类:
- 标签属性:
- 上传时间:2014-06-09
-
文件大小:263.28kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
MHT(多假设跟踪)是一种基于多个扫描周期量测, 进行数据互联的技术, 理论上是解决数
据关联的最优方法。文中重点阐述多假设跟踪算法中数据聚簇、假设生成及假设概率计算、假设约简与
剪枝等环节。从工程角度出发, 采用K best最优假设和N scan 回溯剪枝以提高算法效率和实用-MHT (multiple hypothesis tracking) is a kind of multiple scan cycle measurement based, data interconnection technology, theory is to solve the number
According to the optimal method of association. This paper focuses on multiple hypothesis tracking algorithm in data clustering, hypothesis generation and hypothesis probability calculation, assuming that reduction and
The pruning process. From the engineering point of view, using K best optimal hypothesis and N scan backtracking pruning algorithm to improve the efficiency
据关联的最优方法。文中重点阐述多假设跟踪算法中数据聚簇、假设生成及假设概率计算、假设约简与
剪枝等环节。从工程角度出发, 采用K best最优假设和N scan 回溯剪枝以提高算法效率和实用-MHT (multiple hypothesis tracking) is a kind of multiple scan cycle measurement based, data interconnection technology, theory is to solve the number
According to the optimal method of association. This paper focuses on multiple hypothesis tracking algorithm in data clustering, hypothesis generation and hypothesis probability calculation, assuming that reduction and
The pruning process. From the engineering point of view, using K best optimal hypothesis and N scan backtracking pruning algorithm to improve the efficiency
(系统自动生成,下载前可以参看下载内容)
下载文件列表
多假设跟踪算法研究及其应用.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
