• Journal of Multimedia Information System
• /
• v.6 no.2
• /
• pp.91-98
• /
• 2019

Many researchers have attempted to recognize three-dimensional faces using feature points extracted from two-dimensional facial photographs. However, due to the limit of flat photographs, it is very difficult to recognize faces rotated more than 15 degrees from original feature points extracted from the photographs. As such, it is difficult to create an algorithm to recognize faces in multiple angles. In this paper, it is proposed a new algorithm to recognize three-dimensional face recognition based on feature points extracted from a flat photograph. This method divides into six feature point vector zones on the face. Then, the vector value is compressed and expanded according to the rotation angle of the face to recognize the feature points of the face in a three-dimensional form. For this purpose, the average of the compressibility and the expansion rate of the face data of 100 persons by angle and face zone were obtained, and the face angle was estimated by calculating the distance between the middle of the forehead and the tail of the eye. As a result, very improved recognition performance was obtained at 30 degrees of rotated face angle.

• Journal of the Korean Society for information Management
• /
• v.26 no.3
• /
• pp.261-278
• /
• 2009

Identifying optimal feature sets in Text Categorization(TC) is crucial in terms of improving the effectiveness. In this study, experiments on feature expansion were conducted using author provided keyword sets and article titles from typical scientific journal articles. The tool used for expanding feature sets is WordNet, a lexical database for English words. Given a data set and a lexical tool, this study presented that feature expansion with synonymous relationship was significantly effective on improving the results of TC. The experiment results pointed out that when expanding feature sets with synonyms using on classifier names, the effectiveness of TC was considerably improved regardless of word sense disambiguation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.24-31
• /
• 2001

The K-L expansion is a method for compressing dimensions of features and thus reduces computational cost in recognition process. Also This is well known that features can be extracted without much loss of information in the statistical pattern recognition. In this paper, the method that effectively applies K-L(Karhunen-Loeve) expansion to feature parameters of speech is proposed to improve the recognition accuracy of the Korean speech recognition system. The recognition performance of a novel feature parameters obtained by the proposed method(K-L coefficients) is compared with those of conventional Mel-cepstrum and regressive coefficients through speaker independent connected digits recognition experiments. Experimental results showed that average recognition rates using the K-L coefficients with regression coefficients obtained higher accuracy than conventional Mel-cepstrum with their regression coefficients.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1008-1014
• /
• 2016

Data such as Twitter, Facebook, and customer reviews belong to the informal document group, whereas, newspapers that have grammar correction step belong to the formal document group. Finding consistent rules or patterns in informal documents is difficult, as compared to formal documents. Hence, there is a need for additional approaches to improve informal document analysis. In this study, we classified Twitter data, a representative informal document, into ten categories. To improve performance, we revised and expanded features based on LDA(Latent Dirichlet allocation) word distribution. Using LDA top-ranked words, the other words were separated or bundled, and the feature set was thus expanded repeatedly. Finally, we conducted document classification with the expanded features. Experimental results indicated that the proposed method improved the micro-averaged F1-score of 7.11%p, as compared to the results before the feature expansion step.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.4
• /
• pp.560-566
• /
• 2008

Today, as the power trades between generation companies and power customer are liberalized, the uncertainty level of operated power system is rapidly increased. Therefore, transmission operators as decision makers for transmission expansion are required to establish a deliberate investment plan for effective operations of transmission facilities considering forecasted conditions of power system. This paper proposes the methodology for the optimal solution of transmission expansion in deregulated power system. The paper obtains the expected value of transmission congestion cost for various scenarios by using occurrence probability. In addition, the paper assumes that increasing rates of loads are the probability distribution and indicates the location of expanded transmission line, the time for transmission expansion with the minimum cost for the future by performing the Montecarlo simulation. To minimize the investment risk as the variance of the congestion cost, Mean-Variance Markowitz portfolio theory is applied to the optimization model by the penalty factor of the variance. By the case study, the optimal solution for transmission expansion plan considering the feature of market participants is obtained.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.173-177
• /
• 2018

