• 제목/요약/키워드: permutation method

검색결과 115건 처리시간 0.022초

IVA 기반의 2채널 암묵적신호분리에서 주파수빈 뒤섞임 문제 해결을 위한 후처리 과정 (Post-Processing of IVA-Based 2-Channel Blind Source Separation for Solving the Frequency Bin Permutation Problem)

  • 추쯔하오;배건성
    • 말소리와 음성과학
    • /
    • 제5권4호
    • /
    • pp.211-216
    • /
    • 2013
  • The IVA(Independent Vector Analysis) is a well-known FD-ICA method used to solve the frequency permutation problem. It generally works quite well for blind source separation problems, but still needs some improvements in the frequency bin permutation problem. This paper proposes a post-processing method which can improve the source separation performance with the IVA by fixing the remaining frequency permutation problem. The proposed method makes use of the correlation coefficient of power ratio between frequency bins for separated signals with the IVA-based 2-channel source separation. Experimental results verified that the proposed method could fix the remaining frequency permutation problem in the IVA and improve the speech quality of the separated signals.

Combining Independent Permutation p Values Associated with Mann-Whitney Test Data

  • Um, Yonghwan
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권7호
    • /
    • pp.99-104
    • /
    • 2018
  • In this paper, we compare Fisher's continuous method with an exact discrete analog of Fisher's continuous method from permutation tests for combining p values. The discrete analog of Fisher's continuous method is known to be adequate for combining independent p values from discrete probability distributions. Also permutation tests are widely used as alternatives to conventional parametric tests since these tests are distribution-free, and yield discrete probability distributions and exact p values. In this paper, we obtain permutation p values from discrete probability distributions using Mann-Whitney test data sets (real data and hypothetical data) and combine p values by the exact discrete analog of Fisher's continuous method.

이질적인 중도절단분포 하에서 생존분포의 동일성 검정법 비교연구 (A Comparison of Survival Distributions with Unequal Censoring Distributions)

  • 송수정;이재원
    • 응용통계연구
    • /
    • 제27권1호
    • /
    • pp.1-11
    • /
    • 2014
  • 세 개 이상의 집단에 대한 생존분포의 비교를 위해 가중 로그순위 검정법(Weighted Logrank test)과 그의 특별한 경우인 로그순위 검정법(Logrank test)이 널리 쓰인다. 그러나 이 방법은 근사적인 분포를 이용한 방법이므로 표본 크기가 작은 경우에는 유효하지 못할 수 있으며, 각 집단의 중도절단 분포가 동일하다는 가정 또한 충족되어야 하기 때문에 이 가정이 충족되지 못할 경우에도 검정법의 유효성을 장담할 수 없다. 표본 크기가 작은 경우에 대한 대안으로, 분포에 대한 가정이 없이 관찰된 자료만으로 검정통계량의 분포를 추정하고 그 분포를 이용해 검정하는 순열 검정법(Permutation test)이 제안되었으나, 순열 검정법 또한 각 집단의 중도절단 분포가 동일하다는 가정이 충족되어야 한다. 따라서 순열 검정법을 향상시킨 순열-대치 검정법(Permutation-Imputation test)이 대안이 될 수 있는데, 이는 대치 단계(Imputation step)에서 귀무가설 하에서의 생존확률이 집단에 의존하지 않도록 자료를 조정한 후 순열 검정 단계(Permutation step)를 통해 검정하는 방법이다. 본 논문에서는 근사적 방법, 순열 검정법, 순열-대치 검정법을 로그순위 검정법과 가중 로그순위 검정법의 한 형태인 Prentice-Wilcoxon 검정법에 적용해 각 검정법의 유효성과 검정력을 비교하였다.

이산 카오스 함수와 Permutation Algorithm을 결합한 고신뢰도 광영상 암호시스템 (A high reliable optical image encryption system which combined discrete chaos function with permutation algorithm)

  • 박종호
    • 정보보호학회논문지
    • /
    • 제9권4호
    • /
    • pp.37-48
    • /
    • 1999
  • 현대암호방식은 종래의 선형 대수와 수리이론을 적용한 암호통신을 벗어난 유사 잡음성을 띠는 카오스 신호를 이용한 암호통신을 적용해 오고 있다,[1-2] 본 논문은 1차 permutation 알고 리즘을 이용 하여 변환된 정보를 2차 이산 카오스 변환 함수를 이용해 암호화하는 광영상 암호시스템을 제안하여UT 다. 제안된 시스템은 키수열 발생기의 출력을 통해 영상정보를 permutation 하는 알고리즘 을 설계하였고 이에 대한 검정을 수행하였다. 또한 본 논문에서는 permutation 알고리즘을 통해 제한적인 카오스 함수 의 적용시 발생하는 문제점을 해결하고 비도를 증가시킴으로써 광영상 암호시스템에 적용 시 그 타당성 을 검정하였다. Current encryption methods have been applied to secure communication using discrete chaotic system whose output is a noise-like signal which differs from the conventional encryption methods that employ algebra and number theory[1-2] We propose an optical encryption method that transforms the primary pattern into the image pattern of discrete chaotic function first a primary pattern is encoded using permutation algorithm, In the proposed system we suggest the permutation algorithm using the output of key steam generator and its security level is analyzed. In this paper we worked out problem of the application about few discrete chaos function through a permutation algorithm and enhanced the security level. Experimental results with image signal demonstrate the proper of the implemented optical encryption system.

