4.5 Article

Hierarchical and conditional combination of belief functions induced by visual tracking

期刊

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2009.12.001

关键词

Dempster-Shafer theory; Combination rules; Visual tracking

向作者/读者索取更多资源

In visual tracking, sources of information are often disrupted and deliver imprecise or unreliable data leading to major data fusion issues. In the Dempster-Shafer framework, such issues can be addressed by attempting to design robust combination rules. instead of introducing another rule, we propose to use existing ones as part of a hierarchical and conditional combination scheme. The sources are represented by mass functions which are analysed and labelled regarding unreliability and imprecision. This conditional step divides the problem into specific sub-problems. In each of these sub-problems, the number of constraints is reduced and an appropriate rule is selected and applied. Two functions are thus obtained and analysed, allowing another rule to be chosen for a second (and final) fusion level. This approach provides a fast and robust way to combine disrupted sources using contextual information brought by a particle filter. our experiments demonstrate its efficiency on several visual tracking situations. (C) 2009 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

Idempotent conjunctive and disjunctive combination of belief functions by distance minimization

John Klein, Sebastien Destercke, Olivier Colot

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2018)

Article Computer Science, Artificial Intelligence

From set relations to belief function relations

Sebastien Destercke, Frederic Pichon, John Klein

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2019)

Article Computer Science, Artificial Intelligence

Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces

John Klein

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2019)

Article Engineering, Electrical & Electronic

Impact of the Velocity Profile on Energy Consumption of Electric Vehicles

Anatole Desreveaux, Alain Bouscayrol, Rochdi Trigui, Elodie Castex, John Klein

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY (2019)

Article Engineering, Biomedical

MR to CT synthesis with multicenter data in the pelvic area using a conditional generative adversarial network

Kevin N. D. Brou Boni, John Klein, Ludovic Vanquin, Antoine Wagner, Thomas Lacornerie, David Pasquier, Nick Reynaert

PHYSICS IN MEDICINE AND BIOLOGY (2020)

Article Computer Science, Artificial Intelligence

SPOCC: Scalable POssibilistic Classifier Combination - toward robust aggregation of classifiers

Mahmoud Albardan, John Klein, Olivier Colot

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Radiology, Nuclear Medicine & Medical Imaging

Improving generalization in MR-to-CT synthesis in radiotherapy by using an augmented cycle generative adversarial network with unpaired data

Evin N. D. Brou Boni, John Klein, Akos Gulyban, Nick Reynaert, David Pasquier

Summary: MR-to-CT synthesis using an Augmented CycleGAN model showed good performance in generating synthetic CT images from unpaired data, indicating potential for generalization across different scanners and sequences. The mean absolute errors for sCT image generation were 59.8 HU and 65.8 HU for different test sites, with low dose differences and high gamma pass rates observed in dose distribution analysis.

MEDICAL PHYSICS (2021)

Article Biology

Self-mentoring: A new deep learning pipeline to train a self-supervised U-net for few-shot learning of bio-artificial capsule segmentation

Arnaud Deleruyelle, Cristian Versari, John Klein

Summary: This study introduces a neural pipeline for micro-capsule image segmentation, which utilizes synthetic or indirect supervision to improve model generalization. Experimental results demonstrate significant accuracy improvement, indicating the potential of replacing human annotations.

COMPUTERS IN BIOLOGY AND MEDICINE (2023)

Article Engineering, Electrical & Electronic

State space partitioning based on constrained spectral clustering for block particle filtering

Rui Min, Christelle Garnier, Francois Septier, John Klein

Summary: This study proposes a data-driven partitioning method based on constrained spectral clustering to automatically provide an appropriate partition, helping BPF escape the curse of dimensionality. The method successfully groups the most correlated state variables, reducing the variance of the filtering distribution estimate and limiting the level of bias.

SIGNAL PROCESSING (2022)

Article Computer Science, Theory & Methods

Backpack: A Backpropagable Adversarial Embedding Scheme

Solene Bernard, Patrick Bas, John Klein, Tomas Pevny

Summary: The minmax protocol automatically optimizes steganographic algorithms against various steganalytic detectors, while Backpack provides a theoretically sound solution to address the flaws in the protocol. Experimental verification shows that Backpack performs better than ADV-EMB and enhances the security of steganographic algorithms.

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (2022)

Article Computer Science, Theory & Methods

Explicit Optimization of min max Steganographic Game

Solene Bernard, Patrick Bas, John Klein, Tomas Pevny

Summary: The proposed algorithm aims to enhance the practical security of classical steganographic methods by selecting the least detectable stego image to simulate the game between Alice and Eve. Through extensive evaluation, the algorithm shows potential to increase practical security by effectively hiding information from classifiers.

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Decentralized Learning with Budgeted Network Load Using Gaussian Copulas and Classifier Ensembles

