• Title/Summary/Keyword: and object location

Search Result 1,062, Processing Time 0.031 seconds

Study on collision processing among objects by 3D information of real objects extracted from a stereo type method in AR (가상현실에서 스테레오 타입 방식으로 추출한 실물 객체 3D 정보를 이용한 객체간 충돌처리 연구)

  • Jo, In-Kyeong;Park, Hwa-Jin
    • Journal of Digital Contents Society
    • /
    • v.11 no.2
    • /
    • pp.243-251
    • /
    • 2010
  • In this paper, 2 devices through the input image are projected onto the output video device to extract 3D information of real objects and they are located in virtual space. All 3D objects for each inter-object interaction information and location information makes the validation process by recognizing conflict. The proposed extract 3D information of real objects and collision handling inter-object interaction in the most basic issues in augmented reality, because more than anything is a matter to be prescriptive. Therefore, the proposed system to solve this problem exists in virtual space, all objects of the user by validating the conflict between realism and immersion to show that aims to increase.

A MapReduce based Algorithm for Spatial Aggregation of Microblog Data in Spatial Social Analytics (공간 소셜 분석을 위한 마이크로블로그 데이터의 맵리듀스 기반 공간 집계 알고리즘)

  • Cho, Hyun Gu;Yang, Pyoung Woo;Yoo, Ki Hyun;Nam, Kwang Woo
    • Journal of KIISE
    • /
    • v.42 no.6
    • /
    • pp.781-790
    • /
    • 2015
  • In recent times, microblogs have become popular owing to the development of the Internet and mobile environments. Among the various types of microblog data, those containing location data are referred to as spatial social Web objects. General aggregations of such microblog data include data aggregation per user for a single piece of information. This study proposes a spatial aggregation algorithm that combines a general aggregation with spatial data and uses the Geohash and MapReduce operations to perform spatial social analysis, by using microblog data with the characteristics of a spatial social Web object. The proposed algorithm provides the foundation for a meaningful spatial social analysis.

Activated Viewport based Surveillance Event Detection in 360-degree Video (360도 영상 공간에서 활성 뷰포트 기반 이벤트 검출)

  • Shim, Yoo-jeong;Lee, Myeong-jin
    • Journal of Broadcast Engineering
    • /
    • v.25 no.5
    • /
    • pp.770-775
    • /
    • 2020
  • Since 360-degree ERP frame structure has location-dependent distortion, existing video surveillance algorithms cannot be applied to 360-degree video. In this paper, an activated viewport based event detection method is proposed for 360-degree video. After extracting activated viewports enclosing object candidates, objects are finally detected in the viewports. These objects are tracked in 360-degree video space for region-based event detection. The proposed method is shown to improve the recall and the false negative rate more than 30% compared to the conventional method without activated viewports.

Optimal Moving Pattern Mining using Frequency of Sequence and Weights (시퀀스 빈발도와 가중치를 이용한 최적 이동 패턴 탐사)

  • Lee, Yon-Sik;Park, Sung-Sook
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.79-93
    • /
    • 2009
  • For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.

  • PDF

The Implementation of Information Providing Method System for Indoor Area by using the Immersive Media's Video Information (실감미디어 동영상정보를 이용한 실내 공간 정보 제공 시스템 구현)

  • Lee, Sangyoon;Ahn, Heuihak
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.3
    • /
    • pp.157-166
    • /
    • 2016
  • This paper presents the interior space information using 6D-360 degree immersive media video information. And we implement the augmented reality, which includes a variety of information such as position information, movement information of the specific location in the interior space GPS signal does not reach the position information. Augmented reality containing the 6D-360 degree immersive media video information provides the position information and the three dimensional space image information to identify the exact location of a user in an interior space of a moving object as well as a fixed interior space. This paper constitutes a three dimensional image database based on the 6D-360 degree immersive media video information and provides augmented reality service. Therefore, to map the various information to 6D-360 degree immersive media video information, the user can check the plant in the same environment as the actual. It suggests the augmented reality service for the emergency escape and repair to the passengers and employees.

