102 research outputs found

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    Advances and Applications of DSmT for Information Fusion. Collected Works, Volume 5

    Get PDF
    This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered. First Part of this book presents some theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes. Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well

    A representation of cloth states based on a derivative of the Gauss linking integral

    Get PDF
    Robotic manipulation of cloth is a complex task because of the infinite-dimensional shape-state space of textiles, which makes their state estimation very difficult. In this paper we introduce the dGLI Cloth Coordinates, a finite low-dimensional representation of cloth states that allows us to efficiently distinguish a large variety of different folded states, opening the door to efficient learning methods for cloth manipulation planning and control. Our representation is based on a directional derivative of the Gauss Linking Integral and allows us to represent spatial as well as planar folded configurations in a consistent and unified way. The proposed dGLI Cloth Coordinates are shown to be more accurate in the representation of cloth states and significantly more sensitive to changes in grasping affordances than other classic shape distance methods. Finally, we apply our representation to real images of a cloth, showing that with it we can identify the different states using a distance-based classifier.This work was developed under the project CLOTHILDE which has received funding from the European Research Council (ERC) under the EU-Horizon 2020 research and innovation programme (grant agreement No. 741930). M. Alberich-Carramiñana is also with the Barcelona Graduate School of Mathematics (BGSMath) and the Institut de Matemàtiques de la UPC-BarcelonaTech (IMTech), and she and J. Amorós are partially supported by the Spanish State Research Agency AEI/10.13039/501100011033 grant PID2019-103849GB-I00 and by the AGAUR project 2021 SGR 00603 Geometry of Manifolds and Applications, GEOMVAP. J. Borràs is supported by the Spanish State Research Agency MCIN/ AEI /10.13039/501100011033 grant PID2020-118649RB-I00 (CHLOE-GRAPH project).Peer ReviewedPostprint (published version

    Realizability of Free Spaces of Curves

    Full text link
    The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often, the question arises whether a certain pattern in the free space diagram is "realizable", i.e., whether there exists a pair of polygonal chains whose free space diagram corresponds to it. The answer to this question may help in deciding the computational complexity of these distance measures, as well as allowing to design more efficient algorithms for restricted input classes that avoid certain free space patterns. Therefore, we study the inverse problem: Given a potential free space diagram, do there exist curves that generate this diagram? Our problem of interest is closely tied to the classic Distance Geometry problem. We settle the complexity of Distance Geometry in R>2\mathbb{R}^{> 2}, showing R\exists\mathbb{R}-hardness. We use this to show that for curves in R2\mathbb{R}^{\ge 2}, the realizability problem is R\exists\mathbb{R}-complete, both for continuous and for discrete Fr\'echet distance. We prove that the continuous case in R1\mathbb{R}^1 is only weakly NP-hard, and we provide a pseudo-polynomial time algorithm and show that it is fixed-parameter tractable. Interestingly, for the discrete case in R1\mathbb{R}^1, we show that the problem becomes solvable in polynomial time.Comment: 26 pages, 12 figures, 1 table, International Symposium on Algorithms And Computations (ISAAC 2023

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum

    On the determination of human affordances

    Get PDF

    LIPIcs, Volume 274, ESA 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 274, ESA 2023, Complete Volum

    LIPIcs, Volume 258, SoCG 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 258, SoCG 2023, Complete Volum
    corecore