John Klein, Mahmoud Albardan, Benjamin Guedj, Olivier Colot

MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2019, PT I (2020)

Proceedings Paper Computer Science, Theory & Methods

Exploiting Adversarial Embeddings for Better Steganography

Solene Bernard, Tomas Pevny, Patrick Bas, John Klein

IH&MMSEC '19: PROCEEDINGS OF THE ACM WORKSHOP ON INFORMATION HIDING AND MULTIMEDIA SECURITY (2019)

Proceedings Paper Computer Science, Artificial Intelligence

From Relations Between Sets to Relations Between Belief Functions

Sebastien Destercke, Frederic Pichon, John Klein

BELIEF FUNCTIONS: THEORY AND APPLICATIONS, BELIEF 2018 (2018)

Proceedings Paper Engineering, Electrical & Electronic

Automatic Extraction of Breast Region in Raw Mammograms Using a Combined Strategy

Cyrille Feudjio, Alain Tiedeu, John Klein, Olivier Colot

2017 13TH INTERNATIONAL CONFERENCE ON SIGNAL-IMAGE TECHNOLOGY AND INTERNET-BASED SYSTEMS (SITIS) (2017)

Article Computer Science, Artificial Intelligence

Change in quantitative bipolar argumentation: Sufficient, necessary, and counterfactual explanations

Timotheus Kampik, Kristijonas Cyras, Jose Ruiz Alarcon

Summary: This paper presents a formal approach to explaining changes in inference in Quantitative Bipolar Argumentation Frameworks (QBAFs). The approach traces the causes of strength inconsistencies and provides explanations for them.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A direct approach to representing algebraic domains by formal contexts

Xiangnan Zhou, Longchun Wang, Qingguo Li

Summary: This paper aims to establish a closer connection between domain theory and Formal Concept Analysis (FCA) by introducing the concept of an optimized concept for a formal context. With the utilization of optimized concepts, it is demonstrated that the class of formal contexts directly corresponds to algebraic domains. Additionally, two subclasses of formal contexts are identified to characterize algebraic L-domains and Scott domains. An application is presented to address the open problem of reconstructing bounded complete continuous domains using attribute continuous contexts, and the presentation of algebraic domains is extended to a categorical equivalence.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Exploiting fuzzy rough entropy to detect anomalies

Sihan Wang, Zhong Yuan, Chuan Luo, Hongmei Chen, Dezhong Peng

Summary: Anomaly detection is widely used in various fields, but most current methods only work for specific data and ignore uncertain information such as fuzziness. This paper proposes an anomaly detection algorithm based on fuzzy rough entropy, which effectively addresses the similarity between high-dimensional objects using distance and correlation measures. The algorithm is compared and analyzed with mainstream anomaly detection algorithms on publicly available datasets, showing superior performance and flexibility.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

A preferential interpretation of MultiLayer Perceptrons in a conditional logic with typicality

Mario Alviano, Francesco Bartoli, Marco Botta, Roberto Esposito, Laura Giordano, Daniele Theseider Dupre

Summary: This paper investigates the relationships between a multipreferential semantics in defeasible reasoning and a multilayer neural network model. Weighted knowledge bases are considered for a simple description logic with typicality under a concept-wise multipreference semantics. The semantics is used to interpret MultiLayer Perceptrons (MLPs) preferentially. Model checking and entailment based approach are employed in verifying conditional properties of MLPs.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Polyadic relational concept analysis

Bazin Alexandre, Galasso Jessie, Kahn Giacomo

Summary: Formal concept analysis is a mathematical framework that represents the information in binary object-attribute datasets using a lattice of formal concepts. It has been extended to handle more complex data types, such as relational data and n-ary relations. This paper presents a framework for polyadic relational concept analysis, which extends relational concept analysis to handle relational datasets consisting of n-ary relations.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

Verified propagation of imprecise probabilities in non-linear ODEs

Ander Gray, Marcelo Forets, Christian Schilling, Scott Ferson, Luis Benet

Summary: The presented method combines reachability analysis and probability bounds analysis to handle imprecisely known random variables. It can rigorously compute the temporal evolution of p-boxes and provide interval probabilities for formal verification problems. The method does not impose strict constraints on the input probability distribution or p-box and can handle multivariate p-boxes with a consonant approximation method.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)

Article Computer Science, Artificial Intelligence

How to choose a completion method for pairwise comparison matrices with missing entries: An axiomatic result

Laszlo Csato

Summary: This paper studies a special type of incomplete pairwise comparison matrices and proposes a new method to determine the missing elements without violating the ordinal property.

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING (2024)