Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

help me understanding kNN

Hello guys,

I read all the documentation about how kNN works but I have some questions still:

Lets say I try to use kNN to recognize capital letters. I generate my training data by creating a black/white 10x20 matrix for every character.

Now I want to find the letters in my picture (e.g. a Screenshot of some random text) and already have a resized 10x20 contour for every letter. My "k" of kNN is 1. Does the algorythm now check every pixels 1 nearest neighbour? So it applys the kNN algorythm 20x10 = 200 times for each character it found? And afterwars it replys the letter with the most accordance? If not, how does it work?

Would be nice if you could help me understand it!

help me understanding kNN

Hello guys,

I read all the documentation about how kNN works but I have some questions still:

Lets say I try to use kNN to recognize capital letters. I generate my training data by creating a black/white 10x20 matrix for every character.

Now I want to find the letters in my picture (e.g. a Screenshot of some random text) and already have a resized 10x20 contour for every letter. My "k" of kNN is 1. Does the algorythm now check every pixels 1 nearest neighbour? So it applys the kNN algorythm 20x10 = 200 times for each character it found? And afterwars it replys the letter with the most accordance? If not, how does it work?

Would be nice if you could help me understand it!

help me understanding understand kNN

Hello guys,

I read all the documentation about how kNN works but I have some questions still:

Lets say I try to use kNN to recognize capital letters. I generate my training data by creating a black/white 10x20 matrix for every character.

Now I want to find the letters in my picture (e.g. a Screenshot of some random text) and already have a resized 10x20 contour Mat for every letter. My "k" of kNN is 1. Does the algorythm now check every pixels 1 nearest neighbour? So it applys the kNN algorythm 20x10 = 200 times for each character it found? And afterwars it replys the letter with the most accordance? If not, how does it work?

Would be nice if you could help me understand it!