• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.649-655
• /
• 2006

This paper proposes a HMM-based recognition method using DMSVQ(Dynamic Multi-Section Vector Quantization) codebook by DMS model and double spectral feature, as a method on the speech recognition of speaker-independent. LPC cepstrum parameter is used as a instantaneous spectral feature and LPC cepstrum's regression coefficient is used as a dynamic spectral feature These two spectral features are quantized as each VQ codebook. HMM using DMS model is modeled by receiving instantaneous spectral feature and dynamic spectral feature by input. Other experiments to compare with the results of recognition experiments using proposed method are implemented by the various conventional recognition methods under the equivalent environment of data and conditions. Through the experiment results, it is proved that the proposed method in this paper is superior to the conventional recognition methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4658-4679
• /
• 2017

Android is now the most popular smartphone platform and remains rapid growth. There are huge number of sensitive privacy information stored in Android devices. Kinds of methods have been proposed to detect Android malicious applications and protect the privacy information. In this work, we focus on extracting the fine-grained features to maximize the information of Android malware detection, and selecting the least joint features to minimize the number of features. Firstly, permissions and APIs, not only from Android permissions and SDK APIs but also from the developer-defined permissions and third-party library APIs, are extracted as features from the decompiled source codes. Secondly, feature selection methods, including information gain (IG), regularization and particle swarm optimization (PSO) algorithms, are used to analyze and utilize the correlation between the features to eliminate the redundant data, reduce the feature dimension and mine the useful joint features. Furthermore, regularization and PSO are integrated to create a new joint feature mining method. Experiment results show that the joint feature mining method can utilize the advantages of regularization and PSO, and ensure good performance and efficiency for Android malware detection.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.432-443
• /
• 2005

Recent three-dimensional feature-based CAD systems based on solid or non-manifold modelling functionality have been widely used for product design in manufacturing companies. When product models associated with features are used in various downstream applications such as analysis, however, simplified and abstracted models at various levels of detail (LODs) are frequently more desirable and useful than the full detailed model. To provide multi-resolution models, the features need to be rearranged according to a criterion that measures the significance of the feature. However, if the features are rearranged, the resulting shape is possibly different from the original because union and subtraction Boolean operations are not commutative. To solve this problem, in this paper, the new concept of the effective zone of a feature is defined and identified using Boolean algebra. By introducing the effective zone, an arbitrary rearrangement of features becomes possible and arbitrary LOD criteria may be selected to suit various applications. Besides, because the effective zone of a feature is independent of the data structure of the model, the multi-resolution modelling algorithm based on the effective zone can be implemented on any 3D CAD system based on conventional solid representations as well as non-manifold topological (NMT) representations.

• ETRI Journal
• /
• v.33 no.4
• /
• pp.589-599
• /
• 2011

This paper presents an image description and matching scheme using synthetic features for a recommendation service. The recommendation service is an example of smart search because it offers something before a user's request. In the proposed extraction scheme, an image is described by synthesized spatial and statistical features. The spatial feature is designed to increase the discriminability by reflecting delicate variations. The statistical feature is designed to increase the robustness by absorbing small variations. For extracting spatial features, we partition the image into concentric circles and extract four characteristics using a spatial relation. To extract statistical features, we adapt three transforms into the image and compose a 3D histogram as the final statistical feature. The matching schemes are designed hierarchically using the proposed spatial and statistical features. The result shows that each feature is better than the compared algorithms that use spatial or statistical features. Additionally, if we adapt the proposed whole extraction and matching scheme, the overall performance will become 98.44% in terms of the correct search ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4028-4042
• /
• 2021

Aiming at the problem of software defect prediction difficulty caused by insufficient software defect marker samples and unbalanced classification, a semi-supervised software defect prediction model based on a tri-training algorithm was proposed by combining feature normalization, over-sampling technology, and a Tri-training algorithm. First, the feature normalization method is used to smooth the feature data to eliminate the influence of too large or too small feature values on the model's classification performance. Secondly, the oversampling method is used to expand and sample the data, which solves the unbalanced classification of labelled samples. Finally, the Tri-training algorithm performs machine learning on the training samples and establishes a defect prediction model. The novelty of this model is that it can effectively combine feature normalization, oversampling techniques, and the Tri-training algorithm to solve both the under-labelled sample and class imbalance problems. Simulation experiments using the NASA software defect prediction dataset show that the proposed method outperforms four existing supervised and semi-supervised learning in terms of Precision, Recall, and F-Measure values.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.1
• /
• pp.63-69
• /
• 2018

