• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.490-491
• /
• 2021

Recently, technologies using Wi-Fi fingerprints and deep learning are being studied to provide accurate location-based services in an indoor environment. At this time, the composition of learning data is very important, and it is essential to collect sufficient data necessary for learning. However, the number of specific points for the collection of radio signal data within the area requiring positioning is infinite, and it is impossible to collect all of these data. Therefore, there is a need for a way to make up for insufficient learning data. This study proposes a method of constructing a sufficient number of location data necessary for learning based on insufficiently collected location data.

• TTA Journal
• /
• s.110
• /
• pp.93-98
• /
• 2007

• Information and Communications Magazine
• /
• v.20 no.2
• /
• pp.77-85
• /
• 2003

• TTA Journal
• /
• s.97
• /
• pp.120-125
• /
• 2005

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.831-838
• /
• 2001

Mobile information service aims to provide some degree of effective information for real life activities of mobile users. Due to the user mobility and actual realism, it becomes very important technical issue to support an adaptive information service methodology to current situations of the terminal and/or user. This paper deals with a prefetching scheme for location-aware, out of the various context-aware which can be considered in mobile information service. It makes use of the velocity-based mobility model to shape the terminal and/or user's mobility behavior. Based on the moving speed and direction, the prefetching zone is proposed to define the number of prefetched information, so as to limit effectively the prefetched information whilst to preserve the location-aware adaptability. Using a simulator, the proposed scheme has been evaluated in the effectiveness point of view. The idea in this paper is expected to be able to extended to the other mobile service contexts, such as service time, I/O types of mobile terminals, network bandwidth.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.405-415
• /
• 2005

Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

• 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 Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1971-1978
• /
• 2011

In RFID-based cold-storage systems, product locations are recognized as the logical locations of RFID readers which are attached to the entrance of the cold rooms. However, through these methods, product locations can be incorrect in many different situations of a storage. Cold storage rooms have a huge rage in temperature, and the product in the cold-storage spoils easily. Therefore, highly precise product locations is very important for the product quality In this paper, a new approach is suggested to manage the storage location inaccuracy by adding two readers to existing forklift and attaching RFID tags to the ceiling. One reader recognizes ceiling tags to acquire location data, and the other recognizes product tags to acquire product detail data loaded on the forklift. The product can be seamlessly tracked and traced in realtime by monitoring and analyzing data gathered from these readers. Through the proposed location management method, the effectiveness of the product management in cold-storage can be improved consequently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.765-772
• /
• 2011

In this paper, a simulation-based method is presented to dispose direction finders in three dimensional space for locating targets using the directional data. A direction finder(DF) is a military weapon that is used to find locations of targets that emit radio frequencies by operating two or more DFs simultaneously. If one or more DFs are operated in the air, the accuracy of location estimation can be enhanced by disposing them in a better configuration. By extending the line method, which is a well-known algorithm for 2-D location estimation, into 3-D space, the problem of 3-D location estimation is defined as an nonlinear programming form and solved analytically. Then the optimal disposition of DFs is considered with the presented method in which methods of simulation and search technique are combined. With the suggested algorithm for 3-D disposition of DFs, regions in which targets exist can be effectively covered so that the operation effect of DF be increased.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3211-3218
• /
• 1997

This paper addresses an eye location algorithm which is essential process of human face tracking system for natural video-conferencing. In current video-conferencing systems, user's facial movements are restricted by fixed camera, therefore it is inconvenient to users. We Propose an eye location algorithm for automatic face tracking. Because, locations of other facial features guessed from locations of eye and scale of face in the image can be calculated using inter-ocular distance. Most previous feature extraction methods for face recognition system are approached under assumption that approximative face region or location of each facial feature is known. The proposed algorithm in this paper uses no prior information on the given image. It is not sensitive to backgrounds and lighting conditions. The proposed algorithm uses the valley representation as major information to locate eyes. The experiments have been performed for 213 frames of 17 people and show very encouraging results.