• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.175-182
• /
• 2020

Fisher's classical method for combining independent p-values from continuous distributions is widely used but it is known to be inadequate for combining p-values from discrete probability distributions. Instead, the discrete analog of Fisher's classical method is used as an alternative for combining p-values from discrete distributions. In this paper, firstly we obtain p-values from discrete probability distributions associated with multi-sample location test data (Fisher-Pitman test and Kruskall-Wallis test data) by permutation method, and secondly combine the permutaion p-values by the discrete analog of Fisher's classical method. And we finally compare the combined p-values from both the discrete analog of Fisher's classical method and Fisher's classical method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.516-518
• /
• 2012

일반적으로 표적에 대한 탐지는 감시장비의 성능과 지형지물의 차폐 여부가 가장 큰 영향을 준다. 본 연구는 SRTM DSM (Digital Surface Model)과 국방지형정보단 DEM (Digital Elevation Model) 그리고 여기에 수목고를 고려한 DCM (Digital Canopy Model)고도를 기반으로 탐지확률 실험을 하였다. 실험결과 DCM과 DEM 기반의 탐지확률 결과가 가장 유사성이 높았고, SRTM과 DEM 기반의 탐지 확률은 차이가 나는 것으로 확인하였다. 따라서 SRTM이 이론적으로 DSM으로 고려되지만, 향후 추가적인 연구를 통해 이에 대한 분석이 더 필요할 것으로 사료된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.247-249
• /
• 2004

본 논문에서는 aspect model을 이용한 차원 축소 기반의 유전자 발현 데이터 분석을 제시한다. Aspect model은 은닉변수모델의 하나로서, 이를 이용하여 유전자 발현 데이터에 대한 확률적 학습 과정을 통해 특징적 발현 패턴을 추출할 수 있다. 또한 모델로부터 커널함수를 유도함으로써 발현패턴에 기반한 유전자간의 유사도를 자연스럽게 측정할 수 있다. 모델에 의해 정의되는 은닉공간 차원 수는 데이터 permutation 기반의 검증을 통해 결정한다. 효모 (yeast)의 세포 주기(cell cycle) 관련 발현데이터네 대한 실험에서, 주기별 특징 발현 패턴을 추출할 수 있었다. 또한 aspect model로부터 유도된 커널 기반의 유사도 척도를 이용함으로써, 동일 기능 또는 동일 complex 범주에 속하는 유전자 쌍 예측에서 기본적인 상관계수에 의한 방법에 비해 보다 향상된 성능을 얻을 수 있었다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.464-464
• /
• 2012

수문분야에 있어서 빈도해석의 목적은 특정 재현기간에 대한 발생 가능한 수문량의 규모를 파악하는데 있으며, 빈도해석의 정확도는 적합한 확률분포모형의 선택과 매개변수 추정방법에 의존하게 된다. 일반적으로 각 확률분포모형의 특성을 대표하는 매개변수를 추정하기 위해서는 모멘트 방법, 확률가중 모멘트 방법, 최대우도법 등을 이용하게 된다. 모멘트 방법에 의한 매개변수 추정은 해를 구하기 위한 과정이 단순한 반면, 비대칭형의 왜곡된 분포를 갖는 자료들에 대해서는 부정확한 결과를 나타내게 된다. 확률가중 모멘트 방법은 표본의 크기가 작거나 왜곡된 자료일 경우에도 비교적 안정적인 결과를 제공하는 반면, 확률 가중치가 정수로만 제한되는 단점을 갖고 있다. 그리고 대수 우도함수를 이용하여 매개변수를 추정하게 되는 최우도법은 가장 효율적인 매개변수 추정치를 얻을 수 있는 것으로 알려져 있으나, 비선형 연립방정식으로 표현되는 해를 구하기 위해서는 Newton-Raphson 방법을 사용하는 등 절차가 복잡하며, 때로는 수렴이 되지 않아 해룰 구하지 못하는 경우가 발생되게 된다. 이에 반해, 최근의 Genetic Algorithm, Ant Colony Optimization 및 Simulated Annealing과 같은 Meta-Heuristic Algorithm들은 복잡합 공학적 최적화 문제 있어서 효율적인 대안으로 주목받고 있으며, Hassanzadeh et al.(2011)에 의해 수문학적 빈도해석을 위한 매개변수 추정에 있어서도 그 적용성이 검증된바 있다. 본 연구의 목적은 연 최대강수 자료의 빈도해석에 적용되는 확률분포모형들의 매개변수 추정을 위해 Meta-Heuristic Algorithm을 적용하고자 함에 있다. 따라서 본 연구에서는 매개변수 추정을 위한 방법으로 Genetic Algorithm 및 Harmony Search를 적용하였고, 그 결과를 최우도법에 의한 결과와 비교하였다. GEV 분포를 이용하여 Simulation Test를 수행한 결과 Genetic Algorithm을 이용하여 추정된 매개변수들은 최우도법에 의한 결과들과 비교적 유사한 분포를 나타내었으나 과도한 계산시간이 요구되는 것으로 나타났다. 하지만 Harmony Search를 이용하여 추정된 매개변수들은 최우도법에 의한 결과들과 유사한 분포를 나타내었을 뿐만 아니라 계산시간 또한 매우 짧은 것으로 나타났다. 또한 국내 74개소의 강우관측소 자료와 Gamma, Log-normal, GEV 및 Gumbel 분포를 이용한 실증연구에 있어서도 Harmony Search를 이용한 매개변수 추정은 효율적인 매개 변수 추정치를 제공하는 것으로 나타났다.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.1
• /
• pp.117-124
• /
• 2013