Permutation P-values for Inter-rater Agreement Measures

  • Um, Yonghwan
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권12호
    • /
    • pp.169-174
    • /
    • 2015
  • Permutation p-values are provided for the agreement measures for multivariate interval data among many raters. Three agreement measures, Berry and Mielke's measure, Janson and Olsson's measure, and Um's measure are described and compared. Exact and resampling permutation methods are utilized to compute p-values and empirical quantile limits for three measures. Comparisons of p-values demonstrate that resampling permutation methods provide close approximations to exact p-values, and Berry and Mielke's measure and Um's measure show similar performance in terms of measuring agreement.

수세기를 통한 순열과 조합의 이해

  • 정인철
    • East Asian mathematical journal
    • /
    • 제25권3호
    • /
    • pp.247-262
    • /
    • 2009
  • Permutation and combination are the part of mathematics which can be introduced the pliability and diversity of thought. In prior studies of permutation and combination, there treated difficulties of learning, strategy of problem solving, and errors that students might come up with. This paper provides the method so that meaningful teaching and learning might occur through the systematic approach of permutation and combination. But there were little prior studies treated counting numbers that basic of mathematics' action. Therefore this paper tries to help the understanding of permutation and combination with the process of changing from informal knowledge to formal knowledge.

Permutation Test for the Equality of Several Independent Cronbach's Alpha Coefficients

  • Um, Yonghwan
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권6호
    • /
    • pp.159-164
    • /
    • 2019
  • The statistical inference of Cronbach's alpha measure of internal reliability is known to be inaccurate when sample size is small and the assumption of normality is violated. In this paper, we describe the permutation method in which we compute resampling p-values for testing the difference between two or more independent Cronbach's alpha coefficients. When the over-all permutation test is significant, we also make pairwise post-hoc comparisons using permutaion method. The permutation tests for the equality of two independent Cronbach's alpha coefficients and three independent Cronbach's alpha coefficients are illustrated with an example analysis of survey data.

Testing the Equality of Several Correlation Coefficients by Permutation Method

  • Um, Yonghwan
    • 한국컴퓨터정보학회논문지
    • /
    • 제27권6호
    • /
    • pp.167-174
    • /
    • 2022
  • 본 논문에서는 여러 개의 독립적인 모집단들 사이에서 상관계수들의 등가성에 대한 퍼뮤테이션 검정을 조사한다. 퍼뮤테이션 검정은 관측값들의 상호교환성에 기초하는 비모수적인 검정 방법이며 상호교환성이란 독립적이고 동일한 확률변수들의 개념을 일반화한 개념이다. 퍼뮤테이션 검정을 사용함으로써 근사적으로 정확한 검정에 가까운 검정을 실시할 수 있다. 퍼뮤테이션 검정은 근사적으로 보수적인 검정만큼의 검정력을 지니며, 표본의 크기가 작거나 정규성 가정이 충족되지 않을 때 유용한 방법이다. 본 논문에서는 먼저 상관계수들의 등가성을 검정하는 모수적인 방법들을 소개하고 이들을 퍼뮤테이션 검정과 비교한다. 끝으로 모든 검정들은 Iris 데이터를 예를 들어 비교된다.

순열알고리즘을 이용한 도로포장의 유지보수 (Pavement Maintenance System Through using the Permutation Algorithm)

  • 김장락;이상염;문성호
    • 한국도로학회논문집
    • /
    • 제16권5호
    • /
    • pp.67-72
    • /
    • 2014
  • PURPOSES : This study focuses on conducting pavement rehabilitation for more deteriorated roads given a limited government budget. METHODS : Therefore, we apply a optimization programming model of the permutation algorithm used for rehabilitating more deteriorated pavement areas, which is subjected to the limited budget. RESULTS : The permutation algorithm was evaluated in terms of determining the maximized rehabilitation of deteriorated pavement areas, using the newly developed performance models such as fatigue cracking, rutting, international roughness index(IRI) through the surveying data from 2006 to 2012. When compared with a traditional model of the so-called worst-first sequence(WFS) method, the permutation algorithm worked better than the WFS method, resulting in covering more deteriorated pavement areas given the limited government budget. CONCLUSIONS : Through a case study, it could be concluded that the permutation algorithm provides more reliable results in terms of rehabilitating more deteriorated pavement areas given the limited budget.

Method-Free Permutation Predictor Hypothesis Tests in Sufficient Dimension Reduction

  • Lee, Kyungjin;Oh, Suji;Yoo, Jae Keun
    • Communications for Statistical Applications and Methods
    • /
    • 제20권4호
    • /
    • pp.291-300
    • /
    • 2013
  • In this paper, we propose method-free permutation predictor hypothesis tests in the context of sufficient dimension reduction. Different from an existing method-free bootstrap approach, predictor hypotheses are evaluated based on p-values; therefore, usual statistical practitioners should have a potential preference. Numerical studies validate the developed theories, and real data application is provided.