A Recognition System for 3D Embossed Digits on Non-Smooth Metallic Surface

Similar documents
FARSI CHARACTER RECOGNITION USING NEW HYBRID FEATURE EXTRACTION METHODS

Feature Extraction Using Zernike Moments

Image Recognition Using Modified Zernike Moments

MOMENT functions are used in several computer vision

Object Recognition Using Local Characterisation and Zernike Moments

Science Insights: An International Journal

An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments

Kernel Machine Based Fourier Series

Representing regions in 2 ways:

Evaluation of OCR Algorithms for Images with Different Spatial Resolutions and Noises

Discriminative Direction for Kernel Classifiers

IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART C: APPLICATIONS AND REVIEWS, VOL. 30, NO. 1, FEBRUARY I = N

Accurate Orthogonal Circular Moment Invariants of Gray-Level Images

Empirical Analysis of Invariance of Transform Coefficients under Rotation

Affine Normalization of Symmetric Objects

Invariant and Zernike Based Offline Handwritten Character Recognition

Feature extraction: Corners and blobs

Temporal analysis for implicit compensation of local variations of emission coefficient applied for laser induced crack checking

Computer Vision & Digital Image Processing

Invariant Pattern Recognition using Dual-tree Complex Wavelets and Fourier Features

Orientation Map Based Palmprint Recognition

Face recognition using Zernike moments and Radon transform

AN INVESTIGATION ON EFFICIENT FEATURE EXTRACTION APPROACHES FOR ARABIC LETTER RECOGNITION

Shape of Gaussians as Feature Descriptors

Invariant Feature Extraction from Fingerprint Biometric Using Pseudo Zernike Moments

Linear Methods in Data Mining

A New OCR System Similar to ASR System

Prof. Mohd Zaid Abdullah Room No:

A HYBRID MOMENT METHOD FOR IDENTIFICATION OF 3D-OBJECTS FROM 2D-MONOCROMATIC IMAGES

A Robust Modular Wavelet Network Based Symbol Classifier

Object Recognition Using a Neural Network and Invariant Zernike Features

3-D Projective Moment Invariants

Main matrix factorizations

Classifying Galaxy Morphology using Machine Learning

CS 4495 Computer Vision Binary images and Morphology

A Novel Activity Detection Method

Basic Concepts of. Feature Selection

Comparative study of global invariant. descriptors for object recognition

Noisy Word Recognition Using Denoising and Moment Matrix Discriminants

Various Shape Descriptors in Image Processing A Review

IMAGE INVARIANTS. Andrej Košir, Jurij F. Tasič

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008

Wavelets and Multiresolution Processing

Region Description for Recognition

Projection-invariant pattern recognition with a phase-only logarithmic-harmonic-derived filter

Edges and Scale. Image Features. Detecting edges. Origin of Edges. Solution: smooth first. Effects of noise

A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY

Persian Handwritten Word Recognition Using Zernike and Fourier Mellin Moments

Lecture 8: Interest Point Detection. Saad J Bedros

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY

Estimators for Orientation and Anisotropy in Digitized Images

EECS490: Digital Image Processing. Lecture #26

Empirical Analysis of Rotation Invariance in Moment Coefficients

Deep Learning: Approximation of Functions by Composition

CS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015

A Method for Blur and Similarity Transform Invariant Object Recognition

Invariant Scattering Convolution Networks

The Efficient Discrete Tchebichef Transform for Spectrum Analysis of Speech Recognition

Deformation and Viewpoint Invariant Color Histograms

Noise Robust Isolated Words Recognition Problem Solving Based on Simultaneous Perturbation Stochastic Approximation Algorithm

Schur decomposition in the scaled boundary finite element method in elastostatics

The New Graphic Description of the Haar Wavelet Transform

Hu and Zernike Moments for Sign Language Recognition

Blobs & Scale Invariance

Finite element simulation of residual stresses in laser heating

