1. Describing the Problem with background
Design of object recognition algorithm
knowledge.
In our paper, the object feature vector is used as the
input to detect & classify objects and movable objects
which is further split into pedestrians, automobiles,
and so on. Since the basic vector support machine is
for binary problems only, here we incorporated a
multi-classification system.
A) Image processing
Here, the primary goal was to carry out basic image
processing & detecting the object before going into
object detection. For that, images needed to the
processed in grayscale. The method includes
Average Gray = (R+G+B)/3 (1)
Maximum Gray = Max(R,G,B) (2)
Weighted Average = (xR+yG+zB)/3 (3)
The letters x, y, & z represent the weight of
grayscaling of R, G and B.
B) Moving Object Detection
Because of the “ghost” problem of the traditional
Gauss model when detecting an error, we have
incorporated the updated mixed Gauss model to detect
moving objects. This model uses the three frame
difference method where we assume that
x t 1 , x t and x t 1 is three continuous image frames.
The t-1, t & t+1 represents moments.
C) The moving objects shape features
The shape of the pedestrian & automobile is vastly
different. When we monitor a scene in real-time, the
moving object displayed on the monitor screen is
either there or not. Any video screen will only have a
part of the moving object. Due to this, the shape
method implemented here will divide the image in 1/3
part of the total object size. This ratio method is
utilized to make a clear distinction between the lower
and upper portion of the object in question.
Fig. 1: Custom Shape feature calculation sketch
Due to Support vector machine (SVM) introducing the
structural risk minimization principle, transforming the
issue into a two-time optimization problem, which
assisted us for the linear two value classification.
2.
based on support vector machine.
Support vector machine(SVM) combined with a
binary decision tree to form a multi-class classifier.
Here the two main risks include the empirical risk &
confidence risk.
Empirical risk represents the error in the classifier
while the confidence risk represents the degree of
reliance on classifier performance. The generalization
error bound formula as follows:
R(w) ≤ Remp(w) + Ф(n/h)
here, R(w) is the real risk, Remp(w) for empirical risk,
Ф(n/h) is the risk of confidence.
Consequently, the purpose of statistical learning is
modified from the slightest empirical risk to the
minimum empirical risk and confidence risk. We are
using SVM to solve the minimum structural risk.
Let us assume that we are working with a training
sample size of N which contains two categories. The
first category sample is treated as positive while any
sample that does not belong in the first category is
labeled as negative. To create a separation between the
two classes, machine learning formulates a discriminant
function.
There are two types of training samples: linear and
nonlinear. We are using a linear sample set. The
positive and negative samples are separated from the
linear hyperplane f(x) = wx + b = 0, which is called the
optimal separating hyperplane containing the largest
classification interval.
Fig. 2: Optimal separating hyperplane
The nature of the SVM problem is called aconvex
problem. Karush-kuhu-Tucher (KKT) condition is a
necessary and sufficient condition for convex problems
If we can satisfy this condition, the product of the
Lagrange multipliers (a strategy for finding the local
maxima and minima of a function) and constraints is
equal to 0. So any standard support vector must satisfy
the following conditions.
y i (wx + b) = 1
We have further trained the SVM classifier on the
individual decision node of decision tree-based method.
The design is shown below. Practically, category 1 is
easy to discern, therefore, the multiple classifiers will
distinguish category 1 among all of the other categories
present. The SVM structure is outlined in a manner
based on the binary decision tree. The training SVM
sequence is SVM1 ~ SVM2.
 Fig. 3: SVM multi-class classifier

The moving object detection program initially detects

the moving object and generates a feature vector based
on the division ratio & compactness of the object in
question and taken as the classification sample. After
the SVM is trained with the samples, it finds the vector
sample and establishes the optimal classification
hyperplane. When the SVM training is over, a
real-time video is fed as an input test sample into the
SVM, and recognition result is obtained.

The flow chart of moving object recognition and

classification is shown in Fig. 4.

Fig. 4: Object classification flow chart

3. Conclusion
To conclude, an SVM based algorithm is used for
object recognition. The presented data is based on a
moving object who are divided into pedestrians and
automobiles. We can use the shape of ratio &
compactness as a feature vector and train the SVM
model. In terms to form a multi-class classifier the
SVM, and binary decision tree is combined to detect
the target feature vector to classify objects.