Traditional Computer Vision (CV) techniques

Last updated Apr 24, 2022 Edit Source

See AI/Computer Vision/Computer vision

See AI/Computer Vision/Background subtraction

• https://pixinsight.com/doc/docs/InterpolationAlgorithms/InterpolationAlgorithms.html
• https://www.cambridgeincolour.com/tutorials/image-interpolation.htm
• https://www.unioviedo.es/compnum/expositive/presentations/T3C_Interpolation_image.pdf

• https://en.wikipedia.org/wiki/Geometric_transformation
• https://www.graphicsmill.com/docs/gm/affine-and-projective-transformations.htm
• https://docs.opencv.org/3.0-beta/doc/py_tutorials/py_imgproc/py_geometric_transformations/py_geometric_transformations.html
• http://eeweb.poly.edu/~yao/EL5123/lecture12_ImageWarping.pdf

• https://en.wikipedia.org/wiki/Affine_transformation
• Affine transformations are combinations of linear transformations and translations. Properties of affine transformations:
• Lines map to lines
• Parallel lines remain parallel
• Ratios are preserved
• Closed under composition

• https://en.wikipedia.org/wiki/Projective_transformation
• Projective transformations are combos of Affine transformations, and projective warps. Properties of projective transformations:
• Lines map to lines
• Parallel lines do not necessarily remain parallel
• Ratios are not preserved
• Closed under composition
• Models change of basis
• Projective matrix is defined up to a scale (8 DOF)

• For each pixel we compute a function of local neighborhood and output a new value. Use cases:
  • Enhance images: Denoise, smooth, increase contrast, etc.
  • Extract information from images: Texture, edges, distinctive points, etc.
  • Detect patterns: Template matching

• https://en.wikipedia.org/wiki/Kernel_(image_processing)
• Convolutions in image processing
• Convolution and kernels
• Image Kernels visualization
• OpenCV - Image Gradients
• http://scikit-image.org/docs/dev/api/skimage.filters.html
• https://dsp.stackexchange.com/questions/12684/difference-between-correlation-and-convolution-on-an-image
• Examples:
  • Box filter. Replaces each pixel with an average of its neighborhood (smoothing effect)
  • Sharpening filter. Accentuates differences with local average.
    • http://northstar-www.dartmouth.edu/doc/idl/html_6.2/Sharpening_an_Image.html
    • https://en.wikipedia.org/wiki/Box_blur
  • Sobel filter. This filter is used in image processing and computer vision, particularly within edge detection algorithms where it creates an image emphasising edges.
    • http://aishack.in/tutorials/sobel-laplacian-edge-detectors/
    • https://en.wikipedia.org/wiki/Sobel_operator
  • Gaussian filter. Smoothing. Remove “high-frequency” components from the image (low-pass filter)
  • Median filter. Non linear filter for image smoothing. Robustness to outliers
  • Bilateral filter. A bilateral filter is a non-linear, edge-preserving, and noise-reducing smoothing filter for images. It replaces the intensity of each pixel with a weighted average of intensity values from nearby pixels
  • Laplacian filter. Filtering with a Laplacian operator:
    • http://aishack.in/tutorials/sobel-laplacian-edge-detectors/
    • https://docs.opencv.org/2.4/doc/tutorials/imgproc/imgtrans/laplace_operator/laplace_operator.html

1
2
3

0	 1	  0
1 	-4	  1
0 	 1	  0

• Fourier transform stores the magnitude and phase at each frequency. The magnitude encodes how much signal there is at a particular frequency while the phase encodes spatial information (indirectly).
• The Convolution Theorem:
  • The Fourier transform of the convolution of two functions is the product of their Fourier transforms
  • The inverse Fourier transform of the product of two Fourier transforms is the convolution of the two inverse Fourier transforms
  • Convolution in spatial domain is equivalent to multiplication in frequency domain

• https://en.wikipedia.org/wiki/Template_matching

• See the “Filtering” section
• http://aishack.in/tutorials/template-matching/
• For templates without strong features, or for when the bulk of the template image constitutes the matching image, a template-based approach may be effective.
• Cross-correlation. Linear filtering: function is a weighted sum/difference of pixel values (dot products at each position)
  • https://en.wikipedia.org/wiki/Cross-correlation