Binary Image Analysis

Manifold Coarse Graining for Online Semi-supervised Learning

Tensor Method for Constructing 3D Moment Invariants

Corners, Blobs & Descriptors. With slides from S. Lazebnik & S. Seitz, D. Lowe, A. Efros

Detectors part II Descriptors

Detection of Subsurface Defects using Active Infrared Thermography

A new class of shift-invariant operators

Elements of Continuum Elasticity. David M. Parks Mechanics and Materials II February 25, 2004

Logarithmic quantisation of wavelet coefficients for improved texture classification performance

Introduction to Machine Learning. PCA and Spectral Clustering. Introduction to Machine Learning, Slides: Eran Halperin

Original Article Design Approach for Content-Based Image Retrieval Using Gabor-Zernike Features

CS 231A Section 1: Linear Algebra & Probability Review

CS 231A Section 1: Linear Algebra & Probability Review. Kevin Tang

Palmprint Verification with Moments

Image Analysis. Feature extraction: corners and blobs

COMP344 Digital Image Processing Fall 2007 Final Examination

Gaussian derivatives

Role of Assembling Invariant Moments and SVM in Fingerprint Recognition

Enhanced Fourier Shape Descriptor Using Zero-Padding

Towards airborne seismic. Thomas Rapstine & Paul Sava

ME 132, Dynamic Systems and Feedback. Class Notes. Spring Instructor: Prof. A Packard

Sec. 1.1: Basics of Vectors

where =0,, 1, () is the sample at time index and is the imaginary number 1. Then, () is a vector of values at frequency index corresponding to the mag

Michal Kuneš

Combining Memory and Landmarks with Predictive State Representations

SYMBOL RECOGNITION IN HANDWRITTEN MATHEMATI- CAL FORMULAS

Material testing method for understanding rubber s mechanical characteristics Quasi-Static Tension Test

Subcellular Localisation of Proteins in Living Cells Using a Genetic Algorithm and an Incremental Neural Network

A Novel Rejection Measurement in Handwritten Numeral Recognition Based on Linear Discriminant Analysis

When Fisher meets Fukunaga-Koontz: A New Look at Linear Discriminants

arxiv: v1 [cs.cv] 10 Feb 2016

Lecture Hilbert-Huang Transform. An examination of Fourier Analysis. Existing non-stationary data handling method

Atmospheric Turbulence Effects Removal on Infrared Sequences Degraded by Local Isoplanatism

Efficient Computation of Zernike and Pseudo-Zernike Moments for Pattern Classification Applications 1

Transcription:

