• Korean Journal of Computational Design and Engineering
• /
• v.4 no.1
• /
• pp.43-51
• /
• 1999

Producing the relevant information (features) from the CAD models of CAM, called feature recognition or extraction, is the essential stage for the integration of CAD and CAM. Most feature recognition methods, however, have problems in the recognition of intersecting features because they do not handle the intersection geometry properly. In this paper, we propose a machining feature recognition algorithm, which has a solid model consisting of orthogonal primitives as input. The algorithm calculates candidate features and constitutes the Intersection Geometry Matrix which is necessary to represent the spatial relation of candidate features. Finally, it recognizes machining features from the proposed candidate features dividing and growing systems using half space and Boolean operation. The algorithm has the following characteristics: Though the geometry of part is complex due to the intersections of design primitives, it can recognize the necessary machining features. In addition, it creates the Maximal Feature Volumes independent of the machining sequences at the feature recognition stage so that it can easily accommodate the change of decision criteria of machining orders.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.65 no.2
• /
• pp.130-135
• /
• 2016

Gait recognition has advantage of non-contact type recognition. But It has disadvantage of low recognition rate when the pedestrian silhouette is changed due to bag or coat. In this paper, we proposed new method using combination of gait energy image feature and thermal face image feature. First, we extracted a face image which has optimal focusing value using human body rate and Tenengrad algorithm. Second step, we extracted features from gait energy image and thermal face image using linear discriminant analysis. Third, calculate euclidean distance between train data and test data, and optimize weights using genetic algorithm. Finally, we compute classification using nearest neighbor classification algorithm. So the proposed method shows a better result than the conventional method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.781-784
• /
• 2014

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we use Affine SIFT to detect affine invariant local descriptors for face recognition under large viewpoint change. Affine SIFT is an extension of SIFT algorithm. SIFT algorithm is scale and rotation invariant, which is powerful for small viewpoint changes in face recognition, but it fails when large viewpoint change exists. In our scheme, Affine SIFT is used for both gallery face and probe face, which generates a series of different viewpoints using affine transformation. Therefore, Affine SIFT allows viewpoint difference between gallery face and probe face. Experiment results show our framework achieves better recognition accuracy than SIFT algorithm on FERET database.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.345-350
• /
• 2018

This study is an algorithm for detecting vein pattern features important for finger vein recognition. The feature detection algorithm is important because it greatly affects recognition results in pattern recognition. The recognition rate is degraded because the reference is changed according to the finger position change. In addition, the image obtained by irradiating the finger with infrared light is difficult to separate the image background and the blood vessel pattern, and the detection time is increased because the image preprocessing process is performed. For this purpose, the presented algorithm can be performed without image preprocessing, and the detection time can be reduced. SWDA (Down Slope Trace Waveform) algorithm is applied to the finger vein images to detect the fingertip position and vein pattern. Because of the low infrared transmittance, relatively dark vein images can be detected with minimal detection error. In addition, the fingertip position can be used as a reference in the classification stage to compensate the decrease in the recognition rate. If we apply algorithms proposed to various recognition fields such as palm and wrist, it is expected that it will contribute to improvement of biometric feature detection accuracy and reduction of recognition performance time.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.10a
• /
• pp.271-276
• /
• 2003

In this study, we compared backpropagation neural network(BPNN) with probabilistic neural network(PNN) as shape recognition algorithm of welding flaws. For this purpose, variables are applied the same to two algorithm. Here, feature variable is composed of time domain signal itself and frequency domain signal itself, Through this process, we comfirmed advantages/disadvantages of two algorithms and identified application methods of two algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.58-65
• /
• 1992

In this paper new back propagation algorithm which adds neurons to hidden layer is proposed. this proposed algorithm is applied to the pattern recognition of written number coupled with back propagation algorithm through omitting redundant learning. Learning rate and recognition rate of the proposed algorithm are compared with those of the conventional back propagation algorithm and the back propagation through omitting redundant learning. The learning rate of proposed algorithm is 4 times as fast as the conventional back propagation algorithm and 2 times as fast as the back propagation through omitting redundant learning. The recognition rate is 96.2% in case of the conventional back propagation algorithm, 96.5% in case of the back propagation through omitting redundant learning and 97.4% in the proposed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.371-376
• /
• 2007

This paper presents an emotion recognition and its expression system of an intelligent robot like a home robot or a service robot. Emotion recognition method in the robot is used by a facial image. We use a motion and a position of many facial features. apply a tracking algorithm to recognize a moving user in the mobile robot and eliminate a skin color of a hand and a background without a facial region by using the facial region detecting algorithm in objecting user image. After normalizer operations are the image enlarge or reduction by distance of the detecting facial region and the image revolution transformation by an angel of a face, the mobile robot can object the facial image of a fixing size. And materialize a multi feature selection algorithm to enable robot to recognize an emotion of user. In this paper, used a multi layer perceptron of Artificial Neural Network(ANN) as a pattern recognition art, and a Back Propagation(BP) algorithm as a learning algorithm. Emotion of user that robot recognized is expressed as a graphic LCD. At this time, change two coordinates as the number of times of emotion expressed in ANN, and change a parameter of facial elements(eyes, eyebrows, mouth) as the change of two coordinates. By materializing the system, expressed the complex emotion of human as the avatar of LCD.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.7
• /
• pp.685-692
• /
• 2016

In this paper, we not only take advantage of the SIFT features in banknote recognition, which has robustness to illumination changes, geometric rotation as well as scale changes, but also propose the hierarchical banknote recognition algorithm, which comprised of feature vector extraction from the frame grabbed image of the banknotes, and matching to the prepared data base of multinational banknotes by ANN algorithm. The images of banknote under the developed UV, IR and white illumination are used so as to extract the SIFT features peculiar to each banknotes. These SIFT features are used in recognition of the nationality as well as face value. We confirmed successful function of the proposed algorithm by applying the proposed algorithm to the banknotes of Korean and USD as well as EURO.

• Journal of Convergence for Information Technology
• /
• v.7 no.2
• /
• pp.77-82
• /
• 2017

In this paper, a new security algorithm to recognize the type of the vehicle with the vehicle image as a input image is suggested. The vehicle recognition security algorithm is composed of five core parts, such as the input image, background removal, edge areas extraction, pre-processing(binarization), and the vehicle recognition. Therefore, the final recognition rate of the security algorithm for vehicle type recognition can be affected by the function and efficiency of each step. After inputting image into a gray scale image and removing backgrounds, the binarization is performed by extracting only the edge region. After the pre-treatment process for making outlines clear, the type of vehicles is categorized into large vehicles, passenger cars and motorcycles through the ratio of height and width of the vehicle.

• International Journal of Advanced Culture Technology
• /
• v.6 no.2
• /
• pp.123-128
• /
• 2018

Learning data is composed of 100 characters with 10 different fonts, and test data is composed of 10 characters with a new font that is not used for the learning data. In order to consider the variety of learning data with several different fonts, 10 learning masks are constructed by accumulating pixel values of same characters with 10 different fonts. This process eliminates minute difference of characters with different fonts. After finding maximum values of learning masks, test data is expanded by multiplying these maximum values to the test data. The algorithm calculates sum of differences of two corresponding pixel values of the expanded test data and the learning masks. The learning mask with the smallest value among these 10 calculated sums is selected as the result of the recognition process for the test data. The proposed algorithm can recognize various types of fonts, and the learning data can be modified easily by adding a new font. Also, the recognition process is easy to understand, and the algorithm makes satisfactory results for character recognition.