aboutsummaryrefslogtreecommitdiff
path: root/report/paper.md
diff options
context:
space:
mode:
authornunzip <np.scarh@gmail.com>2018-11-15 23:47:04 +0000
committernunzip <np.scarh@gmail.com>2018-11-15 23:47:04 +0000
commit34c51e998cd88999cf6f084f79aad4954572eb53 (patch)
tree599cd2ce3fdc4391ed1df47734c17f1c221ede53 /report/paper.md
parent03047f7eab043251daa3f3dcbf428b6e34a7e077 (diff)
downloadvz215_np1915-34c51e998cd88999cf6f084f79aad4954572eb53.tar.gz
vz215_np1915-34c51e998cd88999cf6f084f79aad4954572eb53.tar.bz2
vz215_np1915-34c51e998cd88999cf6f084f79aad4954572eb53.zip
Add KNN part 1
Diffstat (limited to 'report/paper.md')
-rwxr-xr-xreport/paper.md12
1 files changed, 12 insertions, 0 deletions
diff --git a/report/paper.md b/report/paper.md
index 7b46b53..419bdc7 100755
--- a/report/paper.md
+++ b/report/paper.md
@@ -189,6 +189,18 @@ classification.
\end{center}
\end{figure}
+It is possible to use a NN classification that takes into account majority voting.
+With this method recognition is based on the K closest neighbors of the projected
+test image. Such method anyways showed the best recognition accuracies for PCA with
+K=1, as it can be observed from the graph below.
+
+\begin{figure}
+\begin{center}
+\includegraphics[width=20em]{fig/kneighbors_diffk.pdf}
+\caption{NN recognition accuracy varying K. Split: 80-20}
+\end{center}
+\end{figure}
+
The process for alternative method is somewhat similar to LDA. One different
subspace is generated for each class. These subspaces are then used for reconstruction
of the test image and the class of the subspace that generated the minimum reconstruction