• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.803-806
• /
• 2000

The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. We solve the correspondence problem as the optimal graph search problem, by considering false feature points and by properly reflecting motion characteristics. The proposed algorithm finds a local optimal correspondence so that the effect of false feature points can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O(m$^2$n) in the worst case, where m and n are the number of feature points in two consecutive frames. The proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.34 no.3
• /
• pp.3-10
• /
• 2018

It's not practical to collect all information at the entire degrees of freedom of finite element model. The incomplete measurements should be expanded for subsequent analysis and damage detection. This work presents the analytical methods to expand the incomplete static or dynamic response data. Using the expanded data, introducing the concept of residual force, and minimizing the performance index expressed as the stiffness matrix and its difference before and after damage, the variation in stiffness matrix is derived. Based on the difference in the stiffness matrix, the damage detection method of structures is also provided. The validity of the proposed methods is illustrated in a numerical application, the numerical results are analyzed for applications, and the applicability of both methods is investigated.

• Communications for Statistical Applications and Methods
• /
• v.11 no.2
• /
• pp.235-246
• /
• 2004

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.49-63
• /
• 1997

We consider the problem of classifying a p x 1 observation into one of two multivariate normal populations when the training smaples contain a block of missing observation. A new classification procedure is proposed which is a linear combination of two discriminant functions, one based on the complete samples and the other on the incomplete samples. The new discriminant function is easy to use.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.484-486
• /
• 2002

본 논문은 여러 컬렉션에 대해 검색을 수행하는 분산 검색시스템에서 질의어가 들어 왔을 때 질의어에 적합한 컬렉션을 자동으로 선택할 수 있도록 하는 컬렉션 선택 모델과 브로커 구조를 제안하였다. 각 컬렉션마다 과거 질의에 대해 검색된 결과 문서들을 색인하여 인접단어를 고려한 불완전 인텍스를 생성한다. 이러한 불완전 인덱스를 이 용하여 컬렉션 선택하는 모델을 TREC 문서집합과 SMART 시스템을 이용하여 구현하였다.

• Journal of the Korean Statistical Society
• /
• v.19 no.1
• /
• pp.88-92
• /
• 1990

In the problem of the recovery of interblock information in balanced incomplete block designs(BIBD), it is well known that a truncated estimator dominates the untruncated estimator under mean squared error loss. This paper shows that the domination result holds universally for every nondecreasing loss function.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.1-8
• /
• 2007

The distributions of the minimum correlated F-variable arises in many applied statistical problems including simultaneous analysis of variance (SANOVA), equality of variance, selection and ranking populations, and reliability analysis. In this paper, negative binomial sampling technique is employed to derive the distributions of the minimum of chi-square variables and hence the distributions of the minimum correlated F-variables. The work presented in this paper is divided in two parts. The first part is devoted to develop some combinatorial identities arised from the negative binomial sampling. These identities are constructed and justified to serve important purpose, when we deal with these distributions or their characteristics. Other important results including cumulants and moments of these distributions are also given in somewhat simple forms. Second, the distributions of minimum, chisquare variable and hence the distribution of the minimum correlated F-variables are then derived within the negative binomial sampling framework. Although, multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of the distributions. The computation methods we adopted are exact and no interpolations are involved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.427-434
• /
• 1996

Hypercube has some advantages such as small diameter between nodes and relatively simple routing scheme, so it is one of the most popular interconnection networks used in real systems. But to make this structure more practical, it is required to reduce its diameter and to be able to expand it to any number of nodes. In this study, we proposed a Crossed Incomplete Hypercube structure. This scheme is based on the previous Crossed Hypercube topology that reduces the diameter about 50% and has the same complexity with general hypercube and is able to expand to any number of nodes. We also proposed a fixed routing scheme for this structure. In the repect of the average path and the average routing time, this structure shows an enhanced performance about 30% and it is enhanced about 20% ifn the average traffic density.

• Journal of Broadcast Engineering
• /
• v.26 no.3
• /
• pp.247-257
• /
• 2021

This paper proposes a new technique for calibrating a multi-view RGB-D camera using a 3D (dimensional) skeleton. In order to calibrate a multi-view camera, consistent feature points are required. In addition, it is necessary to acquire accurate feature points in order to obtain a high-accuracy calibration result. We use the human skeleton as a feature point to calibrate a multi-view camera. The human skeleton can be easily obtained using state-of-the-art pose estimation algorithms. We propose an RGB-D-based calibration algorithm that uses the joint coordinates of the 3D skeleton obtained through the posture estimation algorithm as a feature point. Since the human body information captured by the multi-view camera may be incomplete, the skeleton predicted based on the image information acquired through it may be incomplete. After efficiently integrating a large number of incomplete skeletons into one skeleton, multi-view cameras can be calibrated by using the integrated skeleton to obtain a camera transformation matrix. In order to increase the accuracy of the calibration, multiple skeletons are used for optimization through temporal iterations. We demonstrate through experiments that a multi-view camera can be calibrated using a large number of incomplete skeletons.

• Journal of the Korean Data and Information Science Society
• /
• v.13 no.2
• /
• pp.175-184
• /
• 2002

In this paper, diallel crosses block designs for control versus test comparisons among the lines are proposed. These block designs are constructed by using partially balanced incomplete block designs with C-properties. Also, the efficiencies of the diallel crosses block designs obtained through this method are tabulated for number of lines 22 or less.