• Proceedings of the Korea Database Society Conference
• /
• 2000.11a
• /
• pp.239-248
• /
• 2000

전자화폐 시스템은 인출(withdrawal), 지불(payment) 그리고 예치(deposit)의 기본적인 과정을 수행하는데, 이러한 단계에서 사용자의 사생활(privacy)을 보호하기 위해 사용자와 사용자의 구입 내용 및 지불 내용을 연계시키지 않고 인출 단계와 지불 단계가 연결되지 않도록 기본적으로 익명성을 제공하고 있다. 하지만 이러한 완전한 익명성을 제공하므로 인해 돈 세탁, 약탈, 불법 거래와 같은 불법적인 범죄 행위들에 이용 될 수 있으며 이 때 이와 같은 범죄행위를 한 사용자와 그 돈에 대한 행방을 찾을 수가 없다. 따라서 이를 방지하기 위해 일정한 조건 아래에서 익명성을 제어하기 위한 연구들이 많이 진행되어 왔다. 본 논문에서는 DSS에 기반한 새로운 공정한 은닉 서명 방식을 제안하고 이를 전자화폐 시스템에 적용시킨다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.70-76
• /
• 2003

Digital watermarking is a technique embedding hidden information into multimedia data imperceptibly such as images and sounds. Generally an original image is transformed and coded watermark data is embedded in frequency domain watermarking models. In this paper, We propose a new data embedding method using Fresnel transform. A watermark image is fresnel-transformed and the intensity of transformed pattern is embedded into original image. Our watermarking model has the flexibility In data embedding. It is possible to get many embedding patterns from a single watermark image by using various distance parameters with Fresnel transform. All kinds of image models such af shape, letter and photo ran be used as a watermark data. The watermarking experiments were conducted to show the validity of the proposed method, and the results show that our method has the robustness against lossy compression, filtering and geometric transformation.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.1001-1010
• /
• 2007

HMM tends to output high probability for not only the proper class data but confusable class data, since the modeling power increases as the number of parameters increases. Thus it may not be helpful for discrimination to simply increase the number of parameters of HMM. We proposed two methods in this paper. One is a CMC(Confusion Likelihood Model Selection Criterion) using confusion class data probability, the other is a new recognition method, RCM(Recognition Using Confusion Models). In the proposed recognition method, confusion models are constructed using confusable class data, then confusion models are used to depress misrecognition by confusion likelihood is subtracted from the corresponding standard model probability. We found that CMC showed better results using fewer number of parameters compared with ML, ALC2, and BIC. RCM recorded 93.08% recognition rate, which is 1.5% higher result by reducing 17.4% of errors than using standard model only.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.88-91
• /
• 1995

개층형 신경망은 교사신호들의 학습으로 원하는 입출력간의 매핑을 할 수 있으므로 패턴분류를 위해 사용되어왔다. 본 논문은 계층형 신경망의 일종인 RBFN 중 GPFN 과 PNN으로 한국어 음소인식을 수행하였다. RBFN 의 구조는 계층형 신경망과 유사하나 차이점으로는 은닉층에서 시그모이드 함수, 참조벡터 및 학습알고리듬의 선택이 다르다. 특히 PNN 의 시그모이드 함수는 지수를 포함한 함수들로 대체되며 학습없이 패턴을 분류하므로 계산시간이 빠르게 수행된다. 본 실험에서는 한국어 단음절에서 모음과 자음을 추출하여 음소인식을 수행하였다. 실험 결과 학습과 평가데이타에 의한 인식률은 계층형 신경망과 비교하여 향상 되었으며, Hybrid 구성에 의한 실험에서도 항상된 인식률을 얻을 수 있었다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.547-553
• /
• 2008

We propose a two-stage document layout segmentation method. At the first stage, as top-down segmentation, morphological distance map algorithm extracts a collection of rectangular regions from a given input image. This preliminary result from the first stage is employed as input parameters for the process of next stage. At the second stage, a machine-learning algorithm is adopted RBF network, one of neural networks based on statistical model, is selected. In order for constructing the hidden layer of RBF network, a data clustering technique bared on the self-organizing property of Kohonen network is utilized. We present a result showing that the supervised neural network, trained by 300 number of sample data, improves the preliminary results of the first stage.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1749-1758
• /
• 1997

This paper suggests the development of dynamic forecasting model for short-term power demand based on Radial Basis Function Network and Pal's GLVQ algorithm. Radial Basis Function methods are often compared with the backpropagation training, feed-forward network, which is the most widely used neural network paradigm. The Radial Basis Function Network is a single hidden layer feed-forward neural network. Each node of the hidden layer has a parameter vector called center. This center is determined by clustering algorithm. Theatments of classical approached to clustering methods include theories by Hartigan(K-means algorithm), Kohonen(Self Organized Feature Maps %3A SOFM and Learning Vector Quantization %3A LVQ model), Carpenter and Grossberg(ART-2 model). In this model, the first approach organizes the load pattern into two clusters by Pal's GLVQ clustering algorithm. The reason of using GLVQ algorithm in this model is that GLVQ algorithm can classify the patterns better than other algorithms. And the second approach forecasts hourly load patterns by radial basis function network which has been constructed two hidden nodes. These nodes are determined from the cluster centers of the GLVQ in first step. This model was applied to forecast the hourly loads on Mar. $4^{th},\;Jun.\;4^{th},\;Jul.\;4^{th},\;Sep.\;4^{th},\;Nov.\;4^{th},$ 1995, after having trained the data for the days from Mar. $1^{th}\;to\;3^{th},\;from\;Jun.\;1^{th}\;to\;3^{th},\;from\;Jul.\;1^{th}\;to\;3^{th},\;from\;Sep.\;1^{th}\;to\;3^{th},\;and\;from\;Nov.\;1^{th}\;to\;3^{th},$ 1995, respectively. In the experiments, the average absolute errors of one-hour ahead forecasts on utility actual data are shown to be 1.3795%.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.986-998
• /
• 2006

