• 제목/요약/키워드: Research objects

검색결과 3,153건 처리시간 0.042초

EFFICIENT MANAGEMENT OF VERY LARGE MOVING OBJECTS DATABASE

  • Lee, Seong-Ho;Lee, Jae-Ho;An, Kyoung-Hwan;Park, Jong-Hyun
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
    • /
    • pp.725-727
    • /
    • 2006
  • The development of GIS and Location-Based Services requires a high-level database that will be able to allow real-time access to moving objects for spatial and temporal operations. MODB.MM is able to meet these requirements quite adequately, providing operations with the abilities of acquiring, storing, and querying large-scale moving objects. It enables a dynamic and diverse query mechanism, including searches by region, trajectory, and temporal location of a large number of moving objects that may change their locations with time variation. Furthermore, MODB.MM is designed to allow for performance upon main memory and the system supports the migration on out-of-date data from main memory to disk. We define the particular query for truncation of moving objects data and design two migration methods so as to operate the main memory moving objects database system and file-based location storage system with.

  • PDF

MOVING OBJECT JOIN ALGORITHMS USING TB- TREE

  • Lee Jai-Ho;Lee Seong-Ho;Kim Ju-Wan
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.309-312
    • /
    • 2005
  • The need for LBS (Loc,ation Based Services) is increasing due to the wnespread of mobile computing devices and positioning technologies~ In LBS, there are many applications that need to manage moving objects (e.g. taxies, persons). The moving object join operation is to make pairs with spatio-temporal attribute for two sets in the moving object database system. It is import and complicated operation. And processing time increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we apply spatial join methods to moving objects join. We propose two kind of join methods with TB- Tree that preserves trajectories of moving objects. One is depth first traversal spatio-temporaljoin and another is breadth-first traversal spatio-temporal join. We show results of performance test with sample data sets which are created by moving object ,generator tool.

  • PDF

DESIGN AND IMPLEMENTATION OF MOVING OBJECTS MANAGEMENT SYSTEM APPLYING OPEN GOESPATIAL DATA ENCODING

  • Lee, Hye-Jin;Lee, Hyun-Ah;Park, Jong-Heung
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
    • /
    • pp.663-666
    • /
    • 2005
  • The Geography Markup Language (GML) is an XML encoding for the transport and storage of geographic information, including both the geometry and properties of geographic features. This paper uses the GML to provide extendibility and interoperability of spatial data in moving objects management system. Since the purpose of the system is to provide locations of the moving objects in the web and mobile environments, we used the GML both for presenting map data and trajectories of the moving objects. The proposed system is composed of Location Data Interface, Moving Objects Engine, and Web/Mobile Presentation Interface. We utilized the concept of Web Map Server, that is web mapping technology of OGC (Open Geospatial Consortium), to integrate map data and the location information of the moving objects. In the process of the integration, we used the standard data model and interfaces while defining new application schema. Since our suggested system uses open spatial data encoding and interfaces, both extendibility and interoperability are guaranteed.

  • PDF

Extending SQL for Moving Objects Databases

  • Nam, Kwang-Woo;Lee, Jai-Ho;Kim, Min-Soo
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.138-143
    • /
    • 2002
  • This paper describes a framework for extending GIS databases to support moving object data type and query language. The rapid progress of wireless communications, positioning systems, and mobile computing devices have led location-aware applications to be essential components for commercial and industrial systems. Location-aware applications require GIS databases system to represent moving objects and to support querying on the motion properties of objects. For example, fleet management applications may require storage of information about moving vehicles. Also, advanced CRM(Customer Relationship Management) applications may require to store and query the trajectories of mobile phone users. In this trend, maintaining consistent information about the location of continuously moving objects and processing motion-specific queries is challenging problem. We formally define a data model and query language for mobile objects that includes complex evolving spatial structure, and propose core algebra to process the moving object query language. Main profit of proposed moving objects query language and algebra is that proposed model can be constructed on the top of GIS databases.

  • PDF

계명대학교 박물관 보존과학실 소개 (Conservation Laboratory of Keimyung University Museum)

  • 김병주
    • 보존과학연구
    • /
    • 통권6호
    • /
    • pp.247-258
    • /
    • 1985
  • Conservation laboratory was attached to Keimyung University Museum inMarch 1980 and ever since it has been devoted mainly to the processing andconservation of metal objects. A number of objects have been processed inthis laboratory during the period, including those already in the collection ofthe Museum, those which were discovered during the three major excavationsof Kaya tombs conducted by the Museum, and those processed on commissionfrom other museums in the country,The activities of this laboratory include: (1) conserving the objects againstfurther erosion; (2) raising the archaeological value of the objects by revealingthe structure of such parts of the objects as concealed under rust; and (3)recovering the original shape of damaged objects.The methods adopted by the laboratory include: (1) removing from theobjects the ionized chlorine which usually are the major cause of erosion; (2)strengthening the objects by soaking them in acrylic resins; and (3) applyingresins to the surface of the objects to protect them from further erosion.Chemicals much employed by the laboratory includes the acrylic resin(Ruschot; developed jointly by the Cultural Property Research Institute ofKorea and Samwha Paint Company), the sodium sesquicarbonate, the sodiumhydroxide, the lithium hydroxide, and the benzotriazole.Major apparatus in the laboratory includes the vacuum immersion tank, theairbrasive, the ultrasonic cleaner, the pH-ion meter, the water bath, the zoomstereo microscope, the drying oven, and the drill.

  • PDF

