• Title/Summary/Keyword: 상대위치좌표

Search Result 91, Processing Time 0.021 seconds

A Head-Eye Calibration Technique Using Image Rectification (영상 교정을 이용한 헤드-아이 보정 기법)

  • Kim, Nak-Hyun;Kim, Sang-Hyun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.8
    • /
    • pp.11-23
    • /
    • 2000
  • Head-eye calibration is a process for estimating the unknown orientation and position of a camera with respect to a mobile platform, such as a robot wrist. We present a new head-eye calibration technique which can be applied for platforms with rather limited motion capability In particular, the proposed calibration technique can be applied to find the relative orientation of a camera mounted on a linear translation platform which does not have rotation capability. The algorithm find the rotation using a calibration data obtained from pure Translation of a camera along two different axes We have derived a calibration algorithm exploiting the rectification technique in such a way that the rectified images should satisfy the epipolar constraint. We present the calibration procedure for both the rotation and the translation components of a camera relative to the platform coordinates. The efficacy of the algorithm is demonstrated through simulations and real experiments.

  • PDF

Crustal velocities around the Korean Peninsula estimated with GPS (GPS로 잰 한반도 주변의 지각운동 속도)

  • Park, Pil-Ho;Ahn, Yong-Won;Park, Jong-Uk;Joh, Jeong-Ho;Lim, Hyung-Chul
    • Journal of the Korean Geophysical Society
    • /
    • v.3 no.3
    • /
    • pp.153-160
    • /
    • 2000
  • Crustal velocities around the Korea peninsula are estimated and investigated from eight IGS permanent stations in eastern Asia area. GPS data for the period of May 1995 to December 1991 were analyzed to estimate daily coordinates of each site relative to TAEJ site. The velocity vector of each site is estimated from linear regression analysis with time series of coordinates. As the result, horizontal velocity components for four stations(Tsukuba, Usuda,Taiwan and Shanghai) using thirty-two months data were estimated with the standard error less than 1 mm/year. Our GPS velocity of six sites on the interiors of the Eurasia plate are similar within 1 cm/year with small differences respectively. On the other hand, the velocities of Tsukuba and Usuda showed the great differences from the other six sites. This can be explained by the fact that these two sites are enforced by the surrounding four plates, such as the Pacific, Eurasia, North America and Philipine plate. This study showed that the distance between Korea and Japan is shortened with the rate of 3 cm per year.

  • PDF

A Study on the Development of a Home Mess-Cleanup Robot Using an RFID Tag-Floor (RFID 환경을 이용한 홈 메스클린업 로봇 개발에 관한 연구)

  • Kim, Seung-Woo;Kim, Sang-Dae;Kim, Byung-Ho;Kim, Hong-Rae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.2
    • /
    • pp.508-516
    • /
    • 2010
  • An autonomous and automatic home mess-cleanup robot is newly developed in this paper. Thus far, vacuum-cleaners have lightened the burden of household chores but the operational labor that vacuum-cleaners entail has been very severe. Recently, a cleaning robot was commercialized to solve but it also was not successful because it still had the problem of mess-cleanup, which pertained to the clean-up of large trash and the arrangement of newspapers, clothes, etc. Hence, we develop a new home mess-cleanup robot (McBot) to completely overcome this problem. The robot needs the capability for agile navigation and a novel manipulation system for mess-cleanup. The autonomous navigational system has to be controlled for the full scanning of the living room and for the precise tracking of the desired path. It must be also be able to recognize the absolute position and orientation of itself and to distinguish the messed object that is to be cleaned up from obstacles that should merely be avoided. The manipulator, which is not needed in a vacuum-cleaning robot, has the functions of distinguishing the large trash that is to be cleaned from the messed objects that are to be arranged. It needs to use its discretion with regard to the form of the messed objects and to properly carry these objects to the destination. In particular, in this paper, we describe our approach for achieving accurate localization using RFID for home mess-cleanup robots. Finally, the effectiveness of the developed McBot is confirmed through live tests of the mess-cleanup task.

An Efficient Spatial Index Technique based on Flash-Memory (플래시 메모리 기반의 효율적인 공간 인덱스 기법)

  • Kim, Joung-Joon;Sim, Hee-Joung;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2009
  • Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

  • PDF

