• Title/Summary/Keyword: point/line correspondence

Search Result 16, Processing Time 0.024 seconds

Registration of Aerial Image with Lines using RANSAC Algorithm

  • Ahn, Y.;Shin, S.;Schenk, T.;Cho, W.
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.529-536
    • /
    • 2007
  • Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

A Study on the Various Anatomical Landmarks Associated with Determining the Dental Midline (상악 중절치간 중심선과 해부학적 부위와의 관계에 대한 조사연구)

  • Kim, Uoong-Chul
    • Journal of Technologic Dentistry
    • /
    • v.12 no.1
    • /
    • pp.95-102
    • /
    • 1990
  • The distances from the center line between maxillary right and left central incisors(the dental midline) to the various anatomical landmarks were measured. Fifty five students(thirth four males and twenty one females) who have at least natural teeth including maxillary and mandibular incisors and bicuspids were examined. 1. There was statistically significant difference between the dental midline and the center line of maxillary labial frenum(p<0.05). 2. There was no statistically significant difference between the dental midline and the point of incisive papilla, philtrum line, the center line between two mandibular central incisors, and the median palatine suture line(p>0.05). 3. There was no statistically significant sexual difference among data. 4. The philtrum line showed the highest value of correspondence to the center line between two maxillary central incisors followed by the center point of incisive papilla, the center line of two mandibular central incisors, median plaltine suture line and the center line of maxillary labial frenum at the decreasing rate.

  • PDF

EKF-based SLAM Using Sonar Salient Feature and Line Feature for Mobile Robots (이동로봇을 위한 Sonar Salient 형상과 선 형상을 이용한 EKF 기반의 SLAM)

  • Heo, Young-Jin;Lim, Jong-Hwan;Lee, Se-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.28 no.10
    • /
    • pp.1174-1180
    • /
    • 2011
  • Not all line or point features capable of being extracted by sonar sensors from cluttered home environments are useful for simultaneous localization and mapping (SLAM) due to their ambiguity because it is difficult to determine the correspondence of line or point features with previously registered feature. Confused line and point features in cluttered environments leads to poor SLAM performance. We introduce a sonar feature structure suitable for a cluttered environment and the extended Kalman filter (EKF)-based SLAM scheme. The reliable line feature is expressed by its end points and engaged togather in EKF SLAM to overcome the geometric limits and maintain the map consistency. Experimental results demonstrate the validity and robustness of the proposed method.

Effect of Calcium Carbonate on Properties of Paper in Alkali Paper Masking (중성초지에서 탄산칼슘의 성질이 종이의 물성에 미치는 영향)

  • 신종순
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.8 no.1
    • /
    • pp.71-87
    • /
    • 1990
  • This paper presents a simple algorithm to obtain three dimensional information of an object. In the preprocessing of the stereo matching,feature point informations of stero image must be less sensitive to noise and well liked the correspondance problem. This paper described a simple technique of struture feature extraction of 3-D object and used edge-end point expanding method for unconnected line instade of Hough transform. The feature such as corner point and their angles are used for matching problem. The experimental results show that the described algorithm is a useful method for stereo correspondence problem.

  • PDF

Reconstruction of a 3D Model using the Midpoints of Line Segments in a Single Image (한 장의 영상으로부터 선분의 중점 정보를 이용한 3차원 모델의 재구성)

  • Park Young Sup;Ryoo Seung Taek;Cho Sung Dong;Yoon Kyung Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.4
    • /
    • pp.168-176
    • /
    • 2005
  • We propose a method for 3-dimensionally reconstructing an object using a line that includes the midpoint information from a single image. A pre-defined polygon is used as the primitive and the recovery is processed from a single image. The 3D reconstruction is processed by mapping the correspondence point of the primitive model onto the photo. In the recent work, the reconstructions of camera parameters or error minimizing methods through iterations were used for model-based 3D reconstruction. However, we proposed a method for the 3D reconstruction of primitive that consists of the segments and the center points of the segments for the reconstruction process. This method enables the reconstruction of the primitive model to be processed using only the focal length of various camera parameters during the segment reconstruction process.

Data Structure Extraction of Boundary Segments by Region Labeling (영역 라벨링에 의한 경계선 세그먼트의 데이터 구조 추출)

  • 최환언;정광웅;김두영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.1
    • /
    • pp.80-89
    • /
    • 1992
  • This paper presents algorithms which are region labeling and data structure of a boundary segmentation as image intermediate description process. In the method, the algorithms are region labeling, boundary segmentation, line and curve fitting and extracting data structure of each segment. As a result, a data structure of image is described by a set of region number, segment number, line or curve, starting point and end point of each segment and coefficient of line or curve. These data structures would serve for higher level processing as object recognition. For example we will use this data structure to solve the correspondence problem of stereoscopic image information. And we verified these algorithms through the image reconstruction of data structure.

  • PDF

Estimation of Camera Calibration Parameters using Line Corresponding Method (선 대응 기법을 이용한 카메라 교정파라미터 추정)

  • 최성구;고현민;노도환
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.10
    • /
    • pp.569-574
    • /
    • 2003
  • Computer vision system is broadly adapted like as autonomous vehicle system, product line inspection, etc., because it has merits which can deal with environment flexibly. However, for applying it for that industry, it has to clear the problem that recognize position parameter of itself. So that computer vision system stands in need of camera calibration to solve that. Camera calibration consists of the intrinsic parameter which describe electrical and optical characteristics and the extrinsic parameter which express the pose and the position of camera. And these parameters have to be reorganized as the environment changes. In traditional methods, however, camera calibration was achieved at off-line condition so that estimation of parameters is in need again. In this paper, we propose a method to the calibration of camera using line correspondence in image sequence varied environment. This method complements the corresponding errors of the point corresponding method statistically by the extraction of line. The line corresponding method is strong by varying environment. Experimental results show that the error of parameter estimated is within 1% and those is effective.

3D point recovery from 2D correspondence Using Maximum Clique (최대 클릭을 이용한 2차원 데이터의 대응관계로부터 3차원 좌표복원)

  • 김성진;추창우;이동훈;정순기;원광연
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.619-621
    • /
    • 1999
  • 여러 대의 카메라를 통해 캡춰된 2차원 데이터를 사용하여 3차원의 좌표를 추출하기 위해서는 각 카메라의 2차원 영상 데이터들의 대응점(correpondence point)을 구해야 한다. 이를 위해 에피폴라 제약조건(epipolar constraints)을 이용하여 에피포라 라인(epipolar line)에 근접한 점을 추출할 수 있다. 에피폴라 제약조건을 사용하면, 실제 원하는 점 이외에 많은 수의 고스트(ghost)가 발생할 수 있다. 또한 카메라로부터 은닉(occlusion)된 점들로 인해 모든 카메라에서 대응되는 점이 존재하는지의 여부를 보장할 수 없다. 본 논문에서는 가 카메라의 대응관계를 k-partite graph로 모델링하고, 전역 탐색을 위해 가중치를 적용하여 클릭(clique)을 추출함으로서, 고스트가 제거된 대응점을 구한다.

  • PDF

Line Edge-Based Type-Specific Corner Points Extraction for the Analysis of Table Form Document Structure (표 서식 문서의 구조 분석을 위한 선분 에지 기반의 유형별 꼭짓점 검출)

  • Jung, Jae-young
    • Journal of Digital Contents Society
    • /
    • v.15 no.2
    • /
    • pp.209-217
    • /
    • 2014
  • It is very important to classify a lot of table-form documents into the same type of classes or to extract information filled in the template automatically. For these, it is necessary to accurately analyze table-form structure. This paper proposes an algorithm to extract corner points based on line edge segments and to classify the type of junction from table-form images. The algorithm preprocesses image through binarization, skew correction, deletion of isolated small area of black color because that they are probably generated by noises.. And then, it processes detections of edge block, line edges from a edge block, corner points. The extracted corner points are classified as 9 types of junction based on the combination of horizontal/vertical line edge segments in a block. The proposed method is applied to the several unconstraint document images such as tax form, transaction receipt, ordinary document containing tables, etc. The experimental results show that the performance of point detection is over 99%. Considering that almost corner points make a correspondence pair in the table, the information of type of corner and width of line may be useful to analyse the structure of table-form document.

Camera Calibration for Machine Vision Based Autonomous Vehicles (머신비젼 기반의 자율주행 차량을 위한 카메라 교정)

  • Lee, Mun-Gyu;An, Taek-Jin
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.9
    • /
    • pp.803-811
    • /
    • 2002
  • Machine vision systems are usually used to identify traffic lanes and then determine the steering angle of an autonomous vehicle in real time. The steering angle is calculated using a geometric model of various parameters including the orientation, position, and hardware specification of a camera in the machine vision system. To find the accurate values of the parameters, camera calibration is required. This paper presents a new camera-calibration algorithm using known traffic lane features, line thickness and lane width. The camera parameters considered are divided into two groups: Group I (the camera orientation, the uncertainty image scale factor, and the focal length) and Group II(the camera position). First, six control points are extracted from an image of two traffic lines and then eight nonlinear equations are generated based on the points. The least square method is used to find the estimates for the Group I parameters. Finally, values of the Group II parameters are determined using point correspondences between the image and its corresponding real world. Experimental results prove the feasibility of the proposed algorithm.