국방 분야에서 일부 노출된 물체 인식 향상에 대한 연구 (Enhancing Object Recognition in the Defense Sector: A Research Study on Partially Obscured Objects)

  • 김영훈;권현
    • 융합보안논문지
    • /
    • 제24권1호
    • /
    • pp.77-82
    • /
    • 2024
  • 최근 연구를 통해 다양한 물체 탐지 및 분류 모델은 전반적으로 크게 성능 향상이 이루워졌지만, 물체가 부분적으로 노출된 상황에서의 물체 탐지 및 분류에 대한 연구는 미흡한 실정이다. 특히, 군사 분야에서 무인전투체계가 물체를 탐지하고 분류하는 데 사용되는 경우, 군사적 상황에서 물체는 일반적으로 부분적으로 가려진 상태나 위장된 상태일 가능성이 높다. 본 연구에서는 부분적으로 가려진 물체의 분류 성능을 향상시키는 방법을 제안한다. 이 방법은 물체 이미지 상에 특정 부분을 주변 환경을 고려하여 가리는 부분을 추가하여 은·엄폐 및 위장된 물체에 대한 분류 성능을 개선시켰다. 실험결과로 제안 방법을 적용하였을 때 은·엄폐 및 위장된 물체에 대해서 기존 방법에 비해 물체 분류 향상이 있음을 볼 수가 있었다.

Migration Policies of a Main Memory Index Structure for Moving Objects Databases

  • An Kyounghwan;Kim Kwangsoo
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
    • /
    • pp.673-676
    • /
    • 2004
  • To manage and query moving objects efficiently in MMDBMS, a memory index structure should be used. The most popular index structure for storing trajectories of moving objects is 3DR-tree. The 3DR-tree also can be used for MMDBMS. However, the volume of data can exceed the capacity of physical memory since moving objects report their locations continuously. To accommodate new location reports, old trajectories should be migrated to disk or purged from memory. This paper focuses on migration policies of a main memory index structure. Migration policies consist of two steps: (i) node selection, (ii) node placement. The first step (node selection) selects nodes that should be migrated to disk. The criteria of selection are the performance of insertion or query. The second step (node placement) determines the order of nodes written to disk. This step can be thought as dynamic declustering policies.

  • PDF

출토 철제 유물의 탈염 처리 방법 고찰 (Desalting Method for Removing $Cl^-$ Ions from the Exacavated Irons Objects)

  • 문환석;황진주;정영동
    • 보존과학연구
    • /
    • 통권17호
    • /
    • pp.1-19
    • /
    • 1996
  • Desalting methods for chloride ions from the excavated iron objects were studied. These methods were compared with room temperature and heating condition of treating solution. During the Desalting treatments the $Cl^-$concentration of the solution were measured regularly and the plotted for $Cl^-$concentrations the square root of time, heating methods showed that the $Cl^-$ ions are more extracted. For the desalting treatments these plots were found to be flattening line, it was showed the changing second solution. Also, the changing solution in the room temperation detected less $Cl^-$ ions of heating treatment solution. As the examination for the relative humidity has compared for desalting objects during 8 days, it was showed a re-corroded appearance of R.H90%. As it did not detected a $Cl^-$ ions of re-corroded section, these phenomena were showed the naturally occuring corrosion of the objects in the high relative humidity.

  • PDF

Instance segmentation with pyramid integrated context for aerial objects

  • Juan Wang;Liquan Guo;Minghu Wu;Guanhai Chen;Zishan Liu;Yonggang Ye;Zetao Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권3호
    • /
    • pp.701-720
    • /
    • 2023
  • Aerial objects are more challenging to segment than normal objects, which are usually smaller and have less textural detail. In the process of segmentation, target objects are easily omitted and misdetected, which is problematic. To alleviate these issues, we propose local aggregation feature pyramid networks (LAFPNs) and pyramid integrated context modules (PICMs) for aerial object segmentation. First, using an LAFPN, while strengthening the deep features, the extent to which low-level features interfere with high-level features is reduced, and numerous dense and small aerial targets are prevented from being mistakenly detected as a whole. Second, the PICM uses global information to guide local features, which enhances the network's comprehensive understanding of an entire image and reduces the missed detection of small aerial objects due to insufficient texture information. We evaluate our network with the MS COCO dataset using three categories: airplanes, birds, and kites. Compared with Mask R-CNN, our network achieves performance improvements of 1.7%, 4.9%, and 7.7% in terms of the AP metrics for the three categories. Without pretraining or any postprocessing, the segmentation performance of our network for aerial objects is superior to that of several recent methods based on classic algorithms.

임의 물체에 대한 최적 3차원 Grasp Planning (Optimal 3D Grasp Planning for unknown objects)

  • 이현기;최상균;이상릉
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2002년도 춘계학술대회 논문집
    • /
    • pp.462-465
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

  • PDF