Credal semantics of Bayesian transformations Fabio Cuzzolin, Department of Computing, Oxford Brookes University 6 th INTERNATIONAL SYMPOSIUM ON IMPRECISE.

Slides:



Advertisements
Similar presentations
The geometry of of relative plausibilities
Advertisements

On the credal structure of consistent probabilities Department of Computing School of Technology, Oxford Brookes University 19/6/2008 Fabio Cuzzolin.
We consider situations in which the object is unknown the only way of doing pose estimation is then building a map between image measurements (features)
Simplicial complexes of finite fuzzy sets Fabio Cuzzolin Dipartimento di Elettronica e Informazione – Politecnico di Milano Image and Sound Processing.
Department of Engineering Math, University of Bristol A geometric approach to uncertainty Oxford Brookes Vision Group Oxford Brookes University 12/03/2009.
Geometry of Dempsters rule NAVLAB - Autonomous Navigation and Computer Vision Lab Department of Information Engineering University of Padova, Italy Fabio.
On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October
Dempster-Shafer Theory
Fundamentals of Dempster-Shafer Theory presented by Zbigniew W. Ras University of North Carolina, Charlotte, NC College of Computing and Informatics University.
Advanced Topics in Algorithms and Data Structures Lecture 7.2, page 1 Merging two upper hulls Suppose, UH ( S 2 ) has s points given in an array according.
Recovery of affine and metric properties from images in 2D Projective space Ko Dae-Won.
DETC06: Uncertainty Workshop; Evidence & Possibility Theories Evidence and Possibility Theories in Engineering Design Zissimos P. Mourelatos Mechanical.
Geometric Transformations
Continuous Collision Detection: Progress and Challenges Gino van den Bergen dtecta
An Introduction to Variational Methods for Graphical Models.
09/25/02 Dinesh Manocha, COMP258 Triangular Bezier Patches Natural generalization to Bezier curves Triangles are a simplex: Any polygon can be decomposed.
Dempster-Shafer Theory SIU CS 537 4/12/11 and 4/14/11 Chet Langin.
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Lecture 11 Stereo Reconstruction I Lecture 11 Stereo Reconstruction I Mata kuliah: T Computer Vision Tahun: 2010.
WORKSHOP “Applications of Fuzzy Sets and Fuzzy Logic to Engineering Problems". Pertisau, Tyrol, Austria - September 29th, October 1st, 2002 Aggregation.
Math Primer for CG Ref: Interactive Computer Graphics, Chap. 4, E. Angel.
Geometry CSC 2141 Introduction to Computer Graphics.
Mathematical Foundations Sections A-1 to A-5 Some of the material in these slides may have been adapted from university of Virginia, MIT and Åbo Akademi.
Homogeneous Coordinates (Projective Space) Let be a point in Euclidean space Change to homogeneous coordinates: Defined up to scale: Can go back to non-homogeneous.
Transformations Jehee Lee Seoul National University.
Do Now: Plot the following coordinates in a coordinate plane: HW: Page ,68,69,70.
From Rough Set Theory to Evidence Theory Roman Słowiński Laboratory of Intelligent Decision Support Systems Institute of Computing Science Poznań University.
On joint modelling of random uncertainty and fuzzy imprecision Olgierd Hryniewicz Systems Research Institute Warsaw.
1 Formation et Analyse d’Images Session 7 Daniela Hall 25 November 2004.
Objective: plot points in a coordinate plane
We are learning to write expressions using variables. (8-1)
Computer Graphics, KKU. Lecture 41 The Computer Programming Laws Any given program, when running, is obsolete. Any given program costs more and.
Object association in the TBM framework, application to vehicle driving aid D. Mercier, E. Lefèvre, D. Jolly Univ. Lille Nord de France, F Lille,
Honours Graphics 2008 Session 2. Today’s focus Vectors, matrices and associated math Transformations and concatenation 3D space.
Coordinate Systems and Transformations
Computer Graphics I, Fall 2010 Transformations.
Object Modeling: Curves and Surfaces CEng 477 Introduction to Computer Graphics.
Transformations Szirmay-Kalos László. Transformations Can destroy our equations Limit the transformations and the shapes and require invariance – Line.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
Consistent approximations of belief functions Fabio Cuzzolin, Department of Computing, Oxford Brookes University 6 th INTERNATIONAL SYMPOSIUM ON IMPRECISE.
Objectives Introduce standard transformations Introduce standard transformations Derive homogeneous coordinate transformation matrices Derive homogeneous.
Modeling and Equation Solving
Graphs and Applications of Linear Equations
Spatcial Description & Transformation
Geometric Transformations Hearn & Baker Chapter 5
5 Systems of Linear Equations and Matrices
Image Warping (Geometric Transforms)
Find the Inverse and Graph the Functions
Warm Up Worksheet .
CS Visual Recognition Projective Geometry Projective Geometry is a mathematical framework describing image formation by perspective camera. Under.
Viewing Transformations
Logical architecture refinement
Transformations 3 University of British Columbia
Objectives Graph ordered pairs in the coordinate plane.
Graphing on the Coordinate Plane
1 FUNCTIONS AND MODELS.
An Introduction to Variational Methods for Graphical Models
3D Transformation CS380: Computer Graphics Sung-Eui Yoon (윤성의)
Find the Inverse and Graph the Functions
Orthogonal Base Cartesian Coordinate System Works in general:
Two-view geometry.
Multi-view geometry.
Objectives Graph ordered pairs in the coordinate plane.
Graphing on the Coordinate Plane
TWO DIMENSIONAL TRANSFORMATION
One-to-one Correspondence
Graphing on a Coordinate plane
Linear Constrained Optimization
Presentation transcript:

