COSC428 Exam 2025

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/174

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 9:32 PM on 5/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

175 Terms

1
New cards

What is a sensory gap?

Between the object in the world and the information in the computational description derived from a recording of that scene

2
New cards

What is a semantic gap?

Lack of coincidence between the information that one can extract from the visual data and the interpretation that the same data can have for a user in the given situation

3
New cards

How do you recover 3D information?

Motion, stereo, texture, shading, contour, time of flight

4
New cards

What are the 4 stages of CV processing?

Simulate human image processing, pre processing, early processing, late processing.

5
New cards

What are 4 examples of low level image processing

Image compression, Noise reduction, edge detection

segmentation

6
New cards

What is spectral resolution?

the ability of a sensor to define fine wavelength intervals

7
New cards

Human eye - spectral resolution

400 (violet) - 700mm (red)

8
New cards

What is dynamic range (eye)

Difference between the lowest perceptible light intensity and the highest intensity we can tolerate without glare.

9
New cards

Human eye - dynamic range

10^8 : 1

10
New cards

What is spatial resolution?

The ability to distinguish two separate objects close together

11
New cards

Human eye - spatial resolution

1-3cm @ 20m

12
New cards

What is radiometric resolution?

The ability to describe very small energy changes

13
New cards

Human eye - radiometric resolution

16-32 shades b&w 100 colours

14
New cards

What does the eye work?

Light enters eye, focused by cornea and lens and strikes the retina at the back of the eye. 2 cells that are stimulated: rods and cones

15
New cards

What are cones?

Provide vision in bright light, color vision, sharp images. Closely packed. Shorter and thicker

16
New cards

What are rods?

retinal receptors that detect black, white, and gray; necessary for peripheral and twilight vision, when cones don't respond. 100 megapixel camera. Scotopic - most active in the short wavelength

17
New cards

How many cones are in the human eye?

6.5 million

18
New cards

How many rods are in the human eye?

100 million

19
New cards

What is the distribution of rods and cones in the retina?

They are not evenly distributed.

20
New cards

Where is the density of cones greatest in the eye?

At the fovea

21
New cards

What is the fovea known for?

It is the region of sharpest vision.

22
New cards

Why is there a blindspot in the eye?

No receptors because this is where the ganglion cells leave the eye to form the optic nerve.

23
New cards

Why specify colour numerically?

Representation is commercially valuable

24
New cards

CIE colour space

A standardised colour space where any colour can be represented as (xy) coordinates.

25
New cards

What's wrong with CIE?

Doesn't describe the way light interacts in reality. Instead it is simple in the way that it models how the human eye perceives.

26
New cards

What is HSV?

hue, saturation, value.

27
New cards

Why use lenses?

To collect more light

28
New cards

Pinhole camera

Perfect in focus image with lenses.

0.35MM is the sweet spot

29
New cards

Vignetting

Light at different wave lengths. Follows different paths, some wavelengths are defocused.

30
New cards

Pros of multi-plane calibration (Checkerboard)

Only requires a plane. Dont have to know positions/orientations

31
New cards

What does adding a lens do?

Focus light onto the film

32
New cards

Depth of field

Changing aperture size affects it.

33
New cards

Focal length

Adjusts the zoom

34
New cards

Exposure time

How long an image is exposed

35
New cards

ISO

sensitive of the "film". Proportional to noise.

36
New cards

How is distortion of an image caused?

Imperfect lenses

37
New cards

What is image filtering?

Modify the pixels in an image based on some function of the local neighbourhood of the pixels.

38
New cards

Linear functions (filters)

Replace each pixel by a linear combinations of it's neighbours.

39
New cards

What is a convolution kernal?

The prescription for the linear comb. (linear function filter)

40
New cards

What is a box filter?

Averaging filter, blurring filter

41
New cards

What does a box filter do?

Replaces each pixel with an average of its neighborhood

42
New cards

What does a box filter achieve?

Smoothing effect (remove sharp features)

43
New cards

What happens when the pixel offsets is positive?

Shifts image to the left

44
New cards

What happens when the middle left value is 1 in a box filter?

Shifts image left by 1 pixel

45
New cards

What happens when pixel offsets are evenly distributed?

Blur

46
New cards

Implication of smoothing and noise

Implies that smoothing suppresses noise, for appropriate noise models.

47
New cards

What would 2 offset - 0.33 (3 total bars) achieve?

Sharping. We took away information but it made it better for humans.

48
New cards

What are edge points?

Points of sharp change in an image

49
New cards

Edge detection

Convert a 2D image into a set of curves

50
New cards

What causes edges?

Surface normal discontinuity, Depth surface colour, illumination

51
New cards

How can you tell that a pixel is on an edge?

Change to black and white

52
New cards

What is an edge?

Where change occurs

53
New cards

