• Proceedings of the KSRS Conference
• /
• v.2
• /
• 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.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• 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.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• 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.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• 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.

• 보존과학연구
• /
• s.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.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• 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.

• 보존과학연구
• /
• s.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.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.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• 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.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.11
• /
• pp.54-64
• /
• 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 mainly analyzed with either unknown objects 2-dimensionally by vision sensor or known objects, such as cylindrical objects, 3-dimensionally. As extending the previous work, in this study we propose an algorithm to analyze grasp of unknown objects 3-dimensionally by using vision sensor. This is archived by two steps. The first step is to make a 3-dimensional geometrical model for unknown objects by using stereo matching. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand which has the characteristic of multi-finger hand and is easy to model. To find the optimal grasping points, genetic algorithm is employed and objective function minimizes the admissible force of finger tip applied to the objects. The algorithm is verified by computer simulation by which optimal grasping points of known objects with different angle are checked.