ACKNOWLEDGEMENT

We are grateful to our respected guide Mr. Sanjay Khajure for his kind, disciplined
and invaluable guidance which inspired us to solve all the difficulties that came across
during completion of project.

We express our special thanks to Mr. V. P. Mahatme, Head of the Department, for
his kind support, valuable suggestion and allowing us to use all facilities that are
available in the Department during this project.

Our sincere thanks are due to Dr. B. Ram Rathan Lal, Principal, for extending all
the possible help and allowing us to use all resources that are available in the Institute.

We are also thankful to our Family members and Friends for their valuable
cooperation and standing with us in all difficult conditions.

Project-mates
 ABSTRACT

Machine learning is a subset of artificial intelligence which helps the machine

to learn from data rather than being explicitly programmed. Machine learning is a
relatively new discipline with computer science that provides a collection of data
analysis techniques. Some of these techniques are based on well-established statistical
methods. Machine learning algorithms build a mathematical model of sample data,
known as “training data”, in order to make predictions or decisions without being
explicitly programmed to perform.
Image processing is a method to convert an image into digital form and
perform some operations on it, in order to get an enhanced image or to extract some
useful information from it. It is a type of signal dispensation in which input is image,
like video frame or photograph and output may be image or characteristics associated
with that image.
The aim of the project is recognition of landmarks in images which can help to
manage large image collections and thus is desirable for many image retrieval
applications. K-nearest neighbor classifier is used as it attains the higher average test
accuracy as compared to Harris algorithm.
Modelling and recognizing landmarks at world-scale is a useful yet
challenging task. There exists no readily available list of worldwide landmarks. The
vast amount of multimedia data on the web, the availability of an Internet image
search engine, and advances in object recognition technique are addressing these
issues. The system provides an attentive local feature descriptor suitable for image
retrieval referred as histogram of oriented gradient. The new feature is based on
histogram of oriented gradient, which are trained with image level annotations, on a
landmark image dataset. The system can be used for image identification for other key
points descriptor enabling more accurate feature matching and geometric verification.

KEYWORDS: machine learning, image retrieval, histogram of oriented gradient, k-

nearest neighbor, landmark recognition, feature descriptor.

ii
 CONTENTS

Acknowledgement i

Abstract ii

Contents iii

List of Figures vi

List of Tables vii

Abbreviations viii

CHAPTER 1 INTRODUCTION 1-5

1.1 Artificial Intelligence 2

1.2 Landmark 4

1.3 Modules of Application 4

1.4 Motivation 4

1.5 Organization of Report 5

CHAPTER 2 LITERATURE REVIEW 6-28

2.1 Key Features of Landmark Recognition 24

2.2 Issues and Challenges 24

2.3 Algorithm for Landmark Recognition

2.3.1 Harris Algorithm 24

2.3.2 SIFT Algorithm 25

2.3.3 SURF Algorithm 25

2.3.4 Histogram of Oriented Gradient 27

2.6 Aims and Objectives 28

iii
CHAPTER 3 MACHINE LEARNING 29-34

3.1 Types of Machine Learning 30

3.1.1 Supervised Learning 30

3.1.2 Unsupervised Learning 31

3.1.3 Reinforcement Learning 31

3.2 Applications of Machine Learning 32

CHAPTER 4 IMAGE PROCESSING 35-42

4.1 Need of Digital Image Processing 36

4.2 Operation on Image 36

4.3 Applications of Image Processing 40

4.4 Global and Local Features 40

CHAPTER 5 PROPOSED APPROACH AND SYSTEM 43-48

DESCRIPTION

5.1 System Architecture 43

5.1.1 Local Feature Extraction 44

5.1.2 HOG Descriptors 45

5.1.3 K-Nearest Neighbor Algorithm 47

5.1.4 Classification of Images 48

CHAPTER 6 IMPLEMENTATION 49-62

6.1 Working of Implemented Algorithm 49

6.1.1 Histogram of Oriented Gradient 49

6.1.2 K-Nearest Neighbor Algorithm 52

6.2 Flowchart for HOG Algorithm 54

6.3 Flowchart for KNN Algorithm 55

iv
 6.4 Implemented System Modules 57

6.4.1 Pre-processing 57

6.4.2 Feature Extraction and Detection 60

6.4.3 Labelling of Image 61

CHAPTER 7 RESULT AND DISCUSSION 63-67

7.1 System Input 63

7.2 Pre-processing of Image 64

7.3 Extracted Keypoints 66

7.4 Image with Specific Landmark Label 66

CHAPTER 8 CONCLUSION 68

8.1 Limitation of the Study 68

8.2 Future Scope of Work 68

References 69-70

v
 LIST OF FIGURES

Figure Caption Page No.

No.
4.1 Global and local feature representation 41
5.1 Architecture of landmark recognition 43
6.1 HOG overflow 51
6.2 Working of KNN algorithm 53
6.3 Working of KNN algorithm(k=3) 54
6.4 Flowchart of HOG algorithm 55
6.5 Flowchart of KNN algorithm 57
6.6 Gray scale image 58
6.7 Blur image 59
6.8 Pre-processing of image 60
6.9 Feature detected (using HOG Descriptor) 61
6.10 Image labelled with specific landmark 62
7.1 GUI of extracting input 63
7.2 Enter input image 64
7.3 Pre-processing of image 65
7.4 Output of pre-processing 66
7.5 Image with labelled landmark 67

vi
 LIST OF TABLES

Table Caption Page No.

No.
1 Performance of different algorithms 53

vii
 ABBREVIATIONS

Abbreviations Meaning

SVM Support Vector Machine

SIFT Scale Invariant Feature Transform

HOG Histogram of Oriented Gradients

BoW Bag-of-words

ELM Extreme Learning Machine

CO-ELM Constrained-Optimization Extreme Learning Machine

MQTT Message Telemetry Transfer Queue

CBIR Content-Based Image Retrieval

KNN K-Nearest Neighbor

viii