On Friday, August 4, 2017 at 10:08:56 PM UTC+8, Ho Yeung Lee wrote:
> i had changed to use kmeans
>
> https://gist.github.com/hoyeunglee/2475391ad554e3d2b2a40ec24ab47940
>
> i do not know whether write it correctly
> but it seems can cluster to find words in window, but not perfect
>
>
> On Wed
i had changed to use kmeans
https://gist.github.com/hoyeunglee/2475391ad554e3d2b2a40ec24ab47940
i do not know whether write it correctly
but it seems can cluster to find words in window, but not perfect
On Wednesday, August 2, 2017 at 3:06:40 PM UTC+8, Peter Otten wrote:
> Glenn Linderman wrote
I remove red line
and capture another version
https://gist.github.com/hoyeunglee/99bbe7999bc489a79ffdf0277e80ecb6
it can capture words in windows, but since window words some are black
and some gray, some are not exactly black,
so I only choose notepad , since it is using black words
but some
https://gist.github.com/hoyeunglee/3d340ab4e9a3e2b7ad7307322055b550
I updated again
how to do better because some words are stored in different files
On Thursday, August 3, 2017 at 10:02:01 AM UTC+8, Ho Yeung Lee wrote:
> https://gist.github.com/hoyeunglee/f371f66d55f90dda043f7e7fea38ffa2
>
> I
https://gist.github.com/hoyeunglee/f371f66d55f90dda043f7e7fea38ffa2
I am near succeed in another way, please run above code
when so much black words, it will be very slow
so I only open notepad and maximum it without any content
then capture screen and save as roster.png
and run it, but I discov
Glenn Linderman wrote:
> On 8/1/2017 2:10 PM, Piet van Oostrum wrote:
>> Ho Yeung Lee writes:
>>
>>> def isneighborlocation(lo1, lo2):
>>> if abs(lo1[0] - lo2[0]) < 7 and abs(lo1[1] - lo2[1]) < 7:
>>> return 1
>>> elif abs(lo1[0] - lo2[0]) == 1 and lo1[1] == lo2[1]:
>>>
how to write this distance function in sort
there are the syntax error
On Wednesday, August 2, 2017 at 6:03:13 AM UTC+8, Glenn Linderman wrote:
> On 8/1/2017 2:10 PM, Piet van Oostrum wrote:
> > Ho Yeung Lee writes:
> >
> >> def isneighborlocation(lo1, lo2):
> >> if abs(lo1[0] - lo2[0]) <
On 8/1/2017 2:10 PM, Piet van Oostrum wrote:
Ho Yeung Lee writes:
def isneighborlocation(lo1, lo2):
if abs(lo1[0] - lo2[0]) < 7 and abs(lo1[1] - lo2[1]) < 7:
return 1
elif abs(lo1[0] - lo2[0]) == 1 and lo1[1] == lo2[1]:
return 1
elif abs(lo1[1] - lo2[1]) == 1
Ho Yeung Lee writes:
> def isneighborlocation(lo1, lo2):
> if abs(lo1[0] - lo2[0]) < 7 and abs(lo1[1] - lo2[1]) < 7:
> return 1
> elif abs(lo1[0] - lo2[0]) == 1 and lo1[1] == lo2[1]:
> return 1
> elif abs(lo1[1] - lo2[1]) == 1 and lo1[0] == lo2[0]:
> return
i tried with
testing1.sort(key=lambda x: x[0])
but only first element of tuple are grouped
then i expect to sort with custom function if difference between first element
of tuple and another first element of tuple is less than some value
and do for second element too,
goal to segmentation of bla
def isneighborlocation(lo1, lo2):
if abs(lo1[0] - lo2[0]) < 7 and abs(lo1[1] - lo2[1]) < 7:
return 1
elif abs(lo1[0] - lo2[0]) == 1 and lo1[1] == lo2[1]:
return 1
elif abs(lo1[1] - lo2[1]) == 1 and lo1[0] == lo2[0]:
return 1
else:
return 0
sort
11 matches
Mail list logo