Patel College of Science & Technology, Indore

FORMAT FOR SYNOPSIS REPORT

a. The contents of the report shall consist of:-
1. Title Page
2. Dedication/Appreciation/ Certificate
3. Abstract (100 Words Approx.)
The synopsis must begin with an abstract of 100 words. The abstract must clearly indicate
the idea of the proposed work, suggested solution framework and expected outcome in
brief.
4. List of Contents
5. Figures list
6. Tables list
7. Graph list
8. Symbols list
9. Introduction (Maximum 1 page including Figs.)
This should include the introduction to your topic in short.
10. Background (Maximum 2 paragraphs)
History of the topic in short.
11. Brief Literature survey (Minimum 2 pages)
Crux of the literature that you’ve reviewed for your topic. Names of the base papers and
other literatures.
12. Motivation & Problem formulation (Maximum 1page)
The things that you have noticed in the literature survey that need to be changed/modified
so that there is a scope for improvement.
13. Objectives & Scope (Minimum 1 page)
This section must provide the objective behind the changes that you are proposing and the
scope of the work.
14. Methodology / Research plan (Minimum 2 pages)
Your actual implementation of the topic.
15. Expected Outcome (Minimum 1 page)
This should include what do you expect after adding the proposed changes. This is the
outcome of your project.
16. Conclusion (Minimum 1/2 page)
More of less similar to abstract. You can also include future scope of the topic.
17. References
References should be in the following format.
Pritesh Jain, Dheeraj Rane, Shyam Patidar, “A Survey Paper on Cloud Computing,” In
Proceedings of the International Conference on Information Advanced Computing and
Communication Technologies (ACCT-12), Rohtak, January 7-8, 2012 IEEE, pp. 394-398.
18. Appendixes
b. The front page of the report is shown in below. The report must be submitted on the 2 week of
the training.

1
c. Other important formatting advices
1. [FONT TYPE: Times New Roman]
Main heading size=14, sub heading size=12, All text size=12, Page size A4
2. Alignment should be justified for text.
3. Margins should be as follows:

4. Page number should be there on bottom of each page centrally aligned.

5. All figures and tables should be named and numbered.
6. Spacing of 1.5 lines should be throughout the report.
7. Index should be prepared with appropriate numbering & remove table border for index,fig.
8. For all diagrams standard conventions should be used.
9. Don’t write any abbreviations anywhere write the full form.
10. No page border and shading on any page of report.
11. Don’t put section/subsection as last line of the page.

2
 Topic Name

An Synopsis Report Submitted to

Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal

Towards Partial Fulfillment for the Award of

Master of Technology
(Computer Science & Engineering)

Submitted By
Name
Enrollment No.

Under the Supervision of

Prof. ……………..
(Asst. Professor)

Department of Computer Science & Engineering

Patel College of Science and Technology, Indore
December 2018

3
 Patel College of Science and Technology,
Indore
Department of Computer Science Engineering

CERTIFICATE

The Synopsis report entitled “topic,” being submitted by Name (Enrollment No.
0828) has been examined by us and is here by approved for the award of degree
Master of Technology in Computer Science & Engineering discipline, for
which it has been submitted. It is understood that by this approval the undersigned
do not necessarily endorse or approve any statement made, opinion expressed or
conclusion drawn there in, but approve the synopsis only for the purpose for which
it has been submitted.

Guided By: Head of Department:

------------------------
------------------------------Prof…………………
Prof. ……………….
(Asst. Professor) (Asst. Professor)

4
 ACKNOWLEDGEMENT

I take the opportunity to express my cordial gratitude to Er. Name, Asst. Professor in the
Department of Computer Science & Engineering, Patel College of Science and Technology,
Indore for the valuable guidance and inspiration throughout the synopsis work. I feel thankful for
his innovative ideas, which led to successful completion of this work.

I also extend my deepest gratitude to Er……………………….., HOD, Department of Computer

Science & Engineering, Patel College of Science and Technology, Indore for providing all the
necessary facilities and true encouraging environment to bring out the best of my endeavors.

I give special thanks to Mr……………….Department of Computer Science & Engineering, Patel

College of Science and Technology, Indore to always being willing to help find solutions to any
problems I had with my work.

I express my gratitude and thanks to all the staff members of Computer Science & Engineering
department for their sincere cooperation in furnishing relevant information to complete this
dissertation well in time successfully.

Lastly but not least I must express my cordial thank to my parent, family members and friends
who gave me the moral support without which it was impossible to complete my project work.
With this note I thank everyone for the support.

Name

5
 Demo version ………………………
Abstract

Classification refers to as assigning a physical object or incident into one of a set of categories
which is predefined. The goal of texture classification is to assign an unknown sample image to
one of a set of known texture classes. In the field of texture analysis texture classification is one
of the four problem domains. The other three are texture segmentation (partitioning of an image
into regions which have homogeneous properties with respect to texture; supervised texture
segmentation with a priori knowledge of textures to be separated simplifies to texture
classification), texture synthesis (the goal is to build a model of image texture, this model can
then be used for generating the texture) and shape from texture (a 2D image is considered to be a
projection of a 3D scene and apparent texture distortions in the 2D image are used to estimate
surface orientations in the 3D scene).

6
 TABLE OF CONTENTS
Page No
Certificate i
Acknowledgement ii
Abstract iii
List of Figures iv
List of Tables v
List of Graph vi

Abbreviation vii

CHAPTER 1: Introduction 1-6

