All bites
The whole library, newest first. Filter by what you are here for, or pick a topic if you already know.
4330 bites
Page 83
How does filter separability optimize Gaussian blur and its complexity?
This tests if you know a 2D Gaussian separates into two 1D convolutions. A strong answer gives complexity as O(N^2 K^2) dropping to O(N^2 K) for an N-by-N image and K-by-K kernel. A red flag is claiming all kernels are separable or omitting dimensions.
Walk me through Canny edge detection and why it beats Sobel thresholding
Tests multi-scale edge detection and noise robustness versus raw gradient thresholding. Strong answer lists Gaussian blur, Sobel gradients, non-maximum suppression, double thresholding, hysteresis. Red flag: calling it blurred Sobel without hysteresis or NMS.
Harris corner detector and corner stability
Harris finds points where intensity changes strongly in all directions using the structure tensor of gradients; corners are well localized in two directions, unlike edges.
Image gradients, Sobel, and Canny
The gradient measures local intensity change in x and y; Sobel approximates it via convolution kernels; Canny uses gradient magnitude and direction plus non-max suppression and hysteresis.
SIFT scale and rotation invariance
Scale-space extrema via difference-of-Gaussians give scale invariance; a dominant gradient orientation gives rotation invariance; the descriptor is a normalized gradient histogram.
SIFT versus SURF versus ORB
SIFT is most accurate but slow with float descriptors; SURF approximates SIFT for speed; ORB is fast, binary, and free, ideal for real-time and embedded.
Descriptor matching and Lowe's ratio test
Match by nearest-neighbor descriptor distance; Lowe's ratio test keeps a match only if the best is clearly better than the second-best, rejecting ambiguous ones.
Bag of Visual Words model
Cluster many local descriptors (e.g. k-means) into visual words; assign each image's features to words; represent the image as a histogram of word counts for a classifier.
CNN features for image retrieval
Pass the image through a pretrained CNN and read activations from a late layer as a descriptor; deeper layers encode semantics, earlier layers encode texture.
Feature choice for real-time mobile SLAM
Pick ORB for fast FAST keypoints and cheap binary descriptors matched by Hamming distance; accept reduced robustness versus SIFT for real-time, low-power operation.
Epipolar constraint for correspondence search
The match for p1 must lie on its epipolar line in the second image, reducing a 2D search to 1D; the relation is encoded by the fundamental matrix.
Disparity and depth in stereo vision
Disparity is the horizontal shift of a point between left and right images; depth is inversely proportional to disparity given baseline and focal length.
Fundamental matrix versus essential matrix
Both relate corresponding points across two views via the epipolar constraint; the fundamental matrix works in pixel coordinates, the essential matrix in calibrated coordinates and encodes relative pose.
Incremental Structure from Motion pipeline
Detect and match features, estimate two-view geometry, triangulate, then incrementally add images with PnP and refine via bundle adjustment.
The PnP problem in Structure from Motion
PnP recovers a camera's pose from known 3D points and their 2D projections; it registers new frames against the existing point cloud in SfM.
Stereo rectification math and its artifacts
Rectification warps both images by homographies so epipolar lines become horizontal and aligned.
How a convolutional layer works
Learnable kernels slide over the input computing dot products, with stride controlling step size and padding controlling output size.
Max pooling versus strided convolution
Pooling downsamples and adds small translation invariance with no parameters; strided conv learns its downsampling but adds parameters.
Why CNNs need nonlinear activations like ReLU
ReLU introduces nonlinearity letting stacked layers model complex functions; without it any stack collapses to a single linear map.
Regularization techniques for an overfitting CNN
Data augmentation expands the effective dataset, dropout prevents co-adaptation, weight decay penalizes large weights, plus early stopping and batchnorm.