Assessing the Real-time Positioning Accuracy of Low-cost GPS Receiver using NTRIP-based Augmentation Service (Ntrip 기반 보정서비스를 활용한 저가 GPS 수신기의 실시간 측위 정확도 평가)

  • Lee, Yong Chang
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.23 no.3
    • /
    • pp.31-39
    • /
    • 2015
  • This paper presents the static and kinematic positioning accuracy by the real-time GPS positioning modes of the low-cost GPS receivers using NTRIP-based augmentation service. For this, acquires both the raw measurements data of the field tests by LEA 6T GPS module of u-blox AG, and correction communication via NTRIP caster with RTKLIB as an open source program for GNSS solution. With computing the positions of the check points and road tracks by six kinds of GPS positioning modes which are Single, SBAS, DGPS, PPP, RTK, and TCP/IP_RTK, compared these results to the reference position of the check points. The position error average and rmse of the static test by GPS L1 RTK surveying showed $N=0.002m{\pm}0.001m$, $E=0.004m{\pm}0.001m$ in horizontal plane, and $h=-0.116m{\pm}0.003m$ in vertical, these results are very closed to the coordinates with the geodetic receiver. Especially, in case of the kinematic test with obstacles located on both sides of road, the computed track with ambiguity fixing showed very similar trajectory considerably from VRS network RTK mode. And also, evaluate and verify the performance of the TCP/IP_RTK mode developed based on TCP/IP protocol.

원자력分野 에서의 破壞力學 現況 -법적 요구사항을 중심으로 (II)-

  • 송달호;손갑헌
    • Journal of the KSME
    • /
    • v.21 no.1
    • /
    • pp.21-31
    • /
    • 1981
  • 원자력발전소의 원자로냉각재 압력경계의 건전성과 안정성을 확보하기 위하여 법적 요구조건을 설정함에 있어 파괴역학이 어떻게 적용되었는 가를 설명하였다. 이를 요약하면 다음과 같다. 1) 압력경계에 사용되는 재료의 $RT_{NDT}$를 정의하였다. 이는 무연성천이온도와 같은 개 념의 것으로, 앞으로 재료의 파괴인성은 이 $RT_{NDT}$에 대한 상대온도의 함수로 주어진다. 2)비연성파괴를 방지하기 위한 설계조건으로서 선형탄성 파괴역학에 근거한 조건식을 인용하였다. 여기서 조건식이란 능력확대계수의 합계가 어떠한 조건에서도 이러한 조건식을 만족한다는 것을 해석적으로 확인하고 규제당국의 승인을 받아야 한다. 3) 가동중검사에 발견된 결함으로 합격수준을 초과하는 것은 파괴역학적으로 해석하여 구조적 으로 안전하다는 것은 파괴역학적으로 해석하여 구조적으로 안전하다는 것을 입증하여야 한다. 이때 결함은 원자로의 가동과 더불어 성장하므로 수명기간중 피로파괴에 이를 것인지의 여부도 평가하여야 한다. 이때의 대조균열성장률은 Paris의 power law에 따른다. 4) 고속중성자 (E>1. 0MeV)에 의한 조사취화를 감시하기 위하여 감시시험계획을 사전에 수립 하고 이에 따라 감시시험을 수행하여 조사에 수립하고 이에 따라 감시시험을 수행하여 조사에 의한 원자로용기 재료의 파괴인성의 저하를 평가하여 이를 고려한 충분한 안전여유를 갖는 운 전조건 즉, 압력-온도 한계곡선을 산출하여야 한다. 이때의 취화 정도는 DELTA. $RT_{NDT}$ 와 Upper Shelf Energy의 감소로 나타낸다. 또한, 압력-온도 한계곡선은 선형관성 파괴역학에 입각한 조건식을 이용하여 해당 온도에서의 압력을 산출한다. System을 개발 사용하기 위하여 기존 전자계산소를 이용하는 방법이 바람직하며 System의 도입은 자체운영을 결정하기 전에 경제적인 여건 등 여러가지 문제를 검토하여야 한다. 특히 Turn Key Base로 System를 도입할 경우에는 System의 도입목 적과 사용빈도, 앞으로의 확장성 현재 설계및 생산 과정과의 마찰가능성, 유지보수문제 등을 신 중히 검토하여야 한다. 이제 기계공업도 전자계산기를 이해하고 사용하므로 서 발전할 수 있는 단계가 되었다. 예로부터 좋은 공구를 개발하여 적절히 사용하는 것이 기계공업 발전의 첩경이 었다. 전자계산기는 현대 기술이 개발한 가장 강력하고 사용하기 좋은 공구이다.점에서 피로구열의 안정성장을 논하고, 과거 10여년간의 피로 crack문제에 대한 연구방법, 실험방법 등을 소개하는 방향으로 고 를 진행시켜 나가겠다.에 그 효과가 증대됨을 알 수 있었다.적용한 임상실험이 수행되어야 할 것이다. 또한 위치결정에서 획득한 좌표값의 정확성을 알아보기 위해서 팬톰을 이용한 방사선조사 실험이 추후에 실행되어져야 할 것이다. 그리고 제작된 프레임에 Rotating X선 시스템과 내부 장기의 움직임을 계량화하고 PTV에서의 최적 여유폭을 설정함으로써 정위 방사선수술 및 3 차원 업체 방사선치료에 대한 병소 위치측정과 환자의 자세에 대한 setup 오차측정 결정에 도움이 될 수 있을 것이라고 사료된다. 상대적으로 우수한 것으로 나타났으며, 혼합충전재는 암모니아의 경우 코코넛과 펄라이트의 비율이 7:3인 혼합 재료 3번과 소나무수피와 펄라이트의 비율이 7:3인 혼합 재료 6번에서 다른 혼합 재료에 비하여 우수한 것으로 나타났다. 4. 코코넛과 소나무수피의 경우 암모니아 가스에 대한 흡착 능력은 거의 비슷한 것으로 사료되며,

  • PDF

