Beruflich Dokumente
Kultur Dokumente
original names, scan results and image It consists of feature extraction design,
processing techniques to be able to identify decision rule design, pattern recognition
matching titles. Patterns and features of great evaluation, and knowledge data formation.
name, complexity, and pressure. b) Introduction phase (operational)
The initial process of identifying the Consists of determining the pattern to be
signatures of the 2DPCA method and the observed, the measurement of features, the
SSE method using a digital sample image process of recognition by enacting the rules
which is starting converted into a grayscale of decision and the use of known data.
image. Both ways produce an identification c) Evaluation Phase
level with high accuracy and an An image must be represented numerically
uncomplicated verification phase. Both of with discrete values. The image
these methods are perfect for a thick and representation of the malar function
uncomplicated signature style. The 2DPCA (continuous) into discrete values is called
method is a feature extraction for data digitalization [4]. The resulting image is
compression and requires many coefficients called digital image (digital image). In
in storing data [2]. general, Digital images are four rectangles,
For the color process using the first sum and their dimensions are expressed as height
squared error (SSE) method is to make the x width (or width x length). Digital images of
template database as the comparison with the the size of m x n are commonly represented
value of the crop image processing, the result by the matrix of the row size m and n
of the comparison, from the comparison columns as follows. On average, the feature
result will be obtained SSE blue, SSE green matrices produced by the proposed method
value in each sample data. By searching the and those formed by 2PCA are about the
squared value of error difference from same size. A digital image is regarded as the
sample data and test data. The results of the numeric representation of the 2D image in a
test show that SSE can recognize signatures sampled and quantized from. The basic
with 96% accuracy. 2DPCA Method used for picture element is called pixel, and an MXN
signature extraction with various slopes as image has M rows of pixels and N columns
well using Euclidean Distance to look for of pixels. With a coordinate system that
signature similarities [3]. This study aims to follows the principle of displacement on a
find out which method is more appropriate in standard TV screen, a pixel has coordinates
verifying and knowing the proper signature of (x, y), x represents column position and y
pattern for 2DPCA Method and SSE Method. denotes the line position. The upper-left
corner pixel has coordinates (0, 0) and the
pixels in the lower-right corner have
II. Related Work
coordinates (N-1, M-1). It can also be
Outline the comparison stage of the thought of a 2D grid or matrix whose
signature matching extraction results the elements are represented by f(x,y), where x
2DPCA method and SSE method as follow a. and y are the coordinates of the grid or the
Preprocessing, b. Extract 2DPCA method c. indices of the matrix element [5]:
Euclidean Distance techniques d. Extract
SSE method. f ( 0, 0 ) f ( 0,1) ... f ( 0, N )
f(x) =
f ( 0,1) f (1,1) ... f (1, N )
2.1. Preprocessing
Digital image extraction begins by f ( M 1,0) f ( N 1,1) ... f ( N 1, M 1)
converting the image into rows and matrices
columns. The model contains colors Red, 2.2. The Two Dimensional Principal
Blue, and Green. Image representation results Component Analysis (2DPCA) Method
in the matrix will facilitate image reduction.
The data source consists of several signatures Principal Components Analysis (PCA) or
affixed to the white paper to be sampled data. Karhunen Loeve Transformation is a
The results of the signature capture are stored technique used to simplify a data, using a
in the.JPG file format. The pattern is a linear transformation to form a new
grouping of numerical and symbolic data coordinate system with maximum variance.
(including imagery) automatically by a Two Dimensional Principal Component
machine (computer). Analysis (2DPCA) is a development of the
Operation pattern recognition system: Principal Component Analysis (PCA)
a) Stage of exercise method that serves feature extraction for data
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)
ISSN: 2579-7298 International Journal Of Artificial Intelegence Research
Vol. 1, No. 1, June 2018, pp. 6-13
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)
International Journal Of Artificial Intelegence Research ISSN: 2579-7298
Vol. 1, No. 1, June 2018, 6-13
data is used, pre-process stage to facilitate the used as reference process identification and
next step. At this stage, the process is to process second is training or testing system.
resize the image of the signature data from
the original size (Figure 1).
is a digital image that has only one channel 250 244 15 0 0 9 255 255 245 247 2 0 0 255 238 255
255 0 0 5 255 236 255 253 255 255 1 0 255 255 251 255
0 10 0 9 251 255 253 252 255 0 2 3 248 253 248 255
value on each pixel, meaning the value of 4 0 255 250 255 246 255 255 242 23 0 2 244 255 255 245
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)
ISSN: 2579-7298 International Journal Of Artificial Intelegence Research
Vol. 1, No. 1, June 2018, pp. 6-13
… + xm,i/ m) dan Zero Mean (Φ). Result weight becomes the source of the image
Covariance Matrix (C) diperoleh dari C = 1 / identifying data.
m – 1 (xji – μ i) (xji – μ i) (Table 2).
Table 1. Result Covariance Matrix Table 3. Euclidean Distance of Results
Data 1 Data 2 Data 3 Data 4 Data 5
2.579479 0.436079 0.116479 0.002279 -0.052621 -0.083221 -0.102021 23519.60 48705.63 54651.06 46126.79 52781.17
2.573079 0.432379 0.113379 -0.000421 -0.055021 -0.085521 -0.116521
2.442779 0.372479 0.060279 -0.053721 -0.110221 -0.141221 -0.163321
2.455379
2.193579
0.376679
0.270679
0.063079
-0.022721
-0.051621
-0.132521
-0.108421
-0.188821
-0.141221
-0.141221
-0.162021
-0.245421
Data verification uses five scenarios of 100
2.200679 0.272979 -0.021121 -0.131221 -0.187621 -0.222821 -0.244221
data, each situation consisting of 50 training
1.430079 -0.007221 -0.227321 -0.310321 -0.353321 -0.221521 -0.409421
1.391179 -0.020721 -0.236921 -0.318521 -0.360721 -0.379421 -0.409421
data and 50 data testing and ten signature
0.942379 -0.155021 -0.318821 -0.378021 -0.407321 -0.386321 -0.443421 data classes. The percentage comparison of
0.414479 -0.355721 -0.473821 -0.518421 -0.541621 -0.555621 -0.571821
training and testing data is 50%: 50%.
Data testing is stored in the database to be
further used as a source of data comparison Table 4. Verification Test Results
with training data. Eigenvalue (λ) is Scenario Data Size Accuracy Time (s)
sequenced in descending order from the most 1 50 x 50 92% 0.5782
considerable value to the smallest value (λ1>
λ2> λ3 ....... λm). 2 100 x 100 94% 0.1654
3 150 x 150 97% 0.2756
The Eigenvector (Ʌ) corresponding to the 4 200 x 200 98% 0.3645
most significant value of the eigenvalue has
the most dominant character, while the 5 250 x 250 95% 0.4749
eigenvector value corresponding to the Graph of matching signature based on data
smallest eigenvalue has the least dominant testing and training data on the smallest
feature. The optimal eigenvector is called the weight of Euclidean Distance (dij), according
projection matrix (system). The projection to a diagram obtained data testing and
matrix will be used for the formation of the training data follow Euclidean Distance
final pattern of data, i.e., as the method of Weight (Figure 6).
recognition method for the design of data
testing. Table 2 is the Eigenvalue (λ) and
Eigenvector (Ʌ) of the data testing piece.
Eigenvalue Eigenvector
-0.0375 + 0.0227i 6.8888 + 0.0015i
-0.0375 - 0.0227i 6.8780 + 0.0016i
-0.0020 + 0.0128i 6.6215 + 0.0016i Figure 6. Data Graph Testing and Data Training
-0.0020 - 0.0128i 6.6502 + 0.0016i
3.0753 6.0997 + 0.0026i
0.1269 6.1162 + 0.0016i
0 4.4179 + 0.0034i
-0.0003 4.3310 + 0.0013i
-0.012 3.2719 + 0.0014i
-2.4361 2.1301 + 0.0007i
Figure 7. Signature Matching Graph
Table 2. Eigenvector and Eigenvalue of Results
From the eigenvector and eigenvalue values a 3.3 Implementation SSE Method
new set of data sets (NewDataSet = ΦT * Ʌ) An image histogram is a graph depicting
and the matrix score (MatWeight = X * the deployment of pixel intensity values of a
NewDataSetT) are matched. This 2DPCA particular image or part in an image. From a
method extraction step results in training data histogram can be known the frequency of
in the matrix. The final step is to perform a emergence relative (relative) of the intensity
signature match that is to measure the matrix of the image.
score and the projection matrix of data
testing that has been projected with the
projection data training matrix. Matching
signatures using Euclidean Distance (Table
2), ie, finding the Euclidean distance between Figure 8. Image Histogram 240 x 160 Pixels
i and j. The smallest Euclidean Distance (dij)
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)
International Journal Of Artificial Intelegence Research ISSN: 2579-7298
Vol. 1, No. 1, June 2018, 6-13
The histogram also shows the brightness implementation and testing stages will be
and contrast of an image. Suppose that the analyzed to determine the accuracy of the
digital image has an L of gray, that is, from 0 method used. The DPCA 2 method is more
to L - 1 (for example in an image with appropriate to match signatures than the SSE
quantization of 8-bit grays degree, a gray method, influenced by the thickness,
degree value from 0 to 255). Mathematically complexity of a name and the quality of the
hn = ni / n, i = 0.1, .... L - 1; ni = the number captured camera image or the resulting
of pixels that have the gray degree L, n = the digital image scan.
total number of pixels in the image. Sum
Squared Error (SSE) to determine the value IV. Conclusion
of the histogram and the total black values of
The 2DPCA method represents the image
the sample data of the scanned test data [10].
with a much smaller covariant Matrix, so the
Table 5. Result of Histogram Value and Total evaluation of the covariance matrix is more
Black Value accurate. Time to calculate eigenvalues and
Data Value Total Black eigenvectors faster. The use of different data
Histogram Value training and testing aims to determine the
1 0,05783 95% effect of using the amount of training data on
2 1,073842 98% accuracy. The result of Euclidean Distance
3 0,329321 96% calculation, the smaller the distance between
4 0,923247 97% the score matrix with the projection matrix of
5 1,839358 94% data testing that has been projected with the
projection data training matrix, the closer the
From the result of histogram value and distance to the matching image. By using
total black value (%) determined SSE value Euclidean Distance calculation, identification
that is a difference of actual value with value of sample data with 2DPCA method
achieved. SSE results show the accuracy of produces accuracy of 96%-98%. The data
the signature [11]. identification process using the Sum Squared
Table 6. Value Result of SSE Method Error (SSE) range value has an efficiency of
Data Size Data Accuracy Time (s) 95% - 98%. Supported data sample has
1 50 x 50 95% 0.267836 dominant color or thickness. The comparison
2 100 x 100 97% 0.199104 results of both methods have a reasonably
3 150 x 150 93% 0.333916 good accuracy level in the signature
4 200 x 200 96% 0.574312 matching of about 97% - 98%.
5 250 x 250 91% 0.464381 In this research, signature matching is
done using 2DPCA reduction method and
Implementation of each result The stored SSE method. To identify the signature match
method then makes a comparison of the with the Sum Squared Error (SSE) Method,
accuracy of the 2DPCA method results with Sample Data, SSE Value Data and Test Data,
the SSE method (Table 6). as well as 2DPCA method required data
testing, data planning, and Euclidean
Distance Method.
The 2DPCA method more accurately
identifies the signature than the SSE method,
the matching difference being 2% -3%.
Acknowledgments
I thank STMIK Penusa Medan for entrusting
me to teach Image Processing lesson. I think
Figure 9. The Comparison Diagram of the it is a chance to occupy the interest sector of
2DPCA my capability. Hopefully, I can transfer my
The sample data is processed by applying skill both for teaching and do research
the 2DPCA and SSE methods and continued entirely.
matching of the signature. The 2DPCA
reduction method is a feature extraction
process that can reduce the dimensions of the
image to be smaller. The results of the
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)
ISSN: 2579-7298 International Journal Of Artificial Intelegence Research
Vol. 1, No. 1, June 2018, pp. 6-13
References
Anita Sindar RM Sinaga(The Comparison of Signature Verification Result Using 2DPCA Method and SSE Method)