• Title/Summary/Keyword: 유사도 행렬

Search Result 260, Processing Time 0.028 seconds

균형배열을 이용한 Resolution V $2^t$ 포화부분실험계획법의 정보행렬에 관한 연구

  • 김상익
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.404-413
    • /
    • 1995
  • 2수준계 요인실험법에서 Kim(1992) 에 의해 균형배열을 이용하여 설계된 resolution V 포화균형부분실시법에서 추정량들의 공분산행렬을 계산하여 통계적 특성을 연구하였다. 이러한 부분실시법은 최소의 처리조합수를 가지고 주효과와 2인자 교호작용까지 분석할 수 있는 특징이 있다. 특히 본 논문에서는 인자의 수에 따라 설계가능한 8개의 부분실시법들간의 유사성과 통계적 효율성, 그리고 index number들의 변화에 따른 공분산행렬의 특성을 살펴보았다.

  • PDF

The Block Decorrelation Method for Integer Ambiguity Resolution of GPS Carrier Phase Measurements (GPS 반송파 위상관측의 미지정수해를 위한 블록 비상관화 방법)

  • Tran, Binh Quoc;Lim, Sam-Sung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.8
    • /
    • pp.78-86
    • /
    • 2002
  • The GPS carrier phase measurements include integer ambiguities and the decorrelation process on the variance-covariance matrix is necessary to resolve these ambiguities efficiently. In this paper, we introduce a new method for the ambiguity de-correlation. This method divides the variance-covariance matrix into 4 smaller blocks and decorrelates them separately. The decorrelation of each block is processed recursively so that the result of the previous step is not affected by the next step. A couple of numerical examples chosen in random show that this method is better than or comparable to other decorrelation methods, however, the speed of this is relatively faster because the computations are performed on small blocks of the variance-covariance matrix.

Efficient design of LDPC code Using circulant matrix and eIRA code (순환 행렬과 eIRA 부호를 이용한 효율적인 LDPC 부호화기 설계)

  • Bae Seul-Ki;Kim Joon-Sung;Song Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2C
    • /
    • pp.123-129
    • /
    • 2006
  • In this paper, we concentrate on reducing the complexity for efficient encoder. We design structural LDPC code using circulant matrix and permutation matrix and eIRA code. It is possible to design low complex encoder by using shift register and differential encoder and interleaver than general LDPC encoder that use matrix multiplication operation. The code designed by this structure shows similar performance as random code. And the proposed codes can considerably reduce a number of XOR gates.

Coupling Matrix Synthesis Methods for RF/Microwave Filter Design (초고주파용 필터설계를 위한 결합행렬 합성법)

  • Choi, Dong-Muk;Kim, Che-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1346-1353
    • /
    • 2007
  • In this paper, the methods are presented for the calculation of general coupling coefficient matrixes used in the band pass filter design. They are calculated from transmission coefficient($S_{21}$) and reflection coefficient($S_{11}$) with desired characteristics derived from the poles of filter function and return loss(RL). The calculated matrixes from this method are transformed to the folded canonical filter structure using similarity transformation which lends us the practical filter design. Based on the resulting matrix, the folded canonical filter has been designed.

Equivalent Writing of Loanwords Detection Method based on Korean Alphabet Confusion Matrix (한국어 자모 혼동행렬 기반 유사 외래어 표기 검출 기법)

  • Kwon, Soonho;Kwon, Hyuk-Chul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.04a
    • /
    • pp.433-436
    • /
    • 2010
  • 최근 한국어 문서에는 한국어뿐만 아니라 외래어 표기 등이 혼합되어 사용되고 있다. 외래어 표기는 한 단어에 대해 한 개만 존재하는 것이 아니라 여러 개의 다른 표기로 사용되고 있다. 이러한 표기상 불일치는 하나의 단어가 다른 개념으로 인식되어 정보검색 시스템의 성능 저하의 원인이 된다. 따라서 정보검색 시스템의 성능 향상을 위해 여러 외래어 표기를 같은 개념으로 인식하는 시스템이 필요하다. 본 논문에서는 한국어 자모 혼동행렬을 기반으로 한 유사 외래어 표기 검출 기법을 제안한다. 제안한 기법에 따라 유사 외래어 표기를 검출해줌으로써 정보검색 시스템의 성능을 향상할 수 있다.

