On the credal structure of consistent probabilities Department of Computing School of Technology, Oxford Brookes University 19/6/2008 Fabio Cuzzolin.

Slides:



Advertisements
Similar presentations
Pretty-Good Tomography Scott Aaronson MIT. Theres a problem… To do tomography on an entangled state of n qubits, we need exp(n) measurements Does this.
Advertisements

Applications of one-class classification
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.
Lectureship Early Career Fellowship School of Technology, Oxford Brookes University 19/6/2008 Fabio Cuzzolin INRIA Rhone-Alpes.
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.
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.
Machine Learning for Vision-Based Motion Analysis Learning pullback metrics for linear models Oxford Brookes Vision Group Oxford Brookes University 17/10/2008.
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.
On the properties of relative plausibilities Computer Science Department UCLA Fabio Cuzzolin SMC05, Hawaii, October
Lectureship A proposal for advancing computer graphics, imaging and multimedia design at RGU Robert Gordon University Aberdeen, 20/6/2008 Fabio Cuzzolin.
FEATURE PERFORMANCE COMPARISON FEATURE PERFORMANCE COMPARISON y SC is a training set of k-dimensional observations with labels S and C b C is a parameter.
Gossets student-t model What happens to quantitative samples when n is small?
Modelling uncertainty in 3APL Johan Kwisthout Master Thesis
CSE 473/573 Computer Vision and Image Processing (CVIP) Ifeoma Nwogu Lecture 27 – Overview of probability concepts 1.
DETC06: Uncertainty Workshop; Evidence & Possibility Theories Evidence and Possibility Theories in Engineering Design Zissimos P. Mourelatos Mechanical.
Chapter 6 The Structural Risk Minimization Principle Junping Zhang Intelligent Information Processing Laboratory, Fudan University.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/4/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2005 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/25/05.
An Algorithm for Polytope Decomposition and Exact Computation of Multiple Integrals.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/3/02.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Review Lecture Tuesday, 12/10/02.
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
Linear Solution to Scale and Rotation Invariant Object Matching Professor: 王聖智 教授 Student : 周 節.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2004 Lecture 1 (Part 1) Introduction/Overview Wednesday, 9/8/04.
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Tracking We are given a contour   with coordinates   ={x 1, x 2, …, x N } at the initial frame.
Slide 1 Statistics Workshop Tutorial 4 Probability Probability Distributions.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/29/02.
Computer Simulation A Laboratory to Evaluate “What-if” Questions.
Machine Learning Queens College Lecture 3: Probability and Statistics.
PROBABILITY & STATISTICAL INFERENCE LECTURE 3 MSc in Computing (Data Analytics)
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
Probability, contd. Learning Objectives By the end of this lecture, you should be able to: – Describe the difference between discrete random variables.
3-2 Random Variables In an experiment, a measurement is usually denoted by a variable such as X. In a random experiment, a variable whose measured.
1 Robot Environment Interaction Environment perception provides information about the environment’s state, and it tends to increase the robot’s knowledge.
A Generalization of PCA to the Exponential Family Collins, Dasgupta and Schapire Presented by Guy Lebanon.
On joint modelling of random uncertainty and fuzzy imprecision Olgierd Hryniewicz Systems Research Institute Warsaw.
Lecture V Probability theory. Lecture questions Classical definition of probability Frequency probability Discrete variable and probability distribution.
4 Proposed Research Projects SmartHome – Encouraging patients with mild cognitive disabilities to use digital memory notebook for activities of daily living.
Exam 2: Rules Section 2.1 Bring a cheat sheet. One page 2 sides. Bring a calculator. Bring your book to use the tables in the back.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
Tracking with dynamics
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Review Lecture Tuesday, 12/11/01.
Linear Solution to Scale and Rotation Invariant Object Matching Hao Jiang and Stella X. Yu Computer Science Department Boston College.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
CS274 Spring 01 Lecture 8 Copyright © Mark Meyer Lecture VIII Deformable Bodies CS274: Computer Animation and Simulation.
Final Exam Information These slides and more detailed information will be posted on the webpage later…
Over the recent years, computer vision has started to play a significant role in the Human Computer Interaction (HCI). With efficient object tracking.
Chapter 1: Outcomes, Events, and Sample Spaces men 1.
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.
Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08
Math a - Sample Space - Events - Definition of Probabilities
Random variables (r.v.) Random variable
Sampling distribution
Modeling with Alternative Arithmetic
Machine Learning Basics
Econometric Models The most basic econometric model consists of a relationship between two variables which is disturbed by a random error. We need to use.
Neutrosophic Mathematical Morphology for Medical Image
Neutrosophic approach for mathematical morphology.
Statistics for Business and Economics (13e)
Mechanical Engineering Department
Experiments, Outcomes, Events and Random Variables: A Revisit
Continuous Random Variables: Basics
Presentation transcript:

