19.11.2012 Views

Bull's Head and Mermaid - The Bernstein Project - Österreichische ...

Bull's Head and Mermaid - The Bernstein Project - Österreichische ...

Bull's Head and Mermaid - The Bernstein Project - Österreichische ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

ers other paper features like the paper structure, since this<br />

is present in all pieces of paper, like chain <strong>and</strong> laid lines. Especially,<br />

the laid line density (the number of laid lines per<br />

centimetre) as well as the chain line distances (the distances<br />

between the chain lines) are important features. Until now<br />

these features were extracted manually by simple measuring<br />

them with a ruler.<br />

Doing this with a computer is also now far from simple.<br />

Also here we have to do with noise. Advanced image processing<br />

techniques are needed to extract the relevant parameters.<br />

<strong>The</strong> following two illustrations show a process of<br />

chain line detection. Illustration 15 shows how in a number<br />

of various steps (a-d), the X-ray image is processed in such<br />

a way that the resulting image is more suitable for a computer<br />

to look for the chain lines. <strong>The</strong>n the image d is<br />

scanned line by line. For each line the grayscale values are<br />

represented by numbers <strong>and</strong> these are translated into a sig-<br />

112<br />

Ill. 14: A page from the printed Piccard collection with one of the isolated watermarks in two forms<br />

nal (e). It is a bit like an electrocardiogram; with the heartbeats<br />

showing up as high point that may be indicate the<br />

position of a chain line. By subjecting all the resulting<br />

‘heartbeat’ signals to a logical algorithm enables the computer<br />

to pinpoint the exact positions of the chain lines (f-h).<br />

Having obtained the line patterns <strong>and</strong> the corresponding<br />

chain line distances retrieval is now rather simple. <strong>The</strong> chain<br />

line distances are compared with other series of numbers in<br />

the database. On the basis of some similarity measure the<br />

computer comes up with a number of possibly identical papers<br />

with a decreasing degree of certainty (Ill. 16).<br />

As a matter of fact the best results are obtained when<br />

the information of watermarks as well as of laid line density<br />

<strong>and</strong> chain line distances are used at the same time.<br />

J.C.A.v.d.L. / H.M.O.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!