Association rule of data mining techniques is the method to quantify the relationship between a set of items in a huge database, andhas been applied in various fields like internet shopping mall, healthcare, insurance, and education. There are three primary interestingness measures for association rule, support and confidence and lift. Confidence is the most important measure of these measures, and we generate some association rules using confidence. But it is an asymmetric measure and has only positive value. So we can face with difficult problems in generation of association rules. In this paper we apply the similarity measures by probabilistic interestingness measure (PIM) with all marginal proportions (AMP) to solve this problem. The comparative studies with support, confidences, lift, chi-square statistics, and some similarity measures by PIM with AMPare shown by numerical example. As the result, we knew that the similarity measures by PIM with AMP could be seen the degree of association same as confidence. And we could confirm the direction of association because they had the sign of their values, and select the best similarity measure by PIM with AMP.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.82-89
• /
• 2001

It is a document segmentation to set a boundary in the documents by the contents. It is essential for the accurate and efficient information search. In this paper we want to make an automatic document segmentation system with the method of probability analysis which uses the mutual information between the words. Proposed system can move the boundary of window and compute the similarity or the two window. In this system the more words are shared and the more important the words are, the higher the cohesive force of the two window systems goes. The result of experience with the document segmentation is that despite the differences of block unit the division point at which we expected to divide was normally divided.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.11-19
• /
• 2016

In this paper, we propose an automatic segmentation method of renal parenchyma on abdominal CT image using graph-cuts with shape constraint based on multi-probabilistic atlas. The proposed method consists of following three steps. First, to use the various shape information of renal parenchyma, multi-probabilistic atlas is generated by cortex-based similarity registration. Second, initial seeds for graph-cuts are extracted by maximum a posteriori (MAP) estimation and renal parenchyma is segmented by graph-cuts with shape constraint. Third, to reduce alignment error of probabilistic atlas and increase segmentation accuracy, registration and segmentation are iteratively performed. To evaluate the performance of proposed method, qualitative and quantitative evaluation are performed. Experimental results show that the proposed method avoids a leakage into neighbor regions with similar intensity of renal parenchyma and shows improved segmentation accuracy.

• Journal of Advanced Navigation Technology
• /
• v.22 no.2
• /
• pp.163-167
• /
• 2018

Probabilistic approach is applied to the experiment of Probability Density Function to get the information. Especially this method will be useful to make the montage to compare similarity. But in the case of art painting, it is more difficult than montage image. In this case, we should study the habit of painter with characteristic point in the paintings. Especially we will study characteristic point in the oil paintings to decide truth or falsehood in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.695-704
• /
• 2002

Watermark detection plays a crucial role in multimedia copyright protection and has traditionally been tackled using correlation-based algorithms. However, correlation-based detection is not actually the best choice, as it does not utilize the distributional characteristics of the image being marked. Accordingly, an efficient watermark detection scheme for DWT coefficients is proposed as optimal for non-additive schemes. Based on the statistical decision theory, the proposed method is derived according to Bayes decision theory, the Neyman-Pearson criterion, and the distribution of the DWT coefficients, thereby minimizing the missed detection probability subject to a given false alarm probability. The proposed method was tested in the context of robustness, and the results confirmed the superiority of the proposed technique over conventional correlation-based detection method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.39-49
• /
• 2003

Watermark detection has a crucial role in copyright protection of and authentication for multimedia and has classically been tackled by means of correlation-based algorithms. Nevertheless, when watermark embedding does not obey an additive rule, correlation-based detection is not the optimum choice. So a new detection algorithm is proposed which is optimum for non-additive watermark embedding. By relying on statistical decision theory, the proposed method is derived according to the Bayes decision theory, Neyman-Pearson criterion, and distribution of wavelet coefficients, thus permitting to minimize the missed detection probability subject to a given false detection probability. The superiority of the proposed method has been tested from a robustness perspective. The results confirm the superiority of the proposed technique over classical correlation- based method.