On the credal structure of consistent probabilities Department of Computing School of Technology, Oxford Brookes University 19/6/2008 Fabio Cuzzolin

Background Masters thesis on gesture recognition at the University of Padova Visiting student, ESSRL, Washington University in St. Louis, and at the University of California at Los Angeles Ph.D. thesis on random sets and uncertainty theory Researcher at Politecnico di Milano with the Image and Sound Processing group Post-doc at the University of California at Los Angeles, UCLA Vision Lab Marie Curie fellow at INRIA Rhone-Alpes Lecturer, Oxford Brookes University

My background research Discrete math linear independence on lattices and matroids Uncertainty theory geometric approach algebraic analysis generalized total probability Machine learning Manifold learning for dynamical models Computer vision gesture and action recognition 3D shape analysis and matching Gait ID pose estimation

assumption: not enough evidence to determine the actual probability describing the problem second-order distributions (Dirichlet), interval probabilities credal sets Uncertainty measures: Intervals, credal sets Belief functions [Shafer 76]: special case of credal sets a number of formalisms have been proposed to extend or replace classical probability

Belief functions as random sets if m is a mass function s.t. A B belief function b:2 s.t. probabilities are additive: if A B= then p(A B)=p(A)+p(B) probability on a finite set: function p: 2 Θ -> [0,1] with p(A)= x m(x), where m: Θ -> [0,1] is a mass function

Examples of belief functions Some example of belief functions Finite domain of size 4 b 2 ({a 1, a 3 })=0; b 1 ({a 1, a 3 })=m 1 ({a 1 }); b 2 ({a 2,a 3,a 4 })=m 2 ({a 2,a 3,a 4 }); b 1 ({a 2,a 3,a 4 })=0. b 1 : m({a 1 })=0.7, m({a 1, a 2 })=0.3 a1a1 a2a2 a3a3 a4a4 b 2 : m( )=0.1, m({a 2, a 3, a 4 })=0.9

it has the shape of a simplex IEEE Tr. SMC-C '08, Ann. Combinatorics '06, FSS '06, IS '06, IJUFKS'06 Geometric approach to uncertainty belief functions can be seen as points of a Cartesian space of dimension 2 n -2 belief space: the space of all the belief functions on a given frame Each subset is a coordinate in this space

how to transform a measure of a certain family into a different uncertainty measure can be done geometrically Approximation problem Probabilities, fuzzy sets, possibilities are special cases of b.f.s

Belief functions as credal sets consistent probabilities: the probabilities that can be obtained from b by redistributing the mass of each event for each event A with mass m(A) we assign a fraction x m(A) to each x A turns out to be the probabilities which dominates b

Binary example Belief functions on a domain of size 2 are points of R 2 credal set of probabilities consistent with b

Example of probability distributions consistent with a belief function Half of {x,y} to x, half to y All of {y,z} to y

Classical result the credal set of consistent probs is known to have a quite complex structure it is a polytope, the convex closure of a number of points (distributions) what are those distributions?? if E i ={x 1,...,x m } i=1..n are the focal elements of b, the extremal probs are:

Ternary example graphical illustration, domain of size 3

Our result the vertices of the credal set of consistent probabilities are associated with permutations of the elements {x 1,...,x n } of the domain consider all possible permutations (x (1),...,x (n) ) the actual vertices of the polytope of consistent probs are: to each element x (i) it assigns the mass of all events A containing it but not its predecessors in the permutation

Example again consider a ternary frame {x,y,z} and a belief function with mass: m(x)=0.2, m(y)=0.1, m(z)=0.3, m(x,y)=0.1, m(y,z)=0.2, m(x,y,z)=0.1

Conclusions Belief functions as polytopes of probabilities Not all such polytopes (credal sets) are belief functions For b.f.s: vertices are each associated with a permutation of the elements