An Efficient Spatial Index Structure for Main Memory (메인 메모리를 위한 효율적인 공간 인덱스 구조)

  • Lee, Ki-Young;Lim, Myung-Jae;Kang, Jeong-Jin;Kim, Joung-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.13-20
    • /
    • 2009
  • Recently there is growing interest in LBS requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based spatial indexes of the spatial main memory DBMS in the main memory, spatial index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMB (relative-sized MBR)compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

An Efficient MBR Compression Technique for Main Memory Multi-dimensional Indexes (메인 메모리 다차원 인덱스를 위한 효율적인 MBR 압축 기법)

  • Kim, Joung-Joon;Kang, Hong-Koo;Kim, Dong-Oh;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.13-23
    • /
    • 2007
  • Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

Extended Cartoon Rendering using 3D Texture (3차원 텍스처를 이용한 카툰 렌더링의 만화적 스타일 다양화)

  • Byun, Hae-Won;Jung, Hye-Moon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.8
    • /
    • pp.123-133
    • /
    • 2011
  • In this paper, we propose a new method for toon shading using 3D texture which renders 3d objects in a cartoon style. The conventional toon shading using 1D texture displays shading tone by computing the relative position and orientation between a light vector and surface normal. The 1D texture alone has limits to express the various tone change according to any viewing condition. Therefore Barla et. al. replaces a 1D texture with a 2D texture whose the second dimension corresponds to the view-dependent effects such as level-of-abstraction, depthof-field. The proposed scheme extends 2D texture to 3D texture by adding one dimension with the geometric information of 3D objects such as curvature, saliency, and coordinates. This approach supports two kinds of extensions for cartoon style diversification. First, we support "shape exaggeration effect" to emphasize silhouette or highlight according to the geometric information of 3D objects. Second, we further incorporate "cartoon specific effect", which is examples of screen tone and out focusing frequently appeared in cartoons. We demonstrate the effectiveness of our approach through examples that include a number of 3d objects rendered in various cartoon style.

Automated Image Matching for Satellite Images with Different GSDs through Improved Feature Matching and Robust Estimation (특징점 매칭 개선 및 강인추정을 통한 이종해상도 위성영상 자동영상정합)

  • Ban, Seunghwan;Kim, Taejung
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.6_1
    • /
    • pp.1257-1271
    • /
    • 2022
  • Recently, many Earth observation optical satellites have been developed, as their demands were increasing. Therefore, a rapid preprocessing of satellites became one of the most important problem for an active utilization of satellite images. Satellite image matching is a technique in which two images are transformed and represented in one specific coordinate system. This technique is used for aligning different bands or correcting of relative positions error between two satellite images. In this paper, we propose an automatic image matching method among satellite images with different ground sampling distances (GSDs). Our method is based on improved feature matching and robust estimation of transformation between satellite images. The proposed method consists of five processes: calculation of overlapping area, improved feature detection, feature matching, robust estimation of transformation, and image resampling. For feature detection, we extract overlapping areas and resample them to equalize their GSDs. For feature matching, we used Oriented FAST and rotated BRIEF (ORB) to improve matching performance. We performed image registration experiments with images KOMPSAT-3A and RapidEye. The performance verification of the proposed method was checked in qualitative and quantitative methods. The reprojection errors of image matching were in the range of 1.277 to 1.608 pixels accuracy with respect to the GSD of RapidEye images. Finally, we confirmed the possibility of satellite image matching with heterogeneous GSDs through the proposed method.