2011 International Conference on elecommunication echnology and Applications Proc.of CSI vol.5 (2011) (2011) IACSI Press, Singapore A Recognition System for 3D Embossed Digits on Non-Smooth Metallic Surface aweepol Suesut, Suphan Gulpanich and Kitti irasesth Department of Instrumentation and Control Engineering, Faculty of Engineering, King Mongkut s Institute of echnology Ladkrabang, Bangkok 10520 HAILAND Abstract. his paper presents a new solution to the automatic localization and recognition of natural digits embossed on structured and rough surfaces. A new concept of combining periodic (e.g. FF, DC) with polynomial moments (e.g. chebichef moments) is shown that the new method can eliminate some of the problems associated with the Gibbs phenomena. QR decomposition is used to obtain a unitary basis, minimizing the numerical effort when modeling surfaces. he combined moment method is used to generate a smoothed global model of the surface structure. Following segmentation of the individual digits, pattern recognition based on moment function such as Hu s moment invariants, Zernike moments, and Orthogonal Fourier Mellin Moments was used to recognize the stamped number after analyzing 3D surface data of the steel block. A prototype system of the laser-scanning instrument was implemented and test measurements were performed in a production line. he results showed the correct functionality of the method. Keywords: Polynomial moments, 3D surface modeling, OCR, machine vision, Gibbs error 1. Introduction Most steel production plants produce steels of different qualities containing various alloys. Consequently, for critical products, such as oil drilling rods, it is essential to track the steel from the continuous caster to its use in an individual product. Only in this manner can the quality of the material be ensured. he difficulties associated with material tracking in steel production are: the material needs to be marked at temperatures of up to 1100±C, which precludes the use of classical labels; there is significant growth of scale, particularly for high carbon steels. As a result the marking must be robust enough to withstand later rescaling - commonly performed with water jets at 2000 Bar; thermal stress during cooling may lead to significant deformation of the product; the ends of the bars are cut using autogenic-burners, which leaves a characteristic rough surface (see Figure 1a). Presently the solution to these problems is to emboss a code as a 3D structure into the surface of the material. here has also been a migration of the types of embossed codes used: originally, embossed dot or bar codes were used. hese codes are not human-readable which proved to be a major disadvantage. It is very difficult to maintain tracking of steel bars which are removed from the plant during unplanned disruption of the production. Later the bars were embossed with both human-readable and machine readable codes; see Figure 1a for an example. he reason for stamping both codes was that there were no reliable methods to locate and identify the natural digits on such rough surfaces. In general, character recognition or optical character recognition (OCR), sub-field of pattern recognition, is applied with a binary image acquired by scanner or digital camera. Using a camera to directly capture images from metallic surface is very difficult to perform image segmentation and classification. Because of the image of metallic surface in this work is dark and contains a periodic texture, global deformations, and local anomalies - characteristics. It is not easy to classify the number stamped on the metallic surface by a simple technique. ypically, a character recognition system comprises three main steps: pre-processing, feature extraction, and classification. After performing the surface relief, the image of surface is manipulated by a variety of 258

methods that perform operations such as filter for noise removal, image enhancement and segmentation. his stage ensures that the resultant image is made suitable for further processing. (a) (b) Fig.1 a) Examples of an embossed bar code combined with embossed natural digits. b) 3D surface data acquisition using laser light sectioning. 2. Moments for surface modeling As the steel bar enters the production line it is stopped briefly, and the geometry of the end of the bar is measured by a 3D scanner. he scanner (see Figure 1b) consists of a linear drive which moves a laser planeof-light measurement unit past the surface. A complete 3D geometry of the surface containing the embossed code is acquired (see Figure 1a). he reconstruction of the 2D cross sections from the images can be constructed of a 3D surface from the individual cross sections. his paper presents a solution to the automatic localization and recognition of natural digits which are stamped as 3D structures on rough surfaces. Recently, discrete polynomial moments were applied to realtime geometric surface inspection [1][2][3]. his paper builds upon that recent work extending the technique to combine discrete polynomial and periodic bases in a single new unitary basis; efficiently dealing with surfaces having a combination of periodic texture, global deformations and local anomalies characteristics are typical of parts produced by mechanical machining. Since the combined moment method has been applied to enhance the surface information, images of stamped number are able to perform pattern recognition algorithms. 2.1 Polynomial moments It has been proved that there is one and only one discrete unitary polynomial basis [4]. he unique unitary polynomial basis P, a sum of monomials, can be synthesized in the range [-1, 1] directly from the recurrence relationship, whereby, P = αp p + βp (1) n 1 n 1 n 2 α = 1 2 p p ( p p ) t t t n 2 (2) and β = αp p, 2 (3) t n 259

