• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2550-2556
• /
• 2012

We proposed the energy-efficient routing algorithm ALPS (Ad hoc network Localized Positioning System) algorithm that is range-free based on the distance information. The routing coordinate method of ALPS algorithm consists of hierarchical cluster routing that provides immediately relative coordinate location using RSSI(Received Signal Strength Indication) information. Existing conventional DV-hop algorithm also to manage based on normalized the range free method, the proposed hierarchical cluster routing algorithm simulation results show more optimized energy consumption sustainable path routing technique to improve the network management.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.615-620
• /
• 2009

Nowadays, wireless infrastructures such as sensor networks are widely used in many different areas. In case of sensor networks, the wirelessly connected sensors can execute different kind of tasks in a diversity of environments, and one of the most important parameter for a successful execution of such tasks is the location information of each node. As to localization problems in WSNs, there are ToA (Timer of Arrival), RSS (Received Signal Strength), AoA (Angle of Arrival), etc. In this paper, we propose a modification of existing ToA and RSS based methods, adding a weighted average scheme to measure more precisely the distance between nodes. The comparison experiments with the traditional ToA method show that the average error value of proposed method is reduced by 0.1 cm in indoor environment ($5m{\times}7m$) and 0.6cm in outdoor environment ($10{\times}10m$).

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.647-658
• /
• 2010

Many localization schemes estimate the locations of radio nodes based on the physical locations of anchors and the connectivity from the anchors. Since they only consider the knowledge of the anchors without else other nodes, they are likely to have enormous error in location estimate unless the range information from the anchors is accurate or there are sufficiently many anchors. In this paper, we propose a novel localization algorithm with the location knowledge of anchors and even one-hop neighbors to localize unknown nodes in the uniform distance from all the one-hop neighbors without the range information. The node in the uniform distance to its all neighbors reduces the location error relative to the neighbors. It further alleviates the location error between its actual and estimated locations. We evaluate our algorithm through extensive simulations under a variety of node densities and anchor placement methods.

• Journal of Biomedical Engineering Research
• /
• v.25 no.2
• /
• pp.145-150
• /
• 2004

In this study for the prosthesis of the spatial and directional sensation for the blind, an ultrasonic scale system and an electronic compass system were developed. The ultrasonic scale utilizes 40 ㎑ sound for the detection of distance to the barrier and the spatial information is transferred to the blind by various sound interval, which is proportional to the distance. The electronic compass utilizes a magnetoresistor bridge for the detection of the magnetic field strength of earth in horizontal plane. The information for the direction of the earth's north is transferred by tactile stimuli by a vibrating motor band around upper head. Detection distance of the ultrasonic scale is ranged from 0.065 to 3.26 meters, and the detection angle resolution of the electronic compass is about 22.5 degrees. The integrated system of the ultrasonic scale and the electronic compass was developed. Distance information is converted to the location of the tactile stimulation along the clockwise direction by a vibrating motor according to the distance installed around upper head of the blind. The intent of this article is to provide an practical prosthetic tool of spatial and directional sensation for the blind. Daily practice of this system will improve the usefulness of this system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.104-113
• /
• 2022

In this paper, we propose deep learning-based target distance and velocity estimation technique for OFDM radar systems. In the proposed technique, the 2D periodogram is obtained via 2D fast Fourier transform (FFT) from the reflected signal after removing the modulation effect. The periodogram is the input to the conventional and proposed estimators. The peak of the 2D periodogram represents the target, and the constant false alarm rate (CFAR) algorithm is the most popular conventional technique for the target's distance and speed estimation. In contrast, the proposed method is designed using the multiple output convolutional neural network (CNN). Unlike the conventional CFAR, the proposed estimator is easier to use because it does not require any additional information such as noise power. According to the simulation results, the proposed CNN improves the mean square error (MSE) by more than 5 times compared with the conventional CFAR, and the proposed estimator becomes more accurate as the number of transmitted OFDM symbols increases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1163-1168
• /
• 2001

The ranging systems measure range data in three-dimensional coordinate from target surface. These non-contact remote ranging systems is widely used in various automation applications, including military equipment, construction field, navigation, inspection, assembly, and robot vision. The active ranging systems using time of flight technique or light pattern illumination technique are complex and expensive, the passive systems based on stereo or focusing principle are time-consuming. The proposed algorithm, that is based on cross correlation of projection profile of vertical edge, provides advantages of fast and simple operation in the range acquisition. The results of experiment show the effectiveness of the proposed algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.32-41
• /
• 1999

In spatial database system, the nearest neighbor query occurs frequently and requires the processing cost higher than other spatial queries do. The number of nodes to be searched in the index can be minimized for optimizing the cost of processing the nearest neighbor query. The optimal search distance is pr9posed for the measurement of a search distance to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we prove properties of the optimal search distance in N-dimensional. We show through experiments that the performance of query processing of our method is superior to other method using maximum search distance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.19-26
• /
• 2012

To resist the relay attacks in RFID system, it is commonly used RFID distance bounding protocols using the round trip time measurement for 1 bit challenge and response between a reader and a tag. If the success probability of relay attacks for the 1 bit challenge and response can be reduced in these protocols, it is possible to make an efficient distance bounding protocol. In this paper, we propose an efficient RFID distance bounding protocol based on 2 bit challenge and response which is modified the RFID distance bounding protocol proposed by Hancke and Khun based on 1 bit challenge and response. The success probability of relay attack for the proposed protocol is (7/16)n for the n times of challenge and response, which is much lower than (3/4)n given by Hancke and Khun's protocol.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.85-88
• /
• 2009

In multimedia database systems, the nearest neighbor Query occurs frequently and requires the processing cost higher than other spatial Queries do. It needs the measurement of search distance that the number of searched nodes and the computation time in an index can be minimized for optimizing the cost of processing the nearest neighbor query. The circular location property of objects is considered to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of nearest neighbor queries be considered a circular location property of object where the search space consists of a circular domain and show its characteristics. The proposed method uses the circular minimum distance and the circular optimal distance, the search measurement for optimizing the processing cost of nearest neighbor queries.