A Fast Approximate Reasoning Method in Hierarchical DSmT(A)

您当前的位置：

首页 >

文章列表页 >

A Fast Approximate Reasoning Method in Hierarchical DSmT(A)

更新时间：2025-07-08

- A Fast Approximate Reasoning Method in Hierarchical DSmT(A)
- Acta Electronica Sinica Vol. 38, Issue 11, Pages: 2566-2572(2010)
- 作者机构：
  
  1. 东南大学自动化学院复杂工程系统测量与控制教育部重点实验室,江苏,南京,210096
  2. ONERA(The French Aerospace Lab),29 Av.de la Division,Leclerc,Chatillon,France,92320
  3. 华中科技大学控制系,湖北,武汉,430074
  4. 东南大学自动化学院复杂工程系统测量与控制教育部重点实验室,江苏,南京,210096
  5. ONERA(The French Aerospace Lab)29 Av.de la DivisionLeclercChatillon 92320France
  6. 华中科技大学控制系,湖北,武汉,430074
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Published：2010
- 稿件说明：
移动端阅览
A Fast Approximate Reasoning Method in Hierarchical DSmT(A)[J]. Acta Electronica Sinica, 2010, 38(11): 2566-2572.
DOI：

A Fast Approximate Reasoning Method in Hierarchical DSmT(A)[J]. Acta Electronica Sinica, 2010, 38(11): 2566-2572. DOI：

摘要

本文提出了一种分层递阶的DSmT快速近似推理融合方法

该方法针对超幂集空间中仅单子焦元具有信度赋值的情况

利用二叉树或三叉树分组技术对其刚性分组

与此同时

对每个信息源对应的各个分组焦元进行信度赋值求和

以便实现细粒度超幂集空间向粗粒度超幂集空间映射.然后运用DSmT组合规则和比例冲突分配规则对粗化超幂集空间的两个信息源进行融合

保存该融合结果作为父子之间节点连接权值

然后对每个分组焦元信度赋值归一化处理

通过设定树的深度

来确定分层递阶的次数.最后通过从多个角度比较新、老方法

从而充分地验证了新方法的优越性.

Abstract

A kind of fast approximate reasoning method in hierarchical DSmT is proposed.This method is only fit for the case that there are only singleton focal elements with assignments in hyper-power set.These focal elements in hyper-power set are forced to group through bintree or tritree technologies.At the same time

the assignments of focal elements in these different groups corresponding to each source are added up respectively

in order to realize the mapping from the refined hyper-power set to the coarsened one.And then

two sources with the coarsened hyper-power set are combined together according to DSmC(Classical DSm combination rule) and PCR5(Proportional conflict redistribution No.5).The fused results from different groups will be saved as the connecting weights between father and children nodes.And then

all assignments of focal elements in different groups will be normalized respectively.Tree depth is set

in order to decide the iterative times in hierarchical system.Finally

by comparing new method with old one from different views

the superiority of new one over old one is testified well.

关键词

Keywords

references

Views

1110

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)

An DSmT Approximate Reasoning Method on the Condition of Non-zero Multiple Focal Elements

Dual Attention-Guided Detail and Structure Information Fusion Network for Image Dehazing

Research on Recombination Operator and Multi-Objective Optimization Based on Fitness Guided Mating Restriction Strategy

Dual-Domain Feature Interaction and Local Correlation Upsampling Network for Single Image Dehazing

Related Author

LI Xin-de

YANG Wei-dong

WU Xue-jian

Jean Dezert

GUO Qiang

HE You

GUAN Xin

GAI Ming-jiu

Related Institution

ONERA(The French Aerospace Lab)29 Av.de la Division LeclercChatillon 92320France

Key Laboratory of Measurement and Control of CSE (School of AutomationSoutheast University)Ministry of EducationNanjingJiangsu 210096China

ONERA(The French Aerospace Lab),29 Av.de la Division Leclerc,Chatillon

Key Laboratory of Measurement and Control of CSE (School of Automation,Southeast University),Ministry of Education

Department of Basic Science Naval Aeronautical and Astronautical University Yantai Shandong China

⁰