• Journal of the Korea Society of Computer and Information
• /
• v.24 no.8
• /
• pp.137-142
• /
• 2019

This paper proposed bitmap based spatial data transmission scheme in need of rapid transmission through network in mobile environment that use and creation of data are frequently happen. Former researches that used clustering algorithms, focused on providing service using spatial data can cause delay since it doesn't consider the transmission speed. This paper guaranteed rapid service for user by convert spatial data to bit, leads to more transmission of bit of MTU, the maximum transmission unit. In the experiment, we compared arithmetically default data composed of 16 byte and spatial data converted to bitmap and for simulation, we created virtual data and compared its network transmission speed and conversion time. Virtual data created as standard normal distribution and skewed distribution to compare difference of reading time. The experiment showed that converted bitmap and network transmission are 2.5 and 8 times faster for each.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1518-1524
• /
• 2014

In this paper, a new method of spatial query, which is called Surround Search (SuSe) is suggested. This method makes it possible to search for the closest spatial object of interest to the user from a query point. SuSe is differentiated from the existing spatial object query schemes, because it locates the closest spatial object of interest around the query point. While SuSe searches the surroundings, the spatial object is saved on an R-tree, and MINDIST, the distance between the query location and objects, is measured by considering an angle that the existing spatial object query methods have not previously considered. The angle between targeted-search objects is found from a query point that is hidden behind another object in order to distinguish hidden objects from them. The distinct feature of this proposed scheme is that it can search the faraway or hidden objects, in contrast to the existing method. SuSe is able to search for spatial objects more precisely, and users can be confident that this scheme will have superior performance to its predecessor.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.941-949
• /
• 2011

In a cooperative communication system with a source node and multiple relays equipping single antenna and a destination node equipping multiple antennas, the selective cooperative spatial multiplexing scheme can obtain spatial multiplexing gain and additional selection diversity gain. But it can degrade a bit error rate performance because some received symbols forwarded from particular relays may be lost by attenuation due to path-loss. We propose a relay and transmission mode selection scheme which selects minimum number of multiple relays having the channel capacity larger than a given data rate and transmission mode which switches spatial multiplexing and spatial diversity mode in cooperation phase to enhance the bit error rate performance. The proposed scheme achieves 1.5~2dB gain at the low SNR range compared with the conventional scheme by obtaining additional spatial diversity gain.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.35-42
• /
• 2011

Cooperative relay communication for wireless networks has been extensively studied due to its ability to mitigate fading effectively via spatial diversity. In this paper, we propose a balanced transmit scheme in cooperative relay communication with decode-and-forward DF) scheme. The proposed scheme selects the feedback bits to obtain the maximum cooperative diversity gain. The simulation results show that the proposed scheme improves the bit error rate BER) performance as compare with a conventional scheme.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.134-144
• /
• 2003

Spatial relationships among objects are one of the important ingredients for expressing constraints of an image in image or multimedia retrieval systems. In this paper, we propose a unified image retrieval scheme using spatial relationships among objects and their features. The proposed scheme is especially effective in computing similarity between query image and images in the database. Also, objects and their spatial relationships are captured and annotated in XML. It could give better precision and flexibility in retrieving images from database. Finally, we have implemented a prototype system for retrieving images based on proposed technique and showed some of the experiment results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5481-5495
• /
• 2018

Single pixel imaging technology has developed for years, however the video acquisition on the single pixel camera is not a well-studied problem in computer vision. This work proposes a new scheme for single pixel camera to acquire video data and a new regularization for robust signal recovery algorithm. The method establishes a single pixel video compressive sensing scheme to reconstruct the video clips in spatial domain by recovering the difference of the consecutive frames. Different from traditional data acquisition method works in transform domain, the proposed scheme reconstructs the video frames directly in spatial domain. At the same time, a new regularization called spatial cluster is introduced to improve the performance of signal reconstruction. The regularization derives from the observation that the nonzero coefficients often tend to be clustered in the difference of the consecutive video frames. We implement an experiment platform to illustrate the effectiveness of the proposed algorithm. Numerous experiments show the well performance of video acquisition and frame reconstruction on single pixel camera.

• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.3
• /
• pp.182-190
• /
• 2021

Computational simulations of turbulent flows around a model ship have been performed to investigate an influence of TVD schemes on the accuracy of advective terms associated with ship resistances. Several TVD schemes including upwind, second-order upwind, vanLeer, and QUICK as well as a nonTVD linear scheme were studied by examining temporal and spatial characteristics of accuracy transition in adjacent cells to the hull. Even though vanLeer scheme was the most accurate among TVD schemes in both structured and unstructured grid systems, the ratio of accuracy switch from 2^nd order to 1^st order in vanLeer scheme was considerable compared with the 2^nd order linear scheme. Also, the accuracy transition was observed to be overally scattered in the unstructured grid while the accuracy transition in the structured grid appeared relatively clustered. It concluded that TVD schemes had to be carefully used in computational simulations of turbulent flows around a model ship due to the loss of accuracy despite its attraction of numerical stability.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.11-19
• /
• 2008

Recently, advances in mobile devices and wireless communication technologies require research on various location-based services. As a result, many studies on processing k-nearest neighbor query, which is most im portant one in location-based services, have been done. Most of existing studies use pre-computation technique to improve retrieval performance by computing network distance between POIs and nodes beforehand in spatial networks. However, they have a drawback that they can not deal with effectively the update of POIs to be searched. In this paper, we propose a distributed grid scheme using S-GRID to overcome the disadvantage of the existing work as well as to manage the location information of a large number of moving objects in efficient way. In addition, we describe a k-nearest neighbor(k-NN) query processing algorithm for the proposed distributed grid scheme. Finally, we show the efficiency of our distributed grid scheme by making a performance comparison between the k-NN query processing algorithm of our scheme and that of S-GRID.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.6
• /
• pp.2713-2719
• /
• 2012

According to increasing of various location-based services, distributed data stream processing techniques have been widely studied to provide high scalability and availability. In previous researches, in order to balance the load of distributed nodes, the geographic characteristics of spatial data stream are not considered. For this reason, distributed operations for adjacent spatial regions increases the overall system load. We propose a operation allocation scheme considering the characteristics of spatial operations to effectively processing spatial data stream in distributed computing environments. The proposed method presents the efficient share maximizing approach that preferentially distributes spatial operations sharing the common query regions to the same node in order to separate the adjacent spatial operations on overlapped regions.

• Spatial Information Research
• /
• v.6 no.2
• /
• pp.125-132
• /
• 1998

The I/O performance for spatial queries is extremely important since the handling of huge amount of multidimensional data is required in spatial databases for geographic information systems. Therefore, we describe representative spatial access methods handling complex spatial objects, z-transform B tree, KDB tree, R tree, MAX tree, to increase I/O performance. In addition, we measure the performance of spatial indexing schemes by testing against various realistic data and query sets. Results from the benchmark test indicates that MAX outperforms other indexing schemes on insertion, range query, spatial join. MAX tree is expected to use as index scheme organizing storage system of GIS in the future.