The Experimental Analysis of Integrated (Name/Property) Dynamic Binding Service Model for Wide-Area Objects Computing (광역 객체 컴퓨팅에서 통합(이름/속성) 기반의 동적 바인딩 서비스 모델의 실험분석)

  • Jeong, Chang-Won;Joo, Su-Chong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.746-758
    • /
    • 2006
  • Many objects existing on wide area environments have the replication characteristics according to how to categorize using their own names or properties. From the clients' requests, the existing naming and trading services have not supported with the binding service for replicated solver object with the same service type. For this reason, we present an integrated model that can support the selection of replicated object and dynamic binding services on wide-area computing environments. This model suggests provides not only location management of replicated objects but also active binding service which enables to select a least-loaded object on the system to keep the balance of load between systems. In this purpose, constructing both the service plan and model for support solver object's binding with replication property on wide area computing environments has been researched. In this paper, we showed the test environment and analyzed the performance evaluation of client/server binding procedures via integrated binding service in federation model and verified our model under the condition to see whether load balance can be applied to our model. For the performance evaluation of suggested wide area integrated binding service federation model, evaluated the integrated binding service of each domain and analyzed the performance evaluation of process for non-replication object's under federation model environment. Also, we analyzed the performance evaluation of the federation model between domains for wide area environment. From the execution results, we showed the federation model provides lowers search-cost on the physical tree structure of network.

A Method for Real Time Target Following of a Mobile Robot Using Heading and Distance Information (방향각 및 거리 정보에 의한 이동 로봇의 실시간 목표물 추종 방법)

  • Ko, Nak-Yong;Seo, Dong-Jin;Moon, Yong-Seon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.624-631
    • /
    • 2008
  • This paper presents a method for a mobile robot to follow a moving object in real time. The robot follows a target object keeping the facing angle toward the target and the distance to the target to given value. The method consists of two procedures: first, the detection of target position in the robot coordinate system, and the second, the calculation of translational velocity and rotational velocity to follow the object:. To detect the target location, range sensor data is represented in histogram. Based on the real time calculation of the location of the target relative to the robot, translational velocity and rotational velocity to follow the target are calculated. The velocities make the heading angle and the distance to target converge toward the desired ones. The performance of the method is tested through simulation. In the simulation, the target moves with three different trajectories, straight line trajectory, rectangular trajectory, and circular trajectory. As shown in the results, it is inevitable to lose track temporarily of the target when the target suddenly changes its motion direction. Nevertheless, the robot speeds up to catch up and finally succeeds to follow the target as soon as possible even in this case. The proposed method can also be utilized to coordinate the motion of multiple robots to keep their formation as well as to follow a target.

Performance Analysis of the Localization Compensation Algorithm for Moving Objects Using the Least-squares Method (최소자승법을 적용한 이동객체 위치인식 보정 알고리즘 성능분석)

  • Jung, Moo Kyung;Lee, Dong Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.1
    • /
    • pp.9-16
    • /
    • 2014
  • The localization compensation algorithm for moving objects using the least-squares method is suggested and the performance of the algorithm is analyzed in this paper. The suggested compensation algorithm measures the distance values of the mobile object moving as a constant speed by the TMVS (TWR Minimum Value Selection) method, estimates the location of the mobile node by the trilateration scheme based on the values, and the estimated location is compensated using the least-squares method. By experiments, it is confirmed that the localization performance of the suggested compensation algorithm is largely improved to 58.84% and 40.28% compared with the conventional trilateration method in the scenario 1 and 2, respectively.

A Study on Algorithm of Edge Detection in Mixed Noise Environments (복합잡음 환경에서 에지 검출에 관한 알고리즘에 관한 연구)

  • Lee, Chang-Young;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.100-103
    • /
    • 2014
  • Currently, edge detection is utilized in various areas. Edge detection is the preprocessing process for image processing in general, and this is a technology that is considered essential for image processing. According, research on this subject is carried out incessantly. Edge has important image related elements such as size, direction and location of the object of an image. Numerous methods were proposed for the detection. Among them, the representative methods are Sobel, Prewitt, Roberts, Laplacian. However, these existing methods are rather lacking when it comes to the edge detection characteristics in case of the image with mixed noise. Therefore, this study presented edge detection method that utilizes median and average values for the elements depending on the size and location of local mask.

  • PDF

Design and Implementation of a Main Memory Index based on the R-tree for Moving Object Databases (이동체 데이터베이스를 위한 R-tree 기반 메인 메모리 색인의 설계 및 구현)

  • Ahn, Sung-Woo;An, Kyoung-Hwan;Lee, Chaug-Woo;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.53-73
    • /
    • 2006
  • Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

  • PDF