• Title/Summary/Keyword: correspondence

Search Result 1,525, Processing Time 0.034 seconds

A Fast Correspondence Matching for Iterative Closest Point Algorithm (ICP 계산속도 향상을 위한 빠른 Correspondence 매칭 방법)

  • Shin, Gunhee;Choi, Jaehee;Kim, Kwangki
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.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.

Visualizations for Matched Pairs Models Using Modified Correspondence Analysis

  • Lee, Chanyoon;Choi, Yong-Seok
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.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.

Dynamic Simple Correspondence Analysis

  • Choi Yong-Seok;Hyun Gee Hong;Seo Myung Rok
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.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.

Development of Fuzzy Objective Functioin for Establishing the Region Correspondence

  • Soh, Young-sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.2 no.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.

  • PDF

Stereo Correspondence Algorithm Using Dynamic programming (동적 계획법을 이용한 스테레오 대응 알고리즘)

  • 이충환;홍석교
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • 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.

  • PDF

A GEOMETRIC PROOF OF THE ROBINSON-SCHENSTED-KNUTH CORRESPONDENCE

  • CHOI, SEUL HEE
    • Honam Mathematical Journal
    • /
    • v.26 no.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.

  • PDF

Correspondence Matching of Stereo Images by Sampling of Planar Region in the Scene Based on RANSAC (RANSAC에 기초한 화면내 평면 영역 샘플링에 의한 스테레오 화상의 대응 매칭)

  • Jung, Nam-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.4
    • /
    • pp.242-249
    • /
    • 2011
  • In this paper, the correspondence matching method of stereo images was proposed by means of sampling projective transformation matrix in planar region of scene. Though this study is based on RANSAC, it does not use uniform distribution by random sampling in RANSAC, but use multi non-uniform computed from difference in positions of feature point of image or templates matching. The existing matching method sampled that the correspondence is presumed to correct by use of the condition which the correct correspondence is almost satisfying, and applied RANSAC by matching the correspondence into one to one, but by sampling in stages in multi probability distribution computed for image in the proposed method, the correct correspondence of high probability can be sampled among multi correspondence candidates effectively. In the result, we could obtain many correct correspondence and verify effectiveness of the proposed method in the simulation and experiment of real images.

Mathematics Education by Correspondence far Gifted Students in Russia (러시아의 수학영재 통신교육)

  • 신현용;한인기;이종욱;김희선
    • The Mathematical Education
    • /
    • v.38 no.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.

  • PDF

Correspondence Analysis of Two-way Contingency Tables with Ordered Column Categories

  • Yang, Kyung-Sook;Huh, Myung-Hoe
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.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,

  • PDF