• Title/Summary/Keyword: Point correspondence

Search Result 138, Processing Time 0.027 seconds

Location Identification Using an Fisheye Lens and Landmarks Placed on Ceiling in a Cleaning Robot (어안렌즈와 천장의 위치인식 마크를 활용한 청소로봇의 자기 위치 인식 기술)

  • Kang, Tae-Gu;Lee, Jae-Hyun;Jung, Kwang-Oh;Cho, Deok-Yeon;Yim, Choog-Hyuk;Kim, Dong-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.10
    • /
    • pp.1021-1028
    • /
    • 2009
  • In this paper, a location identification for a cleaning robot using a camera shooting forward a room ceiling which kas three point landmarks is introduced. These three points are made from a laser source which is placed on an auto charger. A fisheye lens covering almost 150 degrees is utilized and the image is transformed to a camera image grabber. The widly shot image has an inevitable distortion even if wide range is coverd. This distortion is flatten using an image warping scheme. Several vision processing techniques such as an intersection extraction erosion, and curve fitting are employed. Next, three point marks are identified and their correspondence is investigated. Through this image processing and image distortion adjustment, a robot location in a wide geometrical coverage is identified.

Identification of Surfaces of a 3-Dimensional Object from Range Data (Range 데이터를 이용한 3-D 물체의 면 인식 방법에 관한 연구)

  • Park, Doo-Yeong
    • The Journal of Engineering Research
    • /
    • v.2 no.1
    • /
    • pp.63-71
    • /
    • 1997
  • In this paper, we describe an approach that determines the identity of surfaces of an object with planar and curved surfaces from range data of the object in the scene. The proposed matching scheme presents that surface correspondence of an object is achieved by simple comparison of values for representing surfaces of the object with model in order to avoid unnecessary matching procedures. We use uniquely assigned Surface Representing Value(SRV) for representing surfaces of the object, which are sums of all weighted view-point independent features. And, the proposed method is simple, quite effective and insensitive to occlusion and noise in sensor data.

  • PDF

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

SPECTRAL ANALYSIS FOR THE CLASS OF INTEGRAL OPERATORS ARISING FROM WELL-POSED BOUNDARY VALUE PROBLEMS OF FINITE BEAM DEFLECTION ON ELASTIC FOUNDATION: CHARACTERISTIC EQUATION

  • Choi, Sung Woo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.1
    • /
    • pp.71-111
    • /
    • 2021
  • We consider the boundary value problem for the deflection of a finite beam on an elastic foundation subject to vertical loading. We construct a one-to-one correspondence �� from the set of equivalent well-posed two-point boundary conditions to gl(4, ℂ). Using ��, we derive eigenconditions for the integral operator ��M for each well-posed two-point boundary condition represented by M ∈ gl(4, 8, ℂ). Special features of our eigenconditions include; (1) they isolate the effect of the boundary condition M on Spec ��M, (2) they connect Spec ��M to Spec ����,α,k whose structure has been well understood. Using our eigenconditions, we show that, for each nonzero real λ ∉ Spec ����,α,k, there exists a real well-posed boundary condition M such that λ ∈ Spec ��M. This in particular shows that the integral operators ��M, arising from well-posed boundary conditions, may not be positive nor contractive in general, as opposed to ����,α,k.

A Robust Algorithm for Tracking Feature Points with Incomplete Trajectories (불완전한 궤적을 고려한 강건한 특징점 추적 알고리즘)

  • Jeong, Jong-Myeon;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.6
    • /
    • pp.25-37
    • /
    • 2000
  • The trajectories of feature points can be defined by the correspondences between points in consecutive frames. 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. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point 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^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

  • PDF

The Development of Taguchi and Response Surface Method Combined Model (Taguchi-RSM 통합모델 제시)

  • Ree, Sang-Bok;Kim, Youn-Soo;Yoon, Sang-Woon
    • IE interfaces
    • /
    • v.23 no.3
    • /
    • pp.257-263
    • /
    • 2010
  • Taguchi defined a good quality as 'A correspondence of product characteristic's expected value to the objective value satisfying the minimum variance condition.' For his good quality, he suggested Taguchi Method which is called Robust design which is irrelevant to the effect of these noise factors. Taguchi Method which has many success examples and which is used by many manufacturing industry. But Optimal solution of Taguchi Method is one among the experiments which is not optimal area of experiment point. On the other hand, Response Surface Method (RSM) which has advantage to find optimal solution area experiments points by approximate polynomial regression. But Optimal of RSM is depended on initial point and RSM can not use many factors because of a great many experiment. In this paper, we combine the Taguchi Method and the Response Surface Method with each advantage which is called Taguchi-RSM. Taguchi-RSM has two step, first step to find first solution by Taguchi Method, second step to find optimal solution by RSM with initial point as first step solution. We give example using catapults.

