• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.426-428
• /
• 2012

In order to identify proteins that are present in biological samples, these samples are separated and analyzed under the sequential procedure as follows: protein purification and digestion, peptide fragmentation by tandem mass spectrometry (MS/MS) which breaks peptides into fragments, peptide identification, and protein identification. One of the widely used methods for protein identification is based on probabilistic approaches such as ProteinProphet and BaysPro. However, they do not consider the difference in peptide identification probabilities according to their length. Here, we propose a probabilistic graphical model-based approach to protein identification from MS/MS data considering peptide identification probabilities, number of sibling peptides, and peptide length. We compared our approach with ProteinProphet using a yeast MS/MS dataset. As a result, our model identified 27 more proteins than ProteinProphet at 1% of FDR (false discovery rate), confirming the importance of peptide length information in protein identification.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.12 no.3
• /
• pp.451-456
• /
• 2017

Semantic segmentation, which is the most basic and complicated problem in computer vision, classifies each pixel of an image into a specific object and performs a task of specifying a label. MRF and CRF, which have been studied in the past, have been studied as effective methods for improving the accuracy of pixel level labeling. In this paper, we propose a semantic partitioning method that combines CNN, a kind of deep running, which is in the spotlight recently, and CRF, a probabilistic model. For learning and performance verification, Pascal VOC 2012 image database was used and the test was performed using arbitrary images not used for learning. As a result of the study, we showed better partitioning performance than existing semantic partitioning algorithm.

• Journal of Convergence for Information Technology
• /
• v.9 no.8
• /
• pp.35-44
• /
• 2019

The purpose of this study is to find out quantitative vulnerability assessment about COTS(Commercial Off The Shelf) O/S based I&C System. This paper analyzed vulnerability's lifecycle and it's impact. this paper is to develop a quantitative assessment of overall cyber security risks and vulnerabilities I&C System by studying the vulnerability analysis and prediction method. The probabilistic vulnerability assessment method proposed in this study suggests a modeling method that enables setting priority of patches, threshold setting of vulnerable size, and attack path in a commercial OS-based measurement control system that is difficult to patch an immediate vulnerability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1946-1956
• /
• 2001

In this paper, we propose a novel 2-D partial matching algorithm based on model-based stochastic analysis of feature correspondences in a relation vector space, which is quite robust to shape variations as well as invariant to geometric transformations. We represent an object using the ARG (Attributed Relational Graph) model with features of a set of relation vectors. In addition, we statistically model the partial occlusion or noise as the distortion of the relation vector distribution in the relation vector space. Our partial matching algorithm consists of two-phases. First, a finite number of candidate sets areselected by using logical constraint embedding local and structural consistency Second, the feature loss detection is done iteratively by error detection and voting scheme thorough the error analysis of relation vector space. Experimental results on real images demonstrate that the proposed algorithm is quite robust to noise and localize target objects correctly even inseverely noisy and occluded scenes.

• The Korean Journal of Applied Statistics
• /
• v.21 no.2
• /
• pp.183-200
• /
• 2008

Research for efficient management of the National Pension has been emphasized as the current society trends toward aging and low birth rate. In this article, we suggest a statistical model for effective classification and prediction of the reserve for the survivor's pension in Korea. Logistic regression model is incorporated; correct classification rate, and distribution of the posterior probability for the reserve of survivor's pension are investigated and compared with the results from the general logistic models. Assessment of predictive model is also done with lift graph, ROC curve and K-S statistic. We suggest strategies for reducing financial risks in managing and planning the pension as an application of the suggested model.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.94-99
• /
• 2015

With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.138-149
• /
• 2018

In this paper, we propose a system model which effectively mitigates impulsive noise that degrades the performance of power line communication. Recently, deep learning have shown effective performance improvement in various fields. In order to mitigate effective impulsive noise, we applied a convolution neural network which is one of deep learning algorithm to conventional system. Also, we used a successive interference cancellation scheme to mitigate impulsive noise generated from multi-users. We simulate the proposed model which can be applied to the power line communication in the Section V. The performance of the proposed system model is verified through bit error probability versus SNR graph. In addition, we compare ZF and MMSE successive interference cancellation scheme, successive interference cancellation with optimal ordering, and successive interference cancellation without optimal ordering. Then we confirm which schemes have better performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1161-1168
• /
• 2002

In this paper, the throughput performance of an ARQ scheme is analyzed with noisy feedback channel, in order to exactly analysis for performance of an ARQ scheme. An ARQ mechanism is presented by state diagram, and the throughput of an ARQ scheme is mathematically derived using generation function for a signal flow graph. The channel is modeled by the Nakagami-m fading channel which is distributed over far and wide, and the throughput performance of an ARQ scheme, which is applied in BPSK and BFSK systems, according to feedback gain and fading index m is analyzed through computer simulation. In the results, It is shown conformed that the throughput of an ARQ scheme decreased according to the increase of the noise for feedback channel, but it increased according to the increase of the feedback gain and fading index m. Also, it is shown that the throughput of an ARQ scheme using BPSK system is superior to BFSK system because of the difference of bit error probability between BPSK and BFSK systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.477-481
• /
• 2008

Place recognition is necessary for a mobile user to be provided with place-dependent information. This paper proposes real-time video based place recognition system that identifies users' current place while moving in the building. As for the feature extraction of a scene, there have been existing methods based on global feature analysis that has drawback of sensitive-ness for the case of partial occlusion and noises. There have also been local feature based methods that usually attempted object recognition which seemed hard to be applied in real-time system because of high computational cost. On the other hand, researches using statistical methods such as HMM(hidden Markov models) or bayesian networks have been used to derive place recognition result from the feature data. The former is, however, not practical because it requires huge amounts of efforts to gather the training data while the latter usually depends on object recognition only. This paper proposes a combined approach of global and local feature analysis for feature extraction to complement both approaches' drawbacks. The proposed method is applied to a mobile information system and shows real-time performance with competitive recognition result.