FEATURE MAPPING USING SIFT

ALGORITHM:

SIFT ALGORITHM
IMAGE REGISTRATION USING RANSAC
ALGORITHM:
Random sample consensus, or RANSAC, is an iterative method for estimating a
mathematical model from a data set that contains outliers. The RANSAC
algorithm works by identifying the outliers in a data set and estimating the desired
model using data that does not contain outliers.

RANSAC is accomplished with the following steps

1. Randomly selecting a subset of the data set

2. Fitting a model to the selected subset
3. Determining the number of outliers
4. Repeating steps 1-3 for a prescribed number of iterations
For example, the equation of a line that best fits a set of points can be estimated
using RANSAC.
Data points shown in blue, with the line of form y = mx+c estimated using RANSAC
indicated in red.

In computer vision, RANSAC is used as a robust approach to estimate the

fundamental matrix in stereo vision, for finding the commonality between two sets
of points for feature-based object detection, and registering sequential video
frames for video stabilization.
SAMPLE CODE:

Load the stereo images.

Get
I1 = imread("viprectification_deskLeft.png");
I2 = imread("viprectification_deskRight.png");

Show the putatively matched points.

Get
figure;
showMatchedFeatures(I1,I2,matchedPoints1,matchedPoints2,"montage",PlotOptions=["ro
","go","y--"]);
title("Putative Point Matches");

Show the inlier points.

Get
figure;
showMatchedFeatures(I1,I2,matchedPoints1(inliers,:),matchedPoints2(inliers,:),"mon
tage",PlotOptions=["ro","go","y--"]);
title("Point Matches After Outliers Are Removed");

IMAGE CLASSIFICATION USING ARTIFICIAL

NEURAL NETWORKS(ANN):
IMAGE CLASSIFICATION USING CONVOLUTION NEURAL NETWORKS(CNN):
IMAGE CLASSIFICATION USING DECISION TREE:
A decision tree is a flowchart-like tree structure where an internal node represents feature(or
attribute), the branch represents a decision rule, and each leaf node represents the outcome. The
topmost node in a decision tree is known as the root node. It learns to partition on the basis of the
attribute value. It partitions the tree in recursively manner call recursive partitioning. This
flowchart-like structure helps you in decision making. It's visualization like a flowchart diagram
which easily mimics the human level thinking. That is why decision trees are easy to understand
and interpret.

Decision Tree is a white box type of ML algorithm. It shares internal decision-making logic, which is
not available in the black box type of algorithms such as Neural Network. The decision tree is a
distribution-free or non-parametric method, which does not depend upon probability distribution
assumptions. Decision trees can handle high dimensional data with good accuracy.
IMAGE CLASSIFICATION USING SVM:
IMAGE CLASSIFICATION USING LOGISTIC
REGRESSION:
FINDING PALM LINES:
DETECTING FACES:
RECOGNIZING FACES:
TRACKING MOVEMENTS:
DETECTING LANES: