• 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.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.236-244
• /
• 2008

We propose a new building detection and description algorithm for Lidar data and photogrammetric imagery using color segmentation, line segments matching, perceptual grouping. Our algorithm consists of two steps. In the first step, from the initial building regions extracted from Lidar data and the color segmentation results from the photogrammetric imagery, we extract coarse building boundaries based on the Lidar results with split and merge technique from aerial imagery. In the secondstep, we extract precise building boundaries based on coarse building boundaries and edges from aerial imagery using line segments matching and perceptual grouping. The contribution of this algorithm is that color information in photogrammetric imagery is used to complement collapsed building boundaries obtained by Lidar. Moreover, linearity of the edges and construction of closed roof form are used to reflect the characteristic of man-made object. Experimental results on multisensor data demonstrate that the proposed algorithm produces more accurate and reliable results than Lidar sensor.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.274-281
• /
• 1999

Many popularly used recent high-sped and high-capacity disks use the Zone-Structured in which a disk consists of multiple zones. A zone-structured disk has multiple zones, and the bandwidth and the number of sectors in each zone are different from each other. When the previous studies that modeled disks based on the assumption that the number of sectors in all tracks are same are applied to the zone-structured disk and the video data stored in a round-robin manner are read out with the SCAN technique, the transfer rate of the disk is fixed with that of the innermost zone. And excessive disk space is wasted either. To resolve the problem, this paper proposes a method for reconstructing the physical zones into logical zones by split and merge operations and develops a method for determining optimum transfer block size.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.240-249
• /
• 2002

In the course of Internet proliferation, many network-related technologies are examined for possible growth and evolution. The use of Internet-based technologies in private networks has further fuelled the demand for network-based applications. The most promising among the new paradigms is use of mobile agents. The mobile agent is capable of migrating autonomously from node to node in the network, to perform some computation on behalf of the user. The mobile agent paradigm is attractive alternative to traditional client-server programming for a significant class of network-centric applications. It also however, suffers from a major drawback, namely, the potential for malicious attacks, abuse of resources pilfering of information, and other security issues. These issues are significantly hampering the acceptance of the mobile-agent paradigm. This paper describe the design & implementation of secure mobile agent gateway that split and merge the agent cede with security policy database. This mechanism will promote the security in mobile agent systems and mobile agent itself.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.3-13
• /
• 2004

The TPR-tree exploits bounding rectangles based on the function of time in order to index moving objects. As time passes on, each edge of a BR expands with the fastest velocity vector. Since the expansion of the BR results in a serious overlaps between neighboring nodes, the performance of range query is getting worse. In this paper, we propose schemes to reorganize bounding rectangles of nodes. When inserting a moving object, we exploit a forced merging scheme to merge two overlapped nodes and re-split it. When deleting a moving object, we used forced reinsertion schemes to reinsert other objects of a node into a tree. The forced reinsertion schemes are classified into a deleted node reinsertion scheme and an overlapped nodes reinsertion scheme. The overlapped nodes reinsertion scheme outperforms the forced merging scheme and the deleted node reinsertion scheme in all experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.3-12
• /
• 2001

In this course of Internet proliferation, many network-related technologies are examined for possible growth and evolution. The use of Internet-based technologies is private networks has further fuelled the demand for network-based applications. The most promising among the new paradigms is the use of mobile agents. The mobile agent is capable of migrating autonomously form node to node in the network, to perform some computations on behalf of the user. The mobile agent paradigm is attractive alternative to traditional client-server programming for a significant class of network-centric applications. It does however, suffer. from a major drawback namely, the potential for malicious attacks, abuse of resources, pilfering of information, and other security issues. These issues are significantly hampering the acceptance of the mobile-agent paradigm. This paper describes the design of a secure mobile agent gateway 7hat can split and merge the agent code with security policy database on the VPN. This mechanism will promote security in the mobile agent systems.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.744-749
• /
• 2007