Sobel filter

Used in image processing/computer vision.

Creates and image that emphasises edges.

54
New cards

Image gradiant

Points in the direction of rapid change in intensity

Can be used for edge strength

55
New cards

How can we differentiate a digital image

Reconstruct a continuous image, then take grad

Take discrete derivative (finite difference)

56
New cards

Optimal edge detection - Canny

Assume: Linear filtering

Additive Gaussian nose

57
New cards

What should a good edge detector have

Good detection: filter for edge not noise

Good localisation: detected edge near true edge

Single response: one per edge

58
New cards

Detection/localisation trade off

More smoothing improve detections

And hurts localization

59
New cards

Non-maxiumum suppression

Check if pixel is local maximum along grad direction

60
New cards

Predicating the next edge point

Marked point is edge point. Create tangent to the edge curve (Norm) use this to predict next points.

61
New cards

Hysteresis

Check that maximum value of grad value is large.

62
New cards

Choice of sigma in guassian kernal size

Large to detect large scale edges

Small to detect fine features

63
New cards

Finding lines in images

Search for the line at every possible position/orientation

Use voting scheme: Hough transform

64
New cards

How to do Hough transform

Connection between image (x, y) and Hough (m, b) spaces

Line in image to point in Hough space

65
New cards

Finding Corners Intuition

Right at corner, grad is ill defined

Near corner, grad has two different values

66
New cards

How to detect corners

Filter image, compute magnitude, construct C in a window, find eigen values, if both are large means corner

67
New cards

Whats a good feature?

Satisfies brightness constancy, has sufficient texture variation, does not have too much texture variation, corresponds to a "real" surface patch, does not deform too much over time.

68
New cards

Feature distortion

Feature may change shape over time, need a distortion model to really make this work???

69
New cards

Harris detector

A corner detection algorithm. It IDs corners by doing local neighbourhood of each pixel. Used for feature detection.

70
New cards

What is Harris detector invariant to?

Rotation and illumination changes

71
New cards

Advantages of invariant local features

Locality

Distinctiveness

Quantity

Efficiency

Extensibility

72
New cards

SIFT vector formation

Thresholded images are sampled over 16x16 in scale space

Create array of orientation of histograms (For image gradients)

8 orientations x 4x4 histogram array = 128 diamensions

73
New cards

Erosion

Shrinks an object

74
New cards

Dilation

Expands an object

75
New cards

Open

Erosion then dilation

76
New cards

Close

Dilation then erosion

77
New cards

What does opening do?

Smoothes regions

78
New cards

What doe closing do?

Fills gaps

79
New cards

Greyscale erode?

Output at a point is minimum of image pixel and structuring element pixel

80
New cards

Greyscale Dilate

Output is maximum of image and structuring element

81
New cards

Skeleton

Reduces regions of binary image to lines one pixel thick

82
New cards

What does skeleton preserve

Shape, continuity

83
New cards

Thinning algorithm

Repeatedly thin image

Retain end points and connections

84
New cards

Distance Transform algorithm

Skeleton lies along discontinuities

Sort of local maxima or ridges

85
New cards

Application of Thinning and distance transform

Shape representation, maintaining topology

Character recognition

86
New cards

Tracking applications

Motion capture, recognition from motion, surveillance, targeting

87
New cards

Tracking and recursive estimation

Need a real-time efficient algorithm. The task is at each time point, recompute estimate of position

88
New cards

recursive estimation

Estimate position of a tracked object at each time from all previous data.

89
New cards

What is the first main issue in tracking?

Prediction: determining what set of measurements predict for the ith frame and finding p(x|y).

90
New cards

What is the second main issue in tracking?

Data association: using p(x|y) to identify measurements that tell us about the object's state.

91
New cards

What is the third main issue in tracking?

Correction: computing p(x|y) after obtaining yi.

92
New cards

How do we simplify tracking assumptions

Only the immediate past matter, measurements depend only on the current state

93
New cards

Kalman filter

the best estimate of the current position can be obtained by predicting the position using the initial position and the time that has passed and combining this estimate with the noisy measurements of the sensors

94
New cards

Prediction for 1D Kalman filter

Old state * constant + noise

95
New cards

Kalman filter smoothing

We don't have the best estimate of state - what abou the future?

Run two filters, one forward and back in time. Combine these estimates

96
New cards

n-D Kalman filter

Multiple estimate at prior time with forward model and propagate covariance through model and add new noise

97
New cards

Particle filter

Predict multiple positions, multi-model and non-gaussian

98
New cards

Particle filter - specification

Prior density, p(xt-1), Process density p(xt | xt-1), observation density p(zt-1 | xt-1)

99
New cards

Particle filter - Prior density

Joint angles in prev frame

100
New cards

Particle filter - Process density

Kinematic and body models