CHAPTER 1

INTRODUCTION

1.1 OVERVIEW:

These days there is a good development in the areas of Human Machine

Interface. By these developments it became so easy to have an easy way
of human machine interaction. In our project we are dealing with a
problem scenario where it’s hard to find a thing within a limited time
with utmost accuracy in a cluttered scenario. In previous developed
methodologies when there is a change in the orientation, phase (in and
out) or even when the object is covered i.e., fully not displayed the object
cannot be detected, which is the major disadvantage.

General image process consists of the activities, such as Digitization,

Pre-Processing, Image segmentation, Feature Extraction, Classification
and image recognition and interpretation.
Previously available techniques are SIFT which was modified to SURF,
and other Geometry based and appearance-based techniques.

The major methods implemented in finding a thing in a given clutter of

things are Appearance based method & Geometry based methods.
Appearance based method is a method where we can find a thing based
on its appearing features. But the main flaw in this method is we cannot
find the source object in the target image if there is a geometrical
difference in between them. The other method is Geometry based method
where we can find an object based on its geometrical features. But here
appearing feature pointing is not done. Matching is done based on the
geometry of Source and Target Images. Hence here in these two methods
we find some kind of problems in matching/detecting the objects But,
each of the techniques when implemented individually cannot overcome

1
the challenges of the other. For that reason, the above-mentioned
capturing techniques are combined together and implemented in this
project because of which capturing of an image irrespective of the
appearance can be done easily.

Thus, in our project there are 5 different techniques called BRISK,

HARRIS, FAST, MSER, SURF can deal with the above-mentioned
problems. Each of the technique does different kinds of feature matching
and gives the results most precisely. For example, FAST is the technique
which collects the interest points of the target and the reference image
and matches them to recognize the object. We have used five different
techniques in getting required thing from a given clutter of things. The
different techniques used in our project are

1. BRISK feature matching technique

2. FAST feature matching technique
3. SURF feature matching technique
4. MSER feature matching technique
5. HARRIS feature matching technique

A detailed explanation of the above techniques along with their

codes have been mentioned below. Each technique has its own
importance and is useful for finding a thing in a clutter of things in a
minimum time. Thus by using MATLAB and by mentioned techniques we
can detect a thing from a given clutter of things. Major applications are
we can use this in weapon detection i.e., Military Applications, ball
tracking in a Play field etc.

2
 CHAPTER 2

PROPOSED ALGORITHMS

Correlation based method:

Correlation based strategy is an optical strategy that utilizes following

and picture enlistment methods in 2D and 3D estimations of changes in
picture. It is one of the stereo coordinating techniques. It used to relate
the left picture and right picture from the diverse perspectives and
discover the contrast between both the pictures. Connection based
strategy is utilized as a result of their minimal effort in handling time. On
the off chance that the relationship esteem is 1 that is an ideal
coordinating of both left and right pictures. On the off chance that the
connection esteem is beneath 1 that isn't a definite match of left and
right pictures.

2.1 SURF- Speeded up Robust Feature

SURF is an indicator and a descriptor for focal points in pictures where the
picture is changed into directions, utilizing the multi-goals pyramid procedure,
to make a duplicate of the first picture with Pyramidal Gaussian or Laplacian
Pyramid shape to get a picture with a similar size however with diminished data
transmission. In this manner an exceptional obscuring impact on the first
picture, called Scale-Space, is accomplished. This system guarantees that the
focal points are scale invariant.

Speeded Up Robust Features (SURF) is a neighborhood include that can be

utilized for undertakings, for example, object acknowledgment or enrollment or
order or 3D recreation. In this SURF include we have two component focuses:

Interest point indicator

Local neighborhood descriptor

3
The SIFT approach utilizes fell channels to recognize scale-invariant trademark
focuses, where the distinction of Gaussians is determined on rescaled pictures
logically. In SURF, square-formed channels are utilized as an estimation of
Gaussian smoothing. Sifting the picture with a square is a lot quicker if the
vital picture is used. The total of the first picture inside a square shape can be
assessed rapidly utilizing the basic picture, requiring four assessments at the
sides of the square shape.

The objective of a descriptor is to give a remarkable and strong portrayal of a

picture highlight, e.g., by depicting the force dispersion of the pixels inside the
area of the focal point. Most descriptors are in this way figured in a nearby way.
Thus, a portrayal is acquired for each focal point distinguished beforehand.

The dimensionality of the descriptor has direct effect on the two its
computational multifaceted nature and point-coordinating vigor/precision. A
short descriptor might be increasingly strong against appearance varieties,
however may not offer adequate separation and in this way give an excessive
number of false positives.

The initial step comprises of fixing a reproducible introduction dependent on

data from a roundabout locale around the intrigue point. At that point we build
a square area adjusted to the chose introduction, and concentrate the SURF
descriptor from it. Moreover, there is additionally an upstanding form of SURF
(called U-SURF) that isn't invariant to picture revolution and hence quicker to
register and more qualified for application where the camera stays pretty much
flat.

2.2 Features from accelerated segment test (FAST)

FAST is a corner location strategy, which could be utilized to remove

include indicates and later Utilized track and guide protests in numerous
PC vision assignments. The FAST corner indicator was initially created
by Edward Rosten and Tom Drummond, and was distributed in 2006.

