基于截断型D－S的快速证据组合方法

Download: PDF (1377 KB)
Export: BibTeX | EndNote (RIS)

Abstract How to solve the computation complexity of the Dempster rule is a hot topic at present. In order to improve the accuracy of decision, this paper presents an approximation method which improves truncated D-S algorithm. Simulation results show that this method is superior to truncated D-S algorithm in terms of the accuracy of decision based on basic probability assignment function.

Key words： Evidential combination method Approximation computation Truncated Dempster - Shafer

Received: 15 June 2001

PACS:

TN911.72

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors




	Wang Zhuang
	Hu Weidong
	Yu Wenxian
	Zhuang Zhaowen

Cite this article:

Wang Zhuang,Hu Weidong,Yu Wenxian等. A fast evidential combination method based on truncated dempster-shafer[J]. , 2002, 24(12): 1863-1869 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2002/V24/I12/1863

[1]	Xia Shu-Tao, Liu Lu, Liu Xin-Ji. Deterministic Constructions of Compressive Sensing Matrices Based on Berlekamp-Justesen Codes[J]. , 2015, 37(4): 763-769.