1.1 Overview 1

CHAPTER 2: Literature Survey

CHAPTER 6: Conclusion & Future work

References
Appendixes

LIST OF FIGURES

7
Figure No. Title Page
No.
1.1 An example that LBP is sensitive to noise 4
1.2 Pattern number of LBP riu(2,P,R) for 3×3 grids 4
2.1 Photograph of tricolor pasta and its gray- scale version. 7

LIST OF TABLES

Table No. Title Page No.

Table 5.1 Classification rate % on XU_HR database using different 43

schemes.
Table 5.2 Comparison of classification result obtained for noise of 44
different SNR on XU-HR dataset

8
 LIST OF GRAPHS

Graph No. Title Page No.

Graph 5.1 Classification rate % on XU_HR database using different 43

schemes.
Graph 5.2 Comparison of classification result obtained for noise of 44
different SNR on XU-HR dataset

ABBREVIATIONS

9
 LBP : Local Binary Pattern
LTP : Local Ternary Pattern
RLBP : Robust Local Binary Pattern
NILBP : Noise Insensitive Local Binary Pattern
CNILBP : Completed Noise Insensitive Local Binary Pattern
GLC : Gray Level Co-occurrence
GLCM : Gray Level Co-occurrence Matrices
GLD : Gray Level Differences
TU : Texture Unit
TS : Texture Spectrum
TUTS : Texture Unit & Texture Spectrum

Demo version ………………………

1.1 Overview
Classification refers to as assigning a physical object or incident into one of a set of categories
which is predefined. The goal of texture classification is to assign an unknown sample image to
one of a set of known texture classes. In the field of texture analysis texture classification is one
of the four problem domains. The other three are texture segmentation (partitioning of an image
into regions which have homogeneous properties with respect to texture; supervised texture
segmentation with a priori knowledge of textures to be separated simplifies to texture
classification), texture synthesis (the goal is to build a model of image texture, this model can
then be used for generating the texture) and shape from texture (a 2D image is considered to be a

10
projection of a 3D scene and apparent texture distortions in the 2D image are used to estimate
surface orientations in the 3D scene).
Texture classification process involves two phases: first one is the learning phase and the second
one is recognition phase. The main target of the learning phase is to build a model for the texture
content of each texture class which is present in the training data, which is usually, comprises of
images with known class labels. The texture content present in the training images is captured
with the selected texture analysis method; this texture content yields a set of textural features for
each of the image. These features, which can be scalar numbers or empirical distributions or
discrete histograms, characterize given textural properties of the images, such as contrast,
roughness, orientation, spatial structure etc. In the recognition phase the texture content of the
unknown sample is first described with the same texture analysis method. After that the textural
features of the sample are compared to those of the training images with the help of a
classification algorithm, and then the sample is assigned to the best match category. Optionally,
the unknown sample can be rejected if the best match is not sufficiently good according to some
predefined criteria.
A wide variety of techniques for describing image texture have been proposed. Tuceryan and Jain
[1] divided texture analysis methods into four categories: statistical, geometrical, signal
processing and model-based. Statistical methods analyze the spatial distribution of gray values,
by computing the local features present at each point in the image, and from the distributions of
the local features it derives a set of statistics. Depending upon the number of pixels defining the
local feature, the statistical methods can be further classified into first-order (one pixel), second-
order (two pixels) and higher-order statistics (three or more pixels). The basic difference is that
first-order statistics estimate properties (e.g. average and variance) of individual pixel values, by
ignoring the spatial interaction between image pixels; on the other hand second- and higher-order
statistics estimate the properties of two or more pixel values occurring at specific locations
relative to each other. The most commonly used statistical methods are gray level differences
(Weszka et al.) [2] and co-occurrence features (Haralick et al.) [3], which have inspired a variety
of modifications later on. These include the LBP (Local Binary Pattern) operator (Ojala et al.) [4]
and signed differences (Ojala et al.) [5], which incorporate occurrence statistics of simple local
microstructures, thus combining structural and statistical approaches to texture analysis.

1.2 Motivation
Texture classification is an active area of research for more than a decade. Local binary pattern
have shown their effectiveness in many fields of computer vision and image processing. Some of
the important ones are texture classification and finger print recognition. Despite the great
11
success of LBP in computer vision and pattern recognition, its underlying working mechanism
still needs more investigation. Before proposing LBP, Ojala et al. [10] used the absolute gray
level difference (AGLD) between a pixel and its neighbors to generate textons, and used the
histogram of them to represent the image. Later, they proposed LBP [11] to use the sign, instead
of magnitude, of the difference to represent the local pattern. Ojala et al. [12] also proposed a
multidimensional distribution of signed gray level difference (SGLD) and regarded LBP as a
simplified operator of SGLD by keeping sign patterns only. Ahonen and Pietikäinen [13]
analyzed LBP from a viewpoint of operator implementation. Tan and Triggs [14] proposed local
ternary pattern (LTP) to quantize the difference between a pixel and its neighbors into three
levels. . In addition LBP also lacks global information and is sensitive to noise as shown in figure
1.1 therefore the whole LBP code may get changed due to a minor change in the value of the
centre pixel.

Figure 1.1 An example that LBP is sensitive to noise

Figure 1.2 Pattern number of LBP (riu 2,P,R) for 3×3 grids

As shown in Figure 1.2, the pattern number LBP (riu2, 8, 1) in both Figures 1.2(a) and 1.2(b) is
4, but the differences between the pixel values are large.

12