4
The most encouraging favorable position of the FAST corner locator is its
computational effectiveness. Alluding to its name, it is quick and to be
sure it is quicker than numerous other understood component extraction
techniques, for example, distinction of Gaussians (DoG) utilized by the
SIFT, SUSAN and Harris locators. Additionally, when AI methods are
connected, unrivaled execution regarding calculation time and assets can
be figured it out. The FAST corner identifier is truly reasonable for
constant video preparing application as a result of this rapid execution.

An intrigue point in a picture is a pixel which has a very much

characterized position and can be heartily distinguished. Intrigue focuses
have high nearby data substance and they ought to be in a perfect world
repeatable between various pictures [2]. Intrigue point identification has
applications in picture coordinating, object acknowledgment, following
and so on. Interest point location or corner discovery (both are conversely
utilized in writing), isn't new. There are a few entrenched calculations
like: Moravec corner discovery calculation, Harris and Stephens corner
location calculation, SUSAN corner indicator.

2.3 HARRIS Corner Detector

It is a corner location administrator that is normally utilized in PC vision

calculations to separate corners and deduce highlights of a picture. It
was first presented by Chris Harris and Mike Stephens in 1988 upon the
improvement of Moravec's corner locator. Contrasted with the past one,
Harris' corner finder considers the differential of the corner score with
reference to bearing legitimately, rather than utilizing moving patches for
each 45 degree edges, and has been turned out to be progressively
precise in recognizing edges and corners. From that point forward, it has

5
been improved and embraced in numerous calculations to preprocess
pictures for consequent applications.

A corner is a point whose nearby neighborhood remains in two

predominant and distinctive edge headings. As it were, a corner can be
deciphered as the intersection of two edges, where an edge is an abrupt
change in picture brightness.[3] Corners are the vital highlights in the
picture, and they are for the most part named as intrigue guides which
are invariant toward interpretation, turn and light. Despite the fact that
corners are just a little level of the picture, they contain the most
essential highlights in reestablishing picture data, and they can be
utilized to limit the measure of handled information for movement
following, picture sewing, building 2D mosaics, stereo vision, picture
portrayal and other related PC vision territories.

So as to catch the corners from the picture, analysts have proposed a

wide range of corner finders including the Kanade-Lucas-Tomasi (KLT)
administrator and the Harris administrator which are most
straightforward, effective and solid for use in corner identification. These
two well-known procedures are both intently connected with and
dependent on the neighborhood structure framework. Contrasted with
the Kanade-Lucas-Tomasi corner indicator, the Harris corner locator
gives great repeatability under changing enlightenment and revolution,
and hence, it is all the more regularly utilized in stereo coordinating and
picture database recovery. In spite of the fact that there still exists
downsides and impediments, the Harris corner finder is as yet a vital and
essential system for some PC vision applications.

6
2.4 MSER (Maximally Stable Extremal Regions)

MSER is a method for blob detection in images. The MSER algorithm

extracts from an image a number of co-variant regions, called MSERs: an
MSER is a stable connected component of some gray-level sets of the
image. MSER is based on the idea of taking regions which stay nearly
the same through a wide range of thresholds. – All the pixels below a
given threshold are white and all those above or equal are black. – If we
are shown a sequence of thresholder images I t with frame t
corresponding to threshold t, we would see first a black image, then
white spots corresponding to local intensity minima will appear then
grow larger. – These white spots will eventually merge, until the whole
image is white. – The set of all connected components in the sequence is
the set of all extremal regions. Optionally, elliptical frames are attached
to the MSERs by fitting ellipses to the regions. Those regions descriptors
are kept as features The word extremal refers to the property that all
pixels inside the MSER have either higher (bright extremal regions) or
lower (dark extremal regions) intensity than all the pixels on its outer
boundary

This operation can be performed by first sorting all pixels by gray value
and then incrementally adding pixels to each connected component as
the threshold is changed. The area is monitored. Regions such that their
variation with the threshold is minimal are defined maximally stable: –

Let’s make all the pixels below a threshold white. The others black

Considering a sequence of thresholder images with increasing thresholds

sweeping from black to white we pass from a black image to images
where white blobs appear and grow larger by merging, up to the final
image.

7
Over a large range of thresholds, the local binarization is stable and
shows some invariance to affine transformation of image intensities and
scaling.

2.4.1 MSER processing

The MSER extraction implements the following steps:

Sweep threshold of intensity from black to white, performing a simple

luminance thresholding of the image Extract connected components
(“Extremal Regions”)

Find a threshold when an extremal region is “Maximally Stable”, i.e. local

minimum of the relative growth of its square. Due to the discrete nature
of the image, the region below / above may be coincident with the actual
region, in which case the region is still deemed maximal.

Approximate a region with an ellipse (this step is optional)

Keep those regions descriptors as features

However, even if an extremal region is maximally stable, it might be

rejected if:

it is too big (there is a parameter MaxArea);

it is too small (there is a parameter MinArea);
it is too unstable (there is a parameter MaxVariation);
it is too similar to its parent MSER

Margin = the number of thresholds for which the region is

stable

2.5 BRISK Feature Matching:

BRISK0 - Binary Robust Invariant Scalable Keypoints (BRISK) has been

as of late created by Leutenegger et al. Intrigue focuses are identified by
processing a Features from Accelerated Segment Test (FAST) score for