• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.777-784
• /
• 2009

Recently, the importance of geoCRM (geographic Customer Relationship Management) systems are growing rapidly. So, result of the recognition that their applications extend well beyond the traditional CRM systems with the advent of ubiquitous environment and generalized location based services. A majority of traditional CRM systems are either incapable of managing spatial data or are not user-friendly when doing so. On the other hand, the geoCRM systems can be built as providing the geographic-based functions about CRM, including spatial and market analyses and the visualization of customer data, etc. However, it lacks the specific model and implementation of the geoCRM systems, being caused by the incomprehension of needs, the absence of related standards and the difficulties of development, and so on. In this paper, we develop a new spatial analysis supporting system that to enhance productivity through the convenient use and management of spatial data. The functionality provided by our system includes a set of analysis functions based on data mining techniques which allow a user to affect powerful transformation on spatial data. Particularly, both spatial data and non-spatial attributes can be efficiently handled as an object through our OODBMS.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.430-441
• /
• 2002

Video object segmentation is an important component for object-based video coding scheme such as MPEG-4. In this paper, a robust algorithm for segmentation of moving objects in video sequences and VOP(Video Object Planes) extraction is presented. The points of this paper are detection, of an accurate object boundary by associating moving object edge with spatial object edge and generation of VOP. The algorithm begins with the difference between two successive frames. And after extracting difference image, the accurate moving object edge is produced by using the Canny algorithm and morphological operation. To enhance extracting performance, we app]y the morphological operation to extract more accurate VOP. To be specific, we apply morphological erosion operation to detect only accurate object edges. And moving object edges between two images are generated by adjusting the size of the edges. This paper presents a robust algorithm implementation for fast moving object detection by extracting accurate object boundaries in video sequences.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.451-458
• /
• 2011

In order to provide the optimal location based services such as the optimal moving path search or the scheduling pattern prediction, the extraction of significant moving pattern which is considered the temporal and spatial properties of the location-based historical data of the moving objects is essential. In this paper, for the extraction of significant moving pattern we propose the location generalization method which translates the location attributes of moving object into the spatial scope information based on $R^*$-tree for more efficient patterning the continuous changes of the location of moving objects and for indexing to the 2-dimensional spatial scope. The proposed method generates the moving sequences which is satisfied the constraints of the time interval between the spatial scopes using the generalized spatial data, and extracts the significant moving patterns using them. And it can be an efficient method for the temporal pattern mining or the analysis of moving transition of the moving objects to provide the optimal location based services.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.27-29
• /
• 2007

The visual implementation of 3-dimensional national environment is focused by the requirement and importance in the fields such as, national development plan, telecommunication facility deployment plan, railway construction, construction engineering, spatial city development, safety and disaster prevention engineering. The currently used DEM system using contour lines, which embodies national geographic information based on the 2-D digital maps and facility information has limitation in implementation in reproducing the 3-D spatial city. Moreover, this method often neglects the altitude of the rail way infrastructure which has narrow width and long length. There it is needed to apply laser measurement technique in the spatial target object to obtain accuracy. Currently, the LiDAR data which combines the laser measurement skill and GPS has been introduced to obtain high resolution accuracy in the altitude measurement. In this paper, we first investigate the LiDAR based researches in advanced foreign countries, then we propose data a generation scheme and an algorithm for the optimal manage and synthesis of railway facility system in our 3-D spatial terrain information. For this object, LiDAR based height data transformed to DEM, and the realtime unification of the vector via digital image mapping and raster via exactness evaluation is transformed to make it possible to trace the model of generated 3-dimensional railway model with long distance for 3D tract model generation.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.659-666
• /
• 2015

In this paper, we propose a novel reconstruction method of spatially filtered 3D images in integral imaging based on parallel lens array. The parallel lens array is composed of two lens arrays, which are positioned side by side through longitudinal direction. Conventional spatial filtering method by using convolution property between periodic functions has drawback that is the limitation of the position of target object. this caused the result that the target object should be located on the low depth resolution region. The available spatial filtering region of the spatial filtering method is depending on the focal length and the number of elemental lens in the integral imaging pickup system. In this regard, we propose the parallel lens array system to enhance the available spatial filtering region and depth resolution. The experiment result indicate that the proposed method outperforms the conventional method.

• Journal of the Regional Association of Architectural Institute of Korea
• /
• v.20 no.6
• /
• pp.81-87
• /
• 2018

In this paper, in order to maximize the input process efficiency of the building energy simulation field, the authors developed the automatic extraction module of spatial information based BIM geometry information. Existing research or software extracts geometry information based on object information, but it can not be used in the field of energy simulation because it is inconsistent with the geometry information of the object constituting the thermal zone of the actual building model. Especially, IFC-based geometry information extraction module is needed to link with other architectural fields from the viewpoint of reuse of building information. The study method is as follows. (1) Grasp the category and attribute information to be extracted for energy simulation and Analyze the IFC structure based on spatial information (2) Design the algorithm for extracting and reprocessing information for energy simulation from IFC file (use programming language Phython) (3) Develop the module that generates a geometry information database based on spatial information using reprocessed information (4) Verify the accuracy of the development module. In this paper, the reprocessed information can be directly used for energy simulation and it can be widely used regardless of the kind of energy simulation software because it is provided in database format. Therefore, it is expected that the energy simulation process efficiency in actual practice can be maximized.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1077-1088
• /
• 2003

To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.