Object Detection Using Marked Point Process

Slides:



Advertisements
Similar presentations
CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.
Advertisements

Bayesian Estimation in MARK
Maximum Likelihood And Expectation Maximization Lecture Notes for CMPUT 466/551 Nilanjan Ray.
BAYESIAN INFERENCE Sampling techniques
PHD Approach for Multi-target Tracking
MARE 250 Dr. Jason Turner The Normal Distribution.
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
MRF Labeling With Graph Cut CMPUT 615 Nilanjan Ray.
Click on image for full.pdf article Links in article to access datasets.
Today Introduction to MCMC Particle filters and MCMC
Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.
Abstract In this project we expand our previous work entitled "Design of a Robotic Platform and Algorithms for Adaptive Control of Sensing Parameters".
Block Loss Recovery Techniques for Image Communications Jiho Park, D-C Park, Robert J. Marks, M. El-Sharkawi The Computational Intelligence Applications.
6.1 - One Sample One Sample  Mean μ, Variance σ 2, Proportion π Two Samples Two Samples  Means, Variances, Proportions μ 1 vs. μ 2.
CPSC 502, Lecture 15Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 16 Nov, 3, 2011 Slide credit: C. Conati, S.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Collective Buffering: Improving Parallel I/O Performance By Bill Nitzberg and Virginia Lo.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
Markov-Chain Monte Carlo CSE586 Computer Vision II Spring 2010, Penn State Univ.
Tracking Multiple Cells By Correspondence Resolution In A Sequential Bayesian Framework Nilanjan Ray Gang Dong Scott T. Acton C.L. Brown Department of.
1 Tree Crown Extraction Using Marked Point Processes Guillaume Perrin Xavier Descombes – Josiane Zerubia ARIANA, joint research group CNRS/INRIA/UNSA INRIA.
MCMC reconstruction of the 2 HE cascade events Dmitry Chirkin, UW Madison.
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
Lecture #9: Introduction to Markov Chain Monte Carlo, part 3
Spectrum Sensing In Cognitive Radio Networks
Detection, Classification and Tracking in Distributed Sensor Networks D. Li, K. Wong, Y. Hu and A. M. Sayeed Dept. of Electrical & Computer Engineering.
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Silhouette Segmentation in Multiple Views Wonwoo Lee, Woontack Woo, and Edmond Boyer PAMI, VOL. 33, NO. 7, JULY 2011 Donguk Seo
Introduction to Sampling Methods Qi Zhao Oct.27,2004.
Introduction: Metropolis-Hasting Sampler Purpose--To draw samples from a probability distribution There are three steps 1Propose a move from x to y 2Accept.
Markov Random Fields in Vision
Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.
Markov-Chain-Monte-Carlo (MCMC) & The Metropolis-Hastings Algorithm P548: Intro Bayesian Stats with Psych Applications Instructor: John Miyamoto 01/19/2016:
Daphne Koller Sampling Methods Metropolis- Hastings Algorithm Probabilistic Graphical Models Inference.
Overview G. Jogesh Babu. R Programming environment Introduction to R programming language R is an integrated suite of software facilities for data manipulation,
Bayesian Neural Networks
Lesson 8: Basic Monte Carlo integration
MCMC Output & Metropolis-Hastings Algorithm Part I
Introduction to Monte Carlo Method
Marked Point Processes for Crowd Counting
Monte Carlo: A Simple Simulator’s View
CHAPTER 6 Statistical Inference & Hypothesis Testing
Jean Ballet, CEA Saclay GSFC, 31 May 2006 All-sky source search
Ray Tracing via Markov Chain Monte-Carlo Method
Jun Liu Department of Statistics Stanford University
Lesson ANOVA - D Two-Way ANOVA.
Invitation to Computer Science 5th Edition
Remember that our objective is for some density f(y|) for observations where y and  are vectors of data and parameters,  being sampled from a prior.
CAP 5636 – Advanced Artificial Intelligence
Visual Tracking CMPUT 615 Nilanjan Ray.
Predictive distributions
REMOTE SENSING Multispectral Image Classification
REMOTE SENSING Multispectral Image Classification
Marked Point Processes for Crowd Counting
Lecture 7 The Odds/ Log Odds Ratios
Stochastic Hydrology Random Field Simulation
Chapter 14: Analysis of Variance One-way ANOVA Lecture 8
Image Parsing & DDMCMC. Alan Yuille (Dept. Statistics. UCLA)
CAP 5636 – Advanced Artificial Intelligence
CS 188: Artificial Intelligence
Markov Chain Monte Carlo
Pattern Recognition & Machine Learning
CS 188: Artificial Intelligence
If the question asks: “Find the probability if...”
MCMC Inference over Latent Diffeomorphisms
Thanks for taking part in this study
Metropolis Light Transit
Markov Networks.
Stochastic Methods.
Evaluation David Kauchak CS 158 – Fall 2019.
Presentation transcript:

Object Detection Using Marked Point Process CMPUT 615 Nilanjan Ray

Object Detection Often we are asked to detect objects in an image, where the number of objects is not known a priori We may have knowledge about object likelihood, i.e., a good sense of what is a good measurement, what is not We may also have some knowledge about spatial distribution of the objects Can we put together all the pieces of information in a nice computational framework for object detection? Yes! Marked point process framework can be utilized here

Object Detection: Point Process A point process (aka spatial point process) can attach a probability to a configuration of points on a space A point can have its marks. For example, an ellipse center is the point and its marks are the orientation and two radii Thus, a point together with its marks can represent an object that we want to detect from an image

Point Process Prior g1 marks Interaction function: a ~ U(amin, amax), b ~ U(bmin, bmax), θ ~ M(ξ), g1 marks Interaction function: A point consists of a center and its marks (mi)

Simulations From Marked PP Prior Four realizations

Metropolis-Hastings Algorithm Has 3 move types Birth of a new point Death of an existing point Altering marks of an existing point Each such move type is accepted or rejected via a ratio (a dimensionless number) called MH ratio This process simulation is run a long time– until the configuration converges

Detection Result

Road Network Extraction

Building Extraction

Hydrographic Network Extraction

Summary Spatial point process is excellent in modeling object level information Can deal with variable number of objects in an image The downside is long computations: sampling based techniques take a long time