The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the problem of choosing the best subset of sensors that results in a prescribed error probability Pe in Bayesian setting. Since minimizing the error probability is often difficult to evaluate and manipulate, conventional methods adopt Bhattacharyya distance instead of it. In fact, Chernoff distance is the best achievable exponent in the Bayesian error probability and it is more accurate...
The dynamic grid map illustrates the environment of robots with moving and static obstacles. Nuss et al. describe in [1] an implementation of this grid map, in which the state of the grid cells is to be modeled as a random finite set (RFS) based on a stochastic measurement system. For a real-time implementation this approach was approximated with Dempster-Shafer (DS). For this Nuss et al. design the...
In the complex pattern classification problem, the reliability of classifier output for the patterns located at different regions of the data set may be different. In order to efficiently improve the classification accuracy, we propose a new method to correct the original classifier output using the local knowledge of the classifier performance in different regions. The training data set can be divided...
In this paper, the problem of robust minimax testing of binary composite hypothesis is considered, while the actual probability densities are located in neighborhoods characterized by the Itakura-Saito divergence. And then the existence of a saddle value condition is proved under Sion's minimax theorem. Moreover, we derive the least favorable distributions and the robust decision rule involved four...
This paper proposes a method of searching for missing people in mountains by UAVs (Unmanned Aerial Vehicles) based on beacon signals. This method alternately updates the distribution of estimated target position and unknown parameters by particle filtering, and determines the next best observation location based on the idea of the uncertainty sampling. We will show how this method can be integrated...
Dempster-Shafer evidence theory (DST) is a theoretical framework for uncertainty modeling and reasoning. The determination of basic belief assignment (BBA) is crucial in DST, however, there is no general theoretical method for BBA determination. In this paper, a method of generating BBA using fuzzy numbers is proposed. First, the training data are modeled as fuzzy numbers. Then, the dissimilarities...
Dempster-Shafer theory (DST) is an important theory for information fusion. However, in DST how to determinate the basic belief assignment (BBA) is still an open issue. The interval number based BBA determination method is simple and effective, where the features of different classes' samples are modeled using the interval numbers, i.e., an interval number model is constructed for each focal element...
Dempster-Shafer theory of evidence is widely applied to uncertainty modelling and knowledge reasoning because of its advantages in dealing with uncertain information. But some conditions or requirements, such as exclusiveness hypothesis and completeness constraint, limit the development and application of that theory to a large extend. To overcome the shortcomings and enhance its capability of representing...
To embed ensemble techniques into belief decision trees for performance improvement, the bagging algorithm is explored. Simple belief decision trees based on entropy intervals extracted from evidential likelihood are constructed as the base classifiers, and a combination of individual trees promises to lead to a better classification accuracy. Requiring no extra querying cost, bagging belief decision...
In this paper, consensus-based Kalman filtering is extended to deal with the problem of joint target tracking and sensor self-localization in a distributed wireless sensor network. The average weighted Kullback-Leibler divergence, which is a function of the unknown drift parameters, is employed as the cost to measure the discrepancy between the fused posterior distribution and the local distribution...
Dempster-Shafer (D-S) evidence theory is widely used for information fusion field. However, one of the main issues of D-S evidence theory is that, when large amount of focal elements in Basic Probability Assignment (BPA) are available, the fusion of BPA requires high computational cost and long computing time. This problem greatly limits its application. In this paper, a novel method for approximating...
Despite many proposed solutions, multi-object tracking remains a challenging problem in complex situations involving partial occlusions and non-uniform and abrupt illumination changes. Considering modular systems, the tracking performance strongly depends on the consistency of the different blocks relatively to error features. In this work, using the Belief Function framework, we take into account...
Belief fusion consists of taking into account multiple sources of belief about a domain of interest. This paper describes cumulative and averaging multi-source belief fusion in the formalism of subjective logic, which represent generalisations of binary-source belief fusion operators previously described. The advantage of this approach is that we can model and analyse belief fusion situations involving...
In the complex pattern classification problem, the fusion of multiple classification results produced by different attributes is able to efficiently improve the accuracy. Evidence theory is good at representing and combining the uncertain information, and it is employed here. Each attribute (set) can be considered as one source of evidence (information). In some applications, the observation of target...
Facing an unknown situation, a person may not be able to firmly elicit his/her preferences over different alternatives, so he/she tends to express uncertain preferences. Given a community of different persons expressing their preferences over certain alternatives under uncertainty, to get a collective representative opinion of the whole community, a preference fusion process is required. The aim of...
Due to the simplicity of its implementation and the impressive performance, Extreme Learning Machine (ELM) has been widely used in applications of machine learning. However, there are two potential problems in ELM: 1) lack of an efficient method for minimizing error; 2) consideration of little inherent structural information about correlations among output components. To overcome those problems, this...
In 2016 we developed a new approach for Multi-Criteria Decision-Making (MCDM) inspired by the technique for order preference by similarity to ideal solution (TOPSIS) and based on belief functions (BF). Our BF-TOPSIS (Belief Function based TOPSIS) approach assumes that the input score of each hypothesis for each criterion was a real precise number which is a quite restrictive assumption. In this paper...
Different belief sources often provide conflicting evidence, due to e.g. varying source reliability or deliberate deception. Source trust expresses the source reliability as seen by the analyst. In case of conflicting sources the analyst needs a strategy for managing and revising source trust. Intuitively, trust should be reduced for sources that produce advice which is in conflict with the ground...
This paper presents the generalized optimal sub-pattern assignment (GOSPA) metric on the space of finite sets of targets. Compared to the well-established optimal sub-pattern assignment (OSPA) metric, GOSPA is not normalised by the cardinality of the largest set and it penalizes cardinality errors differently, which enables us to express it as an optimisation over assignments instead of permutations...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.