Utilisateur
6.5M
Narrow
100M
~100million, can only distinguish 10 million shades, and 100 shades of monochrome b&w
400-700nm
350nm to 1000nm
CDC is regular, human is irregular
IR dots, limited range, cheap, only good inside
Timing based. Accurate depth. Bad Resolution. Cheap. Limited Range
2 Camera. Colour. High Res, Needs Complext Software, Range bounded by separation
Rotating IR. No IR range limit. v accurate depth. v expensive. low res/ frame rate
Smooths/ blurs
smooths/ blurs
shifts all pixels
Finds the gradients at each point
Smooth with Gaussian. Find derivatives with Sobel. Threshold. Apply non-maximal supression to find local maxs.
big = fine features of image, small = large scale edges
Converts local edge points to hough space, and each point will represent all shapes thaat can fit through them. voting occurs and the most likely shape wins
Looks at patch of image. Takes gradients with Sobel. Find the eigenvalues of the autocorrelation matrix for patch of image. If we have 2 big eigenvalues then it is a strong vector. Brightness invariant as based on brightness. Susceptible to deformation and rotation
Threshold windows of gradients to get local features. Save gradients in all directions around the good feature. Brightness invarient, rotational invarient, susceptivle to deformation
Input -> convolutional ->nonlinear -> pooling
#True Positives/(#True Positives + #False Positives)
#True Positives/(#True positives + #False Negatives)
Combo of Precision and Recall
Intersection of object and bounding box/ Union of the two
Shrinks object and smooths out thick lines. Makes image smaller
Dilation enlarges object and smooths out holes in image makes image bigger
Dilation then Erosion makes image same size but fixes errors
Erosion then Dilation smooths image keeps image same size
Correction finds the actual position of target. Prediction multiplies previous state by a constant. Data association is the constant in this case. If noisy measurement rely on prediction and vice versa
run two filters one forwards one backwards. not real time
Multiple particles that converge to the true location as the prediction and correction processes occur. Can predict more positions than kalman, and is non-gaussian. More computation needed
Transformation that maps point from one plane to another and describes the relationship between two pictures of planar object
Captures the relative geometry between two calibrated cameras observing same 3D object to create a point cloud. Finds relation in pose between two cameras
Iterative reduction of a loss function to minimise reprojection error
Used to fit data to models by random sampling. Eg feature matching pick random subset of features accross two images and calculate homography, then keep going till this minimised
Find marker corners (corner finding + thresholding), calculate homograaphy using corner locations. Check the particular marker ID, and use this to figure out camera pose
Find all good features accross image. Save information about the info around these to database. Compare features in next frame and figure out the change in pose from this
Markerless more computationally intensive but dont have to have obnoxious markers everywhere
Progressive blurring (and size reduction) of image which is good for training size invariance
Iteratively subtract the blurred image from the original to gradually blur edges. Good for noise reduction
A bandpassed representation with non-orientated subbands of the image
Shows image successively at each scale and orientation good for feature analysis
If theotry only need 4 points to estimate camera movement but in theotry need many more - use RANSAC feature tracking. If we know pose at each step we can estimate next pose
Feature detection -> Lucas Kanade -> Pose Estimation - > Mapping of environment (integrate over time) - > Loop closure - update estimate if see same scene twice
Calculate approx motion of brightness patch. Solve Linear equations to estimate linear displacement vector of window around brightness patch
Image shows two instances of object due to difference algorithm
Hole in object from difference algorithm
Pose estimation, tracking, CNN
Circular hough, light intensity index, circularity index
Bilinear interpolation, Gaussian, markov chain, probabalistic diffusion
Viola jones, fisherface, histogram equalisation
Checkerboard, median filtering, canny, open, close, greyscaling
CNN, fisherface, viola jones, non maximak suppression, IOU
Greyscale, gaussian, open, close, thresholding
Canny, binaraisation, OCR, gemini
Lucas kanade, object detection CNN, kalman, mean shift
Detectron, YOLO, Roboflow
Erosion, Dilation, adaptive threshlding, green theorum
Colour space conversion, rotation translation, scaling, CNN, random forest
Erosion, dilation, median blur
Greyscale, optical charaacter recognition, gaussian
Object detection, pose recognition, canny, hough
Instance segmentation, open, close, kalman
gaussian, canny, dilation, hough, cnn
Viola jones, fisherface, CNN, face encoding
Gaussian, Erosion, dilation, thresholding
Circular hough, CNN, Haar cascade
Hough circle, open, close, colour transfer
Gaussian, circle hough, dilation, erosion, CNN
Translation, Rotation, Blurring, Scaling, Perspective Shifting, Shearing, Noise addition
~10^12:1
0.6CM
awdawawd
asawadfwa
asdsad
Widely used, Simple to understand. Device dependent, Not suitable for every application
Intuitive for us, Better for artistic work. Conversion required to get it to RGB to display
Device independent, Based on physical environment, Foundantions of colour spaces. Less as intuitive, requires complex math