On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October 10-12 2005.

Slides:



Advertisements
Similar presentations
Chapter 2 Functions and Graphs.
Advertisements

A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols Sumit Gulwani George Necula EECS Department University of California,
Global Value Numbering using Random Interpretation Sumit Gulwani George C. Necula CS Department University of California, Berkeley.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Slide 1 of 18 Uncertainty Representation and Reasoning with MEBN/PR-OWL Kathryn Blackmond Laskey Paulo C. G. da Costa The Volgenau School of Information.
Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Chapters 1 & 2 Theorem & Postulate Review Answers
Addition using three addends. An associative property is when you group numbers in anyway and the answer stays the same.
0 - 0.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
Addition Facts
CS4026 Formal Models of Computation Running Haskell Programs – power.
The geometry of of relative plausibilities
01/18 Lab meeting Fabio Cuzzolin
On the relationship between the notions of independence in matroids, lattices, and Boolean algebras Fabio Cuzzolin INRIA Rhone-Alpes, Grenoble, France.
On the credal structure of consistent probabilities Department of Computing School of Technology, Oxford Brookes University 19/6/2008 Fabio Cuzzolin.
Machine learning and imprecise probabilities for computer vision
Learning Riemannian metrics for motion classification Fabio Cuzzolin INRIA Rhone-Alpes Computational Imaging Group, Pompeu Fabra University, Barcellona.
IEEE CDC Nassau, Bahamas, December Integration of shape constraints in data association filters Integration of shape constraints in data.
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.
Evidential modeling for pose estimation Fabio Cuzzolin, Ruggero Frezza Computer Science Department UCLA.
Geometry of Dempsters rule NAVLAB - Autonomous Navigation and Computer Vision Lab Department of Information Engineering University of Padova, Italy Fabio.
5-1 Chapter 5 Theory & Problems of Probability & Statistics Murray R. Spiegel Sampling Theory.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Joint work with Andre Lieutier Dassault Systemes Domain Theory and Differential Calculus Abbas Edalat Imperial College Oxford.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
The x- and y-Intercepts
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Limits (Algebraic) Calculus Fall, What can we do with limits?
Modelling uncertainty in 3APL Johan Kwisthout Master Thesis
6.4 Best Approximation; Least Squares
Addition 1’s to 20.
Test B, 100 Subtraction Facts
A Theory For Multiresolution Signal Decomposition: The Wavelet Representation Stephane Mallat, IEEE Transactions on Pattern Analysis and Machine Intelligence,
Week 1.
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
Dantzig-Wolfe Decomposition
Finite Projective Planes
TEL-AVIV UNIVERSITY FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric Average of Two Simple Polygons.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
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.
DETC06: Uncertainty Workshop; Evidence & Possibility Theories Evidence and Possibility Theories in Engineering Design Zissimos P. Mourelatos Mechanical.
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
A Bayesian algorithm for tracking multiple moving objects in outdoor surveillance video Department of Electrical Engineering and Computer Science The University.
1 Angel: Interactive Computer Graphics 4E © Addison-Wesley 2005 Geometry Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and.
Fabio Cuzzolin Now Marie-Curie fellow with the Perception project INRIA Rhone-Alpes Concour chargés de recherche de 1 ère classe, INRIA Rennes, May
6 6.3 © 2012 Pearson Education, Inc. Orthogonality and Least Squares ORTHOGONAL PROJECTIONS.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
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.
AN ORTHOGONAL PROJECTION
Multi-linear Systems and Invariant Theory in the Context of Computer Vision and Graphics CS329 Amnon Shashua.
Multi-linear Systems and Invariant Theory
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Elementary Linear Algebra Howard Anton Copyright © 2014 by John Wiley & Sons, Inc. All rights reserved. Chapter 3.
Credal semantics of Bayesian transformations Fabio Cuzzolin, Department of Computing, Oxford Brookes University 6 th INTERNATIONAL SYMPOSIUM ON IMPRECISE.
Consistent approximations of belief functions Fabio Cuzzolin, Department of Computing, Oxford Brookes University 6 th INTERNATIONAL SYMPOSIUM ON IMPRECISE.
Unit-4 Geometric Objects and Transformations- I
RECORD. RECORD Subspaces of Vector Spaces: Check to see if there are any properties inherited from V:
Introduction to Computer Graphics with WebGL
Linear Algebra Lecture 40.
Mechanical Engineering Department
Presentation transcript:

On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October

2 1 today well be… …introducing our research 3 …presenting the paper 2 …the geometric approach to the ToE...

…the author PhD student, University of Padova, Italy, Department of Information Engineering (NAVLAB laboratory) Visiting student, Washington University in St. Louis Post-doc in Padova, Control and Systems Theory group Research assistant, Image and Sound Processing Group (ISPG), Politecnico di Milano, Italy Post-doc, Vision Lab, UCLA, Los Angeles

4 … the research research Computer vision object and body tracking data association gesture and action recognition Discrete mathematics linear independence on lattices Belief functions and imprecise probabilities geometric approach algebraic analysis total belief problem

2 Geometry of belief functions

6 A Belief functions B2B2 B1B1 belief functions are the natural generalization of finite probabilities Probabilities assign a number (mass) between 0 and 1 to elements of a set consider instead a function m assigning masses to the subsets of this induces a belief function, i.e. the total probability function:

7 Belief space Belief functions can be seen as points of an Euclidean space each subset A A-th coordinate s(A) in an Euclidean space vertices: b.f. assigning 1 to a single set A the space of all the belief functions on a given set has the form of a simplex (submitted to SMC-C, 2005)

8 Geometry of Dempsters rule two belief functions can be combined using Dempsters rule Dempsters sum as intersection of linear spaces conditional subspace foci of a conditional subspace (IEEE Trans. SMC-B 2004) s s t t

9 Duality principle belief functions basic probability assignment convex geometry of belief space plausibilities basic plausibility assignment convex geometry of plausibility space

10 Plausibility space plausibility function associated with s the space of plausibility functions is also a simplex

3 Relative plausibility and the approximation problem

12 Approximation problem Probabilistic approximation: finding the probability p which is the closest to a given belief function s Not unique: choice of a criterion Several proposals: pignistic function, orthogonal projection, relative plausibility of singletons

13 Probabilistic approximations Geometry of the probabilistic region Several probability functions related to a given belief function s (submitted to SMC-B 2005)

14 relative plausibility of singletons it is a probability, i.e. it sums to 1 Relative plausibility using the plausibility function one can build a probability by computing the plausibility of singletons Fundamental property: the relative plausibility perfectly represents s when combined with another probability using Dempsters rule

15 Dempster-based criterion the theory of evidence has two pillars: representing evidence as belief functions, and fusing evidence using Dempsters rule of combination Any approximation criterion must encompass both Dempster-based approximation: finding the probability which behaves as the original b.f. when combined using Dempsters rule

16 Towards a formal proof Conjecture: the relative plausibility function is the solution of the Dempster – based approximation problem This can be proved through geometrical methods All the b.f. on the line s P s * are perfect representatives

Conclusions Belief functions as representation of uncertain evidence Geometric approach to the ToE Probabilistic approximation problem Relative plausibility of singletons Relative plausibility as solution of the approximation problem