given p 0 1 =, and p1 = N 3( N 1) x. N( N + 1) (4) he individual column vectors pi are concatenated to form the complete polynomial basis of degree n, i.e P = [p0. pn]. his polynomial basis forms a chebychev system, the basis is unitary PP = I Low degree polynomial moments can model the gradients and sub-harmonic components of data well. 2.2 Combined moments he new concept is to combine a polynomial and a periodic basis to form a new basis, which is better suited for modeling data with a combination of periodic and non periodic components. Consider, the concatenation of a polynomial and cosine bases to form a new basis set, B = [ PC, ]. (5) he bases P and C are both unitary; however, they are not orthogonal to each other PC 0 In this case perfect reconstruction requires the computation of the pseudo inverse of B, yˆ = BB + y. (6) It can be proved [6] that a QR decomposition exists for any real matrix, such that, B = QR, (7) where Q is a unitary matrix and R is an upper triangular matrix. Note: for an appropriate QR algorithm QQ= I+ E, with E u the numerical resolution of the computer. 2 Furthermore, BB + = QQ (8) In further computations Q is used as the orthogonal basis. 2.3 Extension to 3D data Separable orthogonal bases are used to model 3D surfaces. Eden et al. 1986 [5]showed that the computation ˆ Z = YMX, (9) performs a least square approximation Ẑ of Z, whereby X and Y are the bases used in the x and y directions respectively. he bases in x and y may and commonly are different. In the case of a unitary polynomial basis P + = P the reconstruction process becomes, Zˆ = YY Z( XX ). (10) In the application tested here the residual surface is computed as, R= Z YY Z( XX ). (11) he aim is to separate the low degree geometric deformation of the surface and the periodic portion of the surface from the remaining data. his enables the detection of local anomalies. he data set consists of 611 by 591 points. Figure.2a shows the original data from the 3D scanning instrument. he residual after removal of the surface model associated with the combined moments, (polynomial components dx = 5, dy = 5 and cosine components cx = 6 36, cy = 5 10) has been illustrated in figure 2b. 260

(a) (b) Fig.2. a) Original data b) Residual after removal of the surface model associated with the combined moments 3. Pattern recognition based on moment invariants In this work, images of number are computed to the moments feature vectors; there are three types of moment are adopted, i.e. Hu s moment invariants, Zernike moments, and Orthogonal Fourier Mellin Moments. hese feature vectors of the image of the number are constituted by invariant functions of moments of different orders, so that the global shape characteristics of the image are invariant with translation, rotation and scale. Moments of different orders usually exhibit large dynamic range variations. his leads to the domination of a subgroup of features among a set of moments. herefore, the moments in a feature vector have to be appropriately weighted to get balanced representation of different components of the image shape. Higher order moments are more sensitive to image noise and quantization effects, and can lead to mismatch in pattern recognition algorithms. Moment of orders higher than four is not commonly used in feature vector construction.[7] An appropriate feature vector for the pattern matching of the number is selected according to the following cases. In case of Hu moments, the feature vector Z was formed from all seven Hu s moments [8] as defined by equation (12) z = { H, i= 1,...,7}. (12) i In case of Zernike moments [10] (A. Khotanzad et al. 1990), the feature vector of absolute Zernike moment values was constructed as defined by equation (13) k z = { Z, i = 0,...,4 ( i j) = 2, k N}. (13) ij In case of Orthogonal Fourier-Mellin moments,[9] the feature vector values were defined by equation (14). he circular Fourier or radial Mellin moments (FMMs) of an image function f (, r θ ) was defined in the polar coordinate system (, r θ ) as 2π p ( jqθ ) pq, = (, θ) θ. (14) 0 0 F r f r e rdrd 261

