aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorVasil Zlatanov <v@skozl.com>2018-12-13 17:20:42 +0000
committerVasil Zlatanov <v@skozl.com>2018-12-13 17:20:42 +0000
commit7da9226b4ba2fe70ead06295bce9982d9b4d35ab (patch)
tree8cf4766dc68158d5c346169f3b1041ae94d8c793
parenta015ffd16b2834e522ad3d3b0e2b9c6160d65044 (diff)
downloadvz215_np1915-7da9226b4ba2fe70ead06295bce9982d9b4d35ab.tar.gz
vz215_np1915-7da9226b4ba2fe70ead06295bce9982d9b4d35ab.tar.bz2
vz215_np1915-7da9226b4ba2fe70ead06295bce9982d9b4d35ab.zip
Talk about backpacks :D
-rwxr-xr-xreport/paper.md6
1 files changed, 5 insertions, 1 deletions
diff --git a/report/paper.md b/report/paper.md
index 89e260c..17972c5 100755
--- a/report/paper.md
+++ b/report/paper.md
@@ -252,7 +252,11 @@ The difference between the top $k$ accuracies of the two methods gets smaller as
\end{center}
\end{figure}
-The improved results due to $k$-reciprocal re-ranking can be explained by considering...re-ranking can be explained by considering...
+The improved results due to $k$-reciprocal re-ranking may be explained by considering that re-ranks based on second order neighbours,
+that is, the neighbours of the neighbours. For neighbours which display identifiable features, such as a backpack or binder that is
+not visible in the query but visible in a close neighbour, the reranking algorithm is able to infer that the strong relationship based on this newly introduced
+feature such as a backpack or folder by the neighbour, uniuqly identify other identities in the gallery with the same feature, and moving them up the rankinlist
+as a result despite the identifiable feature being hidden in the query. EXAMPLE BACKPACK HERE
# Conclusion