Featured-Based Registration of Terrestrial Laser Scans with Minimum Overlap Using Photogrammetric Data

  • Renaudin, Erwan;Habib, Ayman;Kersting, Ana Paula
    • ETRI Journal
    • /
    • v.33 no.4
    • /
    • pp.517-527
    • /
    • 2011
  • Currently, there is a considerable interest in 3D object reconstruction using terrestrial laser scanner (TLS) systems due to their ability to automatically generate a considerable amount of points in a very short time. To fully map an object, multiple scans are captured. The different scans need to be registered with the help of the point cloud in the overlap regions. To guarantee reliable registration, the scans should have large overlap ratio with good geometry for the estimation of the transformation parameters among these scans. The objective of this paper is to propose a registration method that relaxes/eliminates the overlap requirement through the utilization of photogrammetrically reconstructed features. More specifically, a point-based procedure, which utilizes non-conjugate points along corresponding linear features from photogrammetric and TLS data, will be used for the registration. The non-correspondence of the selected points along the linear features is compensated for by artificially modifying their weight matrices. The paper presents experimental results from simulated and real datasets to illustrate the feasibility of the proposed procedure.

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.

An Analysis of Nursing Competency affecting on Job Satisfaction and Nursing Performance among Clinical Nurses (간호사의 간호역량이 직무만족과 간호업무성과에 미치는 영향)

  • Ha, Na-Sun;Choi, Jung
    • Journal of Korean Academy of Nursing Administration
    • /
    • v.16 no.3
    • /
    • pp.286-294
    • /
    • 2010
  • Purpose: The purpose of this study was to identify the effects of nursing competency of nurses on job satisfaction and nursing performance. Method: Using a structured questionnaire, data were collected from 368 nurses. Descriptive statistics, t-test, ANOVA, Scheffe test and pearson correlation coefficient with SAS package were used for data analysis. Results: The total mean score for nursing competency was 2.65, with scores for subcategories as follows: ethical competency 2.74, personal competency 2.65, esthetical competency 2.64, and scientific competency 2.61. The mean score of total job satisfaction was 3.18 on a 5 point scale, and nursing performance was 2.97 on a 4 point scale. Total nursing competency and total subcategories of nursing competency perceived by nurses were positively related to job satisfaction and nursing performance. Conclusion: In conclusion, nursing competency of nurses influence job satisfaction and nursing performance. With these result, it is necessary to concentrate on improving nursing competency of nurses to increase job satisfaction and nursing performance.

Development of DSI(Delivery Sequence Information) Database Prototype (순로정보 데이터베이스 프로토타입 개발)

  • Kim, Yong-Sik;Lee, Hong-Chul;Kang, Jung-Yun;Nam, Yoon-Seok
    • IE interfaces
    • /
    • v.14 no.3
    • /
    • pp.247-254
    • /
    • 2001
  • As current postal automation is limited to dispatch and arrival sorting, delivery sequence sorting is performed manually by each postman. It not only acts as a bottleneck process in the overall mailing process but is expensive operation. To cope with this problem effectively, delivery sequence sorting automation is required. The important components of delivery sequence sorting automation system are sequence sorter and Hangul OCR which function is to extract the address of delivery point. DSI database will be interfaced to both Hangul OCR and sequence sorter for finding the accurate delivery sequence number and stacker number. The objectives of this research are to develop DSI(Delivery Sequence Information) database prototype and client application for managing information effectively. For database requirements collection and analysis, we draw all possible sorting plans, and apply the AHP(Analytic Hierarchy Process) method to determine the optimal one. And then, we design DSI database schema based on the optimal one and implement it using Oracle RDBMS. In addition, as address information in DIS database consist of hierarchical structure which has its correspondence sequence number, so it is important to reorganize sequence information accurately when address information is inserted, deleted or updated. To increase delivery accuracy, we reflect this point in writing application.

  • PDF