• Title/Summary/Keyword: 객체 중첩

Search Result 97, Processing Time 0.022 seconds

Extraction of Individual Trees and Tree Heights for Pinus rigida Forests Using UAV Images (드론 영상을 이용한 리기다소나무림의 개체목 및 수고 추출)

  • Song, Chan;Kim, Sung Yong;Lee, Sun Joo;Jang, Yong Hwan;Lee, Young Jin
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.6_1
    • /
    • pp.1731-1738
    • /
    • 2021
  • The objective of this study was to extract individual trees and tree heights using UAV drone images. The study site was Gongju national university experiment forest, located in Yesan-gun, Chungcheongnam-do. The thinning intensity study sites consisted of 40% thinning, 20% thinning, 10% thinning and control. The image was filmed by using the "Mavic Pro 2" model of DJI company, and the altitude of the photo shoot was set at 80% of the overlay between 180m pictures. In order to prevent image distortion, a ground reference point was installed and the end lap and side lap were set to 80%. Tree heights were extracted using Digital Surface Model (DSM) and Digital Terrain Model (DTM), and individual trees were split and extracted using object-based analysis. As a result of individual tree extraction, thinning 40% stands showed the highest extraction rate of 109.1%, while thinning 20% showed 87.1%, thinning 10% showed 63.5%, and control sites showed 56.0% of accuracy. As a result of tree height extraction, thinning 40% showed 1.43m error compared with field survey data, while thinning 20% showed 1.73 m, thinning 10% showed 1.88 m, and control sites showed the largest error of 2.22 m.

A Region-based Comparison Algorithm of k sets of Trapezoids (k 사다리꼴 셋의 영역 중심 비교 알고리즘)

  • Jung, Hae-Jae
    • The KIPS Transactions:PartA
    • /
    • v.10A no.6
    • /
    • pp.665-670
    • /
    • 2003
  • In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n+k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

T-DMB Hybrid Data Service Part 1: Hybrid BIFS Technology (T-DMB 하이브리드 데이터 서비스 Part 1: 하이브리드 BIFS 기술)

  • Lim, Young-Kwon;Kim, Kyu-Heon;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.350-359
    • /
    • 2011
  • Fast developments of broadcasting technologies since 1990s enabled not only High Definition Television service providing high quality audiovisual contents at home but also mobile broadcasting service providing audiovisual contents to high speed moving vehicle. Terrestrial Digital Multimedia Broadcasting (T-DMB) is one of the technologies developed for mobile broadcasting service, which has been successfully commercialized. One of the major technical breakthroughs achieved by T-DMB in addition to robust vehicular reception is an adoption of framework based on MPEG-4 System. It naturally enables integrated interactive data services by using Binary Format for Scene (BIFS) technology for scene description and representation of graphics object and Object Descriptor Framework representing multimedia service components as objects. T-DMB interactive data service has two fundamental limitations. Firstly, graphic data for interactive service should be always overlaid on top of a video not to be rendered out of it. Secondly, data for interactive service is only received by broadcasting channel. These limitations were considered as general in broadcasting systems. However, they are being considered as hard limitations for personalized data services using location information and user characteristics which are becoming widely used for data services of smart devices in these days. In this paper, the architecture of T-DMB hybrid data service is proposed which is utilizing broadcasting network, wireless internet and local storage for delivering BIFS data to overcome these limitations. This paper also presents hybrid BIFS technology to implement T-DMB hybrid data service while maintaining backward compatibility with legacy T-DMB players.

Detection of M:N corresponding class group pairs between two spatial datasets with agglomerative hierarchical clustering (응집 계층 군집화 기법을 이용한 이종 공간정보의 M:N 대응 클래스 군집 쌍 탐색)

  • Huh, Yong;Kim, Jung-Ok;Yu, Ki-Yun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.2
    • /
    • pp.125-134
    • /
    • 2012
  • In this paper, we propose a method to analyze M:N corresponding relations in semantic matching, especially focusing on feature class matching. Similarities between any class pairs are measured by spatial objects which coexist in the class pairs, and corresponding classes are obtained by clustering with these pairwise similarities. We applied a graph embedding method, which constructs a global configuration of each class in a low-dimensional Euclidean space while preserving the above pairwise similarities, so that the distances between the embedded classes are proportional to the overall degree of similarity on the edge paths in the graph. Thus, the clustering problem could be solved by employing a general clustering algorithm with the embedded coordinates. We applied the proposed method to polygon object layers in a topographic map and land parcel categories in a cadastral map of Suwon area and evaluated the results. F-measures of the detected class pairs were analyzed to validate the results. And some class pairs which would not detected by analysis on nominal class names were detected by the proposed method.

The Policy of Minimizing Spatio-Temporal Overlaps on the TB-tree for Trajectories Index (과거 궤적 색인을 위한 TB-트리의 시공간 중첩 최소화 정책)

  • Cho, Dae-Soo;Lim, Duk-Sung;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.1 s.13
    • /
    • pp.13-24
    • /
    • 2005
  • Objects, which change their positions over time such as cars, are called moving objects. Trajectories of a moving object have large volumes because trajectories are accumulated. Efficient indexing techniques for searching these large volumes of trajectories are needed in the moving object databases. Especially the TB-tree which supports bundling trajectories is suitable for processing combined queries which have 2 steps: first step is selecting trajectories (range search), next is selecting the parts of each trajectory (trajectory search). But the TB-tree has unnecessary disk accesses cause of lack of spatial discrimination in range queries. In this paper, we propose and implement the splitting polity which can reduce dead spaces of non-leaf node in order to process range queries efficiently. The policy has better performance about range queries than the TB-tree as well as the advantages of the TB-tree, such as highly space utilization and efficient trajectory extraction. This paper shows that the newly proposed split policy has better performance in processing the range queries than that of the TB-tree by experimental evaluation.

  • PDF

