Canny-Harris Flashcards
Criteria for a good edge detector
Low error rate
Edge points should be well localized
Only one response to a single edge
Canny edge detector properties
Optimal kernel
Non-maximum suppression
Hysteresis thresholding
Non maximum suppression
Check if pixel is local maximum along gradient direction, select a single max across width of the edge (keep checking if pixels next to current pixel is higher)
Hysteresis thresholding
If the gradient of the pixel is:
High- strong edge pixel
Low- non edge pixel
In between-based in neighbor pixels
Effect of theta on canny
Theta is Gaussian spread size
Large theta detects large scale edges
Small theta detects fine features
Gaussian pyramid
Take original image, shrink and apply Gaussian filter
They are useful because they can help with feature tracking and search over scale. Also search for correspondence (coarse to fine matching)
Interest point detection characteristics
Repeatability
Same interest points
Saliency
Each point is distinctive
Locality
A point occupies a small area of the image
Compactness and efficiency
Need a sufficient amount but fewer than image pixels
Key points are used for
Image alignment 3D reconstruction Motion tracking Robot navigation Indexing and database retrieval
Interpreting Harris corner detection matrix
M = a 0
0 b
If either a or b is close to 0, it is not a corner
If it is a corner they will be large