Skip to content

Commit

Permalink
Add notebooks
Browse files Browse the repository at this point in the history
  • Loading branch information
marianlupascu committed Jun 25, 2019
1 parent 48df6a5 commit f85e045
Show file tree
Hide file tree
Showing 49 changed files with 17,396 additions and 0 deletions.
Binary file added Google Landmark Recognition Challenge.pdf
Binary file not shown.
201 changes: 201 additions & 0 deletions LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,201 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/

TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.

"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.

"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.

"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.

"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.

"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.

"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).

"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.

"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."

"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.

2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.

3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.

4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:

(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and

(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and

(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and

(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.

You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.

5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.

6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.

7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.

8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.

9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.

END OF TERMS AND CONDITIONS

APPENDIX: How to apply the Apache License to your work.

To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.

Copyright [yyyy] [name of copyright owner]

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
45 changes: 45 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
# Google Landmark Recognition Challenge

## Introduction
In the spring of 2018, Google launched the Landmark Recognition Challenge, a competition that involves engaging a classifier to recognize the world's famous buildings and monuments. In this project we implemented a series of models including: [VGG-16](https://arxiv.org/abs/1409.1556) pre-engineered on ImageNet to which we trained only the final classifier and modified VGG-16 pre-modulated to which we added a [module of attention](https://arxiv.org/abs/1812.10025).

## Description of Dataset
The dataset consists of approximately 12 million images with 14,952 buildings (classes), which we downloaded from the Internet, then we got the most definite 27 classes, ie about 11.5% of the dataset size (46GB) and 0.18% of the number classes. A histogram showing the weight of the most definite 50 classes in the dataset is described. It can easily be observed that data is unbalanced, varying from 49091 examples for class 9633 to 1 for several dozen classes (9936, 99, etc.). The dataset was divided into 3 train (70%), validation (15%) and test (15%).
![Histogram showing the number of images in the first 50 classes sorted by weight](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/Figure_1.png?raw=true)

## Network Architecture
Data was augmented, namely: on train: rotation at ± 45 °, random crop at 224 × 224, change of illumination up to 25% and random flip, on validation and test: center crop at 224 × 224 and rotation at ± 45 °. The architecture used is VGG-16 to which the final classification sequence has been modified using Dropout after each fully-connected layer for regularization. The training of the model is done only on the classification sequence, while the feature extraction sequence remains frozen during training, as the VGG-16 is already pre-trained on 1000 classes, expected to return a number of well-defined features, either classified.
![The modified VGG-16 architecture](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/vgg16-1-e1542731207177.png?raw=true)

## The Attention Module
- We continue to expand our previous network to an [Attention Branch Network (ABN)](https://arxiv.org/abs/1812.10025) which is nothing but VGG-16 with the branch structure and attention module. The branch architecture is suggested only after applying the ReLU function after the two convolutional 7x7x512 filter (3x3). The purpose of the attention module is to force the network to look only on certain areas of the image. I mention that the architecture used is similar to that described in the paper Attention Branch Network: Learning of Attention Mechanism for Visual Explanation.
- Attention map is based on four convolutions in the feature map, reducing the number of channels from 512 to the number of classes (to us 27) then by applying the sigmoid. This is a 7x7 map in our case of values ​​between 0 and 1, in which areas with a score close to 1 are of interest and those close to 0 not.
- By multiplying each channel in the feature map with the attention map, a new feature map is obtained.
Loss is calculated as a linear combination of the bottom (attention map + classification) and top (GAP (works on the idea of ​​blurring information)).
![Formula](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/Formula.PNG?raw=true)
- alfa and beta are the hyperparameter that measures how much attention (top) and perception (bottom)
![The modified VGG-16 architecture over which the Attention Branch Network has been added](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/vgg16-1-e1542731207177%20_attentionBranch.png?raw=true)

## Experiments and Results
| Model | VALIDATION | TEST |
| ------ | ------ | ------ |
| **VGG-16**| 87.92% | **87.97%** |
| **VGG-16 with Attention Branch (alfa = 0.25 and beta = 1)**| 30.54% | 27.66% |
| **VGG-16 with Attention Branch (alfa = 0 and beta = 1)** | 32.71% | 32.58%

| Model | Epoch 1| Epoch 2| Epoch 3 |
| ------ | ------ | ------ | ------ |
| **VGG-16**| ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccNonAtention1.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccNonAtention2.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccNonAtention3.png?raw=true) |
| **VGG-16 with Attention Branch (alfa = 0.25 and beta = 1)**| ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtention1.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtention2.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtention3.png?raw=true) |
| **VGG-16 with Attention Branch (alfa = 0 and beta = 1)** | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtentionOneLoss1.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtentionOneLoss2.png?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/logs/AccAtentionOneLoss3.png?raw=true) |
- In the above table we see the difference in accuracy after 3 epochs between the three models, one reason being the larger number of parameters of the last two models.
- An interesting aspect is given by the last two lines in the table that suggest that the network that has the only loss on the classification branch (the perception) has a slightly higher convergence rate compared to the network that has accumulated the loss on both sides, thus suggesting that the blurred (general) information does not add to our classification case.

| **VGG-16 with Attention Branch (alfa = 0.25 and beta = 1)** | **VGG-16 with Attention Branch (alfa = 0 and beta = 1)** |
| ------ | ------ |
| ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/1.PNG?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/1OL.PNG?raw=true) |
| ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/2.PNG?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/2OL.PNG?raw=true) |
| ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/3.PNG?raw=true) | ![](https://github.com/marianlupascu/Google-Landmark-Recognition-Challenge/blob/master/results/3Ol.PNG?raw=true) |
## Conclusions
- Attention gets focused on the elements of interest in the image, but learning is hampered by the more complex model and requires more careful tuning of hyperparametres and greater attention to the optimization process
- The attention module is a general concept that can be applied to any task involving convolutional patterns and can be applied to various levels of the network, which has not been treated in this paper. (ending with feature extraction)
1 change: 1 addition & 0 deletions VGG16_Attention_Branch_Network.ipynb

Large diffs are not rendered by default.

1 change: 1 addition & 0 deletions VGG16_Attention_Branch_Network_without_GAP.ipynb

Large diffs are not rendered by default.

1 change: 1 addition & 0 deletions VGG16_nonAtention.ipynb

Large diffs are not rendered by default.

Binary file added images/Figure_1.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
27 changes: 27 additions & 0 deletions images/groupImagesByLandmark.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
# Presupunem ca in acelasi folder cu script-ul avem directoarele test/ si train/ si fisierele .scv
import os
import pandas as pd

folder = 'train/'
#filenames = glob.glob(folder + '*.jpg')
#nrFiles = len(filenames)

df = pd.read_csv('train.csv',delimiter=',')
nrLines = df.shape[0]
print('Grouping', nrLines, 'files')
for index, row in df.iterrows():
print('File {0} out of {1} : {2:.4f}%'.format(index, nrLines, (float(index + 1) / nrLines) * 100))
# Daca e nevoie creem folder-ul asociat acestui landarmk
landmarkFolder = folder + str(row['landmark_id']) + '/'
if not os.path.exists(landmarkFolder):
os.makedirs(landmarkFolder)

# Citim imaginea si o mutam in folder-ul asociat
imgFilename = folder + str(row['id']) + '.jpg' # toate au fost salvate cu extensia .jpg

current = imgFilename # unde se afla poza cu tot cu nume si extensie
new = landmarkFolder + str(row['id']) + '.jpg' # unde mut poza, cu tot cu nume si extensie

# Verific mai intai ca poza sa existe
if os.path.exists(current):
os.rename(current, new)
Loading

0 comments on commit f85e045

Please sign in to comment.