Design of Mixed Reality based Convergence Edutainment System using Cloud Service (클라우드 서비스를 이용한 복합현실 기반의 융합형 에듀테인먼트 시스템 설계)

  • Kim, Donghyun;Kim, Minho
    • Journal of the Korea Convergence Society
    • /
    • v.6 no.3
    • /
    • pp.103-109
    • /
    • 2015
  • TOLED(Transparent, Organic Light Emitting Diodes) based edutainment system has been studied to solve the actual feeling training and educational experience problem of e-learning. However, edutainment system using TOLED has a problem for the non-detection of multi marker array and rotate marker array, and it has problem for the dissonance phenomena caused by Illumination Environment between real world and virtual object. It also has a do not provide services through a variety of devices problem. Therefore, in this paper, we designed a system that provides a realistic actual feeling edutainment contents by recognizes the marker array rotation and a plurality of marker arrangement via an improved marker detection technique. And to unify the real space and virtual space of the lighting environment through a nested block layer.

Hierarchical Subdivision of Light Distribution Model for Realistic Shadow Generation in Augmented Reality (증강현실에서 사실적인 그림자 생성을 위한 조명 분포 모델의 계층적 분할)

  • Kim, Iksu;Eem, Changkyoung;Hong, Hyunki
    • Journal of Broadcast Engineering
    • /
    • v.21 no.1
    • /
    • pp.24-35
    • /
    • 2016
  • By estimating environment light distribution, we can generate realistic shadow images in AR(augmented reality). When we estimate light distribution without sensing equipment, environment light model, geometry of virtual object, and surface reflection property are needed. Previous study using 3D marker builds surrounding light environment with a geodesic dome model and analyzes shadow images. Because this method employs candidate shadow maps in initial scene setup, however, it is difficult to estimate precise light information. This paper presents a novel light estimation method based on hierarchical light distribution model subdivision. By using an overlapping area ratio of the segmented shadow and candidate shadow map, we can make hierarchical subdivision of light geodesic dome.

Research on Infrastructure technology of Stereoscopic Object Expression Utilizing the Grabcut algorithm (Grabcut 알고리즘을 활용한 Stereoscopic 객체표현 기반 기술 연구)

  • Lee, Min ho;Choi, Jin yeong;Lee, Jong hyeok;Cha, Jae sang
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.5
    • /
    • pp.151-159
    • /
    • 2018
  • Recently, stereoscopic technology has become a potential for blue ocean as a new growth power industry, and interest in it has been steadily increasing with the development of virtual and augmented reality technologies. Various methods such as binocular parallax and polarized glasses have been developed and used for stereoscopic image expression, but they have limitations such as eye damage, headache, crosstalk and resolution degradation. In this paper, we present a new method of stereoscopic image representation that can overcome the limitations and verify its applicability through basic experiments for object extraction and real - time image representation.

A Study on Frame Interpolation and Nonlinear Moving Vector Estimation Using GRNN (GRNN 알고리즘을 이용한 비선형적 움직임 벡터 추정 및 프레임 보간연구)

  • Lee, Seung-Joo;Bang, Min-Suk;Yun, Kee-Bang;Kim, Ki-Doo
    • Journal of IKEEE
    • /
    • v.17 no.4
    • /
    • pp.459-468
    • /
    • 2013
  • Under nonlinear characteristics of frames, we propose the frame interpolation using GRNN to enhance the visual picture quality. By full search with block size of 128x128~1x1 to reduce blocky artifact and image overlay, we select the frame having block of minimum error and re-estimate the nonlinear moving vector using GRNN. We compare our scheme with forward(backward) motion compensation, bidirectional motion compensation when the object movement is large or the object image includes zoom-in and zoom-out or camera focus has changed. Experimental results show that the proposed method provides better performance in subjective image quality compared to conventional MCFI methods.

Design and Implementation of Real-time Augmented Reality Building Information System Combined with 3D Map (3D 지도와 결합된 실시간 증강현실 건물 안내 시스템의 설계 및 구현)

  • Kim, Sang-Joon;Bae, Yoon-Min;Choi, Yoo-Joo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.24 no.4
    • /
    • pp.39-54
    • /
    • 2018
  • Recently, augmented reality(AR) based building information applications using a smart phone provide information in the static form irrespective of the distance between a user and a target building. If many target buildings are located close to each other, discrimination of information is reduced due to overlapping information objects. Furthermore, it is difficult to intuitively grasp the current position of the user in the previous AR-based applications. In this paper, to solve these limitations, we have designed and implemented a novel building information system in which the location and size of information objects are adaptively displayed according to locations of a user and target buildings, and which allows users to intuitively understand their location by providing a 3D map that displays the user's location and all target buildings within a given distance in real-time. The AR-based building information application proposed in this paper focuses on the building guide in Deoksu Palace in Jung-gu, Seoul.