• Phonetics and Speech Sciences
• /
• v.1 no.1
• /
• pp.41-46
• /
• 2009

Duration of the preceding vowel is known to vary as a function of the (phonological or phonetic) voicing feature of the following consonant. This study raises a question against this general belief. A spectrographic experiment using 14 Korean obstruents (three sets of stops: /p, p', $p^h$/, /t, t', $t^h$/, /k, k', $k^h$/; one set of affricates: /c, c', $c^h$/; one set of fricatives: /s, s'/) reveals that (1) phonetic voicing in the intervocalic lax consonants /p, t, k, c, s/ has nothing to do with the duration of the preceding vowel; (2) vowel length is significantly shorter before tense consonants than before their lax cognates while tense consonants are significantly longer than their lax cognates. Importantly, Korean obstruents are all phonologically voiceless. Therefore, the voicing feature is rejected as the cause of preconsonantal vowel shortening in Korean both phonetically and phonologically. It is suggested that the temporal phenomenon is basically a kind of physiologically-motivated coarticulation though it is restricted by the phonology of a given language. To meet this assumption, the feature voicing should be replaced with the feature tenseness as the cause, which will enable us to explain the temporal phenomenon on the same basis irrespective of language.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.28-34
• /
• 2012

Various feature extraction algorithms are widely applied to real-time image processing applications for extracting significant features from images. Feature extraction algorithms are mostly combined with image processing algorithms mostly for image tracking and recognition. Feature extraction function is used to supply feature information to the other image processing algorithms and it is mainly implemented in a preprocessing stage. Nowadays, image processing applications are faced with embedded system implementation for a real-time processing. In order to satisfy this requirement, it is necessary to reduce execution time so as to improve the performance. Reducing the time for executing a feature extraction function dose not only extend the execution time for the other image processing algorithms, but it also helps satisfy a real-time requirement. This paper explains FAST (Feature from Accelerated Segment Test algorithm) of E. Rosten and presents FPGA-based embedded hardware accelerator architecture. The proposed acceleration scheme can be implemented by using approximately 2,217 Flip Flops, 5,034 LUTs, 2,833 Slices, and 18 Block RAMs in the Xilinx Vertex IV FPGA. In the Modelsim - based simulation result, the proposed hardware accelerator takes 3.06 ms to extract 954 features from a image with $640{\times}480$ pixels and this result shows the cost effectiveness of the propose scheme.

• Convergence Security Journal
• /
• v.17 no.3
• /
• pp.51-57
• /
• 2017

VOD service provides an additional revenue for broadcasting companies in addition to the existing subscription fees and advertisement-based revenue. Therefore, each broadcasting company develops its own VOD service and performs frequent improvement work. This leads to the development of new VOD services, so developers are considering ways to effectively handle the frequent development needs. In this background, we conducted an underlying research to apply the feature-oriented analysis model to the development of VOD service. The feature-oriented analysis model used in this study is the Feature-Oriented Domain Analysis (FODA) developed by SEI of Carnegie Mellon University. FODA provides a tool for specifying a feature model of a software domain, based on which developers determine the configuration of a software with customers. This study developed a feature model of the VOD service domain and devised the functionalities and testcases in an integrated manner with the feature model. Additionally, we proposed a VOD service development process utilizing the feature model, function specification, and testcases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.115-120
• /
• 2014

Many product line engineering methods use the feature model to structure commonality and variability among products in terms of features and to derive a product feature configuration, which is the set of features required for the development of a product. Features to be selected during product derivation are mainly determined based on the quality attributes required for a product. Most methods published so far derived an optimal product feature configuration through linear co-relationship between features and quality attributes. However, the co-relationship between features and quality attributes can be formulated as a non-linear function because of feature interactions. This paper proposes a method that derives an optimal product feature configuration considering feature interactions. Four product line cases are used to validate the proposed methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.733-744
• /
• 2016

The legacy methods for converting a business model to a feature model make it difficult to support an automatic transformation due to a dependence on a domain analyzers' intuitions, which hinders the feature oriented development for the integration of feature modeling in business modeling. This paper proposes a method for converting a BPMN business model into a feature model based on syntax. To allow the conversion between the heterogeneous models from BPMN to the FM(Feature Model), it defines the grouping mechanism based activities' syntax, and then makes translation rules and a method based on the element (represent business function) and structure (relationships and process among elements), which are common constructs of their models. This method was applied to an online shopping mall system as a case study. With this mechanism, it will help develop a mechanical or automated structure transformation from the BPMN model to the FM.

• 한국경영정보학회:학술대회논문집
• /
• 2007.06a
• /
• pp.608-613
• /
• 2007

Prediction of corporate bankruptcies has long been an important topic and has been studied extensively in the finance and management literature because it is an essential basis for the risk management of financial institutions. Recently, support vector machines (SVMs) are becoming popular as a tool for bankruptcy prediction because they use a risk function consisting of the empirical error and a regularized term which is derived from the structural risk minimization principle. In addition, they don't require huge training samples and have little possibility of overfitting. However. in order to Use SVM, a user should determine several factors such as the parameters ofa kernel function, appropriate feature subset, and proper instance subset by heuristics, which hinders accurate prediction results when using SVM In this study, we propose a novel hybrid SVM classifier with simultaneous optimization of feature subsets, instance subsets, and kernel parameters. This study introduces genetic algorithms (GAs) to optimize the feature selection, instance selection, and kernel parameters simultaneously. Our study applies the proposed model to the real-world case for bankruptcy prediction. Experimental results show that the prediction accuracy of conventional SVM may be improved significantly by using our model.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.393-396
• /
• 1995

In this syudy, the researches classifying the artificial and natural flaws in welding parts are performed using the smart pattern recognition technology. For this purpose the smart signal pattern recognition package including the user defined function was developed and the total procedure including the digital signal processing,feature extraction , feature selection and classifier selection is treated by bulk. Specially it is composed with and discussed using the statistical classifier such as the linear disciminant function classifier, the empirical Bayesian classifier. Also, the smart pattern recognition technology is applied to classification problem of natural flaw(i.e multiple classification problem-crack,lack of penetration,lack of fusion,porosity,and slag inclusion, the planar and volumetric flaw classification problem). According to this results, if appropriately learned the neural network classifier is better than ststistical classifier in the classification problem of natural flaw. And it is possible to acquire the recognition rate of 80% above through it is different a little according to domain extracting the feature and the classifier.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.3
• /
• pp.182-187
• /
• 2003

In this thesis, we propose the algorithm to improve the performance of speaker verification that is mapping feature parameters by using RBF neural network. There is a big difference between wire vector region and wireless one which comes from the same speaker. For wire/wireless speakers model production, speaker verification system should distinguish the wire/wireless channel that based on speech recognition system. And the feature vector of untrained channel models is mapped to the feature vector(LPC Cepstrum) of trained channel model by using RBF neural network. As a simulation result, the proposed algorithm makes 0.6%∼10.5% performance improvement compared to conventional method such as cepstral mean subtraction.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.3
• /
• pp.521-526
• /
• 2020

This paper presents an improved HOLP neural network that adds 25 average values to a typical HOLP neural network using 25 feature vector values as input values by applying high-order local autocorrelation function, which is excellent for extracting immutable feature values of iris images. Compared with deep learning structures with different types, we compared the recognition rate of iris recognition using Back-Propagation neural network, which shows excellent performance in voice and image field, and synthetic product neural network that integrates feature extractor and classifier.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.7
• /
• pp.1064-1073
• /
• 2015

In this study, we introduce the pedestrian detection system by using the feature of HOG-PCA and RBFNNs pattern classifier. HOG(Histogram of Oriented Gradient) feature is extracted from input image to identify and recognize a object. And a dimension is reduced for improving performance as well as processing speed by using PCA which is a typical dimensional reduction algorithm. So, the feature of HOG-PCA through the dimensional reduction by using PCA leads to the improvement of the detection rate. FCM clustering algorithm is used instead of gaussian function to apply the characteristic of input data as well and connection weight is used by polynomial expression such as constant, linear, quadratic and modified quadratic. Finally, INRIA person database known as one of the benchmark dataset used for pedestrian detection is applied for the performance evaluation of the proposed classifier. The experimental result of the proposed classifier are compared with those studied by Dalal.