• Journal of Service Research and Studies
• /
• v.7 no.1
• /
• pp.41-52
• /
• 2017

This study The purpose of this study is to analyze the effect of relationship factors and technical factors on the logistics performance of logistics companies. As a result of the analysis, information sharing, mutual trust, and mutual benefit of the inter-organizational relationship factors as factors affecting the logistics performance were analyzed as the factors that positively influence the logistics performance. In the technology factor, IT infrastructure and technology reliability are analyzed as factors that positively influence logistics performance, but system operation capacity is analyzed as a factor that does not positively affect logistics performance. Based on the results of this analysis, it can be confirmed that logistics companies can maximize the logistics performance by mutual sharing of information, mutual benefit and trust, and it is also confirmed that technical reliability is also an important factor.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.6
• /
• pp.72-79
• /
• 2017

In this paper, we present a new saliency detection algorithm using the mutual information of wavelet subbands. Our method constructs an intermediate saliency map using the power operation and Gaussian blurring for high-frequency wavelet coefficients. After combining three intermediate saliency maps according to the direction of wavelet subband, we find the main directional components using entropy measure. The amount of mutual information of each subband is obtained centering on the subband having the minimum entropy The final saliency map is detected using Minkowski sum based on weights calculated by the mutual information. As a result of the experiment on CAT2000 and ECSSD databases, our method showed good detection results in terms of ROC and AUC with few computation times compared with the conventional methods.

• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.371-385
• /
• 2017

Jain and Saraswat (2012) introduced new generalized f-information divergence measure, by which we obtained many well known and new information divergences. In this work, we introduce new information inequalities in absolute form on this new generalized divergence by considering convex normalized functions. Further, we apply these inequalities for getting new relations among well known divergences, together with numerical verification. Application to the Mutual information is also presented. Asymptotic approximation in terms of Chi- square divergence is done as well.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.1
• /
• pp.133-142
• /
• 2000

In this note we define typical set and differential entropy for continuous random variables. Using Markov chain, we show that the various properties of the mutual information and entropies (theorems 3.2 and 3.4 ) and show the properties of typical set in continuous random variables( lemma 4.2 and theorem 4.3.)

• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.107.2-107.2
• /
• 2014

The study on non-linear correlation between auxiliary channels in LIGO data has been performed by using mutual information coefficient, generating a correlation map.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.10
• /
• pp.63-68
• /
• 2016

Recently, Biometrics is being magnified than ID or password about user authentication. However, unlike a PIN, password, and personal information there is no way to modify the exposure if it is exposed and used illegally. As FIDO(Fast IDentity Online) than existing server storing method, It stores a user's biometric information to the user device. And the user device authentication using the user's biometric information, the user equipment has been used a method to notify only the authentication result to the server FIDO. However, FIDO has no mutual authentication between the user device and the FIDO server. We use a Certificate Authority in order to mutually authenticate the user and the FIDO server. Thereby, we propose a more reliable method and compared this paper with existed methods about security analysis.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.849-852
• /
• 2014

Reverse engineering of gene regulatory network is a challenging task in computational biology. To detect a regulatory relationship among genes from time series data is called reverse engineering. Reverse engineering helps to discover the architecture of the underlying gene regulatory network. Besides, it insights into the disease process, biological process and drug discovery. There are many statistical approaches available for reverse engineering of gene regulatory network. In our paper, we propose pairwise mutual information for the reverse engineering of a gene regulatory network from time series data. Firstly, we create random boolean networks by the well-known $Erd{\ddot{o}}s-R{\acute{e}}nyi$ model. Secondly, we generate artificial time series data from that network. Then, we calculate pairwise mutual information for predicting the network. We implement of our system on java platform. To visualize the random boolean network graphically we use cytoscape plugins 2.8.0.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1333-1336
• /
• 2015

감성분석은 최근 오피니언 마이닝에서 주목받고 있는 분야로써, 특정 주제, 상품, 유명인사 등에 대한 사람들의 반응을 긍정 또는 부정으로 구분하거나 점수를 이용하여 긍정 또는 부정의 강도를 분석하는데 이용되고 있다. PMI(pointwise mutual information)와 SO-PMI(semantic orientation from pointwise mutual information)는 비교적 빠르고 간편하게 극성을 판단할 수 있다는 장점이 있지만, 어휘와 기준 어휘 사이의 극성 값이 넓은 범위를 갖는다는 단점이 있다. 본 논문에서는 일상적인 언어 사용 환경에서 나타나는 어휘로부터 감성을 분석하고자 하였다. 특히 어휘의 극성 값 편차로 인해 나타날 수 있는 어려움을 보완하기 위해 NPMI(normalized pointwise mutual information)를 이용하여 어휘의 감성을 분석하였다. PMI와 NPMI를 비교 분석한 결과 어휘의 감성 강도를 나타내는 데 있어서 밀집도에서 큰 차이를 보였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.191-196
• /
• 2009

In this paper, we proposed a feature selection method using Binary Particle Swarm Optimization(BPSO) and Mutual information. This proposed method consists of the feature selection part for selecting candidate feature subset by mutual information and the optimal feature selection part for choosing optimal feature subset by BPSO in the candidate feature subsets. In the candidate feature selection part, we computed the mutual information of all features, respectively and selected a candidate feature subset by the ranking of mutual information. In the optimal feature selection part, optimal feature subset can be found by BPSO in the candidate feature subset. In the BPSO process, we used multi-object function to optimize both accuracy of classifier and selected feature subset size. DNA expression dataset are used for estimating the performance of the proposed method. Experimental results show that this method can achieve better performance for pattern recognition problems than conventional ones.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.511-518
• /
• 2007

This paper presents an efficient face recognition method by using both centroid shift and mutual information estimation of images. The centroid shift is to move an image to center coordinate calculated by first moment, which is applied to improve the recognition performance by excluding the needless backgrounds in face image. The mutual information which is a measurements of correlations, is applied to efficiently measure the similarity between images. Adaptive partition mutual information(AP-MI) estimation is especially applied to find an accurate dependence information by equally partitioning the samples of input image for calculating the probability density function(PDF). The proposed method has been applied to the problem for recognizing the 48 face images(12 persons * 4 scenes) of 64*64 pixels. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than a conventional method without centroid shift. The proposed method has also robust performance to changes of facial expression, position, and angle, etc. respectively.