Bearing is an essential component in many rotary machineries. To prevent its unpredicted failures and undesired downtime cost, many researches have been made in the field of Prognostics and Health Management(PHM), in which the key issue is to establish a proper feature reflecting its current health state properly at the early stage. However, conventional features have shown some limitations that make them less useful for early diagnostics and prognostics because it tends to increase abruptly at the end of life. This paper proposes a new feature extraction method using the envelope analysis and weighted sum with correlation coefficient. The developed method is demonstrated using the IMS bearing data given by NASA Ames Prognostics Data Repository. Results by the proposed feature are compared with those by conventional approach.

• Journal of Korea Game Society
• /
• v.11 no.2
• /
• pp.161-166
• /
• 2011

In this paper, we propose a novel background segmentation and feature point extraction method of a human motion for the augmented reality game. First, our method transforms input image from RGB color space to HSV color space, then segments a skin colored area using double threshold of H, S value. And it also segments a moving area using the time difference images and then removes the noise of the area using the Hessian affine region detector. The skin colored area with the moving area is segmented as a human motion. Next, the feature points for the human motion are extracted by calculating the center point for each block in the previously obtained image. The experiments on various input images show that our method is capable of correct background segmentation and feature points extraction 12 frames per second.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.207-213
• /
• 2019

In this paper, we propose a low-complexity feature detection algorithm for object tracking and present hardware architecture design and implementation results for real-time processing. The existing Shi-Tomasi algorithm shows good performance in object tracking applications, but has a high computational complexity. Therefore, we propose an efficient feature detection algorithm, which can reduce the operational complexity with the similar performance to Shi-Tomasi algorithm, and present its real-time implementation results. The proposed feature detector was implemented with 1,307 logic slices, 5 DSP 48s and 86.91Kbits memory with FPGA. In addition, it can support the real-time processing of 54fps at an operating frequency of 114MHz for $1920{\times}1080FHD$ images.

• Journal of Biomedical Engineering Research
• /
• v.28 no.1
• /
• pp.8-16
• /
• 2007

Finite element analysis (FEA) is an effective means for the analysis of bioelectromagnetism. It has been successfully applied to various problems over conventional methods such as boundary element analysis and finite difference analysis. However, its utilization has been limited due to the overwhelming computational load despite of its analytical power. We have previously developed a novel mesh generation scheme that produces FE meshes that are content-adaptive to given MR images. MRI content-adaptive FE meshes (cMeshes) represent the electrically conducting domain more effectively with far less number of nodes and elements, thus lessen the computational load. In general, the cMesh generation is affected by the quality of feature maps derived from MRI. In this study, we have tested various feature maps created based on the improved differential geometry measures for more effective cMesh head models. As performance indices, correlation coefficient (CC), root mean squared error (RMSE), relative error (RE), and the quality of cMesh triangle elements are used. The results show that there is a significant variation according to the characteristics of specific feature maps on cMesh generation, and offer additional choices of feature maps to yield more effective and efficient generation of cMeshes. We believe that cMeshes with specific and improved feature map generation schemes should be useful in the FEA of bioelectromagnetic problems.

• The Journal of the Korea Contents Association
• /
• v.19 no.1
• /
• pp.125-131
• /
• 2019

A vanishing point is a point on an image to which parallel lines projected from a real space gather. A vanishing point in a road space provides important spatial information. It is possible to improve the position of an extracted lane or generate a depth map image using a vanishing point in the road space. In this paper, we propose a method of detecting vanishing points on images taken from a vehicle's point of view using Deep Neural Network (DNN) and Histogram of Oriented Gradient (HoG). The proposed algorithm is divided into a HoG feature extraction step, in which the edge direction is extracted by dividing an image into blocks, a DNN learning step, and a test step. In the learning stage, learning is performed using 2,300 road images taken from a vehicle's point of views. In the test phase, the efficiency of the proposed algorithm using the Normalized Euclidean Distance (NormDist) method is measured.