Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: A little fun with merlyn

by mortis (Pilgrim)
on Nov 20, 2001 at 20:38 UTC ( #126539=note: print w/ replies, xml ) Need Help??


in reply to A little fun with merlyn

Wouldn't simply drawing a line (not necessarily straight) through each of the letters/digits (in the exact same color) to connect them defeat most ORC algorithms?

Or how about just overlapping the characters just a little bit with an adjacent character.

I'd think you can still do edge detection even if you're mixing up pixels just to simulate dithering.

just a couple of thoughts...


Comment on Re: A little fun with merlyn

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2015-07-02 05:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (27 votes), past polls