• Using image pyramids

• Feature-based approach relies on the extraction of image features such, i.e. shapes, textures , colors, to match in the target image or frame. This approach is currently achieved by using Neural Networks and Deep Learning classifiers such as VGG, AlexNet, ResNet. Deep Convolutional Neural Networks process the image by passing it through different hidden layers and at each layer produce a vector with classification information about the image. These vectors are extracted from the network and are used as the features of the image. Feature extraction by using Deep Neural Networks is extremely effective and thus is the standard in state of the art template matching algorithms.
• This method is considered more robust and is state of the art as it can match templates with non-rigid and out of plane transformation, it can match with high background clutter and illumination changes.

• The Computer Vision Pipeline: feature extraction
  • Feature extraction is a core component of the computer vision pipeline. In fact, the entire deep learning model works around the idea of extracting useful features which clearly define the objects in the image. We’re going to spend a little more time here because it’s important that you understand what a feature is, what a vector of features is, and why we extract features.
  • A feature in Machine Learning is an individual measurable property or characteristic of a phenomenon being observed. Features are the input that you feed to your machine learning model to output a prediction or classification. Suppose you want to predict the price of a house, your input features (properties) might include: square_foot, number_of_rooms, bathrooms, etc. and the model will output the predicted price based on the values of your features. Selecting good features that clearly distinguish your objects increases the predictive power of machine learning algorithms.
• In image processing, algorithms are used to detect and isolate various desired portions or shapes (features) of a digitized image or video stream. It is particularly important in the area of optical character recognition.
  • Low-level: Edge detection, Corner detection, Blob detection, Ridge detection, Scale-invariant feature transform,
  • Curvature: Edge direction, changing intensity, autocorrelation
  • Image motion: Motion detection. Area based, differential approach, Optical flow
  • Shape based: Thresholding, Blob extraction, Template matching, Hough transform
    • Lines: Circles/ellipses, Arbitrary shapes (generalized Hough transform). Works with any parameterizable feature (class variables, cluster detection, etc..)
  • Flexible methods: Deformable, parameterized shapesActive contours (snakes)

• https://en.wikipedia.org/wiki/Blob_detection
• In computer vision, blob detection methods are aimed at detecting regions in a digital image that differ in properties, such as brightness or color, compared to surrounding regions. Informally, a blob is a region of an image in which some properties are constant or approximately constant; all the points in a blob can be considered in some sense to be similar to each other.
• The Laplacian of Gaussian
• The difference of Gaussians
• The determinant of the Hessian
• The hybrid Laplacian and determinant of the Hessian operator (Hessian-Laplace)
• Maximally stable extremal regions (MSER)

• https://en.wikipedia.org/wiki/Template_matching
• Canny edge detector
  • The Canny edge detector is an edge detection operator that uses a multi-stage algorithm to detect a wide range of edges in images.
  • The Process of Canny edge detection algorithm can be broken down to 5 different steps:
    1. Apply Gaussian filter to smooth the image in order to remove the noise
    2. Find the intensity gradients of the image
    3. Apply non-maximum suppression to get rid of spurious response to edge detection
    4. Apply double threshold to determine potential edges
    5. Track edge by hysteresis: Finalize the detection of edges by suppressing all the other edges that are weak and not connected to strong edges.
  • http://aishack.in/tutorials/canny-edge-detector/
• Robert cross
  • https://en.wikipedia.org/wiki/Roberts_cross
  • The Roberts cross operator is used in image processing and computer vision for edge detection.
  • As a differential operator, the idea behind the Roberts cross operator is to approximate the gradient of an image through discrete differentiation which is achieved by computing the sum of the squares of the differences between diagonally adjacent pixels.