Presentation of Efficient Matching Algorithm and its Applications to Image Recognition (효과적인 정합과정 알고리즘의 제시 및 영상 인식에의 적용)

  • 최세하;이주신
    • The Journal of the Acoustical Society of Korea
    • /
    • v.17 no.1
    • /
    • pp.31-38
    • /
    • 1998
  • 본 논문에서는 애매성을 고려한 이론을 적용하여 유사도를 측정한 후 퍼지 관계 행 렬을 생성하여 인식을 행하는 방법을 제안하고자 한다. 인식 시스템은 모델과 입력 영상의 특징값을 정합하여 행하게 되는데 이때 얼마나 유사한가를 계산하는 유사도 측정은 대단히 중요한 작업중의 하나가 된다. 이를 위해 톨이론과 퍼지이론의 일치도 연산을 이용하여 유 사도를 측정하며, 퍼지 관계 행렬을 생성하여 정합을 행하고자 한다. 제안한 알고리즘에 대 해 3차원 물체와 얼굴 영상을 대상으로 실험을 수행하였으며 이를 통해 본 논문의 유용성을 입증하고자 한다.

  • PDF

XML Document Analysis based on Similarity (유사성 기반 XML 문서 분석 기법)

  • Lee, Jung-Won;Lee, Ki-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.6
    • /
    • pp.367-376
    • /
    • 2002
  • XML allows users to define elements using arbitrary words and organize them in a nested structure. These features of XML offer both challenges and opportunities in information retrieval and document management. In this paper, we propose a new methodology for computing similarity considering XML semantics - meanings of the elements and nested structures of XML documents. We generate extended-element vectors, using thesaurus, to normalize synonyms, compound words, and abbreviations and build similarity matrix using them. And then we compute similarity between XML elements. We also discover and minimize XML structure using automata(NFA(Nondeterministic Finite Automata) and DFA(Deterministic Finite automata). We compute similarity between XML structures using similarity matrix between elements and minimized XML structures. Our methodology considering XML semantics shows 100% accuracy in identifying the category of real documents from on-line bookstore.

Automatic Pose similarity Computation of Motion Capture Data Through Topological Analysis (위상분석을 통한 모션캡처 데이터의 자동 포즈 비교 방법)

  • Sung, Mankyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.5
    • /
    • pp.1199-1206
    • /
    • 2015
  • This paper introduces an algorithm for computing similarity between two poses in the motion capture data with different scale of skeleton, different number of joints and different joint names. The proposed algorithm first performs the topological analysis on the skeleton hierarchy for classifying the joints into more meaningful groups. The global joints positions of each joint group then are aggregated into a point cloud. The number of joints and their positions are automatically adjusted in this process. Once we have two point clouds, the algorithm finds an optimal 2D transform matrix that transforms one point cloud to the other as closely as possible. Then, the similarity can be obtained by summing up all distance values between two points clouds after applying the 2D transform matrix. After some experiment, we found that the proposed algorithm is able to compute the similarity between two poses regardless of their scale, joint name and the number of joints.

An F-LDPC Codes Based on Jacket Pattern (재킷 패턴 기반의 F-LDPC 부호)

  • Lee, Kwang-Jae;Kang, Seung-Son
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.2
    • /
    • pp.317-325
    • /
    • 2012
  • In this paper, we consider the encoding scheme of Low Density Parity Check codes. In particular, using the Jacket Pattern and circulant permutation matrices, we propose the simple encoding scheme of Richardson's lower triangular matrix. These encoding scheme can be extended to a flexible code rate. Based on the simple matrix process, also we can design low complex and simple encoders for the flexible code rates.

Mutual Information-based Circular Template Matching for Image Registration (영상등록을 위한 Mutual Information 기반의 원형 템플릿 정합)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.30 no.5
    • /
    • pp.547-557
    • /
    • 2014
  • This paper presents a method for designing circular template used in similarity measurement for image registration. Circular template has translation and rotation invariant property, which results in correct matching of control points for image registration under the condition of translation and rotation between reference and sensed images. Circular template consisting of the pixels located on the multiple circumferences of the circles whose radii vary from zero to a certain distance, is converted to two-dimensional Discrete Polar Coordinate Matrix (DPCM), whose elements are the pixels of the circular template. For sensed image, the same type of circular template and DPCM are created by rotating the circular template repeatedly by a certain degree in the range between 0 and 360 degrees and then similarity is calculated using mutual information of the two DPCMs. The best match is determined when the mutual information for each rotation angle at each pixel in search area is maximum. The proposed algorithm was tested using KOMPSAT-2 images acquired at two different times and the results indicate high accurate matching performance under image rotation.