Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^2: A little fun with merlyn

by Aristotle (Chancellor)
on Nov 16, 2001 at 02:35 UTC ( #125703=note: print w/ replies, xml ) Need Help??


in reply to Re: A little fun with merlyn
in thread A little fun with merlyn

All these suggestions do not really make it anywhere near impossible to break though.

My proposition is rather tricky and consists of two parts.. first you allocate a number of multiple palette entries to slight variations of the same color. Then you use these colors to form dithered colors, like red and green pixels forming a yellow shape, using different red palette indexes for each red pixel at random (and same for green - or whatever other color). If the background and foreground color share some dithering component (say, there's green pixels in both the background and the foreground), the contours of symbols are "washed out" a bit and the contrast between back- and foreground is low, you get a pretty much unsurmountable obstacle for OCR at least in its current form.


Comment on Re^2: A little fun with merlyn
Re: Re: Re: A little fun with merlyn
by scott (Chaplain) on Nov 24, 2001 at 01:47 UTC

    Hmmm... I'm not sure but wouldn't that make things a little hard on colorblind people?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://125703]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (8)
As of 2014-12-22 03:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (110 votes), past polls