There has been an increasing necessity of Semantic Web-based metadata that helps computers efficiently understand and manage an information increased with the growth of Internet. However, it seems inevitable to face some semantically ambiguous information when metadata is generated. Therefore, we need a solution to this problem. This paper proposes a new method for automated metadata generation with the help of a concept of class, in which some ambiguous words imbedded in information such as documents are semantically more related to others, by using probability model of consequent words. We considers ambiguities among defined concepts in ontology and uses the Hidden Markov Model to be aware of part of a named entity. First of all, we constrict a Markov Models a better understanding of the named entity of each class defined in ontology. Next, we generate the appropriate context from a text to understand the meaning of a semantically ambiguous word and solve the problem of ambiguities during generating metadata by searching the optimized the Markov Model corresponding to the sequence of words included in the context. We experiment with seven semantically ambiguous words that are extracted from computer science thesis. The experimental result demonstrates successful performance, the accuracy improved by about 18%, compared with SemTag, which has been known as an effective application for assigning a specific meaning to an ambiguous word based on its context.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.780-788
• /
• 2008

Modeling hand poses and tracking its movement are one of the challenging problems in computer vision. There are two typical approaches for the reconstruction of hand poses in 3D, depending on the number of cameras from which images are captured. One is to capture images from multiple cameras or a stereo camera. The other is to capture images from a single camera. The former approach is relatively limited, because of the environmental constraints for setting up multiple cameras. In this paper we propose a method of reconstructing 3D hand poses from a 2D input image sequence captured from a single camera by means of Belief Propagation in a graphical model and recognizing a finger clicking motion using a hidden Markov model. We define a graphical model with hidden nodes representing joints of a hand, and observable nodes with the features extracted from a 2D input image sequence. To track hand poses in 3D, we use a Belief Propagation algorithm, which provides a robust and unified framework for inference in a graphical model. From the estimated 3D hand pose we extract the information for each finger's motion, which is then fed into a hidden Markov model. To recognize natural finger actions, we consider the movements of all the fingers to recognize a single finger's action. We applied the proposed method to a virtual keypad system and the result showed a high recognition rate of 94.66% with 300 test data.

• Computational Structural Engineering
• /
• v.6 no.2
• /
• pp.5-12
• /
• 1993

본 고에서는 객체지향설계 및 프로그래밍 기법의 기본적인 개념과 구조설계 전산화에 관한 원론적인 사항에 대하여 고찰하여 보았다. OODP는 이미 S/W 개발분야에서 일반화된 기법이며, 한 때 큰 관심을 모으다 결국 실용화에 실패한 인공지능 또는 전문가시스템고는 달리, S/W 개발 및 유지관리에 큰 발전을 가져오고 있다. 객체 단위에 의한 데이타 및 함수의 통합모듈화, 추상화 및 정보은닉에 의한 객체의 독립성 확보, 객체지향 프로그래밍 언어의 탁월한 이식성, 객체추가에 의한 대규모 S/W의 점진적 개발, 상송성 및 다형성에 의한 프로그램 코드의 재사용성 등은 S/W의 부품화를 가능케 하고 S/W 신뢰도를 크게 높혀 주고 있다. OODP는 구조설계 전산화에도 적합한 기법으로 판단된다. OODP 기법은 전산전문가들의 도구가 아니며 각 분야 전문가들이 자기 분야의 전산화를 위해 사용하는 도구이다. 과거 우리가 fortran을 익혀 구조해석용 S/W를 개발했듯이 이제는 OODP 기법을 익혀 적극적으로 우리 문제에 활용한다면, 우리 분야 전산화 수준을 높히는데 크게 도움이 될 것으로 기대된다.

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.152-163
• /
• 1995

본 논문에서는 은닉 마르코프 모형(HMM)을 이용하여 사람이 쓴 필기의 통계적 특징을 갖는 글씨를 생성하는 방법에 대해서 기술코자 한다. 온라인 필기처럼 같이 필기 궤적을 시계열 신호로 표현하고, 그 특징을 통계적 모형의 하나인 HMM으로 표현한다. HMM은 시계열 신호에 대응하는 모형 내부 경로와 심볼열의 확률 분포를 표현하는 함수이다. 따라서 최적 경로에서 볼 수 있는 최적 출력 심볼열은 훈련 필기 데이타의 평균적 필기 특징에 해당한다. HMM이 주어졌을 때 HMM에서 최적의 패턴을 해석적으로 구하는 방법은 알려져 있지 않다. 본 논문에서는 동적 프로그래밍 기법을 적용하여 HMM이나 HMM 네트워크 모형에서 필기를 생성하는 방법을 제시하고, 아울러 HMM의 문제점을 지적한다.