• 로봇학회논문지
• /
• 제17권3호
• /
• pp.373-380
• /
• 2022

This paper considers a method of fast correspondence matching for iterative closest point (ICP) algorithm. In robotics, the ICP algorithm and its variants have been widely used for pose estimation by finding the translation and rotation that best align two point clouds. In computational perspectives, the main difficulty is to find the correspondence point on the reference point cloud to each observed point. Jump-table-based correspondence matching is one of the methods for reducing computation time. This paper proposes a method that corrects errors in an existing jump-table-based correspondence matching algorithm. The criterion activating the use of jump-table is modified so that the correspondence matching can be applied to the situations, such as point-cloud registration problems with highly curved surfaces, for which the existing correspondence-matching method is non-applicable. For demonstration, both hardware and simulation experiments are performed. In a hardware experiment using Hokuyo-10LX LiDAR sensor, our new algorithm shows 100% correspondence matching accuracy and 88% decrease in computation time. Using the F1TENTH simulator, the proposed algorithm is tested for an autonomous driving scenario with 2D range-bearing point cloud data and also shows 100% correspondence matching accuracy.

• 호남수학학술지
• /
• 제25권1호
• /
• pp.3-15
• /
• 2003

We prove an analogue of the Robinson-Schensted correspondence between generalized biwords and oscillating semi-standard tableaux. We give a geometric construction of the correspondence and examine combinatorial properties of the correspondence.

• Communications for Statistical Applications and Methods
• /
• 제21권4호
• /
• pp.275-284
• /
• 2014

Matched pairs are twice continuously measured data with the same categories. They can be represented as the square contingency tables. We can also consider symmetry and marginal homogeneity. Moreover, we can infer the matched pairs models; the symmetry model, the quasi-symmetry model, and the ordinal quasi-symmetry model. These inferences are involved in assumptions for special distributions. In this study, we visualize matched pairs models using modified correspondence analysis. Modified correspondence analysis can be used when square contingency tables are given; consequently, it is involved in the square and asymmetric correspondence matrix. This technique does not need assumptions for special distributions and is more helpful than the correspondence analysis to visualize matched pairs models.

• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.199-205
• /
• 2005

In general, simple correspondence analysis has handled mainly correspondence relations between the row and column categories but can not display the trends of their change over the time. For solving this problem, we will propose DSCA(Dynamic Simple Correspondence Analysis) of transition matrix data using supplementary categories in this study, Moreover, DSCA provides its trend of the change for the future by predicting and displaying trend toward the change from a standard point of time to the next.

• 한국지능시스템학회논문지
• /
• 제2권3호
• /
• pp.22-28
• /
• 1992

One of the challenging problems in dynamic scene analysis is the correspondence problem. Points and lines have been two major entities for establishing the correspondence among suxcessive frmes and gave rise to discrete approach to dynamic scene analysis. SOme researchers take continuous approach to analyse the motion. There it is usually assumed that some sort of region correspondence has already been established. In this paper, we propose a method based on fuzzy membership function for solving region correspondence problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.310-310
• /
• 2000

The main problem in stereo vision is to find corresponding points in left and right image known as correspondence problem. Once correspondences determined, the depth information of those points are easily computed form the pairs of points in both image. In this paper, dynamic programming considering half-occluded region is used fer solving correspondence problem.

• 호남수학학술지
• /
• 제26권3호
• /
• pp.257-268
• /
• 2004

In this paper, we give a proof of the Robinson-Schensted-Knuth correspondence by using the geometric. construction. We represent a generalized permutation in the first quadrant of the Cartesian plane and find a corresponding pair of semi-standard tableaux of same shape. This work extends the classical geometric construction of Viennot [10] for Robinson-Schensted correspondence.

• 융합신호처리학회논문지
• /
• 제12권4호
• /
• pp.242-249
• /
• 2011

화면 내의 평면영역에서 투영변환행렬 대응 매칭법을 제안한다. 본 연구는 RANSAC에 있지만, RANSAC에서 랜덤 샘플링에 균일분포를 이용하는 것아 아니고, 화상의 특징점 위치나 템플리트 매칭의 차이로부터 구한 다중의 비균일 분포를 이용한다. 기존의 매칭법은 정대응이 거의 만족해야 할 조건을 이용하여 올바르다고 추정되는 대응을 샘플링하고, 그 대응을 1대 1로 매칭시켜 RANSAC을 행하였지만, 제안 방법에서는 화상으로부터 구한 다중의 확률 분포에서 단계적으로 샘플링함으로써 확률이 높은 정대응을 다중의 대응 후보 중에서 효율적으로 샘플링할 수 있다. 그 결과 최종적으로 수많은 정대응을 구할 수 있으며, 시뮬레이션과 실제 화상의 실험에 의하여 제안 방법의 유효성을 검증한다.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제38권2호
• /
• pp.95-103
• /
• 1999

Russia is a country which is interested in mathematics education for gifted students for a long time. Some aspect of education for the gifted students in Russia(for example, mathematics curriculum, contents and activities of study, and selection of students in Russian physio-mathematics school) has already been studied. The purpose of this work was to introduce system of the mathematics education by correspondence for gifted students in Russia. In order to achieve this goal, we analyzed Russian literatures and articles published by the various physio-mathematics correspondence schools for gifted students. In this article, we gave some characteristics of the physio-mathematics correspondence schools for gifted students: various types of mathematics education by correspondence, curriculum, practical materials for mathematics education by correspondence.

• Journal of the Korean Statistical Society
• /
• 제28권3호
• /
• pp.347-358
• /
• 1999

Correspondence analysis is an exploratory method for two-way contingency tables intended to display the association pattern between row and column categories. It has been developed for several decades mainly in France and Japan and, nowadays, is popular worldwide. For the special case, however, that the column consists of ordered categories, correspondence analysis may yield ackward result so that it cannot be fully accommodated. That's because the row and column categories are assumed to be nominal in the ordinary correspondence analysis. The aim of this study is to develop the correspondence analysis for two-way contingency tables with ordered column categories. It is based on two specific algorithms,