11.07.2015 Views

Printing Technique Classification for Document Counterfeit Detection

Printing Technique Classification for Document Counterfeit Detection

Printing Technique Classification for Document Counterfeit Detection

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.

For each of the trans<strong>for</strong>med images, we create a 2D valueco-occurrence histogram p[i, j], i.e. the histogram of howoften an original grayscale value i occurs in the region ofinterest of image I together with a value j at the same positionin the trans<strong>for</strong>med image J.p[i, j] =#{(x, y) ∈ ROI : I[x, y] = i ∧ J[x, y] = j}#{(x, y) ∈ ROI}(a) Contour image and dilation(b) ROI in original and binarizationFigure 5. A region is interest (ROI) mask isconstructed by dilating the contour image (a).The cross-correlation between the ROI-pixelsin the original image and in the binarized image(b) measures how close the contour regionis to an ideal step edge.From each such histogram, we extract the four features contrast,correlation, energy and homogeneity <strong>for</strong> classification:contrast = ∑ |i − j| 2 p[i, j]i,j∑i,jcorrelation =(i − µ x)(j − µ y )p[i, j]σ x σ yenergy = ∑ i,jp 2 [i, j]homogeneity = ∑ i,jp[i, j]1 + |i − j|whereµ x = ∑ i,ji p[i, j]µ y = ∑ i,jj p[i, j]Figure 6. Local binary pattern: A 3 × 3 windowsaround each position is extracted (left).Its center value is used as threshold <strong>for</strong> binarization(center). The 8 binarized neighborsare multiplied with a mask of powers of twoand summed up (right). This arranges themin clockwise order <strong>for</strong>ming a byte value, inthis example 1 + 2 + 4 + 16 + 128 = 151.Local Binary Maps We calculate the rotation invariant localbinary map[8]. It can be illustrated in the followingway: Assume a 3 × 3 window in the image. We calculatea binary version of this window using the centerpoint as threshold. The resulting 8 single-bit values arecombined into a bitstring in clockwise order, resultingin an 8-bit integer value. This process is illustrated inFigure 3.2. The resulting value depends on which bitthe combination started with. To make the feature rotationallyinvariant, we using each bit as a starting pointonce and keep the minimum resulting value as output.The same process can also be done <strong>for</strong> larger windowsizes. In our experiments, we use a 5 × 5 window. Thevalues at its boundary are binarized and combined intoa 16 bit output value, which is again made rotationallyinvariant by minimizing over all 16 possible rotations.√ ∑√ ∑σ x = (i − µ x ) 2 p[i, j] σ y = (j − µ y ) 2 p[i, j]i,ji,jThis results in a 4D feature vector per trans<strong>for</strong>mation, i.e.the total vector <strong>for</strong> texture features is 12-dimensional.3.3 <strong>Classification</strong>For classification, the 15-dimensional feature vectors arereduce to 12-dimensions using the PCA trans<strong>for</strong>m and normalizedto the range [0, 1]. Afterwards, they are used asinput to a support vector machine with Gaussian kernel(RBF-SVM). Support vector machines have proven to bea powerful tool <strong>for</strong> classification tasks where high accuracyis required. By use of a Gaussian kernel function, we avoidthe frequent problem of parameter section, because a RBF-SVM has only two free parameters, the penalty C and thekernel width σ, and there are straight<strong>for</strong>ward testing method<strong>for</strong> choosing them[9]. In our case, parameters were set toC = 20 and σ = 1.Another reason <strong>for</strong> choosing a RBF-SVM was, that theyutilize the advantages of a high (even infinite) dimensionalclassification space, and can be thought of as covering themore fundamental linear kernel SVMs as well[10].3.4 VisualizationA big problem of fully automatic classification problemsis that users don’t fully trust their decisions. This is evenmore the case in sensitive areas like document authenticity,

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

Saved successfully!

Ooh no, something went wrong!