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

• Spatial Information Research
• /
• v.7 no.2
• /
• pp.271-282
• /
• 1999

In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.697-699
• /
• 2007

Spatiograms are histograms augmented with spatial means and covariances to capture a richer description of the target. We present a particle filtering framework for region-based tracking using spatiograms. Unlike mean shift, the framework allows for non-differentiable similarity measures to compare two spatiograms; we present one such similarity measure, a combination of a recent weighting scheme and histogram intersection. Experimental results show improved performance with the new measure as well as the importance of global spatial information for tracking. The performance of spatiograms is compared with color histograms and several texture histogram methods.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.33-36
• /
• 2002

A new smart antenna scheme based on spatial FFT is proposed. By combining the output of spatial FFT, the proposed structure shows similar performance gain compared to ordinary smart antenna systems. Moreover. the proposed scheme could be easily integrated to general receiver without beam focusing module. The analysis and simulation results show that the performances of proposed scheme are comparable to ordinary smart antenna systems

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6A
• /
• pp.563-574
• /
• 2006

This paper implements SCM(Spatial Channel Model), a kind of ray-tracing method which has characteristics similar to realistic wave propagation environments, for link-level performance analysis of OFDM(Orthogonal Frequency Division Multiplexing) based multiple antenna systems. The SCM is proposed by 3GPP & 3GPP2 Spatial Channel AHG(Ad-hoc Group) for system-level performance validation. In this paper, we modify the system level parameters and channel coefficient of SCM to compare the link-level performances of OFDM based multiple antenna systems. Through computer simulations, we manifest the implemented SCM channel characteristics. We analyze a realistic link-level performance of OFDM based conventional MIMO(Multiple Input Multiple Output) system and smart antenna system in the implemented channel. We also include the link-level performance of OFDM based multiple antenna systems in I-METRA(Intelligent Multi Element Transmit and Receive Antenna) and independent channel environments with the same system parameters. We suggest appropriate multiple antenna system in the given environment by comparing the link-level performance in the spatial channels that have different channel correlation values.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.980-986
• /
• 2008

Spatial multiuser access is investigated for the reverse link of multiuser multiple-input multiple-output (MIMO) systems. In particular, we consider two alternative a aches to spatial multiuser access that adopt the same detection algorithm at the base station: one is a closed-loop approach based on singular value decomposition (SVD) of the channel matrix, whereas the other is an open-loop approach based in space-time block coding (STBC). We develop multiuser detection algorithms for these two spatial multiuser access schemes based on the minimum mean square error (MMSE) criterion. Then, we compare the bit error rate (BER) performance of the two schemes and a single-user MIMO scheme. Interestingly, it is found that the STBC approach can provide much better BER performance than the SVD approach as well as than a single-user MIMO scheme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.4
• /
• pp.739-745
• /
• 2011

This paper proposes a method for reducing the negative spatial harmonics of the radial flux density of an interior-type permanent magnet (IPM) motor. The reliability of the motor is increased by minimizing its vibrations under dynamic eccentricity (DE) state and normal state due to reduction of a negative spatial harmonics component through the influx of a zero spatial harmonics component in the radial flux density. To minimize the vibrations, optimal notches corresponding to the distribution shape of the magnetic field are designed on the rotor pole face. The variations of vibration computation by finite element method (FEM) and the validity of the analysis and rotor shape design are confirmed by vibration and performance experiments.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.208-219
• /
• 2022

Crime amount prediction is crucial for optimizing the police patrols' arrangement in each region of a city. First, we analyzed spatiotemporal correlations of the crime data and the relationships between crime and related auxiliary data, including points-of-interest (POI), public service complaints, and demographics. Then, we proposed a crime amount prediction model based on 2D convolution and long short-term memory neural network (2DCONV-LSTM). The proposed model captures the spatiotemporal correlations in the crime data, and the crime-related auxiliary data are used to enhance the regional spatial features. Extensive experiments on real-world datasets are conducted. Results demonstrated that capturing both temporal and spatial correlations in crime data and using auxiliary data to extract regional spatial features improve the prediction performance. In the best case scenario, the proposed model reduces the prediction error by at least 17.8% and 8.2% compared with support vector regression (SVR) and LSTM, respectively. Moreover, excessive auxiliary data reduce model performance because of the presence of redundant information.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.2
• /
• pp.89-97
• /
• 2019

Recently, there is an increasing demand for applications utilizing maps and locations such as autonomous vehicles and location-based services. Since these applications are developed based on spatial data, interest in spatial data processing is increasing and various studies are being conducted. In this paper, I propose a parallel mining algorithm using the CUDA library to efficiently analyze large spatial data. Spatial data includes both geometric (spatial) and non-spatial (aspatial) attributes. The proposed parallel spatial data mining algorithm analyzes both the geometric and non-spatial relationships between two layers. The experiment was performed on graphics cards containing CUDA cores based on TIGER/Line data, which is the actual spatial data for the US census. Experimental results show that the proposed parallel algorithm using CUDA greatly improves spatial data mining performance.

• Spatial Information Research
• /
• v.12 no.4 s.31
• /
• pp.339-349
• /
• 2004

Outliers in spatial databases uuluence on the performance of spatial indexing methods including R-tree. They enlarge the size and overlapping area of MBRs in R-tree which are important factors in determining the performance. In this paper, we give an analysis of outlier effects on R-tree by analytical and experimental work, and propose a method for properly handling outliers. Our experimental results show that our method improves about 15 percents of the performance.