Transcript
Page 1: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Henry S. BairdMichael A. Moll

Sui-Yu Wang

A Highly Legible CAPTCHA

that Resists Segmentation Attacks

Page 2: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Some Typical CAPTCHAs

AltaVista

eBay/PayPal

Yahoo!

PARC’s PessimalPrint

Page 3: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

All These Are Vulnerable to Segment-then-Recognize Attack

Effective strategy of attack:

• Segment image into characters

• Apply aggressive OCR to isolated chars

• If it’s known (or guessed) that the word is ‘spellable’

(e.g. legal English), use the lexicon to constrain

interpretations

Patrice Simard (MS Research) et al report that this

breaks many widely used CAPTCHAs

Page 4: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

We try to generate word-imagesthat will be hard to segment into characters

Slice characters up: -vertical cuts; then -horizontal cuts

Set size of cuts to constant within a word

Choose positions of cuts randomly

Force pieces to drift apart: ‘scatter’ horiz. & vert.

Change intercharacter space

Page 5: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Character fragments can interpenetrate

Not only is it hard to segment the word into characters, ….

… it can be hard to recombine characters’ fragments into characters

Page 6: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Nonsense Words

We use nonsense (but English-like) words (as in BaffleText):

• generated pseudorandomly by a stochastic variable-length character n-gram model

• trained on the Brown corpus … this protects against lexicon-driven attacks

Why not use random strings?• We want to help human readers feel confident they have made

a plausible choice, so they’ll put up with severe image degradations (Cf. research in psychophysics of reading.)

M. Chew & H. S. Baird, “BaffleText: a Human Interactive Proof,” Proc., 10th SPIE/IS&T Document Recognition and Retrieval Conf., (DRR2003), Santa Clara, CA, January 23-24, 2003.

Page 7: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

How Well Can People Read These?

We carried out a human legibility trial with the help of ~60 volunteers: students, faculty, & staff at Lehigh Univ. plus colleagues at Avaya Labs Research

Page 8: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Subjects were told they got it right/wrong– after they rated its ‘difficulty’

Page 9: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Subjective difficulty ratingswere correlated with objective difficulty

• People often know when they’ve done well• This can be used to ensure that challenges aren’t too

hard (frustrating, angering)

Subjective difficulty level

AL

L

Easy

1 2 3 4

Impossible

5

No. of Challenges

4275

610

1056

1105

962

542

Percent answered correctly

52.6

81.3

73.5

56.0

32.8

7.7

Page 10: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

The same data, graphically

Right:

Wrong:

1 Easy

2

3

4

5 Impossible

Page 11: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

People Rated These “Easy’ (1/5)

aferatic

memmari

heiwho

nampaign

Page 12: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Rated “Medium Hard” (3/5)

overch / ovorch

wouwould

atlager / adager

weland / wejund

Page 13: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Rated “Impossible” (5/5)

acchown /

echaeva

gualing /

gealthas

bothere /

beadave

caquired /

engaberse

Page 14: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Why is ScatterType legible?

Does it surprise you that this is legible…?

I speculate that we can read it because:• we exploit typeface consistency … the evidence is small details of local shape• this ability seems largely unconscious

Page 15: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Ensuring that ScatterType is Legible

We mapped the domain of legibility as a function of engineering choices:

typefaces

characters in the alphabet

cutting & scattering parameters:

cut fractionexpansion fractionhorizontal scatter meanvertical scatter meanh & v scatter variancecharacter separation

Page 16: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Some typefaces remain legiblewhile others degrade quickly

Page 17: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Some Characters QuicklyBecome Confusable

overch‘o’ ‘e’ ‘c’ confusions

Page 18: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Mean Horizontal Scattervs Mean Vertical Scatter

Mirage: data analysis tool,Tin Kam Ho, Bell Labs.

Right:

Wrong:

1 Easy

2

3

4

5 Impossible

Page 19: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Cut Fraction Histogram

Right:

Wrong:

1 Easy

2

3

4

5 Impossible

Page 20: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Character Separation Histogram

Right:

Wrong:

1 Easy

2

3

4

5 Impossible

Page 21: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Finding Parameter Rangesfor High Legibility

d = Euclidean distance from origin of Mean Horiz Scatter vs Mean Vertical Scatter

Page 22: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Guided by this Analysis, We Can Define Legibility Regimes

Trivial: large cut fraction and small expansion

Simple: character separation also decreases

Easy: in original trial, correct 81% of time

Medium Hard: larger scatter distances degrades legibility noticeably

Page 23: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Other Examples - “Easy”

“wexped” - difficult to segment ‘e’, ‘x’ and ‘p’. Shows difficulty of achieving 100% legibility

“veral” - same parameters as above but different font. Not as difficult to segment

Page 24: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Other Examples - “Too Hard”

“thern”difficult to read, but easier than most with the same parameter values. Font makes a big difference.

“wezre”satisfactorily illegible, though probably segmentable

Page 25: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Future Work

We have exhausted the experimental data from the 1st trial

How can we automatically create images with given difficulty?

We have generated many images that seem difficult to segment automatically, but

we don’t understand how to guarantee this

We need to understand the effects of typefaces on ScatterType legibility

We want to study character-confusion pairs more

Attacking ScatterType

• Testing on best OCR systems

• Invite attacks from other researchers

• Is it credible if we attack it ourselves, and fail?

Page 26: Henry S. Baird Michael A. Moll Sui-Yu Wang

Pattern Recognition Research LabD. Lopresti & H. S. Baird

Contacts

Henry S. Baird [email protected]

Michael Moll [email protected]


Top Related