• Journal of Korea Multimedia Society
• /
• v.18 no.7
• /
• pp.834-842
• /
• 2015

We propose a method to construct composite feature vector based on discriminant analysis for face recognition. For this, we first extract the holistic- and local-features from whole face images and local images, which consist of the discriminant pixels, by using a discriminant feature extraction method. In order to utilize both advantages of holistic- and local-features, we evaluate the amount of the discriminative information in each feature and then construct a composite feature vector with only the features that contain a large amount of discriminative information. The experimental results for the FERET, CMU-PIE and Yale B databases show that the proposed composite feature vector has improvement of face recognition performance.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.45-58
• /
• 1996

This paper describes an a, pp.oach to recognizing composite features of prismatic parts. AAG (Attribute Adjacency Graph) is adopted as the basis of describing basic feature, but it is extended to enhance the expressive power of AAG by adding face type, angles between faces and normal vectors. Our a, pp.oach is called Extended AAG (EAAG). To simplify the recognition procedure, feature classification tree is built using the graph types of EEA and the number of EAD's. Algorithms to find open faces and dimensions of features are exemplified and used in decomposing composite feature. The processing sequence of recognized features is automatically determined during the decomposition process of composite features.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.274-282
• /
• 1998

A feature is a local shape of a product directly related to the manufacturing process. The feature plays a role of the bridge connecting CAD and CAM. In the process planning for he CAM, information on manufacturing is required. To get the a manufacturing information from CAD dat, we need to recognize features. Once features are recognized, they are used as an input for the process planning. In this paper, we thoroughly investigate the composite features, which are generated by interacting simple features. The simple features in the composite feature usually have precedence relation in terms of process sequence. Based on the reason for the precedence relation, we classify the composite features for the process planning. In addition to the precedence relation, approach direction is used as an input for the process planning. In the process planning, the number of set-up orientations are minimized whole process sequence for the features are generated. We propose a process planning algorithm based on the topological sort and breadth-first search of graphs. The algorithn is verified using sample products.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2761-2768
• /
• 2010

In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by projection runlength, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our feature sets was tested by recognition experiments on the handwritten numeral database CENPARMI, where we used SVM with RBF kernel as a classifier. The experimental results showed that each combination of two or three features gave a better performance than a single feature. This means that each single feature works with a different discriminating power and cooperates with other features to enhance the recognition accuracy. By using the composite feature of the three features, we achieved a recognition rate of 98.90%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.129-136
• /
• 2015

We propose a hybrid face recognition to deal with illumination variation. For this, we extract discriminant features by using the different illumination invariant feature extraction methods. In order to utilize both advantages of each method, we evaluate the discriminant power of each feature by using the discriminant distance and then construct a composite feature with only the features that contain a large amount of discriminative information. The experimental results for the Multi-PIE, Yale B, AR and yale databases show that the proposed method outperforms an individual illumination invariant feature extraction method for all the databases.

• Journal of Sensor Science and Technology
• /
• v.10 no.6
• /
• pp.286-294
• /
• 2001

In this study, 3-D underwater object recognition using the self-made 3-3 type composite ultrasonic transducer and modified SOFM(Self Organizing Feature Map) neural network are investigated. Properties of the self-made 3-3 type composite specimens are satisfied considerably with requirements as an underwater ultrasonic transducer's materials. 3-D underwater all object's recognition rates obtained from both the training data and testing data in different objects, such as a rectangular block, regular triangular block, square block and cylinderical block, were 100% and 94.0%, respectively. All object's recognition rates are obtained by utilizing the self-made 3-3 type composite transducer and SOFM neural network. From the object recognition rates, it could be seen that an ultrasonic transducer fabricated with the self-made 3-3 type composite resonator will be able to have application for the underwater object recognition.

• Journal of Biomedical Engineering Research
• /
• v.31 no.6
• /
• pp.481-486
• /
• 2010

In this paper, we suggest an advanced algorithm, to recognize pedestrian/non-pedestrian using differential haar-like feature, which applies Adaboost algorithm to make a strong classification from weak classifications. First, we extract two feature vectors: horizontal haar-like feature and vertical haar-like feature. For the next, we calculate the proposed feature vector using differential haar-like method. And then, a strong classification needs to be obtained from weak classifications for composite recognition method using the differential area of horizontal and vertical haar-like. In the proposed method, we use one feature vector and one strong classification for the first stage of recognition. Based on our experiment, the proposed algorithm shows higher recognition rate compared to the traditional method for the pedestrian and non-pedestrian.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.3
• /
• pp.441-458
• /
• 1996

Many researches on feature recognition have been performed up to now, but the general solution for recognizing arbitrary features has not been developed. The most popular research area in feature recognition is automatic extraction of 2.5 dimensional features, because they are frequently used in manufacturing field. In this paper, a faster and more convenient 2.5 dimensional feature recognition algorithm is proposed using a new strategy which is quite different from the existing ones. The proposed algorithm takes process planning into consideration. The algorithm is implemented in C++. By applying the algorithm to practical complicate examples, we verify that the algorithm is working very well.

• Genomics & Informatics
• /
• v.17 no.4
• /
• pp.39.1-39.20
• /
• 2019

Analyzing patterns in data points embedded in linear and non-linear feature spaces is considered as one of the common research problems among different research areas, for example: data mining, machine learning, pattern recognition, and multivariate analysis. In this paper, data points are heterogeneous sets of biosequences (composite data points). A composite data point is a set of ordinary data points (e.g., set of feature vectors). We theoretically extend the derivation of the largest generalized eigenvalue-based distance metric D_ij(γ₁) in any linear and non-linear feature spaces. We prove that D_ij(γ₁) is a metric under any linear and non-linear feature transformation function. We show the sufficiency and efficiency of using the decision rule $\bar{{\delta}}_{{\Xi}i}$(i.e., mean of D_ij(γ₁)) in classification of heterogeneous sets of biosequences compared with the decision rules min_𝚵iand median_𝚵i. We analyze the impact of linear and non-linear transformation functions on classifying/clustering collections of heterogeneous sets of biosequences. The impact of the length of a sequence in a heterogeneous sequence-set generated by simulation on the classification and clustering results in linear and non-linear feature spaces is empirically shown in this paper. We propose a new concept: the limiting dispersion map of the existing clusters in heterogeneous sets of biosequences embedded in linear and nonlinear feature spaces, which is based on the limiting distribution of nucleotide compositions estimated from real data sets. Finally, the empirical conclusions and the scientific evidences are deduced from the experiments to support the theoretical side stated in this paper.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.363-372
• /
• 2017

This paper presents a novel face recognition algorithm based on the deep convolution neural network and key point detection jointed local binary pattern methodology to enhance the accuracy of face recognition. We firstly propose the modified face key feature point location detection method to enhance the traditional localization algorithm to better pre-process the original face images. We put forward the grey information and the color information with combination of a composite model of local information. Then, we optimize the multi-layer network structure deep learning algorithm using the Fisher criterion as reference to adjust the network structure more accurately. Furthermore, we modify the local binary pattern texture description operator and combine it with the neural network to overcome drawbacks that deep neural network could not learn to face image and the local characteristics. Simulation results demonstrate that the proposed algorithm obtains stronger robustness and feasibility compared with the other state-of-the-art algorithms. The proposed algorithm also provides the novel paradigm for the application of deep learning in the field of face recognition which sets the milestone for further research.