Masks are generated by adding different fonts of learning data characters in pixel unit, and pixel values belonging to each of the masks are divided into 3 groups. Using the directional expansion operators, we expand the text area of the test data character into 4 diagonal directions in order to create the boundary areas to distinguish it from the background area. A mask with a minimum average discordance is selected as the final recognition result by calculating the degree of discordance between the expanded test data and the masks. Image comparison using directional expansion operations more accurately recognizes test data through 4 subdivided recognition processes. It is also possible to expand the ranges of 3 groups of pixel values of masks more evenly such that new fonts can easily be added to the given learning data.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1680-1691
• /
• 2004

One of the representative methods of optical flow is a gradient method which estimates the movement of an object based on the differential of image brightness. However, the method is ineffective for large displacement of the object and many improved methods have been proposed to copy with such limitations. One of these improved techniques is the multigrid processing, which is used in many optical flow algorithms. As an alternative novel technique we have been proposing an orthogonal functional expansion method, where whole displacements are expanded from low frequency terms. This method is expected to be applicable to flow estimation with large displacement and deformation including expansion and contraction, which are difficult to cope with by conventional optical flow methods. In the orthogonal functional expansion method, the apparent displacement field is calculated iteratively by a projection method which utilizes derivatives of the invariant constraint equations of brightness constancy. One feature of this method is that differentiation of the input image is not necessary, thereby reducing sensitivity to noise. In this paper, we apply our method to several real images in which the objects undergo large displacement and/or deformation including expansion. We demonstrate the effectiveness of the orthogonal functional expansion method by comparing with conventional methods including our optimally scaled multigrid optical flow algorithm.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.2
• /
• pp.54.1-54.1
• /
• 2019

We use iterative smoothing reconstruction method along with exploring in the parameter space of the light curves of the JLA supernova compilation (Joint Light-curve Analysis) to simultaneously reconstruct the expansion history of the universe as well as putting constrains on the light curve parameters without assuming any cosmological model. Our constraints on the light curve parameters of the JLA from our model-independent analysis seems to be closely in agreement with results assuming ΛCDM cosmology or using Chevallier-Polarski-Linder (CPL) parametrization for the equation of state of dark energy. This implies that there is no hidden significant feature in the data that could be neglected by cosmology model assumption. The reconstructed expansion history of the universe and properties of dark energy seems to be in good agreement with expectations of the standard ΛCDM model. Our results also indicate that the data allows a considerable flexibility for expansion history of the universe.

• Journal of Biomedical Engineering Research
• /
• v.43 no.6
• /
• pp.441-447
• /
• 2022

In this paper, we propose a pill identification model using engraved text feature and image feature such as shape and color, and compare it with an identification model that does not use engraved text feature to verify the possibility of improving identification performance by improving recognition rate of the engraved text. The data consisted of 100 classes and used 10 images per class. The engraved text feature was acquired through Keras OCR based on deep learning and 1D CNN, and the image feature was acquired through 2D CNN. According to the identification results, the accuracy of the text recognition model was 90%. The accuracy of the comparative model and the proposed model was 91.9% and 97.6%. The accuracy, precision, recall, and F1-score of the proposed model were better than those of the comparative model in terms of statistical significance. As a result, we confirmed that the expansion of the range of feature improved the performance of the identification model.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2
• /
• pp.40-48
• /
• 1996

In this paper, a 40 dimensional segment vector with 4 frame and 7 frame width in every monosyllable interval was compressed into a 10, 14, 20 dimensional vector using K-L expansion and neural networks, and these was used to speech recognition feature parameter for CHMM. And we also compared them with CHMM added as feature parameter to the discrete duration time, the regression coefficients and the mixture distribution. In recognition test at 100 monosyllable, recognition rates of CHMM +${\bigtriangleup}$MCEP, CHMM +MIX and CHMM +DD respectively improve 1.4%, 2.36% and 2.78% over 85.19% of CHMM. And those using vector compressed by K-L expansion are less than MCEP + ${\bigtriangleup}$MCEP but those using K-L + MCEP, K-L + ${\bigtriangleup}$MCEP are almost same. Neural networks reflect more the speech dynamic variety than K-L expansion because they use the sigmoid function for the non-linear transform. Recognition rates using vector compressed by neural networks are higher than those using of K-L expansion and other methods.