• Prewitt operator
  • https://en.wikipedia.org/wiki/Prewitt_operator
  • The Prewitt operator is used in image processing, particularly within edge detection algorithms. Technically, it is a discrete differentiation operator, computing an approximation of the gradient of the image intensity function. At each point in the image, the result of the Prewitt operator is either the corresponding gradient vector or the norm of this vector. The Prewitt operator is based on convolving the image with a small, separable, and integer valued filter in horizontal and vertical directions and is therefore relatively inexpensive in terms of computations like Sobel and Kayyali operators. On the other hand, the gradient approximation which it produces is relatively crude, in particular for high frequency variations in the image.
• Deriche edge detector
  • https://en.wikipedia.org/wiki/Deriche_edge_detector
  • The Prewitt operator is used in image processing, particularly within edge detection algorithms. Technically, it is a discrete differentiation operator, computing an approximation of the gradient of the image intensity function. At each point in the image, the result of the Prewitt operator is either the corresponding gradient vector or the norm of this vector. The Prewitt operator is based on convolving the image with a small, separable, and integer valued filter in horizontal and vertical directions and is therefore relatively inexpensive in terms of computations like Sobel and Kayyali operators. On the other hand, the gradient approximation which it produces is relatively crude, in particular for high frequency variations in the image.

• https://en.wikipedia.org/wiki/Corner_detection
• http://aishack.in/tutorials/corner-detection-opencv/
• Corner detection is an approach used within computer vision systems to extract certain kinds of features and infer the contents of an image.
• Harris operator: detects corners (patches that have strong gradients in two orthogonal directions)
• Förstner corner detector
• The Wang and Brady corner detection algorithm
• The SUSAN corner detector
• The Trajkovic and Hedley corner detector

• Scale-invariant feature transform (SIFT)
  • http://aishack.in/tutorials/sift-scale-invariant-feature-transform-introduction/
  • SIFT keypoints of objects are first extracted from a set of reference images and stored in a database. An object is recognized in a new image by individually comparing each feature from the new image to this database and finding candidate matching features based on Euclidean distance of their feature vectors. From the full set of matches, subsets of keypoints that agree on the object and its location, scale, and orientation in the new image are identified to filter out good matches. The determination of consistent clusters is performed rapidly by using an efficient hash table implementation of the generalised Hough transform. Each cluster of 3 or more features that agree on an object and its pose is then subject to further detailed model verification and subsequently outliers are discarded. Finally the probability that a particular set of features indicates the presence of an object is computed, given the accuracy of fit and number of probable false matches. Object matches that pass all these tests can be identified as correct with high confidence.
  • https://opencv-python-tutroals.readthedocs.io/en/latest/py_tutorials/py_feature2d/py_sift_intro/py_sift_intro.html
  • There are mainly five steps involved in SIFT algorithm.
    1. Scale-space Extrema Detection (using DoG)
    2. Keypoint Localization
    3. Orientation Assignment
    4. Keypoint Descriptor
    5. Keypoint Matching
• Histogram of oriented gradients (HOG)
• Speeded up robust features (SURF)
  • https://en.wikipedia.org/wiki/Speeded_up_robust_features
  • In computer vision, speeded up robust features (SURF) is a patented local feature detector and descriptor. It can be used for tasks such as object recognition, image registration, classification or 3D reconstruction. It is partly inspired by the scale-invariant feature transform (SIFT) descriptor. The standard version of SURF is several times faster than SIFT and claimed by its authors to be more robust against different image transformations than SIFT.

• https://en.wikipedia.org/wiki/Kanade%E2%80%93Lucas%E2%80%93Tomasi_feature_tracker
• In computer vision, the Kanade–Lucas–Tomasi (KLT) feature tracker is an approach to feature extraction. It is proposed mainly for the purpose of dealing with the problem that traditional image registration techniques are generally costly. KLT makes use of spatial intensity information to direct the search for the position that yields the best match. It is faster than traditional techniques for examining far fewer potential matches between the images.
• Summary of KLT tracking:
  • Find a good point to track (harriscorner)
  • Use intensity second moment matrix and difference across frames to find displacement
  • Iterate and use coarse-to-fine search to deal with larger movements
  • When creating long tracks, check appearance of registered patch against appearance of initial patch to find points that have drifted

• https://en.wikipedia.org/wiki/Optical_flow
• Vector field function of the spatio-temporal image brightness variations
• #PAPER Large Displacement Optical Flow