Where q = 0, ± 1, ± 2 is the circular harmonic order and the order of the Mellin radial transform is an integer p with p 0. Fig.3 Images of number after enhancing. 4. Experimental results he experiment performs according to the 3D surface recognition procedure. After surfaces of the steel block were acquired by the light sectioning instrument, surface approximation to surface relief by combined moments was done. Subsequently, images of surface were performed image pre-processing (i.e. noise removal, segmentation) to finally located the numbers on the images using labeling algorithm by 8-pixelsneighbors as shown in figure 3. he recognition of the number could be well done except the number with some missing part. o illustrate the performance of the classification and recognition, the artificial samples of image were made for various forms (e.g. rotation, missing part). here are three kinds of moment invariants i.e. Hu moment (HMI), Zernike moment (ZMI) and Orthogonal Fourier-Mellin moment (OFMMI) in this experiment. In order to test the recognition accuracy, two experiments were done to compare the performance of selected moment invariants. Firstly, testing recognition rate was performed with adding salt and pepper noise at different levels of noise (i.e. 1%, 2%, 3%, 4%) to the samples. Secondly, the sample images were rotated with every 10 degree of rotation. he results are shown in able 1 and able 2. able 1 Comparison of recognition rate of HMI, ZMI AND OFMMI with noise adding into image Moments 0% of Noise 1% of Noise 2% of Noise 3% of Noise 4% of Noise HMI 98 78 41 29 16 ZMI 98 98 98 98 91 OFMMI 98 81 66 59 55 able 2 Recognition results of moments with rotated images Moments Recognition rate (%) HMI 71 ZMI 79 OFMMI 42 5. Conclusion he work presented in this paper has focused on the geometric modeling to enable a robust extraction of the digits from the structured and rough surface. It has been shown that combining polynomial and periodic moments leads to more efficient modeling of real machined surfaces. he Gibbs energy associated with simple gradients in the signal or sub-harmonic components can be eliminated (Paul O Leary et al. 2008). he new basis is unitary which ensures the best numerical performance, while minimizing the propagation of errors associated with doing operations on poorly conditioned matrices. he new method enables the separation of global geometric form from periodic undulations and local anomalies. A recognition system of stamped number on metallic surface using moment invariants has been implemented. he classifiers were implemented using Euclidean distance measure. Moments can be applied well not only in the smooth surface approximation for geometric surface inspection but also in the pattern recognition. he results presented here indicate that three types of moment invariants i.e. Hu moments, Zernike moments, and Orthogonal Fourier-Mellin moments are useful for recognizing of the number. In case 262

of the samples without some missing part, the recognition by adding noise salt and pepper could be well done for the Zernike moments. Hu s moment invariants were low performance when applied with noisy image. When the samples with some missing part were applied, OFMM invariants were low recognition rate. However, these moments are suitable for a small size image (Y.Sheng et al. 1994). he Zernike moments were still the best performance. 6. References [1] aweepol Suesut, Peter Schalk, Paul O Leary, Ewald Fauster, Matthew Harker (2007) Real-time Geometric surface Inspection. International Conference on Engineering, Applied Science and echnology, hailand [2] F. Pernkopf and P. O Leary (2003) Image acquisition techniques for automatic visual inspection of metallic surfaces. NDE International, vol. 236, pp.609 617. [3] Paul O Leary, Matthew Harker, aweepol Suesut (2008) Combined Polynomial and Periodic Moments for the Analysis of Measured 3D surfaces.i2mc 2008 International Instrumentation and Measurement echnology Conference,Victoria,Canada [4] Paul O Leary and M. Harker(2009) Discrete polynomial moments for real-time geometric surface inspection. Journal of Electronic Imaging, vol.18, pp. 1 38. [5] M. Eden, M. Unser, and R. Leonardi (1986) Polynomial representation of pictures. Signal Processing vol. 10, pp. 385 393 [6] G. Golub and C. Van Loan (1996) Matrix Computations, 3rd ed. Baltimore: John Hopkins University. [7] R. Mukundan and K. R. Ramakrishnan (1998) Moment functions in image analysis,heory and Applications. Singapore: World Scientific. [8] M.-K. Hu (1962) Visual pattern recognition by moment invariants. IRE ransactions on Information heory, pp. 179 187. [9] Y. Sheng and L. Shen (1994) Orthogonal fourier-mellin moments for invariant patter recognition. Journal of Optical Society of America, vol. 11, pp. 1748 1757. [10]A. Khotanzad and Y. Hong (1990) Invariant image recognition by zernike moments. IEEE ransaction on Pattern Analysis and Machine Intelligence, vol. 12, pp. 489 498, 1990. 263