• Korean Journal of Computational Design and Engineering
• /
• v.2 no.3
• /
• pp.142-149
• /
• 1997

This study is intended to develop a Feature based modeler. It is difficult to integrate CAD and CAM/CAPP with information that is given only by a conventional CAD system. Therefore a lot of studies have concentrated on a Feature based CAD system. But conventional Feature based modelers have had limitation on providing sufficient information related to Feature interaction. If a Feature based modeler is to be used in assembly simulation, a new Feature-based modeling method needs to be developed. Also to support collision detection between parts, we have to handle Feature interaction systematically. Therefore we suggest Cell data structure which handles interaction of Features by volume. The volume created by Feature interaction is saved as a Cell. With the Cell structure we solve problems involved with Feature interaction. This study shows how the Cell data structure can manage Feature interaction and give enough information in assembly simulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.105-110
• /
• 2014

Feature-oriented software product line engineering is to develop various products by developing product line core assets in terms of features and composing those features. However, the developed product may not behave correctly if the feature interaction problem has not be properly taken into account during the feature composition. This paper proposes techniques for identifying and modularizing undesirable feature interactions effectively. The scientific calculator product line is used for evaluating the applicability of the proposed method.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.679-688
• /
• 2006

Protein-protein interaction data obtained from high-throughput experiments includes high false positives. In this paper, we introduce a new protein-protein interaction reliability verification system. The proposed system integrates various biological features related with protein-protein interactions, and then selects the most relevant and informative features among them using a feature selection method. To assess the reliability of each protein-protein interaction data, the system construct a classifier that can distinguish true interacting protein pairs from noisy protein-protein interaction data based on the selected biological evidences using a classification technique. Since the performance of feature selection methods and classification techniques depends heavily upon characteristics of data, we performed rigorous comparative analysis of various feature selection methods and classification techniques to obtain optimal performance of our system. Experimental results show that the combination of feature selection method and classification algorithms provide very powerful tools in distinguishing true interacting protein pairs from noisy protein-protein interaction dataset. Also, we investigated the effects on performances of feature selection methods and classification techniques in the proposed protein interaction verification system.

• Journal of KIISE:Software and Applications
• /
• v.33 no.4
• /
• pp.365-377
• /
• 2006

Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein interaction is intrinsic to most cellular processes, prediction of protein interaction is an important issue in post-genomic biology where abundant interaction data have been produced by many research groups. In this paper, we present an associative feature mining method to predict implicit protein-protein interactions of Saccharomyces cerevisiae from public protein interaction data. We discretized continuous-valued features by maximal interdependence-based discretization approach. We also employed feature dimension reduction filter (FDRF) method which is based on the information theory to select optimal informative features, to boost prediction accuracy and overall mining speed, and to overcome the dimensionality problem of conventional data mining approaches. We used association rule discovery algorithm for associative feature and rule mining to predict protein interaction. Using the discovered associative feature we predicted implicit protein interactions which have not been observed in training data. According to the experimental results, the proposed method accomplished about 96.5% prediction accuracy with reduced computation time which is about 29.4% faster than conventional method with no feature filter in association rule mining.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.114-128
• /
• 2008

This study aims to explore the effects of interaction through UCC at online brand communication on scrap intention and visiting loyalty. According to study results, first, only information feature has positive effects on all interactions among quality feature of brand community; Second, confidence and responsiveness feature of brand community has positive effects on the connection feature among elements of interaction; Third, certainty has positive effects on activeness and connection among interaction elements. Fifth, while intention of sharing has positive effects on activeness and connection among interaction elements, it has no effects on the responsiveness. Finally, interaction does not affect the responsiveness of scrap intension, but has positive effects on visiting loyalty.

• The Journal of Korea Robotics Society
• /
• v.3 no.3
• /
• pp.237-244
• /
• 2008

Nowadays, research on human-robot interaction has been getting increasing attention. In the research field of human-robot interaction, speech signal processing in particular is the source of much interest. In this paper, we report a speaker localization system with six microphones for a humanoid robot called MAHRU from KIST and propose a time delay of arrival (TDOA)-based feature matrix with its algorithm based on the minimum sum of absolute errors (MSAE) for sound source localization. The TDOA-based feature matrix is defined as a simple database matrix calculated from pairs of microphones installed on a humanoid robot. The proposed method, using the TDOA-based feature matrix and its algorithm based on MSAE, effortlessly localizes a sound source without any requirement for calculating approximate nonlinear equations. To verify the solid performance of our speaker localization system for a humanoid robot, we present various experimental results for the speech sources at all directions within 5 m distance and the height divided into three parts.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.426-431
• /
• 1997

Features are well recognized to play an important role for the integration of ACD and CAPP. Majority of pervious works for the feature recognition for prismatic part is based on 3D solid model. But in real factories, 2D drawing are used more than 3D drawings. In this paper, we develope an algorithm of the feature recognition on prismatic parts in 2D drawings, using by the graph method and the heuristic algorithm. Previous algorithms have some conflicts at feature interaction. In this paper, elements are grouped into connection by the graph method. Then features are recognized by using these grouped elements and their relationships of front and side-view. For resolving the problem of feature interaction, the element graphs are modified by an deloped algorithm. This algorithm is applied to a CAPP system for milling process planning.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.385-398
• /
• 2021

The complexity of deep learning models affects the real-time performance of gesture recognition, thereby limiting the application of gesture recognition algorithms in actual scenarios. Hence, a residual learning neural network based on a deep convolutional neural network is proposed. First, small convolution kernels are used to extract the local details of gesture images. Subsequently, a shallow residual structure is built to share weights, thereby avoiding gradient disappearance or gradient explosion as the network layer deepens; consequently, the difficulty of model optimisation is simplified. Additional convolutional neural networks are used to accelerate the refinement of deep abstract features based on the spatial importance of the gesture feature distribution. Finally, a fully connected cascade softmax classifier is used to complete the gesture recognition. Compared with the dense connection multiplexing feature information network, the proposed algorithm is optimised in feature multiplexing to avoid performance fluctuations caused by feature redundancy. Experimental results from the ISOGD gesture dataset and Gesture dataset prove that the proposed algorithm affords a fast convergence speed and high accuracy.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.210-218
• /
• 2011

Battiti's mutual information feature selector (MIFS) and its variant algorithms are used for many classification applications. Since they ignore feature synergy, MIFS and its variants may cause a big bias when features are combined to cooperate together. Besides, MIFS and its variants estimate feature redundancy regardless of the corresponding classification task. In this paper, we propose an automated greedy feature selection algorithm called conditional mutual information-based feature selection (CMIFS). Based on the link between interaction information and conditional mutual information, CMIFS takes account of both redundancy and synergy interactions of features and identifies discriminative features. In addition, CMIFS combines feature redundancy evaluation with classification tasks. It can decrease the probability of mistaking important features as redundant features in searching process. The experimental results show that CMIFS can achieve higher best-classification-accuracy than MIFS and its variants, with the same or less (nearly 50%) number of features.

• The Journal of Korea Robotics Society
• /
• v.8 no.2
• /
• pp.104-115
• /
• 2013

For natural human-robot interaction, we need to know location and shape of facial feature in real environment. In order to track facial feature robustly, we can use the method combining particle filter and active appearance model. However, processing speed of this method is too slow. In this paper, we propose two ideas to improve efficiency of this method. The first idea is changing the number of particles situationally. And the second idea is switching the prediction model situationally. Experimental results is presented to show that the proposed method is about three times faster than the method combining particle filter and active appearance model, whereas the performance of the proposed method is maintained.