물체 추적시스템은 비디오 감시 시스템, 화상회의 시스템과 같은 다양한 비전 응용 분야에서 점점 비중이 높아지고 있다. 이 시스템에서 가장 널리 사용되고 있는 방법 중 하나로 Particle-Filter를 들 수 있다. 하지만, 이 Particle-Filter의 단점은 유사한 여러 물체를 추적할 때에 그 물체들이 겹치거나 사라질 경우 정확한 추적을 하기 어렵다는 것이다. 이 단점을 극복하기 위해 많은 연구가 진행되고 있으며, 본 논문에서는 이 문제를 극복하기 위한 새로운 방법을 제안하고자 한다. 다중 물체 추적에서 빈번히 일어나는 문제는 두 가지로 요약할 수 있는데, 동일한 다중 물체가 부분적으로 엇갈리거나 다른 객체에 완전히 겹친 후 떨어질 때 한 물체를 중복하여 추적하는 문제(merge and split problem)와 이 때 분리되어 추적은 됐지만, 물체를 혼동하여 추적하는 문제(Labeling problem)이다. 본 논문에서는 이 러한 문제들을 풀기 위해 이미지 필드에서 보다 정확한 확률분포를 만들고, 이 확률분포의 신뢰성을 높이기 위해서 물체의 특징정보를 표현하는 몇 가지 방법을 제안한다. 전자의 문제는 두 가지 문제로 나누어 생각해 보았다. 첫째, 복잡환 환경에서의 분포를 찾아내는 것과 둘째, 추적 중인 물체를 잃어버릴 경우 새로운 샘플을 생성함으로써 나누어 보았다. 이 문제 중 첫번째는 K-means 클러스터링을 이용하여 유사한 물체가 주변에 퍼져 있을 때, 하나의 후보 위치가 아닌, K개의 후보 위치들을 만들어 내어 보다 정확한 추적이 가능하게 하였으며, 두 번째 문제는 추적 중인 물체가 다른 커다란 물체에 가려질 경우이다. 이 상황에서 샘플을 생성하는 방법은 지금까지 해왔던 간단한 환경에서의 생성 범위와는 다르게 넓게 해야 생성시켜야 한다. 이 때 샘플링의 수를 늘리지 않으면서, 최대한 정확하게 추적하기 위해서 동영상에서 물체의 모션을 이용한 모션 히스토그램을 얻어내고, 그 정보를 이용하여 샘플을 생성하는 위치를 조절함으로써 이 문제를 풀어 보았다. 그리고, 후자의 문제인 이미지 필드상에서 확률분포의 신뢰성을 높이기 위한 특징 정보는 기존에 많이 사용하던 칼라 히스토그램에 공간정보의 의미를 부여하는 칼라 히스토그램을 분할하는 방법과 SIFT에서 사용하는 방향정보와 크기정보를 사용했다. 이것들을 사용하여 보다 정확한 물체추적시스템을 다음과 같이 제안한다.

• Korean Journal of Remote Sensing
• /
• v.22 no.2
• /
• pp.111-121
• /
• 2006

The classification using spectral angle is a new approach based on the fact that the spectra of the same type of surface objects in RS data are approximately linearly scaled variations of one another due to atmospheric and topographic effects. There are many researches on the unsupervised classification using spectral angle recently. Nevertheless, there are only a few which consider the characteristics of Hyperspectral data. On this study, we propose the ISOMUSAC(Iterative Self-Organizing Modified Unsupervised Spectral Angle Classification) which can supplement the defects of previous unsupervised spectral angle classification. ISOMUSAC uses the Angle Division for the selection of seed points and calculates the center of clusters using spectral angle. In addition, ISOMUSAC perform the iterative merging and splitting clusters. As a result, the proposed algorithm can reduce the time of processing and generate better classification result than previous unsupervised classification algorithms by visual and quantitative analysis. For the comparison with previous unsupervised spectral angle classification by quantitative analysis, we propose Validity Index using spectral angle.