• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.425-434
• /
• 2004

Pattern recognition in three dimensional image is highly sensitive to assigned value and formation of voxels (pixels for two dimension case). However, occurred while digital imaging, digitization error leads to unpredictable noises in image data. Skeletonization, a powerful tool of pattern recognition, is sensitively dependent on boundary formation. Without successful controlling of the noises, the results of skeletonization can not be allowed as a stable solution. To minimize the effect of noises affecting to boundary formation, we developed a robust processing method useful in skeletonization technique for pattern recognition. Finally, we provide rigorous test results achieved throughout simulation on analytic three dimensional image.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.2
• /
• pp.111-119
• /
• 2013

Face recognition has recently become one of the most popular research areas in the fields of computer vision, machine learning, and pattern recognition because it spans numerous applications, such as access control, surveillance, security, credit-card verification, and criminal identification. In this paper, we propose a simple descriptor called an ECSP(Extended Center-Symmetric Pattern) for illumination-robust face recognition. The ECSP operator encodes the texture information of a local face region by emphasizing diagonal components of a previous CS-LBP(Center-Symmetric Local Binary Pattern). Here, the diagonal components are emphasized because facial textures along the diagonal direction contain much more information than those of other directions. The facial texture information of the ECSP operator is then used as the input image of an image covariance-based feature extraction algorithm such as 2D-PCA(Two-Dimensional Principal Component Analysis). Performance evaluation of the proposed approach was carried out using various binary pattern operators and recognition algorithms on the Yale B database. The experimental results demonstrated that the proposed approach achieved better recognition accuracy than other approaches, and we confirmed that the proposed approach is effective against illumination variation.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.532-535
• /
• 2003

In this paper, we propose a new algorithm that can enhance the speed of template matching of hand vascular pattern person verification or recognition system. Various template matching algorithms have advantages in the matching accuracy, but most of the algorithms suffer from computational burden. To reduce the computational amount, with accuracy maintained, we propose following template matching scenario as follows. firstly, original hand vascular image is re-sampled in order to reduce spatial resolution. Secondly, reconstructed image is projected to vertical and horizontal direction, being converted to two one dimensional (1D) data. Thirdly, converted data is used to estimate spatial discrepancy between stored template image and target image. Finally, matching begins from where the estimated order is highest, and finishes when matching decision function is computed to be over certain threshold. We've applied the proposed algorithm to hand vascular pattern identification application for biometrics, and observed dramatic matching speed enhancement. This paper presents detailed explanation of the proposed algorithm and evaluation results.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.243-248
• /
• 2006

Recognition of sign has been studied to provide convenience tour information for foreigners and strangers through automatic recognition of sign. The sign image database is essential to training the classifier and to intuitive measurement of performance. In this paper, we described the sign image database collected at Jeonju Hanok Village. As to 45 each other sign image, corresponding 50 images are collected under several condition. This database could be important content to study for the field of pattern recognition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.459-466
• /
• 2014

In this paper, we suggest an efficient image processing method for fast paper currency counting with pattern recognition. The patterns are consisted of feature data in each note object extracted from full reflection image of notes and a general contact image sensor(CIS) is used to aggregate the feature images. The proposed pattern recognition algorithm can endure image variation when the paper currency is scanned because it is not sensitive to changes of image resulting in successful note recognition. We tested 100 notes per denomination and currency of several countries including Korea, U.S., China, EU, Britain and Turkey. To ensure the reliability of the result, we tested a total of 10 times per each direction of notes. We can conclude that this algorithm will be applicable to commercial product because of its successful recognition rates. The 100% recognition rates are obtained in almost cases with exceptional case of 99.9% in Euro and 99.8% in Turkish Lira.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1253-1272
• /
• 2010

In this paper, we propose a new affine shape adaptation scheme for the affine invariant feature detector, in which the convergence stability is still an opening problem. This paper examines the relation between the integration scale matrix of next iteration and the current second moment matrix and finds that the convergence stability of the method can be improved by adjusting the relation between the two matrices instead of keeping them always proportional as proposed by previous methods. By estimating and updating the shape of the integration kernel and differentiation kernel in each iteration based on the anisotropy of the current second moment matrix, we propose a coarse-to-fine affine shape adaptation scheme which is able to adjust the pace of convergence and enable the process to converge smoothly. The feature matching experiments demonstrate that the proposed approach obtains an improvement in convergence ratio and repeatability compared with the current schemes with relatively fixed integration kernel.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.40-43
• /
• 1997

This paper presents a 3D object recognition method for generation of 3D environmental map or obstacle recognition of mobile robots. An active light source projects a stripe pattern of light onto the object surface, while the camera observes the projected pattern from its offset point. The system consists of a laser unit and a camera on a pan/tilt device. The line segment in 2D camera image implies an object surface plane. The scaling, filtering, edge extraction, object extraction and line thinning are used for the enhancement of the light stripe image. We can get faithful depth informations of the object surface from the line segment interpretation. The performance of the proposed method has demonstrated in detail through the experiments for varies type objects. Experimental results show that the method has a good position accuracy, effectively eliminates optical noises in the image, greatly reduces memory requirement, and also greatly cut down the image processing time for the 3D object recognition compared to the conventional object recognition.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.6
• /
• pp.797-803
• /
• 2014

In this paper, 3D face recognition system is designed by using polynomial based on RBFNNs. In case of 2D face recognition, the recognition performance reduced by the external environmental factors such as illumination and facial pose. In order to compensate for these shortcomings of 2D face recognition, 3D face recognition. In the preprocessing part, according to the change of each position angle the obtained 3D face image shapes are changed into front image shapes through pose compensation. the depth data of face image shape by using Multiple Point Signature is extracted. Overall face depth information is obtained by using two or more reference points. The direct use of the extracted data an high-dimensional data leads to the deterioration of learning speed as well as recognition performance. We exploit principle component analysis(PCA) algorithm to conduct the dimension reduction of high-dimensional data. Parameter optimization is carried out with the aid of PSO for effective training and recognition. The proposed pattern classifier is experimented with and evaluated by using dataset obtained in IC & CI Lab.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.31-40
• /
• 2012

Face recognition refers to the process of identifying individuals based on their facial features. It has recently become one of the most popular research areas in the fields of computer vision, machine learning, and pattern recognition because it spans numerous consumer applications, such as access control, surveillance, security, credit-card verification, and criminal identification. However, illumination variation on face generally cause performance degradation of face recognition systems under practical environments. Thus, this paper proposes an novel face recognition system using a fusion approach based on local binary pattern and two-dimensional principal component analysis. To minimize illumination effects, the face image undergoes the local binary pattern operation, and the resultant image are divided into two sub-images. Then, two-dimensional principal component analysis algorithm is separately applied to each sub-images. The individual scores obtained from two sub-images are integrated using a weighted-summation rule, and the fused-score is utilized to classify the unknown user. The performance evaluation of the proposed system was performed using the Yale B database and CMU-PIE database, and the proposed method shows the better recognition results in comparison with existing face recognition techniques.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.887-890
• /
• 2012

Image recognition is one of the most important research directions of pattern recognition. Image based road automatic identification technology is widely used in current society, the intelligence has become the trend of the times. This paper studied the image segmentation algorithm theory and its application in road signs recognition system. With the help of image processing technique, respectively, on road signs automatic recognition algorithm of three main parts, namely, image segmentation, character segmentation, image and character recognition, made a systematic study and algorithm. The experimental results show that: the image segmentation algorithm to establish road signs recognition model, can make effective use of smart phone system and application.