Credal semantics of Bayesian transformations Fabio Cuzzolin, Department of Computing, Oxford Brookes University 6 th INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES AND THEIR APPLICATIONS, ISIPTA’09 University of Durham, UK, July Epistemic transformations Probability transformation Credal interpretation of BetP Lower, upper, interval constraints TBM-like frameworks? A unified description the relation between belief functions and probabilities is the relation between belief functions and probabilities is well studied in the ToE well studied in the ToE different goals: efficient combination, decision making different goals: efficient combination, decision making central in Transferable Belief Model: central in Transferable Belief Model: credal representation of evidence credal representation of evidence pignistic probability transform pignistic probability transform some probability transformations seek commutativity with respect some probability transformations seek commutativity with respect to important operators to important operators affine family: transformations which commute with affine affine family: transformations which commute with affine combination in the Cartesian space combination in the Cartesian space epistemic family: transfs commuting with aggregation operators epistemic family: transfs commuting with aggregation operators (Dempster's rule) (Dempster's rule) Their credal representation belief functions have a credal interpretation, as they belief functions have a credal interpretation, as they determine a convex set of (consistent) probability measures determine a convex set of (consistent) probability measures pignistic transform: maps a belief function pignistic transform: maps a belief function to the center of mass of this credal set to the center of mass of this credal set epistemic transformations are in fact transformations of epistemic transformations are in fact transformations of lower, upper, or interval probability systems respectively lower, upper, or interval probability systems respectively lower probability  b lower probability  b upper probability  pl upper probability  pl interval probability  p[b  interval probability  p[b  do they possess a credal interpretation? do they possess a credal interpretation? what about their transformations? what about their transformations?   the lower prob constraint determines a lower simplex T 1 [b] in the lower prob constraint determines a lower simplex T 1 [b] in the simplex of all prob measures the simplex of all prob measures the upper prob constraint determines an upper simplex T n-1 [b] the upper prob constraint determines an upper simplex T n-1 [b] the interval prob system determines the intersection of lower the interval prob system determines the intersection of lower and upper simplices and upper simplices this is in general different from the polytope of probs consistent this is in general different from the polytope of probs consistent with a BF b with a BF b the relative belief transform lies at the intersection of the lines the relative belief transform lies at the intersection of the lines joining corresponding vertices of P and T 1 [b] joining corresponding vertices of P and T 1 [b] the relative plausibility transform lies at the intersection of the the relative plausibility transform lies at the intersection of the lines joining corresponding vertices of P and T n-1 [b] lines joining corresponding vertices of P and T n-1 [b] the intersection probability lies at the intersection of the lines the intersection probability lies at the intersection of the lines joining corresponding vertices of T 1 [b] and T n-1 [b] joining corresponding vertices of T 1 [b] and T n-1 [b] upper, lower, and interval probability systems are all associated upper, lower, and interval probability systems are all associated with pairs of simplices with pairs of simplices the corresponding probability transformations have a similar the corresponding probability transformations have a similar behavior in the probability simplex  focus of a pair of simplices behavior in the probability simplex  focus of a pair of simplices focus: point of the Cartesian plane with the same affine focus: point of the Cartesian plane with the same affine coordinates in the two simplices coordinates in the two simplices t2t2 t1t1 t3t3 s1s1 s2s2 s3s3 T S relative belief = focus of lower simplex and P relative belief = focus of lower simplex and P its affine coordinate is the inverse of the total mass of its affine coordinate is the inverse of the total mass of singletons singletons relative plausibility = focus of upper simplex and P relative plausibility = focus of upper simplex and P its affine coordinate is the inverse of the total plausibility its affine coordinate is the inverse of the total plausibility of singletons of singletons intersection probability = focus of lower and upper simplices intersection probability = focus of lower and upper simplices its affine coordinate is the relative width of the associate its affine coordinate is the relative width of the associate probability interval probability interval pignistic transform is based on a rationality principle AND has a strong pignistic transform is based on a rationality principle AND has a strong credal interpretation credal interpretation same can be said for the epistemic transforms same can be said for the epistemic transforms rationale: the transform has to behave homogeneously rationale: the transform has to behave homogeneously in the two sets of constraints in the two sets of constraints formulation of TBM-like frameworks for lower, upper, or interval formulation of TBM-like frameworks for lower, upper, or interval probability constraints? probability constraints? relative plausibility of singletons relative belief of singletons relative belief of singletons intersection probability intersection probability Epistemic transforms as foci B P b p[b] f(S,T)