• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.397-401
• /
• 2007

Recent applications on continuous queries on moving objects are extended quickly to various parts. These applications need not only 2-dimensional space data but also high-dimensional space data. If we use previous index for overlapped continuous range queries on high-dimensional space data, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We focus on stationary queries, non-exponential increase of storage cost and efficient processing time for large data sets. In this paper, to solve these problems, we present a novel query indexing method, denoted as PAB(Projected Attribute Bit)-based query index. We transfer information of high-dimensional continuous range query on each axis into one-dimensional bit lists by projecting technique. Also proposed query index supports incremental update for efficient query processing. Through various experiments, we show that our method outperforms the CES(containment-encoded squares)-based indexing method which is one of the most recent research.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.10
• /
• pp.1062-1068
• /
• 2014

In this paper, a novel approach estimating target's rotation velocity(RV) is proposed for inverse synthetic aperture radar(ISAR) cross-range scaling(CRS). Scale invariant feature transform(SIFT) is applied to two sequently generated ISAR images for extracting non-fluctuating scatterers. Considering the fact that the distance between target's rotation center(RC) and SIFT features is same, we can set a criterion for estimating RV. Then, the criterion is optimized through the proposed method based on particle swarm optimization(PSO) combined with exhaustive search method. Simulation results show that the proposed algorithm can precisely estimate RV of a scenario based maneuvering target without RC information. With the use of the estimated RV, ISAR image can be correctly re-scaled along the cross-range direction.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.128-136
• /
• 2008

In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.431-443
• /
• 2010

In this paper, we propose a range-free localization method that can improve the estimation accuracy of Approximate Point in Triangle(APIT), which is the representative localization method for low cost wireless sensor networks. Specifically, we propose extended-APIT(e-APIT) method, which minimizes the error in deciding whether an object is in an area formed by three beacons. We also propose a way to improve the localization by narrowing down the potential localization area using the signals from neighboring beacons. According to the simulation performed, the proposed e-APIT method demonstrated noticeable accuracy improvement over the conventional APIT method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.79-84
• /
• 2011

In this paper, we analyzed performance of vehicle detection for ITS (Intelligent Transport System) applications. We simulated the vehicle detection at Hi-Pass System is based on DSRC (Dedicated Short Range Communication). DSRC is a wireless network using ITS, including GPS (Global Positioning System) satellites in conjunction with the national transportation system. The system performance is evaluated in terms of bit error probability. In the simulation, the vehicle speed is set at 60 km/h and carrier frequency is 5.8 GHz. Wireless channel is modeled as the Rician fading channel. In the transmitter, the ASK (amplitude shift keying) modulation scheme is applied. From simulation results, we confirmed that performance of applied Alamouti scheme is better than other systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1091-1097
• /
• 2005

In this paper, we propose fast motion estimation algorithm. Local statistics of a motion vector is highly correlated to motion vectors of its neighboring blocks. According to the property, block-based motion search range is adaptively determined in order to reduce unnecessary search points. Based on the determined search range, motion vector is obtained by variable step search motion estimation. Experimental results show that comparing to Full search motion estimation, the motion searching points of proposed algorithm is reduced as much as $98\%$. Moreover, PSNR and Bit Rate are almost same to Full search method.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.628-640
• /
• 2005

The XML is well accepted in several different Web application areas. As soon as many users and applications work concurrently on the same collection of XML documents, isolating accesses and modifications of different transactions becomes an important issue. When an XML document correctly corresponds to the rules laid out in a DTD or XML schema, it is also said to be valid. The valid XML document's validity should be guaranteed after the document is updated. The validation method mentioned above, however, results in lower degree of concurrency. For getting higher degree of concurrency and minimizing the range of the XML document validity, a new validation method based on a specific locking method is required. In this paper we propose the sequence group validation method for minimizing the range of the XML document validity. We also propose the boundary locking method for isolating accesses and modifications of different transactions while supporting the valid XML document's validity. Finally, the results of some experiments show the validation and locking methods increase the degree of transaction concurrency.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1270-1281
• /
• 1999

피라미드 기법 1 은 d-차원의 공간을 2d개의 피라미드들로 분할하는 특별한 공간 분할 방식을 이용하여 고차원 데이타를 효율적으로 색인할 수 있는 새로운 색인 방법으로 제안되었다. 피라미드 기법은 고차원 사각형 형태의 영역 질의에는 효율적이나, 유사성 검색에 많이 사용되는 고차원 구형태의 영역 질의에는 비효율적인 면이 존재한다. 본 논문에서는 고차원 데이타를 많이 사용하는 유사성 검색에 효율적인 새로운 색인 기법으로 구형 피라미드 기법을 제안한다. 구형 피라미드 기법은 먼저 d-차원의 공간을 2d개의 구형 피라미드로 분할하고, 각 단일 구형 피라미드를 다시 구형태의 조각으로 분할하는 특별한 공간 분할 방법에 기반하고 있다. 이러한 공간 분할 방식은 피라미드 기법과 마찬가지로 d-차원 공간을 1-차원 공간으로 변환할 수 있다. 따라서, 변환된 1-차원 데이타를 다루기 위하여 B+-트리를 사용할 수 있다. 본 논문에서는 이렇게 분할된 공간에서 고차원 구형태의 영역 질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 마지막으로, 인위적 데이타와 실제 데이타를 사용한 다양한 실험을 통하여 구형 피라미드 기법이 구형태의 영역 질의를 처리하는데 있어서 기존의 피라미드 기법보다 효율적임을 보인다.Abstract The Pyramid-Technique 1 was proposed as a new indexing method for high- dimensional data spaces using a special partitioning strategy that divides d-dimensional space into 2d pyramids. It is efficient for hypercube range query, but is not efficient for hypersphere range query which is frequently used in similarity search. In this paper, we propose the Spherical Pyramid-Technique, an efficient indexing method for similarity search in high-dimensional space. The Spherical Pyramid-Technique is based on a special partitioning strategy, which is to divide the d-dimensional data space first into 2d spherical pyramids, and then cut the single spherical pyramid into several spherical slices. This partition provides a transformation of d-dimensional space into 1-dimensional space as the Pyramid-Technique does. Thus, we are able to use a B+-tree to manage the transformed 1-dimensional data. We also propose the algorithm of processing hypersphere range query on the space partitioned by this partitioning strategy. Finally, we show that the Spherical Pyramid-Technique clearly outperforms the Pyramid-Technique in processing hypersphere range queries through various experiments using synthetic and real data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.643-650
• /
• 2014

Recently, the wireless communication applications are studied in various environment by the development of short range communication system like wireless sensor networks. This paper presents the analysis of localization schemes for ship application using received signal strength. The localization schemes using received signal strength from wireless networks are classified under two methods, which are Range based method and Range free method. Range based methods estimate the location with least square estimation based on estimated distance using path-loss model. Range free methods estimated the location with the information of anchor nodes linked to target. Simulation results show the appropriate localization scheme for each cabin environments based on the empirical path-loss model in warship's internal space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.