1 / 26

Probability

Probability. Course web page: vision.cis.udel.edu/cv. March 19, 2003  Lecture 15. Announcements . Read Forsyth & Ponce, Chapter 1.2, 1.4, 7.4 on cameras, sampling for Friday. Outline. Random variables Discrete Continuous Joint, conditional probability Probabilistic inference.

wilbur
Télécharger la présentation

Probability

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Probability Course web page: vision.cis.udel.edu/cv March 19, 2003  Lecture 15

  2. Announcements • Read Forsyth & Ponce, Chapter 1.2, 1.4, 7.4 on cameras, sampling for Friday

  3. Outline • Random variables • Discrete • Continuous • Joint, conditional probability • Probabilistic inference

  4. Discrete Random Variables • A discrete random variableX has a domain of values fx1, …, xng that it can assume, each with a particular probability in the range [0, 1] • For example, let X=Weather. Then the domain might be fsun, rain, clouds , snowg • Use A,B to denote boolean random variables whose domain is ftrue, falseg

  5. Discrete Probability • P (X = xi)is the probability thatXhas the valuexi • Can use P (xi) where random variable is clear • Boolean variables: P (A)´P (A = true) and P (:A)´P (A = false) • The probability distributionP(X) is the vector of probabilities over X‘s domain: P(X) = (P(X = x1) , …, P(X = xn))

  6. Meaning of Probability • Probability can be interpreted as • The strength of our belief or certainty that a random variable has a particular value in the absence of evidence (sometimes called prior probability) • The frequency with which the random variable will have that value if it is repeatedly measured • Because a random variable must take one of the values in its domain, probability distributions sum to 1: §iP (X = xi) = 1

  7. P (Weather = sun) Example: Distribution on Weather • So for our example, we might have… • The probabilities for the individual values: • P (sun) = 0.7 • P (rain) = 0.2 • P (clouds) = 0.08 • P (snow) = 0.02 • The probability distribution P (Weather) = (0.7, 0.2, 0.08, 0.02)

  8. Joint Probability • Joint Probability:The probability that multiple events occur: P(X= x,Y= y) or P(x,y) • E.g.:P (Weather=sun , Temperature=warm ) • We can thus define the joint probability distributionP(X,Y) • This is an M 1£...£Mn table for n random variables with Mi values in their domains • Table entries sum to 1

  9. Example: Joint Probability DistributionP (Weather , Temperature ) Temperature Weather

  10. Continuous Random Variables • When the variable X has a continuous domain of possible values [xlow, xhigh], it doesn’t make sense to talk about the probability of a particular value. • Instead, we define a probability density function (PDF) p(x) such that

  11. Probability Density Function: Properties • p(x) is non-negative. By analogy with discrete probability distributions: • For n-dimensional joint distributions, the PDF is a surface evaluated over vectors p(x) • Most definitions are analogous to discrete versions—just substitute integration for summation

  12. Example: the Normal Distribution • Here the PDF is defined by an n-D Gaussian function: Representations of joint PDF for 2-D Gaussians with random variables X, Y Y X

  13. Histograms • Definition: Count of instances per bin • Example: Random variable brightness is really continuous, but discretized to [0, 255] courtesy of MathWorks Original image Brightness histogram

  14. Histograms as PDF Representations • Dividing every bin count by the total count captures frequency of occurrence in that range • E.g., P(brightness2[x, x + dx])

  15. Marginalization • Summing a discrete joint distribution over all possible values of one random variable effectively removes that variable • For a two-variable joint distribution, this means summing all rows or all columns

  16. 0.7 0.2 0.08 0.02 0.581 0.419 P (Temperature) Example: Marginalization ofP (Weather , Temperature ) Temperature Weather P (Weather)

  17. remember that these are different distributions Conditional Probability • The conditional probabilityP(X = xjY = y) quantifies the change in our beliefs given knowledge of some other event. This “after the evidence” probability is sometimes called the posterior probability onX, and it is defined with the product rule: P (X= x, Y= y)=P (X= xjY= y)P (Y= y) • In terms of joint probability distributions, this is: P (X, Y)=P (XjY)P (Y) • Independence: P(X,Y)=P(X)P(Y), which implies thatP (XjY)=P (X)

  18. warm cold Example: Conditional Probability DistributionP (Temperature jWeather) • Divide joint distribution by marginal • E.g., P (warmjsun)=P (sun, warm)/P (sun) • Recall P (Temperature) = (0.581, 0.419) Temperature Weather

  19. Conditioning • By the relationship of conditional probability to joint probability P(Y ,X)=P(YjX)P(X) we can write marginalization a different way:

  20. prior on X likelihood posterior on X evidence Bayes’ Rule • EquatingP(X,Y) and P(Y,X) and applying the definition of conditional probability, we have: P(XjY)P(Y)=P(YjX)P(X) and so

  21. Bayes’ Rule • By conditioning, the evidence P(Y) is just a normalizing factor that ensures that the posterior sums to 1: • Thus, only the likelihood and prior matter:

  22. Bayes’ Rule for Inference • SupposeX represents possible hypotheses about some aspect of the world (e.g., the weather today), and Y represents some relevant data we have measured (e.g., thermometer temperature). Inference is the process of reasoning about how likely different values of X are conditioned on Y • Bayes’ rule can be a useful inference tool when there is an imbalance in our knowledge or it is difficult to quantify hypothesis probabilities directly • Inferring hypothesis values is often called parameter estimation

  23. Maximum a posteriori (MAP): Inference • Choose a parameter value xMAP for the hypothesis X that maximizes the probability of the observed data Y=y • For discrete distributions, this means calculating the posterior probability P(Xjy) for all different values of X • For continuous distributions, we may be able to employ differential techniques such as looking for values where the derivative of the posterior is 0

  24. Maximum Likelihood (ML) Inference • MAP with a uniform prior (either we don’t know it or believe it to be unimportant):

  25. Example: Estimating the Temperature • Suppose we want to know what the weather will be like on the basis of a thermometer reading • Say we don’t have direct knowledge of P (WeatherjTemperature), but the thermometer reading indicates a chill, and we do know something about P (Temperature jWeather)

  26. Example: Temperature Estimation • MAP: From logging past occurrences, we think P (Weather) = (0.7, 0.2, 0.08, 0.02). • This leads us to infer that it is sunny, but not by much over rainy • ML: Ignoring the weather prior, snow is most likely • How much better our estimate is than the other possibilities says something about how good it is—we would be much more certain of sunniness for a warm thermometer reading

More Related