Week 11 - Motion & Tracking Flashcards

(29 cards)

1
Q

What is Tracking in Computer Vision?

A

Tracking involves following a specific object through a video

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are some issues with pixel-level motion tracking solutions?

A
  • They do not make predictions for new locations
  • They do not estimate velocities of objects/targets in the image
  • They do not handle uncertainty of position, or challenges like occluding objects
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are Flow Fields used for?

A

It is used in tracking, and can be used to infer motion, stabilise images, stabilise a device or help with frame interpolation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the two types of approaches for Motion Detection?

A
  • Motion Difference
  • Background Subtraction
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How does Motion Difference work in Motion Detection?

A
  • Take two images from a sequence
  • Compute the change in brightness at each pixel in the image
  • Threshold and filter for noise
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How does Background Subtraction work in Motion Detection?

A
  • Capture an image of the background
  • Use the difference between the current frame and the background to find moving objects
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the best way to take background images for Background Subtraction models in Motion Detection?

A

Take several at different points in time, so that the average of a given pixel’s value over some time period is better

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do you work out the average value for a background pixel in Motion Detection?

A

Averaging often becomes a Gaussian model, where you compute deviation as well as just mean:
- Given a new pixel value and a Gaussian model, you can estimate the pixel value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is an example algorithm that uses confidence to predict the movement of an object in Tracking, and how does it work?

A

Kalman Filter
- Handles certainty of measurements and prediction
- Has a motion model
- Assumes we have a unimodal Gaussian i.e. can only predict one location

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a short description of a Particle Filter?

A

A particle filter uses a set of samples to approximate the target probability density.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How does a Particle Filter work?

A

A Particle Filter treats each sample as a particle, which is a hypothesis with some probability of being correct

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the plain English description of the theory behind a Particle Filter?

A
  • Start with many guesses about where the object could be
  • Predict where each guess thinks the object could be
  • Compare those guesses to what you actually see in the new image i.e. the measurement
  • Update the scores of each guess based on how well they match the real observation
  • Pick new guesses based on the best scores, and repeat
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the basic algorithm for CONDENSATION in Tracking?

A
  • Select a particle
  • Project forward in time
  • Add noise
  • Compute weight from measurement
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What are some features of CONDENSATION in Tracking?

A
  • The hypotheses can have any shape probability distribution
  • The observations are used to update the probabilities of the hypotheses via an appearance model
  • Many hypotheses are considered at once, which increases chances of finding the target
  • Works in substantial clutter at or close to video frame rate
  • Can use different numbers of particles as a trade-off between running very fast and having higher accuracy and greater robustness
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is an Appearance model in CONDENSATION?

A

An appearance model is like a predicted silhouette of what the object will look like. You come up with a measurement which is something like this example: 1 if over a red pixel patch, tends to 0 as you drift from this.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is Contour Tracking?

A

Contour Tracking establishes a state that contains a set of points representing a contour, so each particle represents a possible contour
This state has higher dimensions, which are called the parameters of the contour.
The mean state is usually drawn to summarise results

17
Q

What is a mixed-state CONDENSATION model?

A

It saves multiple transition probabilities of an object switching behaviour, and then builds multiple models using this data into a single CONDENSATION tracker.

18
Q

What is the step-by-step process for a Mixed-State CONDENSATION tracker?

A
  • Select a particle, which includes a gamma(t)
  • Randomly generate gamma(t + 1) in line with the transition probability table
  • Project particle forward with motion model associated with gamma(t + 1)
  • Add noise
  • Compute pi(t)
19
Q

What happens to the particles in a Mixed-State CONDENSATION tracker?

A
  • Mixed-state CONDENSATION produces a mix of particles, depending on the transition probabilities.
  • Different particles contain and follow different motion models
  • Clouds of particles can form
20
Q

What is an issue with using transition tables for transition probability predictions in tracking?

A

It was hard-coded, and as such, is difficult to do and is inflexible

21
Q

How does the number of particles affect the performance of particle filter methods?

A

Lower number:
- Fast, but coarse
- May have unsampled areas

Higher Number:
- Slower
- More potential for representing state space

22
Q

What affects the use of CONDENSATION models/trackers?

A

The Curse of Dimesionality

23
Q

What is MCMC tracking, and what are some key properties?

A

Markov Chain Monte Carlo:
- Allows us to explore the space of possible tracker/location states more efficiently
- Don’t apply the motion model to everything inside the state
- Improve a particle by selecting one target inside it, and moving only that and seeing if its better or worse than before
- Only add improved samples to the new particle set
- Effectively a random walk looking for improved target configurations

24
Q

How does the MCMC tracking work?

A
  • Generate a new set of samples using the ‘Metropolis-Hastings’ algorithm:
    – Propose a new state
    – Evaluate the acceptance ratio
    – If the acceptance ratio is greater than 1, then accept the state and update the target we considered
    – Otherwise, accept it if the random variation is high enough
    – Otherwise, keep the current state and reject the proposed state
25
What are some key features of MCMC tracking?
- More efficient sampling, as only optimising one target per iteration, so good with high-dimensional joint states - Quality of samples produced tends to increase with each iteration - Can produce an estimate by taking an average position across the samples for each target
26
What is coalescence in tracking?
It's the result of when similar targets interact. When they do, there's a chance that their trackers can become 'distracted' and all track a single entity.
27
How do you handle interactions and attempt to offset the problem of coalescence?
You need to lower the weight of samples that predict a position too close to other targets This assumes that targets cannot occupy the same spot on the image
28
What is the mathematical representation of the solution attempting to deal with coalescence?
- Construct a graph of targets close enough to interact - Use an interaction function to penalise predictions close to other targets, such as exponential fall-off based on distance
29
What is the concept of sharing motion information?
It's like mixed-state condensation, but pairs of targets that are moving similarly can use each other's velocity estimates, which helps to recover from occlusion.